Martin Marciniszyn

According to our database1, Martin Marciniszyn authored at least 13 papers between 2004 and 2010.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2010
Online vertex-coloring games in random graphs.
Comb., 2010

2009
Asymmetric Ramsey properties of random graphs involving cliques.
Random Struct. Algorithms, 2009

Online Ramsey Games in Random Graphs.
Comb. Probab. Comput., 2009

Upper Bounds for Online Ramsey Games in Random Graphs.
Comb. Probab. Comput., 2009

2008
On the Resilience of Long Cycles in Random Graphs.
Electron. J. Comb., 2008

2007
A probabilistic counting lemma for complete graphs.
Random Struct. Algorithms, 2007

Online balanced graph avoidance games.
Eur. J. Comb., 2007

Online vertex colorings of random graphs without monochromatic subgraphs.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Observational Learning in Random Networks.
Proceedings of the Learning Theory, 20th Annual Conference on Learning Theory, 2007

2006
Ramsey and Turán type problems in random graphs.
PhD thesis, 2006

Threshold Functions for Asymmetric Ramsey Properties Involving Cliques.
Proceedings of the Approximation, 2006

2005
The Online Clique Avoidance Game on Random Graphs.
Proceedings of the Approximation, 2005

2004
E-Jigsaw: Computergestützte Rekonstruktion zerrissener Stasi-Unterlagen.
Inform. Spektrum, 2004


  Loading...