Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Krivelevich, Michael"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the number of Hamilton cycles in sparse random graphs
Roman Glebov
,
Michael Krivelevich
SIAM Journal on Discrete Mathematics
27
(1), 2013, pp. 27-42
The size Ramsey number of a directed path
Ido Ben-Eliezer
,
Michael Krivelevich
,
Benny Sudakov
Journal of Combinatorial Theory Series B
102
(3), 2012, pp. 743-755
Long cycles in subgraphs of (pseudo)random directed graphs
Ido Ben-Eliezer
,
Michael Krivelevich
,
Benny Sudakov
Journal of Graph Theory
70
(3), 2012, pp. 284-296
Variations on cops and robbers
Alan Frieze
,
Michael Krivelevich
,
Po-Shen Loh
Journal of Graph Theory
69
(4), 2012, pp. 383-402
Optimal packings of Hamilton cycles in sparse random graphs
Michael Krivelevich
,
Wojciech Samotij
SIAM Journal on Discrete Mathematics
26
(3), 2012, pp. 964-982
Creating small subgraphs in Achlioptas processes with growing parameter
Michael Krivelevich
,
Reto Spöhel
SIAM Journal on Discrete Mathematics
26
(2), 2012, pp. 670-686
On the resilience of Hamiltonicity and optimal packing of Hamilton cycles in random graphs
Sonny Ben-Shimon
,
Michael Krivelevich
,
Benny Sudakov
SIAM Journal on Discrete Mathematics
25
(3), 2011, pp. 1176-1193
A note on regular Ramsey graphs
Noga Alon
,
Sonny Ben-Shimon
,
Michael Krivelevich
Journal of Graph Theory
64
(3), 2010, pp. 244-249
Why almost all
k
-colorable graphs are easy to color
Amin Coja-Oghlan
,
Michael Krivelevich
,
Dan Vilenchik
Theory of Computing Systems
46
(3), 2010, pp. 523-565
Hamilton cycles in random graphs with a fixed degree sequence
Colin Cooper
,
Alan Frieze
,
Michael Krivelevich
SIAM Journal on Discrete Mathematics
24
(2), 2010, pp. 558-569
Avoider-Enforcer: The rules of the game
Dan Hefetz
,
Michael Krivelevich
,
Milos̑ Stojaković
,
Tibor Szabó
Journal of Combinatorial Theory Series A
117
(2), 2010, pp. 152-163
Resilient pancyclicity of random and pseudorandom graphs
Michael Krivelevich
,
Choongbum Lee
,
Benny Sudakov
SIAM Journal on Discrete Mathematics
24
(1), 2010, pp. 1-16
The rainbow connection of a graph is (at most) reciprocal to its minimum degree
Michael Krivelevich
,
Raphael Yuster
Journal of Graph Theory
63
(3), 2010, pp. 185-191
Embedding spanning trees in random graphs
Michael Krivelevich
SIAM Journal on Discrete Mathematics
24
(4), 2010, pp. 1495-1500
Fast winning strategies in avoider-enforcer games
Dan Hefetz
,
Michael Krivelevich
,
Milos̑ Stojaković
,
Tibor Szabó
Graphs and Combinatorics
25
(4), 2009, pp. 533-544
Fast winning strategies in Maker-Breaker games
Dan Hefetz
,
Michael Krivelevich
,
Milos̑ Stojaković
,
Tibor Szabó
Journal of Combinatorial Theory Series B
99
(1), 2009, pp. 39-47
Hamilton cycles in highly connected and expanding graphs
Dan Hefetz
,
Michael Krivelevich
,
Tibor Szabó
Combinatorica
29
(5), 2009, pp. 547-568
Spanning directed trees with many leaves
Noga Alon
,
Fedor V. Fomin
,
Gregory Gutin
,
Michael Krivelevich
,
Saket Saurabh
SIAM Journal on Discrete Mathematics
23
(1), 2008-2009, pp. 466-476
Testing triangle-freeness in general graphs
Noga Alon
,
Tali Kaufman
,
Michael Krivelevich
,
Dana Ron
SIAM Journal on Discrete Mathematics
22
(2), 2008, pp. 786-819
Large nearly regular induced subgraphs
Noga Alon
,
Michael Krivelevich
,
Benny Sudakov
SIAM Journal on Discrete Mathematics
22
(4), 2008, pp. 1325-1337
Planarity, colorability, and minor games
Dan Hefetz
,
Michael Krivelevich
,
Milos̑ Stojaković
,
Tibor Szabó
SIAM Journal on Discrete Mathematics
22
(1), 2008, pp. 194-212
Parameterized algorithms for directed maximum leaf problems
Noga Alon
,
Fedor V. Fomin
,
Gregory Gutin
,
Michael Krivelevich
,
Saket Saurabh
Lecture Notes in Computer Science
4596
, 2007, pp. 352-362
Better algorithms and bounds for directed maximum leaf problems
Noga Alon
,
Fedor V. Fomin
,
Gregory Gutin
,
Michael Krivelevich
,
Saket Saurabh
Lecture Notes in Computer Science
4855
, 2007, pp. 316-327
Addendum to ``Scalable secure storage when half the system is faulty''
Noga Alon
,
Haim Kaplan
,
Michael Krivelevich
,
Dahlia Malkhi
,
Julien Stern
Information and Computation
205
(7), 2007, pp. 1114-1116
Emedding nearly-spanning bounded degree trees
Noga Alon
,
Michael Krivelevich
,
Benny Sudakov
Combinatorica
27
(6), 2007, pp. 629-644
Seiten 1
2
3
>