|
|
Extended abstracts
2011
- E. Buß, H. Hàn, M. Schacht,
Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs,
Proceedings of EuroComb 2011, vol. 38 series Electron. Notes Discrete Math., 207-212
- H. Hàn, Y. Person, M. Schacht,
Note on forcing pairs,
Proceedings of EuroComb 2011, vol. 38 series Electron. Notes Discrete Math., 437-442
2009
- H. Hàn, Y. Person, M. Schacht,
Note on strong refutation algorithms for random k-SAT formulas,
Proceedings of LAGOS 2009, vol. 35 series Electron. Notes Discrete Math., 157-162
- B. Nagle, A. Poerschke, V. Rödl, M. Schacht,
Hypergraph regularity and quasi-randomness,
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 09), 227-235
- Y. Person, M. Schacht,
An expected polynomial time algorithm for coloring 2-colorable 3-graphs,
Proceedings of EuroComb 09, vol. 34 series Electron. Notes Discrete Math., 465-469,
full article
- Y. Person, M. Schacht,
Almost all hypergraphs without Fano planes are bipartite,
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 09), 217-226
2007
- N. Alon, A. Coja-Oghlan, H. Hàn, M. Kang, V. Rödl, M. Schacht,
Quasi-randomness and algorithmic regularity for graphs with general degree distributions,
Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, Wrocław, Poland, July 9-13, vol. 4596 series Lecture Notes in Computer Science, 789-800,
full article
- J. Böttcher, M. Schacht, A. Taraz,
Embedding spanning subgraphs of small bandwidth,
Proceedings of EuroComb 07, vol. 29 series Electron. Notes Discrete Math., 485-489,
full article
- J. Böttcher, M. Schacht, A. Taraz,
On the bandwidth conjecture for 3-colourable graphs,
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 07), 618-626,
full article
- V. Rödl, M. Schacht,
Property testing in hypergraphs and the removal lemma,
Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC 07), 488-495,
full article
2005
- Chr. Avart, V. Rödl, M. Schacht,
Every Monotone 3-Graph Property is Testable,
Seventh International Colloquium on Graph Theory, vol. 22 series Electron. Notes Discrete Math., 539-542,
full article
- M. Schacht, A. Taraz,
Globally bounded local edge colourings of hypergraphs,
Proceedings of GRACO 2005, vol. 19 series Electron. Notes Discrete Math., 179-185,
full article
2003
|
|