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="Kosowski, Adrian"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Distinguishing views in symmetric networks: A tight lower bound
Dariusz Dereniowski
,
Adrian Kosowski
,
Dominik Paja̧k
Theoretical Computer Science
582
, 2015, pp. 27-34
Bounds on the cover time of parallel rotor walks
Dariusz Dereniowski
,
Adrian Kosowski
,
Dominik Pajaķ
,
Przemysƚaw Uznański
Leibniz International Proceedings in Informatics (LIPIcs)
25
, 2014, pp. 263-275
Does adding more agents make a difference? A case study of cover time for the rotor-router
Adrian Kosowski
,
Dominik Paja̧k
Lecture Notes in Computer Science
8573
, 2014, pp. 544-555
Optimal patrolling of fragmented boundaries
Andrew Collins
,
Jurek Czyzowicz
,
Leszek Ga̧sieniec
,
Adrian Kosowski
,
Evangelos Kranakis
,
Danny Krizanc
,
Russell Martin
,
Oscar Morales Ponce
Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2013 (Montréal, Québec, Canada, July 23-25, 2013)
, 2013, pp. 241-250
Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains
Jurek Czyzowicz
,
Adrian Kosowski
,
Andrzej Pelc
Theory of Computing Systems
52
(2), 2013, pp. 179-199
Fast collaborative graph exploration
Dariusz Dereniowski
,
Yann Disser
,
Adrian Kosowski
,
Dominik Paja̧k
,
Przemysƚaw Uznański
Lecture Notes in Computer Science
7966
, 2013, pp. 520-532
Maximum matching in multi-interface networks
Adrian Kosowski
,
Alfredo Navarra
,
Dominik Pajak
,
Cristina M. Pinotti
Theoretical Computer Science
507
, 2013, pp. 52-60
Allowing each node to communicate only once in a distributed system: Shared whiteboard models
Florent Becker
,
Adrian Kosowski
,
Nicolas Nisse
,
Ivan Rapaport
,
Karol Suchan
Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2012 (Pittsburgh, Pennsylvania, USA, June 25-27, 2012)
, 2012, pp. 11-17
Time vs. space trade-offs for rendezvous in trees
Jurek Czyzowicz
,
Adrian Kosowski
,
Andrzej Pelc
Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2012 (Pittsburgh, Pennsylvania, USA, June 25-27, 2012)
, 2012, pp. 1-10
k
-chordal graphs: From cops and robber to compact routing via treewidth
Adrian Kosowski
,
Bi Li
,
Nicolas Nisse
,
Karol Suchan
Lecture Notes in Computer Science
7392
, 2012, pp. 610-622
Graph decomposition for memoryless periodic exploration
Adrian Kosowski
,
Alfredo Navarra
Algorithmica
63
(1-2), 2012, pp. 26-38
Boundary patrolling by mobile agents with distinct maximal speeds
Jurek Czyzowicz
,
Leszek Ga̧sieniec
,
Adrian Kosowski
,
Evangelos Kranakis
Lecture Notes in Computer Science
6942
, 2011, pp. 701-712
Synchronous black hole search in directed graphs
Adrian Kosowski
,
Alfredo Navarra
,
Cristina M. Pinotti
Theoretical Computer Science
412
(41), 2011, pp. 5752-5759
Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains
Jurek Czyzowicz
,
Adrian Kosowski
,
Andrzej Pelc
Lecture Notes in Computer Science
6281
, 2010, pp. 294-305
Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
Ralf Klasing
,
Adrian Kosowski
,
Alfredo Navarra
Theoretical Computer Science
411
(34-36), 2010, pp. 3235-3246
Derandomizing random walks in undirected graphs using locally fair exploration strategies
Colin Cooper
,
David Ilcinkas
,
Ralf Klasing
,
Adrian Kosowski
Lecture Notes in Computer Science
5556
, 2009, pp. 411-422
Universal augmentation schemes for network navigability
Pierre Fraigniaud
,
Cyril Gavoille
,
Adrian Kosowski
,
Emmanuelle Lebhar
,
Zvi Lotker
Theoretical Computer Science
410
(21-23), 2009, pp. 1970-1981
On the complexity of distributed graph coloring with local minimality constraints
Cyril Gavoille
,
Ralf Klasing
,
Adrian Kosowski
,
Łukasz Kuszner
,
Alfredo Navarra
Networks
54
(1), 2009, pp. 12-19
Cost minimization in wireless networks with a bounded and unbounded number of interfaces
Ralf Klasing
,
Adrian Kosowski
,
Alfredo Navarra
Networks
53
(3), 2009, pp. 266-275
Graph decomposition for improving memoryless periodic exploration
Adrian Kosowski
,
Alfredo Navarra
Lecture Notes in Computer Science
5734
, 2009, pp. 501-512
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
The maximum edge-disjoint paths problem in complete graphs
Adrian Kosowski
Theoretical Computer Science
399
(1-2), 2008, pp. 128-140
Universal augmentation schemes for network navigability: Overcoming the
\sqrt n
-barrier
Pierre Fraigniaud
,
Cyril Gavoille
,
Adrian Kosowski
,
Emmanuelle Lebhar
,
Zvi Lotker
Proceedings of the 19th Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'2007 (San Diego, CA, USA, June 9-11, 2007)
, 2007, pp. 1-7
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
Seiten 1
2
>