Marcelo Mydlarz

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	Topological additive numbering of directed acyclic graphs	2014	Javier Marenco Marcelo Mydlarz Daniel Severín
+	Approximate multipartite version of the Hajnal–Szemerédi theorem	2011	Béla Csaba Marcelo Mydlarz
+ PDF Chat	A fast algorithm for equitable coloring	2010	Henry A. Kiersteád Alexandr Kostochka Marcelo Mydlarz Endre Szemerédi

Common Coauthors

Coauthor	Papers Together
Javier Marenco	1
Daniel Severín	1
Béla Csaba	1
Alexandr Kostochka	1
Endre Szemerédi	1
Henry A. Kiersteád	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+ PDF Chat	A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring	2007	H. A. Kierstead Alexandr Kostochka	2
+	Blow-up Lemma	1997	János Komlós Gábor N. Sárközy Endre Szemerédi	2
+	On the Lucky labeling of Graphs	2010	Arash Ahadi Ali Dehghan Esmael Mollaahmadi	1
+	Additive colorings of planar graphs	2012	Tomasz Bartnicki Bartłomiej Bosek Sebastian Czerwiński Jarosław Grytczuk Grzegorz Matecki Wiktor Żelazny	1
+ PDF Chat	The infamous upper tail	2002	Svante Janson Andrzej Ruciński	1
+	Variants of the Hajnal-Szemerédi Theorem	1999	Eldar Fischer	1
+	A Geometric Theory for Hypergraph Matching	2011	Peter Keevash Richard Mycroft	1
+	Spanning subgraphs of random graphs	1992	Noga Alon Zoltán Füredi	1
+	Perfect Matchings in ϵ-Regular Graphs and the Blow-Up Lemma	1999	Vojtěch Rödl Andrzej Ruciński	1
+ PDF Chat	Ore-type graph packing problems	2006	Alexandr Kostochka Gexin Yu	1
+	An algorithmic version of the blow-up lemma	1998	János Komlós Gábor N. Sárközy Endre Szemerédi	1
+	Quadripartite version of the Hajnal–Szemerédi theorem	2007	Ryan R. Martin Endre Szemerédi	1
+ PDF Chat	A fast algorithm for equitable coloring	2010	Henry A. Kiersteád Alexandr Kostochka Marcelo Mydlarz Endre Szemerédi	1
+	Triangle-factors in a balanced blown-up triangle	2000	Robert Johansson	1
+ PDF Chat	An Ore-type theorem on equitable coloring	2007	H. A. Kierstead Alexandr Kostochka	1
+	REGULAR PARTITIONS OF GRAPHS	1975	Endre Szemerédi	1
+ PDF Chat	Ore-type versions of Brooks' theorem	2008	H. A. Kierstead Alexandr Kostochka	1
+	A multipartite version of the Hajnal-Szemer\'edi theorem for graphs and hypergraphs	2011	Allan Lo Klas Markström	1
+ PDF Chat	Regular Spanning Subgraphs of Bipartite Graphs of High Minimum Degree	2007	Béla Csaba	1
+	Tripartite version of the Corrádi–Hajnal theorem	2002	Csaba Magyar Ryan R. Martin	1
+	Variants of the Hajnal-Szemer�di Theorem	1999	Eldar Fischer	1
+	Combinatorial theory and its applications	1970	Colloquium on Combinatorial Theory P. Erdős Alfréd Rényi Vera T. Sós Bolyai János Matematikai Társulat	1
+	Domain decomposition: Parallel multilevel methods for elliptic partial differential equations	1997	Barry Smith Petter E. Bjørstad William Gropp	1
+	Szemerédi’s Regularity Lemma and Quasi-randomness	2003	Yoshiharu Kohayakawa V. Rödl	1
+	Szemeredi''s Regularity Lemma and its applications in graph theory	1995	János Komlós Miklós Simonovits	1