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="Krizanc, Danny"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Complexity of barrier coverage with relocatable sensors in the plane
Stefan Dobrev
,
Stephane Durocher
,
Mohsen Eftekhari
,
Konstantinos Georgiou
,
Evangelos Kranakis
,
Danny Krizanc
,
Lata Narayanan
,
Jaroslav Opatrny
,
Sunil Shende
,
Jorge Urrutia
Theoretical Computer Science
579
, 2015, pp. 64-73
Excuse me! or the courteous theatregoers' problem
Konstantinos Georgiou
,
Evangelos Kranakis
,
Danny Krizanc
Theoretical Computer Science
586
, 2015, pp. 95-110
DMVP: Foremost waypoint coverage of time-varying graphs
Eric Aaron
,
Danny Krizanc
,
Elliot Meyerson
Lecture Notes in Computer Science
8747
, 2014, pp. 29-41
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
Complexity of barrier coverage with relocatable sensors in the plane
Stefan Dobrev
,
Stephane Durocher
,
Mohsen Eftekhari
,
Konstantinos Georgiou
,
Evangelos Kranakis
,
Danny Krizanc
,
Lata Narayanan
,
Jaroslav Opatrny
,
Sunil Shende
,
Jorge Urrutia
Lecture Notes in Computer Science
7878
, 2013, pp. 170-182
Expected sum and maximum of displacement of random sensors for coverage of a domain
Evangelos Kranakis
,
Danny Krizanc
,
Oscar Morales-Ponce
,
Lata Narayanan
,
Jaroslav Opatrny
,
Sunil Shende
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. 73-82
The complexity of minor-ancestral graph properties with forbidden pairs
Eli Fox-Epstein
,
Danny Krizanc
Lecture Notes in Computer Science
7353
, 2012, pp. 138-147
Maintaining privacy on a line
Evangelos Kranakis
,
Danny Krizanc
Theory of Computing Systems
50
(1), 2012, pp. 147-157
Encoding 2D range maximum queries
Mordecai Golin
,
John Iacono
,
Danny Krizanc
,
Rajeev Raman
,
S. Srinivasa Rao
Lecture Notes in Computer Science
7074
, 2011, pp. 180-189
A characterization of the degree sequences of 2-trees
Prosenjit Bose
,
Vida Dujmovi
,
Danny Krizanc
,
Stefan Langerman
,
Pat Morin
,
David R. Wood
,
Stefanie Wuhrer
Journal of Graph Theory
58
(3), 2008, pp. 191-209
Communication in wireless networks with directional antennas
Ioannis Caragiannis
,
Christos Kaklamanis
,
Evangelos Kranakis
,
Danny Krizanc
,
Andreas Wiese
Proceedings of the 20th Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'2008 (Munich, Germany, June 14-16, 2008)
, 2008, pp. 344-351
Computing minimum spanning trees with uncertainty
Thomas Erlebach
,
Michael Hoffmann
,
Danny Krizanc
,
Matús Mihal'ák
,
Rajeev Raman
Leibniz International Proceedings in Informatics (LIPIcs)
1
, 2008, pp. 277-288
Memoryless search algorithms in a network with faulty advice
Nicolas Hanusse
,
Dimitris Kavvadias
,
Evangelos Kranakis
,
Danny Krizanc
Theoretical Computer Science
402
(2-3), 2008, pp. 190-198
Asynchronous deterministic rendezvous in graphs
Gianluca De Marco
,
Luisa Gargano
,
Evangelos Kranakis
,
Danny Krizanc
,
Andrzej Pelc
,
Ugo Vaccaro
Theoretical Computer Science
355
(3), 2006, pp. 315-326
Efficient update strategies for geometric computing with uncertainty
Richard Bruce
,
Michael Hoffmann
,
Danny Krizanc
,
Rajeev Raman
Theory of Computing Systems
38
(4), 2005, pp. 411-423
Asynchronous deterministic rendezvous in graphs
Gianluca De Marco
,
Luisa Gargano
,
Evangelos Kranakis
,
Danny Krizanc
,
Andrzej Pelc
,
Ugo Vaccaro
Lecture Notes in Computer Science
3618
, 2005, pp. 271-282
Sorting and election in anonymous asynchronous rings
Paola Flocchini
,
Evangelos Kranakis
,
Danny Krizanc
,
Flaminia L. Luccio
,
Nicola Santoro
Journal Parallel Distributed Computing
64
(2), 2004, pp. 254-265
Approximate hotlink assignment
Evangelos Kranakis
,
Danny Krizanc
,
Sunil Shende
Information Processing Letters
90
(3), 2004, pp. 121-128
Compact routing schemes for dynamic ring networks
Danny Krizanc
,
Flaminia L. Luccio
,
Rajeev Raman
Theory of Computing Systems
37
(5), 2004, pp. 585-607
Asymmetric communication protocols via hotlink assignments
Prosenjit Bose
,
Danny Krizanc
,
Stefan Langerman
,
Pat Morin
Theory of Computing Systems
36
(6), 2003, pp. 655-661
Efficient update strategies for geometric computing with uncertainty
Richard Bruce
,
Michael Hoffmann
,
Danny Krizanc
,
Rajeev Raman
Lecture Notes in Computer Science
2653
, 2003, pp. 12-23
Locating information with uncertainty in fully interconnected networks: The case of nondistributed memory
Lefteris M. Kirousis
,
Evangelos Kranakis
,
Danny Krizanc
,
Yannis C. Stamatiou
Networks
42
(3), 2003, pp. 169-180
Range mode and range median queries on lists and trees
Danny Krizanc
,
Pat Morin
,
Michiel Smid
Lecture Notes in Computer Science
2906
, 2003, pp. 517-526
The impact of information on broadcasting time in linear radio networks
Krzysztof Diks
,
Evangelos Kranakis
,
Danny Krizanc
,
Andrzej Pelc
Theoretical Computer Science
287
(2), 2002, pp. 449-471
Rigorous results for random
(2+p)
-SAT
Dimitris Achlioptas
,
Lefteris M. Kirousis
,
Evangelos Kranakis
,
Danny Krizanc
Theoretical Computer Science
265
(1-2), 2001, pp. 109-129
Seiten 1
2
3
4
5
>