Your search returned the following 27 documents:

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