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="Pra{\l}at, Pawe{\l}"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Brushing with additional cleaning restrictions
Piotr Borowiecki
,
Dariusz Dereniowski
,
Paweƚ Praƚat
Theoretical Computer Science
557
, 2014, pp. 76-86
Graphs with average degree smaller than TeX burn slowly
Paweƚ Praƚat
Graphs and Combinatorics
30
(2), 2014, pp. 455-470
Vertex-pursuit in random directed acyclic graphs
Antony Bonato
,
Dieter Mitsche
,
Paweƚ Praƚat
SIAM Journal on Discrete Mathematics
27
(2), 2013, pp. 732-756
Cops and invisible robbers: The cost of drunkenness
Athanasios Kehagias
,
Dieter Mitsche
,
Paweƚ Praƚat
Theoretical Computer Science
481
, 2013, pp. 100-120
On the maximum density of graphs with unique-path labelings
Abbas Mehrabian
,
Dieter Mitsche
,
Paweƚ Praƚat
SIAM Journal on Discrete Mathematics
27
(3), 2013, pp. 1228-1233
Sparse graphs are not flammable
Paweƚ Praƚat
SIAM Journal on Discrete Mathematics
27
(4), 2013, pp. 2157-2166
Fighting constrained fires in graphs
Anthony Bonato
,
Margaret-Ellen Messinger
,
Paweƚ Praƚat
Theoretical Computer Science
434
, 2012, pp. 11-22
Cops and robber with constraints
Fedor V. Fomin
,
Petr Golovach
,
Paweƚ Praƚat
SIAM Journal on Discrete Mathematics
26
(2), 2012, pp. 571-590
polish
- Let us play the cleaning game
Przemysƚaw Gordinowicz
,
Richard J. Nowakowski
,
Paweƚ Praƚat
Theoretical Computer Science
463
, 2012, pp. 123-132
Some remarks on cops and drunk robbers
Athanasios Kehagias
,
Paweƚ Praƚat
Theoretical Computer Science
463
, 2012, pp. 133-147
Geodesics and almost geodesic cycles in random regular graphs
Itai Benjamini
,
Carlos Hoppen
,
Eran Ofek
,
Paweƚ Praƚat
,
Nick Wormald
Journal of Graph Theory
66
(2), 2011, pp. 115-136
Cleaning with brooms
Margaret-Ellen Messinger
,
Richard J. Nowakowski
,
Paweƚ Praƚat
Graphs and Combinatorics
27
(2), 2011, pp. 251-267
On the threshold for
k
-regular subgraphs of random graphs
Paweƚ Praƚat
,
Jacques Verstraëte
,
Nicholas Wormald
Combinatorica
31
(5), 2011, pp. 565-581
An edge deletion model for complex networks
Paweƚ Praƚat
,
Changping Wang
Theoretical Computer Science
412
(39), 2011, pp. 5111-5120
Cleaning random
d
-regular graphs with brooms
Paweƚ Praƚat
Graphs and Combinatorics
27
(4), 2011, pp. 567-584
Cops and Robbers from a distance
Anthony Bonato
,
Ehsan Chiniforooshan
,
Paweƚ Praƚat
Theoretical Computer Science
411
(43), 2010, pp. 3834-3844
Clean the graph before you draw it!
Serge Gaspers
,
Margaret-Ellen Messinger
,
Richard J. Nowakowski
,
Paweƚ Praƚat
Information Processing Letters
109
(10), 2009, pp. 463-467
Cleaning regular graphs with brushes
Noga Alon
,
Paweƚ Praƚat
,
Nicholas Wormald
SIAM Journal on Discrete Mathematics
23
(1), 2008-2009, pp. 233-250