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
[1]
Hilfe
Suche: Author="{\.Z}yli{\'n}ski, Pawe{\l}"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Corrigendum to ``Note on covering monotone orthogonal polygons''
Andrzej Lingas
,
Leonidas Palios
,
Agnieszka Wasylewicz
,
Paweƚ Żyliński
Information Processing Letters
114
(11), 2014, pp. 646-654
Watchman routes for lines and segments
Adrian Dumitrescu
,
Joseph S.B. Mitchell
,
Paweƚ Żyliński
Lecture Notes in Computer Science
7357
, 2012, pp. 36-47
Vision-based pursuit-evasion in a grid
Adrian Dumitrescu
,
Howi Kok
,
Ichiro Suzuki
,
Paweƚ Żyliński
Lecture Notes in Computer Science
5124
, 2008, pp. 53-64
Offline variants of the ``lion and man'' problem - Some problems and techniques for measuring crowdedness and for safe path planning -
Adrian Dumitrescu
,
Ichiro Suzuki
,
Paweƚ Żyliński
Theoretical Computer Science
399
(3), 2008, pp. 220-235
A note on mixed tree coloring
Hanna Furmańczyk
,
Adrian Kosowski
,
Paweƚ Żyliński
Information Processing Letters
106
(4), 2008, pp. 133-135
Tighter bounds on the size of a maximum
P_3
-matching in a cubic graph
Adrian Kosowski
,
Michaƚ Maƚafiejski
,
Paweƚ Żyliński
Graphs and Combinatorics
24
(5), 2008, pp. 461-468
Note on covering monotone orthogonal polygons with star-shaped polygons
Andrzej Lingas
,
Agnieszka Wasylewicz
,
Paweƚ Żyliński
Information Processing Letters
104
(6), 2007, pp. 220-227
An approximation algorithm for maximum
P_3
-packing in subcubic graphs
Adrian Kosowski
,
Michaƚ Maƚafiejski
,
Paweƚ Żyliński
Information Processing Letters
99
(6), 2006, pp. 230-233
On bounded load routings for modeling
k
-regular connection topologies
Adrian Kosowski
,
Michaƚ Maƚafiejski
,
Paweƚ Żyliński
Lecture Notes in Computer Science
3827
, 2005, pp. 614-623