Projects
Reading
People
Chat
SU\G
(𝔸)
/K·U
Projects
Reading
People
Chat
Sign Up
Sign In
Light
Dark
System
Michelle Wagner
Follow
Share
Generating author description...
All published works
Action
Title
Year
Authors
+
Matchings Meeting Quotas and Their Impact on the Blow-Up Lemma
2001
Vojtěch Rödl
Andrzej Ruciński
Michelle Wagner
+
An Algorithmic Embedding of Graphs via Perfect Matchings
1998
Vojtěch Rödl
Andrzej Ruciński
Michelle Wagner
Common Coauthors
Coauthor
Papers Together
Andrzej Ruciński
2
Vojtěch Rödl
2
Commonly Cited References
Action
Title
Year
Authors
# of times referenced
+
Perfect matchings in -regular graphs.
1998
Noga Alon
Beverly Sackler
Vojtěch Rödl
Andrzej Ruci
2
+
Perfect Matchings in ϵ-Regular Graphs and the Blow-Up Lemma
1999
Vojtěch Rödl
Andrzej Ruciński
2
+
On the Pósa-Seymour conjecture
1998
János Komlós
Gábor N. Sárközy
Endre Szemerédi
2
+
An algorithmic version of the blow-up lemma
1998
János Komlós
Gábor N. Sárközy
Endre Szemerédi
2
+
Blow-up Lemma
1997
János Komlós
Gábor N. Sárközy
Endre Szemerédi
2
+
PDF
Chat
The Algorithmic Aspects of the Regularity Lemma
1994
Noga Alon
Richard A. Duke
Hanno Lefmann
V. Rödl
Raphael Yuster
2
+
PDF
Chat
Perfect Matchings in $\epsilon$-regular Graphs
1998
Noga Alon
Vojtěch Rödl
Andrzej Ruciński
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
+
PDF
Chat
Proof of the Seymour conjecture for large graphs
1998
János Komlós
Gábor N. Sárközy
Endre Szemerédi
1
+
Perfect matchings in ε-regular graphs
1998
Noga Alon
Vojtěch Rödl
Andrzej Ruciński
1
+
PDF
Chat
An algorithmic version of the blow‐up lemma
1998
János Komlós
Gábor N. Sárközy
Endre Szemerédi
1
+
Probabilistic construction of deterministic algorithms: Approximating packing integer programs
1988
Prabhakar Raghavan
1
+
On the P�sa-Seymour conjecture
1998
J�nos Koml�s
G�bor N. S�rk�zy
Endre Szemer�di
1