Your search returned the following 27 documents:
-
A QPTAS for ε-Envy-Free Profit-Maximizing Pricing on Line Graphs
Khaled Elbassioni
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, Warwick, UK, 2012, 513-524
-
Certifying 3-Connectivity in Linear Time
Jens M. Schmidt
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, Warwick, UK, 2012, 786-797
-
Clique Cover and Graph Separation: New Incompressibility Results
Marek Cygan, Stefan Kratsch, Marcin Pilipczuk, Michał Pilipczuk, and Magnus Wahlström
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, Warwick, UK, 2012, 254-265
-
Counting Arbitrary Subgraphs in Data Streams
Daniel Kane, Kurt Mehlhorn, Thomas Sauerwald, and He Sun
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, Warwick, UK, 2012, 598-609
-
Efficient Sampling Methods for Discrete Distributions
Karl Bringmann and Konstantinos Panagiotou
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, Warwick, UK, 2012, 133-144
-
Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs
Stefan Kratsch, Marcin Pilipczuk, Michał Pilipczuk, and Magnus Wahlström
In: Automata, Languages, and Programming ; 39th International Colloquium, ICALP 2012, Warwick, UK, 2012, 581-593
-
The Power of Recourse for Online MST and TSP
Nicole Megow, Martin Skutella, Jose Verschae, and Andreas Wiese
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, Warwick, 2012, 689-700
-
A Characterization of 2-Player Mechanisms for Scheduling
George Christodoulou, Elias Koutsoupias, and Angelina Vidali
In: Algorithms - ESA 2008, 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings., Karlsruhe, Germany, 2008, 297-307
-
Cache-Oblivious and Cache-Aware Algorithms
Arge Lars, Michael A. Bender, Erik Demaine, Charles Leiserson, and Kurt Mehlhorn(Ed.)
IBFI, Dagstuhl, 04301, Dagstuhl Seminar Proceedings
-
Informatik 2000 : neue Horizonte im neuen Jahrhundert, 30. Jahrestagung der Gesellschaft für Informatik
Kurt Mehlhorn and Gregor Snelting(Ed.)
Informatik aktuell. 38, , Springer, Berlin, 2000
-
An Implementation of the Binary Blocking Flow Algorithm
Torben Hagerup, Peter Sanders, and Jesper Larsson Träff
In: Proceedings of the 2nd Workshop on Algorithm Engineering (WAE-98), Saarbrücken, Germany, August 20-22, 1998, 143-154
-
From Algorithms to Working Programs on the Use of Program Checking in LEDA
Kurt Mehlhorn and Stefan Näher
In: Fundamentals - foundations of computer science : XV. IFIP world computer congress, Vienna, Austria and Budapest, Hungary, August 20-22, 1998, 81-88
-
Fundamentals - Foundations of Computer Science : Proceedings of the XV. IFIP World Computer Congress
Kurt Mehlhorn(Eds.)
Schriftenreihe der Österreichischen Computer Gesellschaft. 117, , Österreichische Computer Gesellschaft (OCG) / Austrian Computer Society, Vienna, 1998
-
Incremental Computation and Dynamic Algorithms 02.05.-06.05.94
Jan van Leeuwen, Kurt Mehlhorn, and Thomas Reps(Ed.)
IBFI, Dagstuhl, 88
[PS: Download: VanLeeuwen.ps]
-
Special issue on “algorithms: implementation, libraries and use”
, Academic Press, Duluth, 1994, 295-369
-
Effiziente Algorithmen - Tagungsbericht
Kurt Mehlhorn and Robert E. Trajan(Ed.)
Mathematisches Forschungsinstitut Oberwolfach. 33/1991, , Mathematisches Forschungsinstitut, Oberwolfach, 1991
-
Proceedings of the fifth annual symposium on Computational geometry
1989 (SCG '89)
Kurt Mehlhorn(Eds.)
, ACM, New York, 1989
-
Deterministic Simulation of Idealized Parallel Computers on more Realistic Ones
Helmut Alt, Torben Hagerup, Kurt Mehlhorn, and Franco P. Preparata
In: Parallel Algorithms and Architectures : International Workshop, Suhl, FRG, 1987, 11-15
[PDF: Download: DeterministicSimulationParallel.pdf]
-
Parallel algorithms and architectures (WPAA-87) : international workshop
Andreas Albrecht, Hermann Jung, and Kurt Mehlhorn(Ed.)
Mathematical research / Mathematische Forschung. 38, , Akademie-Verlag, Berlin, 1987
-
Parallel algorithms and architectures : International Workshop
Andreas Albrecht, Hermann Jung, and Kurt Mehlhorn(Ed.)
Lecture Notes in Computer Science. 269, , Springer, Berlin, 1987
-
Workshop über Komplexitätstheorie, Effiziente Algorithmen und Datenstrukturen
Kurt Mehlhorn(Eds.)
Interner Bericht / Fachbereich Informatik. 1987,4, , Johann Wolfgang Goethe-Universität Frankfurt a.M., Frankfurt, 1987
-
VLSI algorithms and architectures : Aegean workshop on computing
Fillia Makedon, Kurt Mehlhorn, Theodore S. Papatheodorou, and Paul G. Spirakis(Ed.)
Lecture Notes in Computer Science. 227, , Springer, Berlin, 1986
-
VLSI Algorithms and Architectures, Aegean Workshop on Computing - >> Dublette
Fillia Makedon, Kurt Mehlhorn, Theodore S. Papatheodorou, and Paul G. Spirakis(Ed.)
Lecture Notes in Computer Science. 227, , Springer, Berlin, 1986
-
VLSI Algorithms and Architectures, Aegean Workshop on Computing - >> Dublette
Fillia Makedon, Kurt Mehlhorn, Theodore S. Papatheodorou, and Paul G. Spirakis(Ed.)
Lecture Notes in Computer Science. 227, , Springer, Berlin, 1986
-
AT$^2$-Optimal Galois Field Multiplier for VLSI
Martin Fürer and Kurt Mehlhorn
In: VLSI Algorithms and Architectures, Aegean Workshop on Computing, Loutraki, Greece, 1986, 217-225
-
Theoretical aspects of computer science (STACS-84) : [1st] symposium
M. Fontet and Kurt Mehlhorn(Ed.)
Lecture Notes in Computer Science. 166, , Springer, Berlin, 1984
-
Theoretical aspects of computer science (STACS-85) : 2nd annual symposium
Kurt Mehlhorn(Eds.)
Lecture Notes in Computer Science. 182, , Springer, Berlin, 1985