Max-Planck-Institut für Informatik
max planck institut
informatik
mpii logo Minerva of the Max Planck Society
 

MPI-INF D1 Publications

MPI-INF D1 Publications

Entries sorted by: 1. Author,Editor - 1. by Individual - 1. by Names

Login to this database


 

Viewing:

1. Author,Editor - 1. by Individual - 1. by Names
Next Page
Show entries starting with: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
#YearAuthor(s) [non member]TitleType
1
Hide details for Gabow, Harold N. (ed.)Gabow, Harold N. (ed.)
2005[Chlebus, Bogdan S.]
Kowalski, Dariusz
Cooperative asynchronous update of shared memory
In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC 2005), 733-739
Proceedings Article
1
Hide details for Gabriel, Valiente (ed.)Gabriel, Valiente (ed.)
2006[Brodal, Gerth Stølting]
Kaligosi, Kanela
[Katriel, Irit]
Kutz, Martin
Faster Algorithms for Computing Longest Common Increasing Subsequences
In: Combinatorial Pattern Matching, 17th Annual Symposium, CPM 2006, 330-341
Proceedings Article
1
Hide details for Gärtner, BerndGärtner, Bernd
2001[Bäsken, Matthias]
[Brönnimann, Hervé]
[Frank, Da]
[Devillers, Olivier]
[Ester, Ezra]
[Fabri, Andreas]
[Flato, Eyal]
[Gärtner, Bernd]
[Giezeman, Geert-Jan]
[Halperin, Dan]
[Hanniel, Iddo]
[Har-Peled, Sariel]
[Herrmann, Thomas]
Hert, Susan
[Hirsch, Shai]
[Hoffmann, Michael]
Kettner, Lutz
[Nechushtan, Oren]
[Neyer, Gabriele]
[Pasechnik, Dmitrii]
[Pion, Sylvain]
Schirra, Stefan
[Schönherr, Sven]
Seel, Michael
[Teillaud, Monique]
[Veltkamp, Remco]
[Wein, Ron]
[Wesselink, Wieger]
[Yvinec, Mariette]
CGAL Reference and User ManualsUnknown Form: eBookForm
1
Hide details for Gärtner, TobiasGärtner, Tobias
2009Gärtner, Tobias
[Hotz, Günter]
Computability of Analytic Functions with Analytic Machines
In: Mathematical Theory and Computational Practice : 5th Conference on Computability in Europe, CiE 2009, 250-259
Proceedings Article
3
Hide details for Gagie, TravisGagie, Travis
2014[Gagie, Travis]
Gawrychowski, Pawel
[Kärkkäinen, Juha]
[Nekrich, Yakov]
[Puglisi, Simon J.]
LZ77-Based Self-indexing with Faster Pattern Matching
In: LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31 - April 4, 2014. Proceedings, 731-742
Proceedings Article
2013[Gagie, Travis]
Gawrychowski, Pawel
[Nekrich, Yakov]
Heaviest Induced Ancestors and Longest Common Substrings
In: 25th Canadian Conference on Computational Geometry (CCCG 13), 145-150
Proceedings Article
2010Farzan, Arash
[Gagie, Travis]
[Navarro, Gonzalo]
Entropy-Bounded Representation of Point Grids
In: Algorithms and Computation : 21st International Symposium, ISAAC 2010. - Pt. II, 327-338
Proceedings Article
2
Hide details for Gairing, MartinGairing, Martin
2012Friedrich, Tobias
[Gairing, Martin]
Sauerwald, Thomas
Quasirandom Load Balancing
In: SIAM Journal on Computing [41], 747-771
Journal Article
2010Friedrich, Tobias
[Gairing, Martin]
[Sauerwald, Thomas]
Quasirandom Load Balancing
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1620-1629
Proceedings Article
3
Hide details for Galil, ZviGalil, Zvi
1997[Crochemore, Maxime]
[Galil, Zvi]
Gasieniec, Leszek
[Park, Kunsoo]
[Rytter, Wojciech]
Constant-time Randomized Parallel String Matching
In: SIAM Journal on Computing [26], 950-960
Journal Article
1976Mehlhorn, Kurt
Galil, Zvi
Attachment IconMonotone Switching Circuits and Boolean Matrix Product
In: Computing [16], 99-111
Journal Article
1975Mehlhorn, Kurt
Galil, Zvi
Monotone Switching Circuits and Boolean Matrix Product
In: Mathematical foundations of computer science (MFCS-75) : 4th symposium, 315-319
Proceedings Article
1
Hide details for Gambardella, Luca Maria (ed.)Gambardella, Luca Maria (ed.)
2010Kötzing, Timo
Neumann, Frank
[Röglin, Heiko]
[Witt, Carsten]
Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem
In: Swarm Intelligence : 7th International Conference, ANTS 2010, 324-335
Proceedings Article
1
Hide details for Gandhi, RajivGandhi, Rajiv
2009[Gandhi, Rajiv]
Mestre, Julián
Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
In: Algorithmica [54], 54-71
Journal Article
1
Hide details for Gandibleux, Xavier (ed.)Gandibleux, Xavier (ed.)
2009[Bringmann, Karl]
[Friedrich, Tobias]
Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
In: Evolutionary Multi-Criterion Optimization : 5th International Conference, EMO 2009, 6-20
Proceedings Article
2
Hide details for Ganzha, Viktor G. (ed.)Ganzha, Viktor G. (ed.)
2005Eigenwillig, Arno
Kettner, Lutz
[Krandick, Werner]
Mehlhorn, Kurt
Schmitt, Susanne
Wolpert, Nicola
Attachment IconA Descartes algorithm for polynomials with bit-stream coefficients
In: Computer Algebra in Scientific Computing : 8th International Workshop, CASC 2005, 138-149
Proceedings Article
2005Schmitt, SusanneAttachment IconThe diamond operator - Implementation of exact real algebraic numbers
In: Computer Algebra in Scientific Computing, 8th International Workshop, CASC 2005, 355-366
Proceedings Article
1
Hide details for Ganzinger, Harald (ed.)Ganzinger, Harald (ed.)
1992Klein, Rolf
Mehlhorn, Kurt
Meiser, Stefan
Randomized incremental construction of abstract Voronoi diagrams
In: Informatik---Festschrift zum 60.~Geburtstag von Günter Hotz, 283-308
Part of a Book
2
Hide details for Gao, Pu (Jane)Gao, Pu (Jane)
2011Gao, Pu (Jane)Distribution of spanning regular subgraphs in random graphsUnpublished/Draft
2010Gao, Pu (Jane)
[Wormald, Nicholas]
[Su, Yi]
Attachment IconInduced subgraphs in sparse random graphs with given degree sequenceUnpublished/Draft
2
Hide details for Gao, ShaodiGao, Shaodi
1988Gao, Shaodi
Jerrum, Mark
Kaufmann, Michael
Mehlhorn, Kurt
Rülling, Wolfgang
Attachment IconOn Continuous Homotopic One Layer Routing
In: Computational geometry (SCG-88) : 4th symposium, 392-402
Proceedings Article
1988Gao, Shaodi
Kaufmann, Michael
Mehlhorn, Kurt
Rülling, Wolfgang
Storb, Christoph
Jerrum, Mark
On Continuous Homotopic One Layer Routing (Extended Abstract)
In: Computational geometry and its applications (CG-88) : international workshop, 55-70
Proceedings Article
1
Hide details for Gardy, DanièleGardy, Danièle
2002Banderier, Cyril
[Bousquet-Mélou, Mireille]
[Denise, Alain]
[Flajolet, Philippe]
[Gardy, Danièle]
[Gouyou-Beauchamps, Dominique]
Generating Functions for Generating Trees
In: Discrete Mathematics [246], 29-55
Journal Article
1
Hide details for Gargano, Luisa (ed.)Gargano, Luisa (ed.)
2010Elmasry, Amr
[Jensen, Claus]
[Katajainen, Jyrki]
The Magic of a Number System
In: Fun with Algorithms : 5th International Conference, FUN 2010, 156-165
Proceedings Article
15
Hide details for Garg, NaveenGarg, Naveen
2013Anand, S
Bringmann, Karl
[Friedrich, Tobias]
[Garg, Naveen]
[Kumar, Amit]
Minimizing maximum (weighted) flow-time on related and unrelated machines
In: Automata, Languages, and Programming - 40th International Colloquium (ICALP-13), 13-24
Proceedings Article
2012Elbassioni, Khaled
[Garg, Naveen]
[Gupta, Divya]
[Kumar, Amit]
[Narula, Vishal]
[Pal, Arindam]
Approximation Algorithms for the Unsplittable Flow Problem on Paths and Trees
In: 32nd International Conference on Foundations of Software Technology and Theoretical Computer Science : FSTTCS 2012, 267-275
Electronic Proceedings Article
2011[Anand, S.]
[Garg, Naveen]
Megow, Nicole
Meeting deadlines: How much speed suffices?
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011. - Pt. I, 232-243
Proceedings Article
2010[Garg, Naveen]
[Kavitha, T.]
[Kumar, Amit]
Mehlhorn, Kurt
Mestre, Julián
Assigning Papers to Referees
In: Algorithmica [58], 119-136
Journal Article
2008[Garg, Naveen]
[Kavitha, T.]
[Kumar, Amit]
Mehlhorn, Kurt
Mestre, Julián
Attachment IconAssigning Papers to RefereesUnpublished/Draft
2003Eisenbrand, Friedrich
Funke, Stefan
[Garg, Naveen]
[Könemann, Jochen]
A Combinatorial Algorithm for Computing a Maximum Independent Set in a t-perfect Graph
In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 517-522
Proceedings Article
2000Garg, Naveen
[Konjevod, Goran]
[Ravi, R.]
Approximation algorithm for the group Steiner tree problem
In: Journal of Algorithms [37], 66-84
Journal Article
2000Albers, Susanne
Garg, Naveen
Leonardi, Stefano
Minimizing stall time in single and parallel disk systems
In: Journal of the ACM [47], 969-986
Journal Article
1999[Dinitz, Yefim]
Garg, Naveen
[Goemans, Michel X.]
On the single-source unsplittable flow problem
In: Combinatorica [19], 17-41
Journal Article
1998Albers, Susanne
[Garg, Naveen]
[Leonardi, Stefano]
Minimizing stall time in single and parallel disk systems
In: Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC-98), 454-462
Proceedings Article
1998Chaudhuri, Shiva
Garg, Naveen
[Ravi, R.]
The $p$-neighbor $k$-center problem
In: Information Processing Letters [65], 131-134
Journal Article
1996Garg, NaveenA 3-approximation for the minimum tree spanning with k-vertices
In: Foundations of computer science (FOCS-96) : 37th annual symposium, 302-309
Proceedings Article
1996Garg, Naveen
[Vazirani, Vijay V.]
Approximate max-flow min-(multi)cut theorems and their applications
In: SIAM Journal on Computing [25], 235-251
Journal Article
1996Garg, Naveen
Papatriantafilou, Marina
Tsigas, Philippas
Distributed List Coloring: How to Dynamically Allocate Frequencies to Mobile Base Stations
In: 8th Annual IEEE Symposium on Parallel and Distributed Processing (SPDP '96), 18-25
Proceedings Article
1995Garg, Naveen
[Vazirani, Vijay V.]
A polyhedron with all s-t cuts as vertices, and adjacency of cuts
In: Mathematical Programming (A) [70], 17-25
Journal Article
1
Hide details for Garg, Naveen (ed.)Garg, Naveen (ed.)
2006Doerr, Benjamin
Klein, Christian
Attachment IconUnbiased Rounding of Rational Matrices
In: FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science: 26th International Conference, 200-211
Proceedings Article
2
Hide details for Garibay, Ivan (ed.)Garibay, Ivan (ed.)
2009[Baswana, Surender]
[Biswas, Somenath]
Doerr, Benjamin
[Friedrich, Tobias]
[Kurur, Piyush P.]
Neumann, Frank
Computing Single Source Shortest Paths using Single-Objective Fitness Functions
In: FOGA'09 : revised selected papers from ACM SIGEVO
Foundations of Genetic Algorithms X, 59-66
Proceedings Article
2009[Bringmann, Karl]
[Friedrich, Tobias]
Don't be greedy when calculating hypervolume contributions
In: FOGA'09 : revised selected papers from ACM SIGEVO
Foundations of Genetic Algorithms X, 103-112
Proceedings Article
18
Hide details for Gasieniec, LeszekGasieniec, Leszek
2007[Chrobak, Marek]
[Gasieniec, Leszek]
Kowalski, Dariusz R.
The wake-up problem in multihop radio networks
In: SIAM Journal on Computing [36], 1453-1471
Journal Article
2004[Fraigniaud, Pierre]
[Gasieniec, Leszek]
Kowalski, Dariusz
[Pelc, Andrzej]
Collective Tree Exploration
In: LATIN 2004: Theoretical informatics, 6th Latin American Symposium, 141-151
Proceedings Article
2004[Chrobak, Marek]
[Gasieniec, Leszek]
Kowalski, Dariusz
The Wake-Up problem in multi-hop radio networks
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 985-993
Proceedings Article
1998[Crochemore, Maxime]
Gasieniec, Leszek
[Hariharan, Ramesh]
[Muthukrishnan, S.]
[Rytter, Wojciech]
A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching
In: SIAM Journal on Computing [27], 668-681
Journal Article
1998[Crochemore, Maxime]
Gasieniec, Leszek
[Rytter, Wojciech]
Constant-space string-matching in sublinear average time
In: Compression and Complexity of SEQUENCES 1997, 230-239
Proceedings Article
1997Gasieniec, Leszek
[Pelc, Andrzej]
Broadcasting with a bounded fraction of faulty nodes
In: Journal of Parallel and Distributed Computing [42], 11-20
Journal Article
1997[Crochemore, Maxime]
[Galil, Zvi]
Gasieniec, Leszek
[Park, Kunsoo]
[Rytter, Wojciech]
Constant-time Randomized Parallel String Matching
In: SIAM Journal on Computing [26], 950-960
Journal Article
1997Gasieniec, Leszek
[Indyk, Piotr]
Efficient Parallel Computing with Memory Faults
In: Proceedings of the 11th Symposium on Fundamentals of Computation Theory (FCT-97), 188-197
Proceedings Article
1997[Das, Gautam]
Fleischer, Rudolf
Gasieniec, Leszek
Gunopulos, Dimitrios
Kärkkäinen, Juha
Episode matching
In: Combinatorial pattern matching : 8th annual symposium (CPM-97), 12-27
Proceedings Article
1997Gasieniec, Leszek
Indyk, Piotr
Krysta, Piotr
External inverse pattern matching
In: Proceedings of the 8th Symposium on Combinatorial Pattern Matching (CPM-97), 90-101
Proceedings Article
1997Gasieniec, Leszek
[Jansson, Jesper]
[Lingas, Andrzej]
[Östlin, Anna]
On the complexity of computing evolutionary trees
In: Proceedings of the 3rd International Conference on Computing and Combinatorics (COCOON-97), 134-145
Proceedings Article
1997Czumaj, Artur
Ferragina, Paolo
Gasieniec, Leszek
[Muthukrishnan, S.]
Träff, Jesper Larsson
The Architecture of a Software Library for String Processing
In: Proceedings of the Workshop on Algorithm Engineering (WAE-97), 166-176
Proceedings Article
1996Gasieniec, Leszek
[Pelc, Andrzej]
Adaptive Broadcasting with Faulty Nodes
In: Parallel Computing [22], 903-912
Journal Article
1996[Brodal, Gerth Stølting]
Gasieniec, Leszek
Approximate Dictionary Queries
In: Combinatorial Pattern Matching: 7th Annual Symposium (CPM'96), 65-74
Proceedings Article
1996Gasieniec, Leszek
[Karpinski, Marek]
[Plandowski, Wojciech]
[Rytter, Wojciech]
Efficient Algorithms for Lempel-Ziv Encoding
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 392-403
Proceedings Article
1996Gasieniec, Leszek
[Kranakis, Evangelos]
[Krizanc, Danny]
[Pelc, Andrzej]
Minimizing Congestion of Layouts for ATM Networks with Faulty Links
In: Mathematical Foundations of Computer Science 1996: 21st International Symposium (MFCS'96), 392-403
Proceedings Article
1996[Chlebus, Bogdan S.]
[Czumaj, Artur]
Gasieniec, Leszek
[Kowaluk, Miroslaw]
[Plandowski, Wojciech]
Parallel Alternating-Direction Access Machine
In: Mathematical Foundations of Computer Science 1996: 21st International Symposium (MFCS'96), 255-266
Proceedings Article
1996Gasieniec, Leszek
[Karpinski, Marek]
[Plandowski, Wojciech]
[Rytter, Wojciech]
Randomized Efficient Algorithms for Compressed Strings: the Finger-Print Approach
In: Combinatorial Pattern Matching: 7th Annual Symposium (CPM'96), 39-49
Proceedings Article
1
Hide details for Gast, ChristophGast, Christoph
1997Gast, ChristophDas Maximum-Weight-Trace-Problem bei multiplem Sequenz-Alignment
Universität des Saarlandes
Thesis - Masters thesis
5
Hide details for Gavoille, Cyril (ed.)Gavoille, Cyril (ed.)
2010[Christodoulou, Giorgos]
[Ligett, Katrina]
Pyrga, Evangelia
Contention Resolution under Selfishness
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010. - Pt. II, 430-441
Proceedings Article
2010[Epstein, Leah]
[Levin, Asaf]
van Stee, Rob
Attachment IconMax-min online allocations with a reordering buffer
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010, 336-347
Proceedings Article
2010Fountoulakis, Nikolaos
Panagiotou, Konstantinos
Orientability of random hypergraphs and the power of multiple choices
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010. - Pt. 1, 348-359
Proceedings Article
2010Kratsch, Stefan
Wahlström, Magnus
Preprocessing of Min Ones Problems: A Dichotomy
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010, 653-665
Proceedings Article
1999Sibeyn, Jop F.Power and Limitations of Optical Reconfigurable Arrays
In: Proceedings of the 6th International Colloquium on Structural Information and Communication Complexity (SIROCCO 6), 249-263
Proceedings Article
2
Hide details for Gavrilova, Marina (ed.)Gavrilova, Marina (ed.)
2009Angelopoulos, SpyrosOnline Priority Steiner Tree Problems
In: Algorithms and Data Structures : 11th International Symposium, WADS 2009, 37-48
Proceedings Article
2006Kettner, Lutz
Mehlhorn, Kurt
[Pion, Sylvain]
[Schirra, Stefan]
[Yap, Chee]
Reply to "Backward Error Analysis ..."
In: Computational Science and Its Applications - ICCSA 2006, I, 60-60
Proceedings Article
17
Hide details for Gawrychowski, PawelGawrychowski, Pawel
2014[Babenko, Maxim A.]
[Gawrychowski, Pawel]
[Kociumaka, Tomasz]
[Starikovskaya, Tatiana A.]
Computing Minimal and Maximal Suffixes of a Substring Revisited
In: Combinatorial Pattern Matching - 25th Annual Symposium, CPM 2014, Moscow, Russia, June 16-18, 2014. Proceedings, 30-39
Proceedings Article
2014Gawrychowski, Pawel
[Mozes, Shay]
[Weimann, Oren]
Improved Submatrix Maximum Queries in Monge Matrices
In: Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I, 525-537
Proceedings Article
2014[Gagie, Travis]
Gawrychowski, Pawel
[Kärkkäinen, Juha]
[Nekrich, Yakov]
[Puglisi, Simon J.]
LZ77-Based Self-indexing with Faster Pattern Matching
In: LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31 - April 4, 2014. Proceedings, 731-742
Proceedings Article
2014Gawrychowski, Pawel
[Uznanski, Przemyslaw]
Order-Preserving Pattern Matching with k Mismatches
In: Combinatorial Pattern Matching - 25th Annual Symposium, CPM 2014, Moscow, Russia, June 16-18, 2014. Proceedings, 130-139
Proceedings Article
2014Gawrychowski, PawelSimple and efficient LZW-compressed multiple pattern matching
In: Journal of Discrete Algorithms [25], 34-41
Journal Article
2014Gawrychowski, Pawel
[Manea, Florin]
[Nowotka, Dirk]
Testing Generalised Freeness of Words
In: 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 337-349
Proceedings Article
2014Gawrychowski, Pawel
Jez, Artur
[Jez, Lukasz]
Validating the Knuth-Morris-Pratt Failure Function, Fast and Online
In: Theory of Computing Systems [54], 337-372
Journal Article
2013Gawrychowski, PawelAlphabetic Minimax Trees in Linear Time
In: 8th International Computer Science Symposium in Russia (CSR 2013), 36-48
Proceedings Article
2013Gawrychowski, Pawel
[Straszak, Damian]
Beating O(nm) in Approximate LZW-Compressed Pattern Matching
In: Algorithms and Computation - 24th International Symposium (ISAAC 2013), 78-88
Proceedings Article
2013[Bannai, Hideo]
Gawrychowski, Pawel
[Inenaga, Shunsuke]
[Takeda, Masayuki]
Converting SLP to LZ78 in almost Linear Time
In: Combinatorial Pattern Matching, 24th Annual Symposium (CPM 2013), 38-49
Proceedings Article
2013Gawrychowski, Pawel
[Manea, Florin]
[Nowotka, Dirk]
Discovering Hidden Repetitions in Words
In: 9th Conference on Computability in Europe (CiE 2013), 210-219
Proceedings Article
2013Gawrychowski, Pawel
[Manea, Florin]
[Mercas, Robert]
[Nowotka, Dirk]
[Tiseanu, Catalin]
Finding Pseudo-repetitions
In: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), 257-268
Proceedings Article
2013[Gagie, Travis]
Gawrychowski, Pawel
[Nekrich, Yakov]
Heaviest Induced Ancestors and Longest Common Substrings
In: 25th Canadian Conference on Computational Geometry (CCCG 13), 145-150
Proceedings Article
2013Gawrychowski, Pawel
[Kucherov, Gregory]
[Nekrich, Yakov]
[Starikovskaya, Tatiana]
Minimal Discriminating Words Problem Revisited
In: String Processing and Information Retrieval - 20th International Symposium (SPIRE 2013),
Proceedings Article
2012Gawrychowski, PawelFaster Algorithm for Computing the Edit Distance between SLP-Compressed Strings
In: String Processing and Information Retrieval : 19th International Symposium, SPIRE 2012, 229-236
Proceedings Article
2012Gawrychowski, PawelSimple and efficient LZW-compressed multiple pattern matching
In: Combinatorial Pattern Matching : 23rd Annual Symposium, CPM 2012, 232-242
Proceedings Article
2012Gawrychowski, PawelTying up the loose ends in fully LZW-compressed pattern matching
In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 624-635
Electronic Proceedings Article
2
Hide details for Gecseg, Ferenc (ed.)Gecseg, Ferenc (ed.)
1995[Bodlaender, Hans L.]
Hagerup, Torben
Parallel Algorithms with Optimal Speedup for Bounded Treewidth
In: Automata, Languages, and Programming: 22nd International Colloquium (ICALP95), 268-279
Proceedings Article
1995Chaudhuri, Shiva
Zaroliagis, Christos
Shortest Path Queries in Digraphs of Small Treewidth
In: Automata, Languages, and Programming: 22nd International Colloquium (ICALP95), 244-255
Proceedings Article
1
Hide details for Geerke, Daan P.Geerke, Daan P.
2012[Canzar, Stefan]
[El-Kebir, Mohammed]
[Pool, Rene]
Elbassioni, Khaled
[Malde, Alpeshkumar K.]
[Mark, Alan E.]
[Geerke, Daan P.]
[Stougie, Leen]
[Klau, Gunnar W.]
Charge Group Partitioning in Biomolecular Simulation
In: Research in Computational Molecular Biology : 16th Annual International Conference, RECOMB 2012, 29-43
Proceedings Article
1
Hide details for Geffert, ViliamGeffert, Viliam
1992Alt, Helmut
Geffert, Viliam
Mehlhorn, Kurt
Attachment IconA lower bound for the nondeterministic space complexity of context-free recognition
In: Information Processing Letters [42], 25-27
Journal Article
2
Hide details for Geismann, NicolaGeismann, Nicola
2001Geismann, Nicola
Hemmer, Michael
Schömer, Elmar
Computing a 3-dimensional Cell in an Arrangement of Quadrics: Exactly and Actually!
In: Proceedings of the 17th Annual Symposium on Computational Geometry (SCG-01), 264-273
Proceedings Article
2001Geismann, Nicola
Hemmer, Michael
Schömer, Elmar
The Convex Hull of Ellipsoids (Video)
In: Proceedings of the 17th Annual Symposium on Computational Geometry (SCG-01), 321-322
Proceedings Article
2
Hide details for Georgiou, ChryssisGeorgiou, Chryssis
2005[Georgiou, Chryssis]
Kowalski, Dariusz
[Shvartsman, Alexander]
Efficient gossip and robust distributed computation
In: Theoretical Computer Science [347], 130-166
Journal Article
2003[Georgiou, Chryssis]
Kowalski, Dariusz
[Shvartsman, Alexander]
Efficient Gossip and Robust Distributed Computation
In: Distributed Computing, 17th International Conference (DISC 2003), 224-238
Proceedings Article
1
Hide details for Gerdt, Vladimir (ed.)Gerdt, Vladimir (ed.)
2009Kerber, MichaelAttachment IconOn the Complexity of Reliable Root Approximation
In: Computer Algebra in Scientific Computing : 11th International Workshop, CASC 2009, 155-167
Proceedings Article
4
Hide details for Gergov, JordanGergov, Jordan
2000Gergov, JordanAlgorithms for Interval Coloring, Geometric Packing and Memory Optimization
Universität des Saarlandes
Thesis - PhD thesis
1996Gergov, JordanApproximation Algorithms for Dynamic Storage Allocation
In: Algorithms - ESA '96: 4th Annual European Symposium, 52-61
Proceedings Article
1996Gergov, Jordan
[Meinel, Christoph]
Mod-2-OBDDs - a Date Structure that generalizes EXOR-Sum-of-Products and Ordered Binary Decision Diagrams
In: Formal Methods in System Design [8], 273-282
Journal Article
1995[Dedorath, Jürgen]
Gergov, Jordan
Hagerup, Torben
More Efficient Parallel Flow Algorithms
In: Algorithms and Computation: 6th International Symposium (ISAAC95), 234-243
Proceedings Article
1
Hide details for Gervasi, Osvaldo (ed.)Gervasi, Osvaldo (ed.)
2006Kettner, Lutz
Mehlhorn, Kurt
[Pion, Sylvain]
[Schirra, Stefan]
[Yap, Chee]
Reply to "Backward Error Analysis ..."
In: Computational Science and Its Applications - ICCSA 2006, I, 60-60
Proceedings Article
1
Hide details for Geulen, SaschaGeulen, Sascha
2013[Fanghänel, Alexander]
[Geulen, Sascha]
Hoefer, Martin
[Vöcking, Berthold]
Online Capacity Maximization in Wireless Networks
In: Journal of Scheduling [16], 81-91
Journal Article
1
Hide details for Ghandar, AdamGhandar, Adam
2008[Kroeske, Jense]
[Ghandar, Adam]
[Michalewicz, Zbigniew]
Neumann, Frank
Learning Fuzzy Rules with Evolutionary Algorithms - An Analytic Approach
In: Parallel Problem Solving from Nature (PPSN X), 1051-1060
Proceedings Article
2
Hide details for Giakkoupis, GeorgeGiakkoupis, George
2012[Giakkoupis, George]
Sauerwald, Thomas
Sun, He
[Woelfel, Philipp]
Low Randomness Rumor Spreading via Hashing
In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 314-325
Electronic Proceedings Article
2012[Giakkoupis, George]
Sauerwald, Thomas
Rumor spreading and vertex expansion
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 1623-1641
Proceedings Article
2
Hide details for Giannopoulos, PanosGiannopoulos, Panos
2012[Giannopoulos, Panos]
[Knauer, Christian]
Wahlström, Magnus
[Werner, Daniel]
Hardness of discrepancy computation and ε-net verification in high dimension
In: Journal of Complexity [28], 162-176
Journal Article
2010[Giannopoulos, Panos]
[Klein, Rolf]
Kutz, Martin
[Marx, Daniel]
Computing geometric minimum-dilation graphs is NP-hard
In: International Journal of Computational Geometry & Applications [20], 147-173
Journal Article
2
Hide details for Gibbons, Phillip B. (ed.)Gibbons, Phillip B. (ed.)
2007Ajwani, Deepak
Elbassioni, Khaled
Govindarajan, Sathish
[Ray, Saurabh]
Conflict-free coloring for rectangle ranges using $n^.382$ colors
In: SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallel Algorithms and Architectures, 181-187
Proceedings Article
2006Funke, Stefan
[Guibas, Leonidas]
[Nguyen, An]
[Wang, Yusu]
Distance-Sensitive Information Brokerage in Sensor Networks
In: Distributed Computing in Sensor Systems, Second IEEE International Conference, DCOSS 2006, 234-251
Proceedings Article
5
Hide details for Gidenstam, AndersGidenstam, Anders
2010Gidenstam, Anders
[Papatriantafilou, Marina]
[Tsigas, Philippas]
NBmalloc: Allocating Memory in a Lock-Free Manner
In: Algorithmica [58], 304-338
Journal Article
2009Gidenstam, Anders
[Papatriantafilou, Marina]
[Sundell, Håkan]
[Tsigas, Philippas]
Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting
In: IEEE Transactions on Parallel and Distributed Systems [20], 1173-1187
Journal Article
2009[Larsson, Andreas]
Gidenstam, Anders
[Ha, Phuong H.]
[Papatriantafilou, Marina]
[Tsigas, Philippas]
Multiword Atomic Read/Write Registers on Multiprocessor Systems
In: Journal of experimental algorithmics [13], 7:1-7:30
Electronic Journal Article
2009Gidenstam, Anders
[Papatriantafilou, Marina]
[Tsigas, Phillipas]
NBmalloc : Allocating Memory in a Lock-Free Manner
In: Algorithmica [Online First], 1-35
Electronic Journal Article
2007Gidenstam, Anders
[Papatriantafilou, Marina]
LFthreads: A Lock-Free Thread Library
In: 11th International Conference On Principles Of Distributed Systems (OPODIS), 217-231
Proceedings Article
10
Hide details for Giesen, JoachimGiesen, Joachim
2009[Giesen, Joachim]
Manjunath, Madhusudan
Minimizing Absolute Gaussian Curvature over Meshes
In: Computational Geometry, 1-16
Electronic Proceedings Article
2008Giesen, JoachimConjoint Analysis for Measuring the Perceived Quality in Volume Rendering
In: IEEE Transactions on Visualization and Computer Graphics [13], 1664-1671
Journal Article
2008Giesen, JoachimDelaunay Triangulation Approximates Anchor Hull
In: Computational Geometry - Theory and Applications [36], 131-143
Journal Article
2008Giesen, JoachimThe Flow Complex: A Data Structure for Geometric Modeling
In: Computational Geometry - Theory and Applications [39], 178-190
Journal Article
2008[Eigensatz, Michael]
[Giesen, Joachim]
Manjunath, Madhusudan
The Solution Path of the Slab Support Vector Machine
In: The 20th Canadian Conference on Computational Geometry, 211-214
Proceedings Article
2007Giesen, Joachim
[Mitsche, Dieter]
[Schuberth, Eva]
Attachment IconCollaborative Ranking: an aggregation algorithm for individuals' preference estimation
In: Algorithmic Aspects in Information and Management : Third International Conference, AAIM 2007, 58-67
Proceedings Article
2007Giesen, Joachim
[Schuberth, Eva]
[Simon, Klaus]
[Zolliker, Peter]
[Zweifel, Oliver]
Image-Dependent Gamut Mapping as Optimization Problem
In: IEEE Transactions on Image Processing [16], 2401-2410
Journal Article
2007Giesen, JoachimMedial Axis Approximation from Inner Voronoi Balls: A Demo of the Mesecina Tool
In: 23d Annual ACM Symposium on Computational Geometry, 123-124
Proceedings Article
2007[Miklos, Balint]
Giesen, Joachim
[Pauly, Mark]
Attachment IconMedial Axis Approximation from Inner Voronoi Balls: A Demo of the Mesecina Tool
In: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07), 123-124
Proceedings Article
2007Giesen, JoachimThe Combinatorial Structure of Polyhedral Choice Based Conjoint Analysis
In: Conjoint Measurement: Methods and Applications, 259-271
Part of a Book
3
Hide details for Giezeman, Geert-JanGiezeman, Geert-Jan
2001[Bäsken, Matthias]
[Brönnimann, Hervé]
[Frank, Da]
[Devillers, Olivier]
[Ester, Ezra]
[Fabri, Andreas]
[Flato, Eyal]
[Gärtner, Bernd]
[Giezeman, Geert-Jan]
[Halperin, Dan]
[Hanniel, Iddo]
[Har-Peled, Sariel]
[Herrmann, Thomas]
Hert, Susan
[Hirsch, Shai]
[Hoffmann, Michael]
Kettner, Lutz
[Nechushtan, Oren]
[Neyer, Gabriele]
[Pasechnik, Dmitrii]
[Pion, Sylvain]
Schirra, Stefan
[Schönherr, Sven]
Seel, Michael
[Teillaud, Monique]
[Veltkamp, Remco]
[Wein, Ron]
[Wesselink, Wieger]
[Yvinec, Mariette]
CGAL Reference and User ManualsUnknown Form: eBookForm
2000[Fabri, Andreas]
[Giezeman, Geert-Jan]
[Kettner, Lutz]
Schirra, Stefan
[Schönherr, Sven]
On the Design of CGAL, a computational geometry algorithms library
In: Software - Practice and Experience [30], 1167-1202
Journal Article
1996[Fabri, Andreas]
[Giezeman, Geert-Jan]
[Kettner, Lutz]
Schirra, Stefan
[Schönherr, Sven]
The CGAL Kernel: A Basis for Geometric Computation
In: Applied Computational Geometry: Towards Geometric Engineering Proceedings (WACG'96), 191-202
Proceedings Article
11
Hide details for Gnewuch, MichaelGnewuch, Michael
2013Doerr, Carola
[Gnewuch, Michael]
Wahlström, Magnus
Calculation of Discrepancy Measures and Applications
In: A Panorama of Discrepancy Theory, 1-55
Part of a Book
2012[Gnewuch, Michael]
Wahlström, Magnus
Winzen, Carola
A New Randomized Algorithm to Approximate the Star Discrepancy Based on Threshold Accepting
In: SIAM Journal on Numerical Analysis [50], 781-807
Journal Article
2010Doerr, Benjamin
[Gnewuch, Michael]
Wahlström, Magnus
Algorithmic construction of low-discrepancy point sets via dependent randomized rounding
In: Journal of Complexity [26], 490-507
Journal Article
2009Doerr, Benjamin
[Gnewuch, Michael]
Wahlström, Magnus
Implementation of a component-by-component algorithm to generate small low-discrepancy samples
In: Monte Carlo and Quasi-Monte Carlo Methods 2008, 323-338
Proceedings Article
2008Doerr, Benjamin
[Gnewuch, Michael]
[Kritzer, Peter]
[Pillichshammer, Friedrich]
Component-by-component construction of low-discrepancy point sets of small size
In: Monte Carlo Methods and Applications [14], 129-149
Journal Article
2008Doerr, Benjamin
[Gnewuch, Michael]
Construction of Low-Discrepancy Point Sets of Small Size by Bracketing Covers and Dependent Randomized Rounding
In: Monte Carlo and Quasi-Monte Carlo Methods 2006, 299-312
Proceedings Article
2008Doerr, Benjamin
[Gnewuch, Michael]
[Kritzer, Peter]
[Pillichshammer, Peter]
Component-by-component construction of low-discrepancy point sets of small size
In: Monte Carlo Methods Applications [14], 129-150
Journal Article
2007Doerr, Benjamin
[Gnewuch, Michael]
Hebbinghaus, Nils
Neumann, Frank
A Rigorous View On Neutrality
In: IEEE Congress on Evolutionary Computation 2007, 2591-2597
Proceedings Article
2006Doerr, Benjamin
[Gnewuch, Michael]
Construction of low-discrepancy point sets of small size by bracketing covers and dependent randomized roundingReport
2006Doerr, Benjamin
[Gnewuch, Michael]
Hebbinghaus, Nils
Attachment IconDiscrepancy of Symmetric Products of Hypergraphs
In: The Electronic Journal of Combinatorics [13], 1-12
Electronic Journal Article
2005Doerr, Benjamin
[Gnewuch, Michael]
[Srivastav, Anand]
Bounds and Constructions for the Star-Discrepancy via Delta-Covers
In: Journal of Complexity [21], 691-709
Journal Article
2
Hide details for Goemans, Michel X.Goemans, Michel X.
2004[Goemans, Michel X.]
Skutella, Martin
Attachment IconCooperative facility location games
In: Journal of Algorithms [50], 194-214
Journal Article
1999[Dinitz, Yefim]
Garg, Naveen
[Goemans, Michel X.]
On the single-source unsplittable flow problem
In: Combinatorica [19], 17-41
Journal Article
1
Hide details for Goemans, Michel (ed.)Goemans, Michel (ed.)
2013[Sviridenko, Maxim]
Wiese, Andreas
Approximating the Configuration-LP for Minimizing Weighted Sum of Completion Times on Unrelated Machines
In: Proceedings of the 16th Conference on Integer Programming and Combinatorial Optimization (IPCO 2013),
Proceedings Article
1
Hide details for Goesele, MichaelGoesele, Michael
2002Goesele, Michael
Kautz, Jan
Lang, Jochen
Lensch, Hendrik P. A.
Seidel, Hans-Peter
7th ACM Symposium on Solid Modeling and Applications; Tutorial T1: Geometric Algorithms for Planning and Simulation Tasks in Virtual PrototypingProceedings
1
Hide details for Götschel, Martin (ed.)Götschel, Martin (ed.)
2010Megow, NicoleKeller oder Dach zuerst
In: Besser als Mathe, 111-116
Part of a Book
2
Hide details for Goldberg, Andrew V. (ed.)Goldberg, Andrew V. (ed.)
2009Ajwani, Deepak
[Meyer, Ulrich]
[Osipov, Vitaly]
Breadth first search on massive graphs
In: The shortest path problem : ninth DIMACS implemenation challenge, 291-307
Part of a Book
2009Bast, Holger
Funke, Stefan
Matijevic, Domagoj
Ultrafast shortest-path queries via transit nodes
In: The shortest path problem : ninth DIMACS implemenation challenge, 175-192
Part of a Book
1
Hide details for Goldberg, Andrew (ed.)Goldberg, Andrew (ed.)
2006Bast, Holger
Funke, Stefan
Matijevic, Domagoj
TRANSIT: Ultrafast Shortest-Path Queries with Linear-Time Preprocessing
In: 9th DIMACS Implementation Challenge --- Shortest Path,
Electronic Proceedings Article
6
Hide details for Goldberg, Leslie AnnGoldberg, Leslie Ann
2013Doerr, Benjamin
[Goldberg, Leslie Ann]
Adaptive Drift Analysis
In: Algorithmica [65], 224-250
Journal Article
2011Doerr, Benjamin
[Goldberg, Leslie Ann]
[Minder, Lorenz]
Sauerwald, Thomas
[Scheideler, Christian]
Stabilizing consensus with the power of two choices
In: 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA-11), 149-158
Proceedings Article
2010Doerr, Benjamin
[Goldberg, Leslie Ann]
Adaptive Drift Analysis
In: Parallel Problem Solving from Nature -- PPSN XI. -- Pt. 1, 32-41
Proceedings Article
2010Doerr, Benjamin
[Goldberg, Leslie Ann]
[Minder, Lorenz]
[Sauerwald, Thomas]
[Scheideler, Christian]
Brief Announcement: Stabilizing Consensus with the Power of Two Choices
In: Distributed Computing : 24th International Symposium, DISC 2010, 528-530
Proceedings Article
2010Doerr, Benjamin
[Goldberg, Leslie Ann]
Drift Analysis with Tail Bounds
In: Parallel Problem Solving from Nature – PPSN XI. - Pt. 1, 174-183
Proceedings Article
2000[Goldberg, Leslie Ann]
[MacKenzie, Philip D.]
[Paterson, Mike]
Srinivasan, Aravind
Contention resolution with constant expected delay
In: Journal of the ACM [42], 1048-1096
Journal Article
1
Hide details for Goldberg, Leslie Ann (ed.)Goldberg, Leslie Ann (ed.)
2008Christodoulou, George
[Kovács, Annamária]
[Schapira, Michael]
Bayesian Combinatorial Auctions
In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I, 820-832
Proceedings Article
1
Hide details for Goldberg, Paul W. (ed.)Goldberg, Paul W. (ed.)
2012[Chen, Xujin]
Doerr, Benjamin
[Hu, Xiaodong]
[Ma, Weidong]
van Stee, Rob
Winzen, Carola
Attachment IconThe Price of Anarchy for Selfish Ring Routing is Two
In: Internet and Network Economics : 8th International Workshop, WINE 2012, 420-433
Proceedings Article
2
Hide details for Goles, Eric (ed.)Goles, Eric (ed.)
1995Bradford, Phillip Gnassi
[Choppela, Venkatesh]
[Rawlins, Gregory J.E.]
Lower Bounds for the Matrix Chain Ordering Problem
In: LATIN'95: Theoretical Informatics, 2nd Latin American Symposium, 112-130
Proceedings Article
1995Chaudhuri, Shiva
[Dubhashi, Devdatt]
Probabilistic Recurrence Relations Revisited
In: LATIN'95: Theoretical Informatics, Second Latin American Symposium, 207-219
Proceedings Article
7
Hide details for Golin, Mordecai J.Golin, Mordecai J.
2003[Cheng, Siu-Wing]
Funke, Stefan
[Golin, Mordecai J.]
[Kumar, Piyush]
[Poon, Sheung-Hung]
[Ramos, Edgar A.]
Curve Reconstruction from Noisy Samples
In: Proceedings of the 19th Annual Symposium on Computational Geometry (SCG-03), 420-429
Proceedings Article
2002Bradford, Phillip Gnassi
[Golin, Mordecai J.]
[Larmore, Lawrence L.]
Optimal prefix-free codes for unequal letter costs: Dynamic programming with the Monge property
In: Journal of Algorithms [42], 277-303
Journal Article
1999Arya, Sunil
Golin, Mordecai J.
Mehlhorn, Kurt
On the Expected Depth of Random Circuits
In: Combinatorics, Probability and Computing [8], 209-228
Journal Article
1998Bradford, Phillip Gnassi
[Golin, Mordecai J.]
[Larmore, Lawrence L.]
[Rytter, Wojciech]
Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 43-54
Proceedings Article
1998[Golin, Mordecai J.]
[Raman, Rajeev]
Schwarz, Christian
Smid, Michiel
Randomized Data Structures for the Dynamic Closest-Pair Problem
In: SIAM Journal on Computing [27], 1036-1072
Journal Article
1996[Devillers, Olivier]
[Golin, Mordecai J.]
[Kedem, Klara]
Schirra, Stefan
Queries on Voronoi Diagrams of Moving Points
In: Computational Geometry. Theory and Applications [5], 315-327
Journal Article
1995Golin, Mordecai J.
[Raman, Rajeev]
Schwarz, Christian
Smid, Michiel
Simple randomized algorithms for closest pair problems
In: Nordic Journal of Computing [2], 3-27
Journal Article
1
Hide details for Golumbic, Martin CharlesGolumbic, Martin Charles
2006[Golumbic, Martin Charles]
[Mintz, Aviad]
[Rotics, Udi]
Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial k-trees
In: Discrete Applied Mathematics [154], 1465-1477
Journal Article
1
Hide details for Golumbic, Martin Charles (ed.)Golumbic, Martin Charles (ed.)
2012Hermelin, Danny
[Mestre, Julian]
[Rawitz, Dror]
Optimization Problems in Dotted Interval Graphs
In: Graph-Theoretic Concepts in Computer Science : 38th InternationalWorkshop, WG 2012, 46-56
Proceedings Article
1
Hide details for Gonnet, Gaston H.Gonnet, Gaston H.
1982Eisenbarth, Bernhard
Ziviani, Nivio
Gonnet, Gaston H.
Mehlhorn, Kurt
Wood, Derick
Attachment IconThe Theory of Fringe Analysis and Its Application to 2-3 Trees and B-Trees
In: Information and Control [55], 125-174
Journal Article
1
Hide details for González-Caro, Cristina N. (ed.)González-Caro, Cristina N. (ed.)
2012Gawrychowski, PawelFaster Algorithm for Computing the Edit Distance between SLP-Compressed Strings
In: String Processing and Information Retrieval : 19th International Symposium, SPIRE 2012, 229-236
Proceedings Article
1
Hide details for Goodman, Jacob E. (ed.)Goodman, Jacob E. (ed.)
2004Kettner, Lutz
[Näher, Stefan]
Two Computational Geometry Libraries: LEDA and CGAL
In: Handbook of Discrete and Computational Geometry, 1435-1463
Part of a Book
6
Hide details for Goodrich, Michael T.Goodrich, Michael T.
2001Ramos, Edgar A.
[Amato, Nancy M.]
[Goodrich, Michael T.]
A Randomized Algorithm for Triangulating a Simple Polygon in Linear Time
In: Discrete and Computational Geometry [26], 246-265
Journal Article
2000Ramos, Edgar A.
[Amato, Nancy M.]
[Goodrich, Michael T.]
Computing the arrangement of curve segments: Divide-and-conquer algorithms via sampling
In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00), 705-706
Proceedings Article
2000[Amato, Nancy M.]
[Goodrich, Michael T.]
Ramos, Edgar A.
Linear-Time Triangulation of a Simple Polygon Made Easier Via Randomization
In: Proceedings of the 16th Annual Symposium on Computational Geometry (SCG-00), 201-212
Proceedings Article
1997[Goodrich, Michael T.]
Ramos, Edgar A.
Bounded-independence derandomization of geometric partitioning with applications to parallel fixed-dimensional linear programming
In: Discrete and Computational Geometry [18], 397-420
Journal Article
1997[Duncan, C.A.]
[Goodrich, Michael T.]
Ramos, Edgar A.
Efficient approximation and optimization algorithms for computational metrology
In: Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-97), 121-130
Proceedings Article
1995[Chian, Yi-Feng]
[Goodrich, Michael T.]
Grove, Edward
[Tamassia, Roberto]
[Vengroff, Darren Erik]
[Vitter, Jeffrey Scott]
External-Memory Graph Algorithms
In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95), 139-149
Proceedings Article
3
Hide details for Goodrich, Michael T. (ed.)Goodrich, Michael T. (ed.)
2000Ramos, Edgar A.
[Amato, Nancy M.]
[Goodrich, Michael T.]
Computing the arrangement of curve segments: Divide-and-conquer algorithms via sampling
In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00), 705-706
Proceedings Article
1999Schirra, StefanA Case Study on the Cost of Geometric Computing
In: Selected papers of the International Workshop on Algorithm Engineering and Experimentation (ALENEX-99), 156-176
Proceedings Article
1999Sanders, PeterFast Priority Queues for Cached Memory
In: Selected papers of the International Workshop on Algorithm Engineering and Experimentation (ALENEX-99), 312-327
Proceedings Article
1
Hide details for Gopalakrishnan, Ganesh (ed.)Gopalakrishnan, Ganesh (ed.)
2011[Alkassar, Eyad]
[Böhme, Sascha]
Mehlhorn, Kurt
Rizkallah, Christine
Verification of Certifying Computations
In: Computer Aided Verification : 23rd International Conference, CAV 2011, 67-82
Proceedings Article
2
Hide details for Gorlatch, Sergei (ed.)Gorlatch, Sergei (ed.)
1997Chlebus, Bogdan S.
Czumaj, Artur
Sibeyn, Jop F.
Routing on the PADAM: Degrees of Optimality
In: Proceedings of the 3rd International Euro-Par Conference on Parallel Processing (Euro-Par-97), 272-279
Proceedings Article
1997Sibeyn, Jop F.Sample Sort on Meshes
In: Proceedings of the 3rd International Euro-Par Conference on Parallel Processing (Euro-Par-97), 389-398
Proceedings Article
2
Hide details for Gorrieri, Roberto (ed.)Gorrieri, Roberto (ed.)
1997Hagerup, TorbenDynamic algorithms for graphs of bounded treewidth
In: Proceedings of the 24th International Colloquium on Automata, Languages, and Programming (ICALP-97), 292-302
Proceedings Article
1997Mehlhorn, Kurt
Näher, Stefan
Uhrig, Christian
The LEDA platform for combinatorial and geometric computing
In: Proceedings of the 24th International Colloquium on Automata, Languages, and Programming (ICALP-97), 7-16
Proceedings Article
1
Hide details for Gotsman, CraigGotsman, Craig
2007[Gotsman, Craig]
Kaligosi, Kanela
Mehlhorn, Kurt
Michail, Dimitrios
Pyrga, Evangelia
Attachment IconCycle Bases of Graphs and Sampled Manifolds
In: Computer Aided Geometric Design [24], 464
Journal Article
1
Hide details for Gotthilf, ZviGotthilf, Zvi
2010[Gotthilf, Zvi]
[Hermelin, Danny]
[Landau, Gad M.]
[Lewenstein, Moshe]
Restricted LCS
In: 17th International Symposium on String Processing and Information Retrieval, 250-257
Proceedings Article
1
Hide details for Goumopoulos, ChristosGoumopoulos, Christos
1998[Alefragis, Panayiotis]
[Goumopoulos, Christos]
Sanders, Peter
[Takkula, Tuomo]
[Wedelin, Dag]
Parallel Crew Scheduling in PAROS
In: Proceedings of the 4th International Euro-Par Conference (Euro-Par-98), 1104-1113
Proceedings Article
1
Hide details for Gourves, LaurentGourves, Laurent
2007Christodoulou, George
[Gourves, Laurent]
[Pascual, Fanny]
Attachment IconScheduling Selfish Tasks: About the Performance of Truthful Algorithms
In: Computing and Combinatorics : 13th Annual International Conference, COCOON 2007, 187-197
Proceedings Article
1
Hide details for Gouyou-Beauchamps, DominiqueGouyou-Beauchamps, Dominique
2002Banderier, Cyril
[Bousquet-Mélou, Mireille]
[Denise, Alain]
[Flajolet, Philippe]
[Gardy, Danièle]
[Gouyou-Beauchamps, Dominique]
Generating Functions for Generating Trees
In: Discrete Mathematics [246], 29-55
Journal Article
4
Hide details for Govindarajan, SathishGovindarajan, Sathish
2012[Ajwani, Deepak]
Elbassioni, Khaled
[Govindarajan, Sathish]
Ray, Saurabh
Conflict-free coloring for rectangle ranges using O(n .382) colors
In: Discrete & Computational Geometry [48], 39-52
Journal Article
2008Govindarajan, Sathish
[Dietze, Michael C.]
[Agarwal, Pankaj K.]
[Clark, James S.]
Attachment IconA scalable algorithm for dispersing population
In: Journal of Intellingent Information Systems [29], 39-61
Journal Article
2007Ajwani, Deepak
Elbassioni, Khaled
Govindarajan, Sathish
[Ray, Saurabh]
Conflict-free coloring for rectangle ranges using $n^.382$ colors
In: SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallel Algorithms and Architectures, 181-187
Proceedings Article
2007Ajwani, Deepak
Elbassioni, Khaled M.
Govindarajan, Sathish
[Ray, Saurabh]
Conflict-Free Coloring for Rectangle Ranges Using $\tildeO(n^.382+\epsilon)$ Colors
In: 19th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 07), (to-appear)
Proceedings Article
1
Hide details for Goyal, VishrutGoyal, Vishrut
2005Baswana, Surender
[Goyal, Vishrut]
[Sen, Sandeep]
Attachment IconAll-pairs nearly 2-approximate shortest paths in $O(n^2 \mathrm polylog n)$ time
In: STACS 2005 : 22nd Annual Symposium on Theoretical Aspects of Computer Science, 666-679
Proceedings Article
2
Hide details for Graham, Ron (ed.)Graham, Ron (ed.)
1992Baumgarten, Hanna
Jung, Hermann
Mehlhorn, Kurt
Dynamic Point Location in General Subdivisions
In: Discrete algorithms (SODA-92) : 3rd annual ACM-SIAM symposium, 250-258
Proceedings Article
1992Mehlhorn, Kurt
Sharir, Micha
Welzl, Emo
Tail Estimates for the Space Complexity of Randomised Incremental Algorithms
In: Discrete algorithms (SODA-92) : 3rd annual ACM-SIAM symposium, 89-93
Proceedings Article
1
Hide details for Grahl, Jörn (ed.)Grahl, Jörn (ed.)
2009GECCO 2009: Proceedings of the 11th Annual conference on Genetic and evolutionary computation.Proceedings
1
Hide details for Grammatikakis, M.D.Grammatikakis, M.D.
1998Sibeyn, Jop F.
[Grammatikakis, M.D.]
[Hsu, D.F.]
[Kraetzl, M.]
Packet Routing in Fixed-Connection Networks: A Survey
In: Journal of Parallel and Distributed Computing [54], 77-132
Journal Article
2
Hide details for Granados, MiguelGranados, Miguel
2003Granados, Miguel
Hachenberger, Peter
Hert, Susan
Kettner, Lutz
Mehlhorn, Kurt
Seel, Michael
Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and ImplementationReport
2003Granados, Miguel
Hachenberger, Peter
Hert, Susan
Kettner, Lutz
Mehlhorn, Kurt
Seel, Michael
Attachment IconBoolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation
In: Algorithms - ESA 2003: 11th Annual European Symposium, 654-666
Proceedings Article
1
Hide details for Grandoni, FabrizioGrandoni, Fabrizio
2013[Anagnostopoulos, Aris]
[Grandoni, Fabrizio]
[Leonardi, Stefano]
Wiese, Andreas
Constant Integrality Gap LP formulations of Unsplittable Flow on a Path
In: Proceedings of the 16th Conference on Integer Programming and Combinatorial Optimization (IPCO 2013),
Proceedings Article
2
Hide details for Green Larsen, KasperGreen Larsen, Kasper
2013Bringmann, Karl
[Green Larsen, Kasper]
Succinct Sampling from Discrete Distributions
In: 45th ACM Symposium on Theory of Computing (STOC-13), 775-782
Proceedings Article
2012[Afshani, Peyman]
[Agrawal, Manindra]
Doerr, Benjamin
[Green Larsen, Kasper]
Mehlhorn, Kurt
Winzen, Carola
The Query Complexity of Finding a Hidden Permutation
In: Electronic Colloquium on Computational Complexity (ECCC): Report Series [87 (Revision 1)], 1-36
Electronic Journal Article
2
Hide details for Griebl, Martin (ed.)Griebl, Martin (ed.)
1997Chlebus, Bogdan S.
Czumaj, Artur
Sibeyn, Jop F.
Routing on the PADAM: Degrees of Optimality
In: Proceedings of the 3rd International Euro-Par Conference on Parallel Processing (Euro-Par-97), 272-279
Proceedings Article
1997Sibeyn, Jop F.Sample Sort on Meshes
In: Proceedings of the 3rd International Euro-Par Conference on Parallel Processing (Euro-Par-97), 389-398
Proceedings Article
3
Hide details for Grigoriev, AlexanderGrigoriev, Alexander
2006[Grigoriev, Alexander]
[van Loon, Joyce]
Sitters, Rene
[Uetz, Marc]
How to Sell a Graph: Guidelines for Graph Retailers
In: Graph-Theoretic Concepts in Computer Science : 32nd International Workshop, WG 2006, 125-136
Proceedings Article
2006[Bodlaender, Hans L.]
[Feremans, Corinne]
[Grigoriev, Alexander]
[Penninkx, Eelko]
Sitters, Rene
[Wolle, Thomas]
On the minimum corridor connection and other generalized geometric problems
In: 4th Workshop on Approximation and Online Algorithms, WAOA, 69-82
Proceedings Article
2006[Feremans, Corinne]
[Grigoriev, Alexander]
Sitters, Rene
The geometric generalized minimum spanning tree problem with grid clustering
In: 4OR: A Quarterly Journal of Operations Research [4], 319-329
Journal Article
1
Hide details for Grobelnik, Marko (ed.)Grobelnik, Marko (ed.)
2006Bast, Holger
[Dupret, Georges]
Majumdar, Debapriyo
[Piwowarski, Benjamin]
Discovering a Term Taxonomy from Term Similarities Using Principal Component Analysis
In: Semantics, web and mining : Joint International Workshops, EWMF 2005 and KDO 2005, 103-120
Proceedings Article
1
Hide details for Gröpl, ClemensGröpl, Clemens
2007[Bodirsky, Manuel]
[Gröpl, Clemens]
Johannsen, Daniel
[Kang, Mihyun]
Attachment IconA Direct Decomposition of 3-connected Planar Graphs
In: Séminaire Lotharingien de Combinatoire [B54Ak], 15
Journal Article
1
Hide details for Grohe, Martin (ed.)Grohe, Martin (ed.)
2008Wahlström, MagnusA Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances
In: 3rd International Workshop on Parameterized and Exact Computation (IWPEC 2008), 202-213
Proceedings Article
1
Hide details for Gronau, Norbert (ed.)Gronau, Norbert (ed.)
2007Bast, Holger
Weber, Ingmar
Managing Helpdesk Tasks with CompleteSearch: A Case Study
In: 4th Conference on Professional Knowledge Management (WM'07), 101-108
Proceedings Article
1
Hide details for Gross, RobertoGross, Roberto
1998Ferragina, Paolo
[Gross, Roberto]
Optimal On-Line Search and Sublinear Time Update in String Matching
In: SIAM Journal on Computing [27], 713-736
Journal Article
1
Hide details for Groß, Roderich (ed.)Groß, Roderich (ed.)
2010Kötzing, Timo
Neumann, Frank
[Röglin, Heiko]
[Witt, Carsten]
Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem
In: Swarm Intelligence : 7th International Conference, ANTS 2010, 324-335
Proceedings Article
5
Hide details for Grove, EdwardGrove, Edward
1995[Barve, Rakesh D.]
Grove, Edward
[Vitter, Jeffrey Scott]
An Application-Controlled Paging Algorithm for a Shared Cache
In: 36th Annual Symposium on Foundations of Computer Science, 204-213
Proceedings Article
1995[Chian, Yi-Feng]
[Goodrich, Michael T.]
Grove, Edward
[Tamassia, Roberto]
[Vengroff, Darren Erik]
[Vitter, Jeffrey Scott]
External-Memory Graph Algorithms
In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95), 139-149
Proceedings Article
1995[Awerbuch, Baruch]
[Azar, Yossi]
Grove, Edward
[Kao, Ming-Yang]
Krishnan, P.
[Vitter, Jeffrey Scott]
Load Balancing in the Euclidean Norm
In: 36th Annual Symposium on Foundations of Computer Science, 383-391
Proceedings Article
1995Grove, EdwardOn-line Bin Packing with Lookahead
In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95), 430-436
Proceedings Article
1995Grove, Edward
[Kao, Ming-Yang]
[Krishnan, P.]
[Vitter, Jeffrey Scott]
Online Perfect Matching and Mobile Computing
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 194-205
Proceedings Article
1
Hide details for Gruber, Ralf (ed.)Gruber, Ralf (ed.)
2009Emeliyanenko, PavelAttachment IconEfficient Multiplication of Polynomials on Graphics Hardware
In: Advanced Parallel Processing Technologies : 8th International Symposium, APPT 2009, 134-149
Proceedings Article
4
Hide details for Gruska, Jozef (ed.)Gruska, Jozef (ed.)
1998Crauser, Andreas
Mehlhorn, Kurt
Meyer, Ulrich
Sanders, Peter
Attachment IconA Parallelization of Dijkstra's Shortest Path Algorithm
In: Proceedings of the 23rd International Symposium on the Mathematical Foundations of Computer Science (MFCS-98), 722-731
Proceedings Article
1998Mehlhorn, Kurt
Näher, Stefan
Attachment IconFrom Algorithms to Working Programs: On the Use of Program Checking in LEDA
In: Mathematical foundations of computer science (MFCS-98) : 23rd international symposium, 84-93
Proceedings Article
1986Alt, Helmut
Hagerup, Torben
Mehlhorn, Kurt
Preparata, Franco P.
Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
In: Mathematical Foundations of Computer Science, 12th Symposium (MFCS 1986), 199-208
Proceedings Article
1981Alt, Helmut
Mehlhorn, Kurt
Munro, J. Ian
Partial Match Retrieval in Implicit Data Structures
In: Mathematical foundations of computer science (MFCS-81) : 10th symposium, ,, 156-161
Proceedings Article
2
Hide details for Gudmundsson, Joachim (ed.)Gudmundsson, Joachim (ed.)
2008Dumitriu, Daniel
[Funke, Stefan]
[Kutz, Martin]
[Milosavljevic, Nikola]
On the Locality of Extracting a 2-Manifold in $R^3$
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT-2008), 270-281
Proceedings Article
2008Harren, Rolf
van Stee, Rob
Attachment IconPacking Rectangles into 2 OPT Bins using Rotations
In: 11th Scandinavian Workshop on Algorithm Theory, 306-318
Proceedings Article
1
Hide details for Günter Rudolph (ed.)Günter Rudolph (ed.)
2008Doerr, Benjamin
Johannsen, Daniel
[Tang, Ching Hoo]
Attachment IconHow Single Ant ACO Systems Optimize Pseudo-Boolean Functions
In: Parallel Problem Solving from Nature – PPSN X, 378-388
Proceedings Article
2
Hide details for Günther, ElisabethGünther, Elisabeth
2013[Günther, Elisabeth]
[Maurer, Olaf]
Megow, Nicole
Wiese, Andreas
A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio
In: 24st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013),
Proceedings Article
2010[Günther, Elisabeth]
[König, Felix]
Megow, Nicole
Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width
In: Approximation and Online Algorithms : 7th International Workshop, WAOA 2009, 170-181
Proceedings Article
3
Hide details for Güttler, ReinerGüttler, Reiner
1980Güttler, Reiner
Mehlhorn, Kurt
Schneider, Wolfgang
Attachment IconBinary Search Trees: Average and Worst Case Behavior
In: Elektronische Informationsverarbeitung und Kybernetik [16], 41-61
Journal Article
1976Güttler, Reiner
Mehlhorn, Kurt
Schneider, Wolfgang
Binary Search Trees: Average and Worst Case BehaviorReport
1976Güttler, Reiner
Mehlhorn, Kurt
Schneider, Wolfgang
Wernet, Norbert
Binary Search Trees: Average and Worst Case Behavior
In: GI - 6. Jahrestagung, 301-313
Proceedings Article
1
Hide details for Guez, DanGuez, Dan
2004Kesselman, Alexander
[Guez, Dan]
[Rosen, Adi]
Packet-Mode Policies for Input-Queued Switches
In: Sixteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-04), 93-102
Proceedings Article
1
Hide details for Gugelmann, LucaGugelmann, Luca
2011[Gugelmann, Luca]
Spöhel, Reto
On balanced coloring games in random graphs
In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 425-430
Electronic Proceedings Article
2
Hide details for Guibas, LeonidasGuibas, Leonidas
2010[Guibas, Leonidas]
Milosavljevic, Nikola
[Motskin, Arik]
Attachment IconConnected Dominating Sets on Dynamic Geometric Graphs
In: Proceedings of the 22nd Canadian Conference on Computational Geometry (CCCG2010), 27-30
Proceedings Article
2006Funke, Stefan
[Guibas, Leonidas]
[Nguyen, An]
[Wang, Yusu]
Distance-Sensitive Information Brokerage in Sensor Networks
In: Distributed Computing in Sensor Systems, Second IEEE International Conference, DCOSS 2006, 234-251
Proceedings Article
2
Hide details for Guibas, L.Guibas, L.
1996[Alt, Helmut]
[Guibas, L.]
Mehlhorn, Kurt
[Karp, Richard M.]
[Wigderson, A.]
Attachment IconA Method for Obtaining Randomized Algorithms with Small Tail Probabilities
In: Algorithmica [16], 543-547
Journal Article
1991Alt, Helmut
Guibas, L.
Mehlhorn, Kurt
Karp, Richard M.
Wigderson, A.
Attachment IconA Method for Obtaining Randomized Algorithms with Small Tail ProbabilitiesReport
3
Hide details for Guillaume, FrankGuillaume, Frank
1999Sibeyn, Jop F.
[Guillaume, Frank]
[Seidel, Tillmann]
Practical Parallel List Ranking
In: Journal of Parallel and Distributed Computing [56], 156-180
Journal Article
1997Sibeyn, Jop F.
[Guillaume, Frank]
[Seidel, Tillmann]
Practical Parallel List Ranking
In: Proceedings of the 4th Symposium on Solving Irregularly Structured Problems in Parallel (IRREGULAR-97), 25-36
Proceedings Article
1997Guillaume, FrankPraktisches Paralleles Paralleles List Ranking
Universität des Saarlandes
Thesis - Masters thesis
3
Hide details for Gunopulos, DimitriosGunopulos, Dimitrios
1997Gunopulos, Dimitrios
Mannila, Heikki
Saluja, Sanjeev
Discovering all most specific sentences by randomized algorithms
In: Proceedings of the 6th International Conference on Database Theory (ICDT-97), 215-229
Proceedings Article
1997[Das, Gautam]
Fleischer, Rudolf
Gasieniec, Leszek
Gunopulos, Dimitrios
Kärkkäinen, Juha
Episode matching
In: Combinatorial pattern matching : 8th annual symposium (CPM-97), 12-27
Proceedings Article
1996[Dobkin, David P.]
Gunopulos, Dimitrios
Geometric problems in machine learning
In: Applied Computational Geometry: Towards Geometric Engineering (FCRC96 Workshop, WACG96), 121-132
Proceedings Article
1
Hide details for Guo, QiGuo, Qi
2001[Beldiceanu, Nicolas]
[Guo, Qi]
Thiel, Sven
Non-overlapping Constraints between Convex Polytopes
In: Proceedings of the 7th International Symposium on Principles and Practice of Constraint Programming (CP-01), 392-407
Proceedings Article
2
Hide details for Guo, ZeyuGuo, Zeyu
2011[Guo, Zeyu]
Sun, He
[Zhu, Hong]
Greedy Construction of 2-Approximate Minimum Manhattan Networks
In: International Journal of Computational Geometry and Applications [21], 331-350
Journal Article
2011[Chin, Francis Y. L.]
[Guo, Zeyu]
Sun, He
Minimum Manhattan Network is NP-Complete
In: Discrete & Computational Geometry [45], 701-722
Journal Article
3
Hide details for Gupta, AnupamGupta, Anupam
2010Bansal, Nikhil
[Gupta, Anupam]
[Li, Jian]
Mestre, Julián
[Nagarajan, Viswanath]
[Rudra, Atri]
When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings (Extended Abstract)
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. II, 218-229
Proceedings Article
2009Chan, T-H. Hubert
[Dhamdhere, Kedar]
[Gupta, Anupam]
[Kleinberg, Jon]
[Slivkins, Aleksandrs]
Metric Embeddings with Relaxed Guarantees
In: SIAM Journal on Computing [38], 2303-2329
Journal Article
2009Chan, T.-H. Hubert
[Gupta, Anupam]
Small Hop-diameter Sparse Spanners for Doubling Metrics
In: Discrete and Computational Geometry [41], 28-44
Journal Article
1
Hide details for Gupta, Anupam (ed.)Gupta, Anupam (ed.)
2012[Epstein, Leah]
[Jez, Lukasz]
[Sgall, Jiri]
van Stee, Rob
Attachment IconOnline Scheduling of Jobs with Fixed Start Times on Related Machines
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 15th International Workshop, APPROX 2012 and 16th International Workshop, RANDOM 2012, 134-145
Proceedings Article
2
Hide details for Gupta, ArvindGupta, Arvind
1997Gupta, Arvind
[Mahajan, Sanjeev]
Using amplification to compute majority with small majority gates
In: Computational Complexity [6], 46-63
Journal Article
1996[Gupta, Arvind]
[Kaller, Damon]
[Mahajan, Sanjeev]
[Shermer, Thomas C.]
Vertex partitioning problems on partial k-trees
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 161-172
Proceedings Article
1
Hide details for Gupta, DivyaGupta, Divya
2012Elbassioni, Khaled
[Garg, Naveen]
[Gupta, Divya]
[Kumar, Amit]
[Narula, Vishal]
[Pal, Arindam]
Approximation Algorithms for the Unsplittable Flow Problem on Paths and Trees
In: 32nd International Conference on Foundations of Software Technology and Theoretical Computer Science : FSTTCS 2012, 267-275
Electronic Proceedings Article
8
Hide details for Gupta, ProsenjitGupta, Prosenjit
1999Gupta, Prosenjit
[Janardan, Ravi]
Smid, Michiel
Efficient algorithms for counting and reporting pairwise intersections between convex polygons
In: Information Processing Letters [69], 7-13
Journal Article
1997Gupta, Prosenjit
[Janardan, Ravi]
Smid, Michiel
[Dasgupta, Bhaskar]
The rectangle enclosure and point-dominance problems revisited
In: International Journal of Computational Geometry and Applications [7], 437-456
Journal Article
1996Gupta, Prosenjit
[Janardan, Ravi]
Smid, Michiel
Algorithms for generalized halfspace range searching and other intersection searching problems
In: Computational Geometry [5], 321-340
Journal Article
1996Gupta, Prosenjit
[Janardan, Ravi]
Smid, Michiel
Algorithms for generalized halfspace range searching and other intersection searching problems
In: Computational Geometry [6], 1-19
Journal Article
1996Gupta, Prosenjit
[Janardan, Ravi]
Smid, Michiel
Fast algorithms for collision and proximity problems involving moving geometric objects
In: Computational Geometry [6], 371-391
Journal Article
1995Gupta, Prosenjit
[Janardan, Ravi]
Smid, Michiel
Further results on generalized intersection searching problems:
counting, reporting, and dynamization
In: Journal of Algorithms [19], 282-317
Journal Article
1995Gupta, Prosenjit
[Janardan, Ravi]
Smid, Michiel
[Dasgupta, Bhaskar]
The rectangle enclosure and point-dominance problems revisited
In: 11th Annual ACM Symposium on Computing Geometry, 162-171
Proceedings Article
1995Gupta, Prosenjit
[Janardan, Ravi]
Smid, Michiel
The rectangle enclosure and point-dominance problems revisited
In: 11th Annual !CM Symposium on Computational Geometry, 162-171
Proceedings Article
1
Hide details for Gurd, John (ed.)Gurd, John (ed.)
2001Meyer, UlrichHeaps are better than Buckets: Parallel Shortest Paths on Unbalanced Graphs
In: Proceedings of the 7th International Euro-Par Conference on Parallel Processing (Euro-Par-01) :, 343-351
Proceedings Article
45
Hide details for Gurvich, VladimirGurvich, Vladimir
2012[Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Makino, Kazuhisa]
Every Stochastic Game with Perfect Information Admits a Canonical Form
In: 2nd International ICST Conference on Game Theory for Networks (GameNets 2011),
Unpublished/Draft
2012[Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Makino, Kazuhisa]
On Nash equilibria and improvement cycles in pure positional strategies for Chess-like and Backgammon-like n-person games
In: Discrete Mathematics [312], 772-788
Journal Article
2011[Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Makino, Kazuhisa]
A lower bound for discounting algorithms solving two-person zero-sum limit average payoff stochastic gamesUnpublished/Draft
2011[Boros, Endre]
Elbassioni, Khaled
[Fouz, Mahmoud]
[Gurvich, Vladimir]
[Makino, Kazuhisa]
[Manthey, Bodo]
Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 147-158
Proceedings Article
2011[Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Tiwary, Hans Raj]
The negative cycles polyhedron and hardness of checking some polyhedral properties
In: Annals of Operations Research [188], 63-76
Journal Article
2010[Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Makino, Kazuhisa]
A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information
In: Integer Programming and Combinatorial Optimization : 14th International Conference, IPCO 2010, 341-354
Proceedings Article
2010[Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Makino, Kazuhisa]
On effectivity functions of game forms
In: Games and Economic Behavior [68], 512-531
Journal Article
2010[Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Makino, Kazuhisa]
On Nash Equilibria and Improvement Cycles in Pure Positional Strategies for Chess-like and Backgammon-like $n$-person GamesUnpublished/Draft
2008[Boros, Endre]
Elbassioni, Khaled
Gurvich, Vladimir
[Makino, Kazuhisa]
[Oudalov, Vladimir]
A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2x2 subgames
In: Computer Science - Theory and Applications, Third International Computer Science Symposium in Russia, CSR 2008, 99-109
Proceedings Article
2008[Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Tiwary, Hans Raj]
Characterization of the vertices and extreme directions of the negative cycle polyhedron and hardness of generating vertices of 0/1-polyhedra
In: CoRR [abs/0801.3790], x-x
Journal Article
2008[Khachiyan, Leonid]
[Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir]
Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions
In: Discrete Applied Mathematics [156], 2020-2034
Journal Article
2008[Khachiyan, Leonid]
[Boros, Endre]
[Borys, Konrad]
Elbassioni, Khaled
[Gurvich, Vladimir]
Generating All Vertices of a Polyhedron Is Hard
In: Discrete & Computational Geometry [39], 174-190
Journal Article
2008[Khachiyan, Leonid]
[Boros, Endre]
[Borys, Konrad]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Makino, Kazuhisa]
Generating Cut Conjunctions in Graphs and Related Problems
In: Algorithmica [51], 239-263
Journal Article
2008[Khachiyan, Leonid]
[Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir]
On Enumerating Minimal Dicuts and Strongly Connected Subgraphs
In: Algorithmica [50], 159-172
Journal Article
2008[Khachiyan, Leonid]
[Boros, Endre]
[Borys, Konrad]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Rudolf, Gabor]
[Zhao, Jihui]
On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction
In: Theory Comput. Syst. [43], 204-233
Journal Article
2007[Khachiyan, Leonid]
[Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir]
A global parallel algorithm for the hypergraph transversal problem
In: Information Processing Letters [101], 148-155
Journal Article
2007[Khachiyan, Leonid]
[Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Makino, Kazuhisa]
Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data
In: Theoretical Computer Science [379], 361-376
Journal Article
2007[Khachiyan, Leonid]
[Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Makino, Kazuhisa]
Enumerating disjunctions and conjunctions of paths and cuts in reliability theory
In: Discrete Applied Mathematics [155], 137-149
Journal Article
2007[Boros, Endre]
[Borys, Konrad]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Makino, Kazuhisa]
[Rudolf, Gabor]
Generating Minimal k-Vertex Connected Spanning Subgraphs
In: Computing and Combinatorics, 13th Annual International Conference, COCOON 2007, Proceedings, 222-231
Proceedings Article
2007[Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Makino, Kazuhisa]
Generating Vertices of Polyhedra and Related Monotone Generation ProblemsUnpublished/Draft
2007[Khachiyan, Leonid]
[Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir]
On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs
In: Theoretical Computer Science [382], 139-150
Journal Article
2006[Khachiyan, Leonid]
[Boros, Endre]
[Borys, Konrad]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Makino, Kazuhisa]
Enumerating Spanning and Connected Subsets in Graphs and Matroids
In: Algorithms - ESA 2006, 14th Annual European Symposium, 444-455
Proceedings Article
2006[Khachiyan, Leonid]
[Boros, Endre]
[Borys, Konrad]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
Generating All Vertices of a Polyhedron is Hard
In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06, 758-765
Proceedings Article
2005[Khachiyan, Leonid]
[Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
A New Algorithm for the Hypergraph Transversal Problem
In: Computing and combinatorics : 11th Annual International Conference, COCOON 2005, 767-776
Proceedings Article
2005[Khachiyan, Leonid]
[Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
Generating All Minimal Integral Solutions to Monotone $\wedge,\vee$-Systems of Linear, Transversal and Polymatroid Inequalities
In: Mathematical Foundations of Computer Science 2005 : 30th International Symposium, MFCS 2005, 556-567
Proceedings Article
2005[Khachiyan, Leonid]
[Boros, Endre]
[Borys, Konrad]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 156-165
Proceedings Article
2005[Khachiyan, Leonid]
[Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Makino, Kazuhisa]
On the Complexity of Some Enumeration Problems for Matroids
In: SIAM Journal on Discrete Mathematics [19], 966-984
Journal Article
2004[Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
Attachment IconAlgorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems
In: Algorithms – ESA 2004: 12th Annual European Symposium, 122-133
Proceedings Article
2004[Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Khachiyan, Leonid]
Attachment IconAn Efficient Implementation of a Joint Generation Algorithm
In: Experimental and efficient algorithms : Third International Workshop, WEA 2004, 114-128
Proceedings Article
2004[Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Khachiyan, Leonid]
Attachment IconEnumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems
In: Integer programming and combinatorial optimization : 10th International IPCO Conference, 152-162
Proceedings Article
2004[Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Khachiyan, Leonid]
Attachment IconGenerating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections
In: LATIN 2004: Theoretical Informatics, 6th Latin American Symposium, 488-498
Proceedings Article
2004[Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Khachiyan, Leonid]
[Makino, Kazuhisa]
Attachment IconGenerating Paths and Cuts in Multi-pole (Di)graphs
In: Mathematical foundations of computer science 2004 : 29th International Symposium, MFCS 2004, 298-309
Proceedings Article
2003[Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Khachiyan, Leonid]
Attachment IconAlgorithms for Enumerating Circuits in Matroids.
In: Algorithms and Computation, 14th International Symposium, ISAAC 2003, 485-494
Proceedings Article
2003[Boros, Endre]
Elbassioni, Khaled M.
[Khachiyan, Leonid]
[Gurvich, Vladimir]
Attachment IconAn Efficient Implementation of a Quasi-polynomial Algorithm for Generating Hypergraph Transversals
In: Algorithms - ESA 2003, 11th Annual European Symposium, 556-567
Proceedings Article
2003[Boros, Endre]
Elbassioni, Khaled M.
[Khachiyan, Leonid]
[Gurvich, Vladimir]
Attachment IconAn Inequality for Polymatroid Functions and its Applications
In: Discrete Applied mathematics [131], 27
Journal Article
2003[Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Khachiyan, Leonid]
[Makino, Kazuhisa]
Attachment IconAn Intersection Inequality for Discrete Distributions and Related Generation Problems
In: Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, 543-555
Proceedings Article
2003[Boros, Endre]
Elbassioni, Khaled M.
[Khachiyan, Leonid]
[Gurvich, Vladimir]
Attachment IconExtending the Balas-Yu Bounds on the Number of Maximal Independent Sets in Graphs to Hypergraphs and Lattices
In: Mathematical Programming, Ser. B [98], 14
Journal Article
2002[Boros, Endre]
Elbassioni, Khaled M.
[Khachiyan, Leonid]
[Gurvich, Vladimir]
[Makino, Kazuhisa]
Attachment IconDual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities
In: SIAM Journal on Computing [31], 20
Journal Article
2002[Boros, Endre]
Elbassioni, Khaled M.
[Khachiyan, Leonid]
[Gurvich, Vladimir]
Attachment IconGenerating Dual-Bounded Hypergraphs
In: Optimization Methods and Software [17], 33
Electronic Journal Article
2002[Boros, Endre]
Elbassioni, Khaled M.
[Khachiyan, Leonid]
[Gurvich, Vladimir]
Attachment IconMatroid Intersections, Polymatroid Inequalities, and Related Problems
In: Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, 143-154
Proceedings Article
2001[Boros, Endre]
Elbassioni, Khaled M.
[Khachiyan, Leonid]
[Gurvich, Vladimir]
[Makino, Kazuhisa]
Attachment IconOn Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities
In: Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, 92-103
Proceedings Article
2000[Boros, Endre]
Elbassioni, Khaled M.
[Khachiyan, Leonid]
[Gurvich, Vladimir]
Attachment IconAn Efficient Incremental Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension
In: Parallel Processing Letters [10], 14
Journal Article
1991[Gurvich, Vladimir]Criteria for repetition-freeness of functions in the algebra of logic
In: Soviet Math. Dokl. [43], 721-726
Journal Article
1977[Gurvich, Vladimir]On repetition-free Boolean functions
In: Uspekhi Mat. Nauk. (Russian Math. Surveys) [32], 183-184
Journal Article
1
Hide details for Gutierrez, Jaime (ed.)Gutierrez, Jaime (ed.)
2004El Kahoui, M'hammedAttachment IconAlgorithms for recognizing coordinates in two variables over UFD's
In: Proceedings of the 2004 International Symposium Symbolic and Algebraic Computation (ISSAC-04), 135-140
Proceedings Article
4
Hide details for Gutwenger, CarstenGutwenger, Carsten
1999Gutwenger, CarstenDesign und Implementierung einer Algorithmen-Bibliothek zum Zeichnen von Graphen
Universität des Saarlandes
Thesis - Masters thesis
1998Mutzel, Petra
Gutwenger, Carsten
Brockenauer, Ralf
Fialko, Sergej
Klau, Gunnar W.
Krüger, Michael
Ziegler, Thomas
[Näher, Stefan]
[Alberts, David]
[Ambras, Dirk]
[Koch, Gunter]
[Jünger, Michael]
[Buchheim, Christoph]
[Leipert, Sebastian]
AGD: A Library of Algorithms for Graph Drawing
In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 456-457
Proceedings Article
1998Gutwenger, Carsten
Mutzel, Petra
Planar Polyline Drawings with Good Angular Resolution
In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 167-182
Proceedings Article
1997[Alberts, David]
Gutwenger, Carsten
Mutzel, Petra
[Näher, Stefan]
AGD-Library: A Library of Algorithms for Graph Drawing
In: Proceedings of the Workshop on Algorithm Engineering (WAE-97), 112-123
Proceedings Article
4
Hide details for Győri, Ervin (ed.)Győri, Ervin (ed.)
2011Panagiotou, Konstantinos
Spöhel, Reto
[Steger, Angelika]
[Thomas, Henning]
Explosive percolation in Erdős-Rényi-like random graph processes
In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 699-704
Electronic Proceedings Article
2011[Gugelmann, Luca]
Spöhel, Reto
On balanced coloring games in random graphs
In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 425-430
Electronic Proceedings Article
2011[Mütze, Torsten]
Spöhel, Reto
On the path-avoidance vertex-coloring game
In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 657-662
Electronic Proceedings Article
2011Doerr, Benjamin
[Fouz, Mahmoud]
Friedrich, Tobias
Social Networks Spread Rumors in Sublogarithmic Time
In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 303-308
In: Electronic Notes in Discrete Mathematics [38], 303-308
Electronic Proceedings Article
5
Hide details for Habib, Michel (ed.)Habib, Michel (ed.)
2004Bast, Holger
Mehlhorn, Kurt
Schäfer, Guido
[Tamaki, Hisao]
Attachment IconMatching Algorithms Are Fast in Sparse Random Graphs
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 81-92
Proceedings Article
2004Kavitha, Telikepalli
Mehlhorn, Kurt
Michail, Dimitrios
[Paluch, Katarzyna]
Attachment IconStrongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents Problem
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 222-233
Proceedings Article
2004Kovács, AnnamáriaSum-Multicoloring on Paths
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 68-80
Proceedings Article
2004Schäfer, Guido
Sivadasan, Naveen
Attachment IconTopology matters: Smoothed competitiveness of metrical task systems
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 489-500
Proceedings Article
2003Fotakis, Dimitris
[Pagh, Rasmus]
Sanders, Peter
[Spirakis, Paul G.]
Attachment IconSpace Efficient Hash Tables with Worst Case Constant Access Time
In: Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2003), 271-282
Proceedings Article
6
Hide details for Hachenberger, PeterHachenberger, Peter
2007Hachenberger, Peter
Kettner, Lutz
Mehlhorn, Kurt
Attachment IconBoolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, Optimized Implementation and Experiments
In: Computational Geometry: Theory and Applications [38], 64-99
Journal Article
2006Hachenberger, PeterBoolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms Optimized Implementation, Experiments and Applications
Universität des Saarlandes
Thesis - PhD thesis
2005Hachenberger, Peter
Kettner, Lutz
Boolean Operations on 3D Selective Nef Complexes: Optimized Implementation and Experiments
In: ACM Symposium on Solid and Physical Modeling (SPM 2005), 163-174
Proceedings Article
2003Granados, Miguel
Hachenberger, Peter
Hert, Susan
Kettner, Lutz
Mehlhorn, Kurt
Seel, Michael
Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and ImplementationReport
2003Granados, Miguel
Hachenberger, Peter
Hert, Susan
Kettner, Lutz
Mehlhorn, Kurt
Seel, Michael
Attachment IconBoolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation
In: Algorithms - ESA 2003: 11th Annual European Symposium, 654-666
Proceedings Article
1999Hachenberger, PeterDynamic shortest Path Algorithms for Planar and Outerplanar Graphs
Universität des Saarlandes
Thesis - Masters thesis
2
Hide details for Hagedoorn, MichielHagedoorn, Michiel
2003Hagedoorn, MichielNearest Neighbors Can Be Found Efficiently If the Dimension Is Small Relative to the Input Size
In: Database Theory - ICDT 2003 : 9th International Conference, 440-454
Proceedings Article
2000Hagedoorn, Michiel
Overmars, Mark H.
Veltkamp, Remco
A New Visibility Partition for Affine Pattern Matching
In: Discrete Geometry for Computer Imagery, Proceedings of the 9th International Conference (DGCI-00), 358-370
Proceedings Article
2
Hide details for Hagen, MatthiasHagen, Matthias
2010Berberich, Eric
[Hagen, Matthias]
[Hiller, Benjamin]
[Moser, Hannes]
Experiments
In: Algorithm Engineering : Bridging the Gap between Algorithm Theory and Practice, 325-388
Part of a Book
2008Elbassioni, Khaled
[Hagen, Matthias]
Rauf, Imran
Some Fixed-Parameter Tractable Classes of Hypergraph Duality and Related Problems
In: Parameterized and Exact Computation, Third International Workshop, IWPEC 2008, 91-102
Proceedings Article
37
Hide details for Hagerup, TorbenHagerup, Torben
2002[Agarwal, Pankaj]
[Hagerup, Torben]
Ray, Rahul
[Sharir, Micha]
[Smid, Michiel]
[Welzl, Emo]
Translating a Planar Object to Maximize Point Containment
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 42-53
Proceedings Article
2000Hagerup, TorbenDynamic algorithms for graphs of bounded treewidth
In: Algorithmica [27], 292-315
Journal Article
2000Hagerup, TorbenParallel preprocessing for path queries without concurrent reading
In: Information and Computation [158], 18-28
Journal Article
2000[Andersson, Arne]
Hagerup, Torben
[Hastad, Johan]
[Petersson, Ola]
Tight bounds for searching a sorted array of strings
In: SIAM Journal on Computing [30], 1552-1578
Journal Article
1998Hagerup, Torben
Sanders, Peter
[Träff, Jesper Larsson]
An Implementation of the Binary Blocking Flow Algorithm
In: Proceedings of the 2nd Workshop on Algorithm Engineering (WAE-98), 143-154
Proceedings Article
1998[Diks, Krzysztof]
Hagerup, Torben
More general parallel tree contraction: Register allocation and broadcasting in a tree
In: Theoretical Computer Science [203], 3-29
Journal Article
1998[Bodlaender, Hans L.]
Hagerup, Torben
Parallel Algorithms with Optimal Speedup for Bounded Treewidth
In: SIAM Journal on Computing [27], 1725-1746
Journal Article
1998Hagerup, TorbenSimpler and Faster Dictionaries on the AC° RAM
In: Proceedings of the 25th International Colloquium on Automata, Languages and Programming (ICALP-98), 79-90
Proceedings Article
1998Hagerup, TorbenSorting and Searching on the Word RAM
In: Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS-98), 366-398
Proceedings Article
1997[Dietzfelbinger, Martin]
Hagerup, Torben
Katajainen, Jyrki
[Penttonen, Martti]
A reliable randomized algorithm for the closest-pair problem
In: Journal of Algorithms [25], 19-51
Journal Article
1997Hagerup, TorbenAllocating Independent Tasks to Parallel Processors: An Experimental Study
In: Journal of Parallel and Distributed Computing [47], 185-197
Journal Article
1997Hagerup, TorbenDynamic algorithms for graphs of bounded treewidth
In: Proceedings of the 24th International Colloquium on Automata, Languages, and Programming (ICALP-97), 292-302
Proceedings Article
1997Hagerup, Torben
[Kutylowski, Miroslaw]
Fast integer merging on the EREW PRAM
In: Algorithmica [17], 55-66
Journal Article
1997Albers, Susanne
Hagerup, Torben
Improved Parallel Integer Sorting without Concurrent Writing
In: Information and Computation [136], 25-51
Journal Article
1996Hagerup, TorbenAllocating Independent Tasks to Parallel Processors: An Experimental Study
In: Parallel Algorithms for Irregularly Structured Problems: 3rd International Workshop (IRREGULAR'96), 1-33
Proceedings Article
1996[Cheriyan, Joseph]
Hagerup, Torben
Mehlhorn, Kurt
An o(n³)-Time Maximum-Flow-Algorithm: Can a Maximum Flow be Computed in o(nm) Time?
In: SIAM Journal on Computing [25], 1144-1170
Journal Article
1996[Diks, Krzysztof]
Hagerup, Torben
More general parallel tree contraction: Register allocation and broadcasting in a tree
In: Graph-theoretic concepts in computer science (WG-96) : 22nd international workshop, Cadenabbia, Italy,Graph-theoretic concepts in computer science (WG-96) : 22nd international workshop, 126-140
Proceedings Article
1995Hagerup, TorbenA Lower Bound for the Emulation of PRAM Memories on Processor Networks
In: Information and Computation [119], 124-128
Journal Article
1995[Cheriyan, Joseph]
Hagerup, Torben
A Randomized Maximum-Flow Algorithm
In: SIAM Journal on Computing [24], 203-226
Journal Article
1995Hagerup, Torben
[Katajainen, Jyrki]
[Nishimura, Naomi]
[Ragde, Prabhakar]
Characterizations of k-Terminal Flow Networks and Computing Network Flows in
Partial k-Trees
In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95), 641-649
Proceedings Article
1995Hagerup, TorbenFast Deterministic Processor Allocation
In: Journal of Algorithms [18], 629-649
Journal Article
1995Hagerup, Torben
[Keller, Jörg]
Fast Parallel Permutation Algorithms
In: Parallel Processing Letters [5], 139-148
Journal Article
1995Bast, Hannah
Hagerup, Torben
Fast Parallel Space Allocation, Estimation, and Integer Sorting
In: Information and Computation [123], 72-110
Journal Article
1995[Dedorath, Jürgen]
Gergov, Jordan
Hagerup, Torben
More Efficient Parallel Flow Algorithms
In: Algorithms and Computation: 6th International Symposium (ISAAC95), 234-243
Proceedings Article
1995[Bodlaender, Hans L.]
Hagerup, Torben
Parallel Algorithms with Optimal Speedup for Bounded Treewidth
In: Automata, Languages, and Programming: 22nd International Colloquium (ICALP95), 268-279
Proceedings Article
1995Chaudhuri, Shiva
Hagerup, Torben
Prefix Graphs and their Applications
In: Graph-theoretic Concepts in Computer Science: 20th International Workshop (WG94), 206-218
Proceedings Article
1995[Berthomé, P.]
[Duboux, T.]
Hagerup, Torben
[Newman, I.]
[Schuster, Assaf]
Self-Simulation for the Passive Optical Star Model
In: Algorithms-ESA'95: 3rd Annual European Symposium, 268-380
Proceedings Article
1995[Andersson, Arne]
Hagerup, Torben
[Nilsson, Stefan]
[Raman, Rajeev]
Sorting in Linear Time?
In: 27th Annual ACM Symposium on Theory of Computing (STOC95), 427-436
Proceedings Article
1995Hagerup, TorbenThe Parallel Complexity of Integer Prefix Summation
In: Information Processing Letters [56], 59-64
Journal Article
1993Hagerup, Torben
Mehlhorn, Kurt
Munro, I.
Attachment IconMaintaining Discrete Probability Distributions Optimally
In: Automata, languages and programming (ICALP-93) : 20th international colloquium, 253-264
Proceedings Article
1992Bast, Holger
[Dietzfelbinger, Martin]
Hagerup, Torben
A Perfect Parallel Dictionary
In: 17th International Symposium on Mathematical Foundations of Computer Science (MFCS'92), 133-141
Proceedings Article
1991Bast, Holger
Hagerup, Torben
Fast and Reliable Parallel Hashing
In: 3rd Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'91), 50-61
Proceedings Article
1990Cheriyan, Joseph
Hagerup, Torben
Mehlhorn, Kurt
Can A Maximum Flow be Computed in o(nm) Time?
In: Automata, languages and programming (ICALP-90) : 17th international colloquium, 235-248
Proceedings Article
1990Cheriyan, Joseph
Hagerup, Torben
Mehlhorn, Kurt
Attachment IconCan a maximum flow be computed in $o(nm)$ time?Report
1987Alt, Helmut
Hagerup, Torben
Mehlhorn, Kurt
Preparata, Franco P.
Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
In: SIAM Journal on Computing [16], 808-835
Journal Article
1986Alt, Helmut
Hagerup, Torben
Mehlhorn, Kurt
Preparata, Franco P.
Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
In: Mathematical Foundations of Computer Science, 12th Symposium (MFCS 1986), 199-208
Proceedings Article
1985Alt, Helmut
Hagerup, Torben
Mehlhorn, Kurt
Preparata, Franco P.
Deterministic simulation of idealized parallel computers on more realistic onesReport
1
Hide details for Hagerup, Torben (ed.)Hagerup, Torben (ed.)
2004[Brodal, Gerth Stølting]
[Fagerberg, Rolf]
Meyer, Ulrich
[Zeh, Norbert]
Cache-oblivious data structures and algorithms for undirected breadth-first search and shortest paths
In: Algorithm theory, SWAT 2004 : 9th Scandinavian Workshop on Algorithm Theory ; Humlebæk, Denmark, July 8-10, 2004 ; proceedings, 480-492
Proceedings Article
1
Hide details for Hagerup,TorbenHagerup,Torben
1987Alt, Helmut
Hagerup,Torben
Mehlhorn, Kurt
Preparata, Franco P.
Attachment IconDeterministic Simulation of Idealized Parallel Computers on more Realistic Ones
In: Parallel Algorithms and Architectures : International Workshop, 11-15
Proceedings Article
1
Hide details for Hager, Greg (ed.)Hager, Greg (ed.)
2002Hert, Susan
[Richards, Brad]
Multiple Robot Motion Planning = Parallel Processing + Geometry
In: Sensor Based Intelligent Robots, 183-205
Proceedings Article
2
Hide details for Haines, Eric (ed.)Haines, Eric (ed.)
2008Berberich, Eric
Sagraloff, Michael
Attachment IconA Generic and Flexible Framework for the Geometrical and Topological Analysis of (Algebraic) Surfaces
In: Proceedings of the 2008 ACM Symposium on Solid and Physical Modeling, 171-182
Proceedings Article
2008Berberich, Eric
Kerber, Michael
Attachment IconExact Arrangements on Tori and Dupin Cyclides
In: Proceedings of the 2008 ACM Symposium on Solid and Physical Modeling, 59-66
Proceedings Article
1
Hide details for Hájek, Petr (ed.)Hájek, Petr (ed.)
1995[Kaufmann, Michael]
Sibeyn, Jop F.
Solving Cheap Graph Problems on Meshes
In: Mathematical Foundations of Computer Science 1995: 20th International Symposium (MFCS95), 412-422
Proceedings Article
1
Hide details for Hajiaghayi, MohammadTaghiHajiaghayi, MohammadTaghi
2010[Hajiaghayi, MohammadTaghi]
[Khandekar, Rohit]
[Kortsarz, Guy]
Mestre, Julian
The Checkpoint Problem
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 13th International Workshop, APPROX 2010 and 14th International Workshop, RANDOM 2010, 219-231
Proceedings Article
2
Hide details for Hales, DavidHales, David
2007Weikum, Gerhard
Bast, Holger
[Canright, Geoffrey]
[Hales, David]
[Schindelhauer, Christian]
[Triantafillou, Peter]
Towards Peer-to-Peer Web Search
In: 1st European Conference on Complex Systems, ECCS'05, ?
Proceedings Article
2005Weikum, Gerhard
Bast, Holger
[Canright, Geoffrey]
[Hales, David]
[Schindelhauer, Christian]
[Triantafillou, Peter]
Towards Self-Organizing Query Routing and Processing for Peer-to-Peer Web Search
In: Workshop on Peer-to-peer Data Management in the Complex Systems Perspective, 7-24
Proceedings Article
5
Hide details for Halldórsson, Magnús M. (ed.)Halldórsson, Magnús M. (ed.)
2015Bei, XiaohuiSolving Linear Programming with Constraints Unknown
In: Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I., 129-142
Proceedings Article
2011[Ailon, Nir]
[Avigdor-Elgrabli, Noa]
[Liberty, Noa]
van Zuylen, Anke
Improved Approximation Algorithms for Bipartite Correlation Clustering
In: Algorithms - ESA 2011 : 19th Annual European Symposium, 25-36
Proceedings Article
2011[Christodoulou, George]
Mehlhorn, Kurt
[Pyrga, Evangelia]
Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms
In: Algorithms - ESA 2011 : 19th Annual European Symposium, 119-130
Proceedings Article
2011[Baruah, Sanjoy]
Bonifaci, Vincenzo
[D'Angelo, Gianlorenzo]
[Marchetti-Spaccamela, Alberto]
[van der Ster, Suzanne]
[Stougie, Leen]
Attachment IconMixed-criticality scheduling of sporadic task systems
In: Algorithms - ESA 2011 : 19th Annual European Symposium, 555-566
Proceedings Article
2008Christodoulou, George
[Kovács, Annamária]
[Schapira, Michael]
Bayesian Combinatorial Auctions
In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I, 820-832
Proceedings Article
2
Hide details for Hall, AlexHall, Alex
2003[Hall, Alex]
[Langkau, Katharina]
Skutella, Martin
An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, 71-82
Proceedings Article
2003[Hall, Alex]
[Hippler, Steffen]
Skutella, Martin
Attachment IconMulticommodity Flows Over Time: Efficient Algorithms and Complexity
In: Automata, languages and programming : 30th International Colloquium, ICALP 2003, 397-409
Proceedings Article
13
Hide details for Halperin, DanHalperin, Dan
2012Berberich, Eric
[Halperin, Dan]
[Kerber, Michael]
[Pogalnikova, Roza]
Deconstructing Approximate Offsets
In: Discrete & Computational Geometry [48], 964-989
Journal Article
2011Berberich, Eric
[Halperin, Dan]
[Kerber, Michael]
[Pogalnikova, Roza]
Deconstructing Approximate Offsets
In: arXiv [abs/1109.2158],
Electronic Journal Article
2011Berberich, Eric
[Halperin, Dan]
[Kerber, Michael]
[Pogalnikova, Roza]
Deconstructing Approximate Offsets
In: Proceedings of the 27th Annual Symposium on Computational Geometry (SCG'11), 187-196
Proceedings Article
2010Berberich, Eric
[Fogel, Efi]
[Halperin, Dan]
[Kerber, Michael]
[Setter, Ophir]
Arrangements on Parametric Surfaces II: Concretizations and Applications
In: Mathematics in Computer Science [4], 67-91
Journal Article
2010Berberich, Eric
[Fogel, Efi]
[Halperin, Dan]
Mehlhorn, Kurt
[Wein, Ron]
Arrangements on Parametric Surfaces I: General Framework and Infrastructure
In: Mathematics in Computer Science [4], 45-66
Journal Article
2010Berberich, Eric
[Halperin, Dan]
[Kerber, Michael]
[Pogalnikova, Roza]
Polygonal Reconstruction from Approximate Offsets
In: 26th European Workshop on Computational Geometry : Workshop Proceedings, 65-68
Electronic Proceedings Article
2007[Fogel, Efi]
[Halperin, Dan]
Kettner, Lutz
[Teillaud, Monique]
[Wein, Ron]
Wolpert, Nicola
Attachment IconArrangements
In: Effective Computational Geometry for Curves and Surfaces, 1-66
Part of a Book
2007Berberich, Eric
[Fogel, Efi]
[Halperin, Dan]
Mehlhorn, Kurt
[Wein, Ron]
Sweeping and Maintaining Two-Dimensional Arrangements on QuadricsReport
2007Berberich, Eric
[Fogel, Efi]
[Halperin, Dan]
[Wein, Ron]
Attachment IconSweeping and Maintaining Two-Dimensional Arrangements on Surfaces
In: Proceedings of 23rd European Workshop on Computational Geometry, 223-226
Proceedings Article
2007Berberich, Eric
[Fogel, Efi]
[Halperin, Dan]
Mehlhorn, Kurt
[Wein, Ron]
Attachment IconSweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step
In: Algorithms - ESA 2007, 15th Annual European Symposium, 645-656
Proceedings Article
2004Berberich, Eric
Eigenwillig, Arno
[Emiris, Ioannis]
[Fogel, Efraim]
[Hemmer, Michael]
[Halperin, Dan]
[Kakargias, Athanasios]
Kettner, Lutz
Mehlhorn, Kurt
[Pion, Sylvain]
[Schömer, Elmar]
[Teillaud, Monique]
[Wein, Ron]
Wolpert, Nicola
Attachment IconAn Empirical Comparison of Software for Constructing Arrangements of Curved ArcsReport
2003Berberich, Eric
Eigenwillig, Arno
[Fogel, Efi]
[Halperin, Dan]
Hert, Susan
Kettner, Lutz
[Teillaud, Monique]
[Wein, Ron]
Specification of the traits classes for CGAL arrangements of curvesReport
2001[Bäsken, Matthias]
[Brönnimann, Hervé]
[Frank, Da]
[Devillers, Olivier]
[Ester, Ezra]
[Fabri, Andreas]
[Flato, Eyal]
[Gärtner, Bernd]
[Giezeman, Geert-Jan]
[Halperin, Dan]
[Hanniel, Iddo]
[Har-Peled, Sariel]
[Herrmann, Thomas]
Hert, Susan
[Hirsch, Shai]
[Hoffmann, Michael]
Kettner, Lutz
[Nechushtan, Oren]
[Neyer, Gabriele]
[Pasechnik, Dmitrii]
[Pion, Sylvain]
Schirra, Stefan
[Schönherr, Sven]
Seel, Michael
[Teillaud, Monique]
[Veltkamp, Remco]
[Wein, Ron]
[Wesselink, Wieger]
[Yvinec, Mariette]
CGAL Reference and User ManualsUnknown Form: eBookForm
1
Hide details for Halperin, Dan (ed.)Halperin, Dan (ed.)
2008Christodoulou, George
[Koutsoupias, Elias]
[Vidali, Angelina]
A Characterization of 2-Player Mechanisms for Scheduling
In: Algorithms - ESA 2008, 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings., 297-307
Proceedings Article
1
Hide details for Haltner, EleonoreHaltner, Eleonore
2000[Neumann, Dirk]
Kohlbacher, Oliver
[Haltner, Eleonore]
Lenhof, Hans-Peter
[Lehr, Claus-Michael]
Modeling the Sugar Lectin Interaction by Computational Chemistry Relevant to Drug Design
In: Proceedings of the 3rd World Meeting on Pharmaceutics, Biopharmaceutics and Pharmaceutical Technology, 233
Proceedings Article
1
Hide details for Haltner, ElleonoreHaltner, Elleonore
1998[Neumann, Dirk]
[Haltner, Elleonore]
[Lehr, Claus-Michael]
Kohlbacher, Oliver
Lenhof, Hans-Peter
Investigating the Sugar-Lectin Interaction by Computational Chemistry: Tunneling the Epithelial Barrier
In: Proceedings of the 18th Interlec Meeting, 549
Proceedings Article
1
Hide details for Hamel,AngeleHamel,Angele
2008Angelopoulos, Spyros
[Lopez-Ortiz, Alejandro]
[Hamel,Angele]
Optimal Scheduling of Contract Algorithms with Soft Deadlines
In: 23rd National Conference on Artificial Intelligence (AAAI 2008), 868-873
Proceedings Article
1
Hide details for Hammad, AbdelrahmanHammad, Abdelrahman
2008Elmasry, Amr
[Hammad, Abdelrahman]
Attachment IconInversion-Sensitive Sorting Algorithms in Practice
In: ACM Journal of Experimental Algorithmics [13], 1-18
Journal Article
1
Hide details for Hammerschmidt, FrankHammerschmidt, Frank
1999Hammerschmidt, FrankKonzeption und Entwicklung des streng strukturierten und erweiterbaren Datentyps html_page für LEDA
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Hanniel, IddoHanniel, Iddo
2001[Bäsken, Matthias]
[Brönnimann, Hervé]
[Frank, Da]
[Devillers, Olivier]
[Ester, Ezra]
[Fabri, Andreas]
[Flato, Eyal]
[Gärtner, Bernd]
[Giezeman, Geert-Jan]
[Halperin, Dan]
[Hanniel, Iddo]
[Har-Peled, Sariel]
[Herrmann, Thomas]
Hert, Susan
[Hirsch, Shai]
[Hoffmann, Michael]
Kettner, Lutz
[Nechushtan, Oren]
[Neyer, Gabriele]
[Pasechnik, Dmitrii]
[Pion, Sylvain]
Schirra, Stefan
[Schönherr, Sven]
Seel, Michael
[Teillaud, Monique]
[Veltkamp, Remco]
[Wein, Ron]
[Wesselink, Wieger]
[Yvinec, Mariette]
CGAL Reference and User ManualsUnknown Form: eBookForm
1
Hide details for Hansen, Nikolaus (ed.)Hansen, Nikolaus (ed.)
2008GECCO 2008: Proceedings of the 10th Annual Conference on Genetic and Evolutionary ComputationProceedings
1
Hide details for Han, XiaofengHan, Xiaofeng
1995[Han, Xiaofeng]
Kelsen, Pierre
[Ramachandran, Vijaya]
[Tarjan, Robert E.]
Computing minimal spanning subgraphs in linear time
In: SIAM Journal on Computing [24], 1332-1358
Journal Article
1
Hide details for Han, XinHan, Xin
2010[Han, Xin]
[Lam, Tak-Wah]
Lee, Lap-Kei
[To, Isaac K. K.]
[Wong, Prudence W. H.]
Deadline scheduling and power management for speed bounded processors
In: Theoretical Computer Science [411], 3587-3600
Journal Article
1
Hide details for Hao, Jin-Kao (ed.)Hao, Jin-Kao (ed.)
2012Doerr, Benjamin
Winzen, Carola
Black-box complexity: Breaking the O(n logn) barrier of LeadingOnes
In: Artificial Evolution 10th International Conference Evolution Artificielle, EA 2011, 205-216
Proceedings Article
1
Hide details for Hao, Kin-Kao (ed.)Hao, Kin-Kao (ed.)
2009[Bringmann, Karl]
[Friedrich, Tobias]
Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
In: Evolutionary Multi-Criterion Optimization : 5th International Conference, EMO 2009, 6-20
Proceedings Article
7
Hide details for Happ, EddaHapp, Edda
2012Doerr, Benjamin
Happ, Edda
Klein, Christian
Crossover can provably be useful in evolutionary computation
In: Theoretical Computer Science [425], 17-33
Journal Article
2011Doerr, Benjamin
Happ, Edda
Klein, Christian
Tight Analysis of the (1+1)-EA for the Single Source Shortest Path Problem
In: Evolutionary Computation [19], 673-691
Journal Article
2009Happ, EddaAnalyses of Evolutionary Algorithms
Universität des Saarlandes
Thesis - PhD thesis
2008Doerr, Benjamin
Happ, Edda
Klein, Christian
Crossover Can Provably be Useful in Evolutionary Computation
In: Genetic and Evolutionary Computation Conference 2008, 539-546
Proceedings Article
2008Doerr, Benjamin
Happ, Edda
Directed trees: A Powerful Representation for Sorting and Ordering Problems
In: Proceedings of CEC 2008, 3606-3613
Proceedings Article
2008Happ, Edda
Johannsen, Daniel
Klein, Christian
Neumann, Frank
Attachment IconRigorous Analyses of Fitness-Proportional Selection for Optimizing Linear Functions
In: Genetic and Evolutionary Computation Conference 2008, 953-960
Proceedings Article
2007Doerr, Benjamin
Happ, Edda
Klein, Christian
A Tight Bound for the (1+1)-EA on the Single Source Shortest Path Problem
In: IEEE Congress on Evolutionary Computation 2007, 1890-1895
Proceedings Article
2
Hide details for Har-Peled, SarielHar-Peled, Sariel
2005Althaus, Ernst
Funke, Stefan
[Har-Peled, Sariel]
[Könemann, Jochen]
[Ramos, Edgar A.]
Skutella, Martin
Approximating k-Hop Minimum-Spanning Trees
In: Operations Research Letters [33], 115-120
Journal Article
2001[Bäsken, Matthias]
[Brönnimann, Hervé]
[Frank, Da]
[Devillers, Olivier]
[Ester, Ezra]
[Fabri, Andreas]
[Flato, Eyal]
[Gärtner, Bernd]
[Giezeman, Geert-Jan]
[Halperin, Dan]
[Hanniel, Iddo]
[Har-Peled, Sariel]
[Herrmann, Thomas]
Hert, Susan
[Hirsch, Shai]
[Hoffmann, Michael]
Kettner, Lutz
[Nechushtan, Oren]
[Neyer, Gabriele]
[Pasechnik, Dmitrii]
[Pion, Sylvain]
Schirra, Stefan
[Schönherr, Sven]
Seel, Michael
[Teillaud, Monique]
[Veltkamp, Remco]
[Wein, Ron]
[Wesselink, Wieger]
[Yvinec, Mariette]
CGAL Reference and User ManualsUnknown Form: eBookForm
9
Hide details for Hariharan, RameshHariharan, Ramesh
2006[Hariharan, Ramesh]
[Telikepalli, Kavitha]
Mehlhorn, Kurt
Attachment IconA Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs
In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Part I, 250-261
Proceedings Article
2000[Cole, Richard]
[Farach-Colton, Martin]
Hariharan, Ramesh
[Przytycka, Teresa]
[Thorup, Mikkel]
An O(n log n) algorithm for the maximum agreement subtree problem for binary trees
In: SIAM Journal on Computing [30], 1385-1404
Journal Article
1998[Crochemore, Maxime]
Gasieniec, Leszek
[Hariharan, Ramesh]
[Muthukrishnan, S.]
[Rytter, Wojciech]
A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching
In: SIAM Journal on Computing [27], 668-681
Journal Article
1996[Cole, Richard]
Hariharan, Ramesh
An O(n log n) algorithm for the maximum agreement subtree problem for binary trees
In: 7th ACM-SIAM Symposium on Discrete Algorithms (SODA96), 323-332
Proceedings Article
1996Hariharan, Ramesh
Kelsen, Pierre
Mahajan, Sanjeev
Coloring 2-colorable hypergraphs with a sublinear number of colors
In: Scandinavian Workshop on Algorithm Theory (SWAT96), 41-52
Proceedings Article
1995Hariharan, Ramesh
[Kapoor, Sanjiv]
Algorithms for Enumerating all Spanning Trees of an Undirected Graph
In: SIAM Journal on Computing [24], 247-265
Journal Article
1995Hariharan, Ramesh
Mahajan, Sanjeev
Derandomizing semidefinite programming based approximation algorithms
In: 36th IEEE Symposium on Foundations of Computer Science, 162-16
Proceedings Article
1995Hariharan, Ramesh
[Muthukrishnan, S.]
String Matching over a General Matching Relation
In: Information and Computation [122], 140-148
Journal Article
1995[Cole, Richard]
Hariharan, Ramesh
[Paterson, Mike]
[Zwick, Uri]
Tighter Lower Bounds on the Exact Complexity of String Matching
In: SIAM Journal on Computing [24], 30-45
Journal Article
1
Hide details for Hariharan, R.Hariharan, R.
2008Mehlhorn, Kurt
[Kavitha, T.]
[Hariharan, R.]
Attachment IconFaster Deterministic and Randomized Algorithms for Minimum Cycle Basis in Directed Graphs
In: SIAM Journal of Computing [38], 1430-1447
Journal Article
2
Hide details for Harks, TobiasHarks, Tobias
2013[Harks, Tobias]
Hoefer, Martin
[Klimm, Max]
[Skopalik, Alexander]
Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games
In: Mathematical Programming [141], 193-215
Journal Article
2010Bonifaci, Vincenzo
[Harks, Tobias]
[Schäfer, Guido]
Attachment IconStackelberg Routing in Arbitrary Networks
In: Mathematics of Operations Research [35], 330 - 346
Journal Article
12
Hide details for Harren, RolfHarren, Rolf
2012Harren, Rolf
van Stee, Rob
Absolute Approximation Ratios for Packing Rectangles into Bins
In: Journal of Scheduling [15], 63-75
Journal Article
2012Harren, Rolf
[Kern, Walter]
Improved Lower Bound for Online Strip Packing
In: Approximation and Online Algorithms : 9th International Workshop ,WAOA 2011, 211-218
Proceedings Article
2011Harren, Rolf
[Jansen, Klaus]
[Prädel, Lars]
van Stee, Rob
Attachment IconA (5/3 + ε)-Approximation for Strip Packing
In: Algorithms and Data Structures : 12th International Symposium, WADS 2011, 475-487
Proceedings Article
2010Harren, RolfTwo-dimensional packing problems
Universität des Saarlandes
Thesis - PhD thesis
2009Harren, RolfAttachment IconApproximation Algorithms for Orthogonal Packing Problems for Hypercubes
In: Theoretical Computer Science [410], 4504-4532
Journal Article
2009Harren, Rolf
van Stee, Rob
Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 12th International Workshop, APPROX 2009 and 13th International Workshop, RANDOM 2009, 177-189
Proceedings Article
2008[Diedrich, Florian]
Harren, Rolf
[Jansen, Klaus]
[Thöle, Ralf]
[Thomas, Henning]
Attachment IconApproximation Algorithms for 3D Orthogonal Knapsack
In: Journal of Science and Technology [23], 749-762
Journal Article
2008Harren, Rolf
van Stee, Rob
Attachment IconPacking Rectangles into 2 OPT Bins using Rotations
In: 11th Scandinavian Workshop on Algorithm Theory, 306-318
Proceedings Article
2007[Diedrich, Florian]
Harren, Rolf
[Jansen, Klaus]
[Thöle, Ralf]
[Thomas, Henning]
Attachment IconApproximation Algorithms for 3D Orthogonal Knapsack
In: Theory and Applications of Models of Computation, 34-45
Proceedings Article
2007Harren, RolfMehrdimensionale Packungsprobleme - Approximation geometrischer Verallgemeinerungen klassischer PackungsproblemeBook
2006Harren, RolfAttachment IconApproximating the Orthogonal Knapsack Problem for Hypercubes
In: Automata, Languages and Programming, 238-249
Proceedings Article
2006Harren, RolfApproximation mehrdimensionaler Packungsprobleme
Universität Dortmund
Thesis - other
1
Hide details for Hartman, TzvikaHartman, Tzvika
2011[Fellows, Michael R.]
[Hartman, Tzvika]
Hermelin, Danny
[Landau, Gad M.]
[Rosamond, Frances A.]
[Rozenberg, Liat]
Haplotype Inference Constrained by Plausible Haplotype Data
In: IEEE/ACM Transactions on Computational Biology and Bioinformatics [8], 1692-1699
Journal Article
1
Hide details for Hastad, JohanHastad, Johan
2000[Andersson, Arne]
Hagerup, Torben
[Hastad, Johan]
[Petersson, Ola]
Tight bounds for searching a sorted array of strings
In: SIAM Journal on Computing [30], 1552-1578
Journal Article
1
Hide details for Hawking, David (ed.)Hawking, David (ed.)
2006Bast, Holger
Weber, Ingmar
Attachment IconType Less, Find More: Fast Autocompletion Search with a Succinct Index
In: SIGIR 2006: Proceedings of the 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 364-371
Proceedings Article
1
Hide details for Hazboun, JackHazboun, Jack
1999Hazboun, JackMolekül-Docking-Reaktionen
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Ha, Phuong H.Ha, Phuong H.
2009[Larsson, Andreas]
Gidenstam, Anders
[Ha, Phuong H.]
[Papatriantafilou, Marina]
[Tsigas, Philippas]
Multiword Atomic Read/Write Registers on Multiprocessor Systems
In: Journal of experimental algorithmics [13], 7:1-7:30
Electronic Journal Article
1
Hide details for Healy, Patrick (ed.)Healy, Patrick (ed.)
2005Mehlhorn, KurtMinimum Cycle Bases and Surface Reconstruction
In: Graph Drawing: 13th International Symposium, GD 2005, ,, 532-532
Proceedings Article
20
Hide details for Hebbinghaus, NilsHebbinghaus, Nils
2011Friedrich, Tobias
Hebbinghaus, Nils
Average update times for fully-dynamic all-pairs shortest paths
In: Discrete Applied Mathematics [159], 1751-1758
Journal Article
2010Friedrich, Tobias
[He, Jun]
Hebbinghaus, Nils
Neumann, Frank
[Witt, Carsten]
Approximating Covering Problems by Randomized Search Heuristics using Multi-Objective Models
In: Evolutionary Computation [18], 617 - 633
Journal Article
2009Friedrich, Tobias
[He, Jun]
Hebbinghaus, Nils
Neumann, Frank
[Witt, Carsten]
Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem
In: Evolutionary Computation, [17], 3-19
Journal Article
2009Friedrich, Tobias
Hebbinghaus, Nils
Neumann, Frank
Comparison of Simple Diversity Mechanisms on Plateau Functions
In: Theoretical Computer Science [410], 2455-2462
Journal Article
2009Cilleruelo, Javier
Hebbinghaus, Nils
Discrepancy in generalized arithmetic progressions
In: European Journal of Combinatorics [30], 1607-1611
Journal Article
2009[Brockhoff, Dimo]
[Friedrich, Tobias]
Hebbinghaus, Nils
Klein, Christian
Neumann, Frank
[Zitzler, Eckart]
On the Effects of Adding Objectives to Plateau Functions
In: IEEE Transactions on Evolutionary Computation [13], 591-603
Journal Article
2008Friedrich, Tobias
Hebbinghaus, Nils
Average Update Times for Fully-Dynamic All-Pairs Shortest Paths.
In: Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC 2008), 693-704
Proceedings Article
2007Doerr, Benjamin
[Gnewuch, Michael]
Hebbinghaus, Nils
Neumann, Frank
A Rigorous View On Neutrality
In: IEEE Congress on Evolutionary Computation 2007, 2591-2597
Proceedings Article
2007Friedrich, Tobias
[He, Jun]
Hebbinghaus, Nils
Neumann, Frank
[Witt, Carsten]
Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models
In: Genetic and Evolutionary Computation Conference 2007, 797-804
Proceedings Article
2007Hebbinghaus, NilsAttachment IconDiscrepancy of Sums of two Arithmetic ProgressionsReport
2007[Brockhoff, Dimo]
Friedrich, Tobias
Hebbinghaus, Nils
Klein, Christian
Neumann, Frank
[Zitzler, Eckart]
Do Additional Objectives Make a Problem Harder?
In: Genetic and Evolutionary Computation Conference 2007, 765-772
Proceedings Article
2007Friedrich, Tobias
[He, Jun]
Hebbinghaus, Nils
Neumann, Frank
[Witt, Carsten]
On Improving Approximate Solutions by Evolutionary Algorithms
In: IEEE Congress on Evolutionary Computation 2007, 2614-2621
Proceedings Article
2007Friedrich, Tobias
Hebbinghaus, Nils
Neumann, Frank
Plateaus Can Be Harder in Multi-Objective Optimization
In: IEEE Congress on Evolutionary Computation 2007, 2622-2629
Proceedings Article
2007Friedrich, Tobias
Hebbinghaus, Nils
Neumann, Frank
Rigorous Analyses of Simple Diversity Mechanisms
In: Genetic and Evolutionary Computation Conference 2007, 1219-1225
Proceedings Article
2007Doerr, Benjamin
Hebbinghaus, Nils
Neumann, Frank
Speeding up Evolutionary Algorithms Through Asymmetric Mutation Operators
In: Evolutionary Computation [15], 401-410
Journal Article
2006Doerr, Benjamin
[Gnewuch, Michael]
Hebbinghaus, Nils
Attachment IconDiscrepancy of Symmetric Products of Hypergraphs
In: The Electronic Journal of Combinatorics [13], 1-12
Electronic Journal Article
2006Doerr, Benjamin
Hebbinghaus, Nils
[Werth, Sören]
Attachment IconImproved Bounds and Schemes for the Declustering Problem
In: Theoretical Computer Science [359], 123-132
Journal Article
2006Doerr, Benjamin
Hebbinghaus, Nils
Neumann, Frank
Attachment IconSpeeding Up Evolutionary Algorithms Through Restricted Mutation Operators
In: Parallel Problem Solving from Nature - PPSN IX, 9th International Conference, 978-987
Proceedings Article
2006[Bundy, David]
Hebbinghaus, Nils
[Stellmacher, Bernd]
Attachment IconThe Local C(G,T) Theorem
In: Journal of Algebra [300], 741-789
Journal Article
2005Doerr, Benjamin
Hebbinghaus, Nils
Discrepancy of Products of Hypergraphs
In: 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 323-328
Proceedings Article
1
Hide details for Hebbinhaus, NilsHebbinhaus, Nils
2010Friedrich, Tobias
Hebbinhaus, Nils
Neumann, Frank
Plateaus Can Be Harder in Multi-Objective Optimization
In: Theoretical Computer Science [411], 854-864
Journal Article
1
Hide details for Heinrich, Stefan (ed.)Heinrich, Stefan (ed.)
2008Doerr, Benjamin
[Gnewuch, Michael]
Construction of Low-Discrepancy Point Sets of Small Size by Bracketing Covers and Dependent Randomized Rounding
In: Monte Carlo and Quasi-Monte Carlo Methods 2006, 299-312
Proceedings Article
1
Hide details for Heinz, JeffreyHeinz, Jeffrey
2012[Heinz, Jeffrey]
[Kasprzik, Anna]
Kötzing, Timo
Learning in the limit with lattice-structured hypothesis spaces
In: Theoretical Computer Science [457], 111 - 127
Journal Article
2
Hide details for Hein, Jotun (ed.)Hein, Jotun (ed.)
1997[Das, Gautam]
Fleischer, Rudolf
Gasieniec, Leszek
Gunopulos, Dimitrios
Kärkkäinen, Juha
Episode matching
In: Combinatorial pattern matching : 8th annual symposium (CPM-97), 12-27
Proceedings Article
1997Gasieniec, Leszek
Indyk, Piotr
Krysta, Piotr
External inverse pattern matching
In: Proceedings of the 8th Symposium on Combinatorial Pattern Matching (CPM-97), 90-101
Proceedings Article
1
Hide details for Hélary, Jean-Michel (ed.)Hélary, Jean-Michel (ed.)
1995[Hoepman, Jaap-Henk]
Papatriantafilou, Marina
Tsigas, Philippas
Self-Stabilization in Wait-Free Shared Memory Objects
In: Distributed Algorithms: 9th International Workshop (WDAG95), 273-287
Proceedings Article
1
Hide details for Hellwagner, Hermann (ed.)Hellwagner, Hermann (ed.)
2003[Agarwal, Amit]
[Agarwal, Tarun]
[Chopra, Sumit]
[Feldmann, Anja]
[Kammenhuber, Nils]
Krysta, Piotr
[Vöcking, Berthold]
An experimental study of k-splittable scheduling for DNS-based traffic allocation
In: Euro-Par 2003 parallel processing : 9th International Euro-Par Conference ; proceedings, 230-235
Proceedings Article
1
Hide details for Helwig, SabineHelwig, Sabine
2009[Helwig, Sabine]
Neumann, Frank
[Wanka, Rolf]
Particle Swarm Optimization with Velocity Adaptation
In: 2009 International Conference on Adaptive and Intelligent Systems ICAIS 2009 : proceedings, 146-151
Proceedings Article
37
Hide details for Hemmer, MichaelHemmer, Michael
2011Hemmer, Michael
[Dupon, Laurent]
[Petitjean, Sylvain]
[Schomer, Elmar]
A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics
In: Journal of Symbolic Computation [46], 467-494
Journal Article
2011Berberich, Eric
[Hemmer, Michael]
[Kerber, Michael]
A Generic Algebraic Kernel for Non-linear Geometric Applications
In: Proceedings of the 27th Annual Symposium on Computational Geometry (SCG'11), 179-186
Proceedings Article
2010Berberich, Eric
[Hemmer, Michael]
[Kerber, Michael]
A Generic Algebraic Kernel for Non-linear Geometric ApplicationsReport
2009Sagraloff, Michael
Kerber, Michael
Hemmer, Michael
Certified Complex Root Isolation via Adaptive Root Separation Bounds
In: The Joint Conference of ASCM 2009 and MACIS 2009, 151-166
Proceedings Article
2009Hemmer, Michael
Limbach, Sebastian
[Schömer, Elmar]
Attachment IconContinued Work on the Computation of an Exact Arrangement of Quadrics
In: EuroCG'09 : 25th European Workshop on Computational Geometry, 313-316
Proceedings Article
2009Hemmer, Michael
[Tsigaridas, Elias P.]
[Zafeirakopoulos, Zafeirakis]
[Emiris, Ioannis Z.]
[Karavelas, Menelaos I.]
[Mourrain, Bernard]
Experimental evaluation and cross-benchmarking of univariate real solvers
In: Symbolic Numeric Computation 2009 (SNC 2009), 45-54
Proceedings Article
2009Hemmer, Michael
[Hülse, Dominik]
Attachment IconGeneric implementation of a modular GCD over Algebraic Extension Fields
In: EuroCG'09 : 25th European Workshop on Computational Geometry, 321-324
Proceedings Article
2009Hemmer, MichaelModular Arithmetic, CGAL - Computational Geometry Algorithms Library, release 3.4Manual
2009Hemmer, MichaelPolynomials, CGAL - Computational Geometry Algorithms Library, release 3.4Manual
2008Hemmer, Michael
[Limbach, Sebastian]
Arrangements of quadrics in 3D: continued work on experimental implementationReport
2008Hemmer, MichaelCGAL package for modular arithmetic operationsReport
2008Hemmer, MichaelCGAL package: Algebraic FoundationsReport
2008Hemmer, Michael
[Dupont, Laurent]
[Petitjean, Sylvain]
[Schömer, Elmar]
Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangment of QuadricsReport
2008[Emiris,Ioannis]
Hemmer, Michael
[Karavelas, Menelaos]
[Limbach, Sebastian]
[Mourrain, Bernard]
[Tsigaridas, Elias]
[Zafeirakopoulos,Zafeirakis]
Cross-benchmarks of univariate algebraic kernelsReport
2008Hemmer, MichaelEvaluation of different approaches in 3D curved kernel for arrangements of quadricsReport
2008Hemmer, MichaelAttachment IconExact Computation of the Adjacency Graph of an Arrangement of Quadrics
Johannes Gutenberg-Universität Mainz
Thesis - PhD thesis
2008[Emiris, Ioannis Z.]
Hemmer, Michael
[Karavelas, Menelaos]
[Mourrain, Bernard]
[Tsigaridas, Elias P.]
[Zafeirakopoulos, Zafeirakis]
Attachment IconExperimental evaluation and cross-benchmarking of univariate real solversReport
2008Berberich, Eric
Hemmer, Michael
[Karavelas, Menelaos]
[Pion, Sylvain]
[Teillaud, Monique]
[Tsigaridas, Elias]
Prototype implementation of the algebraic kernelReport
2008[Emiris, Ioannis]
Hemmer, Michael
[Tsigaridas, Elias]
[Tzoumas, Georg]
Voronoi diagram of ellipses: CGAL-based implementationReport
2007Hemmer, MichaelAlgebraic Foundations, CGAL - Computational Geometry Algorithms Library, release 3.3Manual
2007Hemmer, Michael
[Limbach, Sebastian]
Benchmarks on a generic univariate algebraic kernelReport
2007[Dupont, Laurent]
Hemmer, Michael
[Petitjean, Sylvain]
[Schömer, Elmar]
Attachment IconComplete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics
In: 15th Annual European Symposium on Algorithms, 633-644
Proceedings Article
2007Berberich, Eric
[Hemmer, Michael]
Definition of the 3D Quadrical Kernel ContentReport
2007Hemmer, Michael
[Hert, Susan]
[Kettner, Lutz]
[Pion, Sylvain]
[Schirra, Stefan]
Number Types, CGAL - Computational Geometry Algorithms Library, release 3.3Manual
2007Berberich, Eric
Hemmer, Michael
[Karavelas, Menelaos I.]
[Teillaud, Monique]
Revision of interface specification of algebraic kernelReport
2007Hemmer, Michael
[Hülse, Dominik]
Traits classes for polynomial gcd computation over algebraic extensionsReport
2006Berberich, Eric
Hemmer, Michael
[Karavelas, Menelaos]
[Pion, Sylvain]
[Teillaud, Monique]
[Tsigaridas, Elias]
Interface specification of algebraic kernelReport
2006Berberich, Eric
Hemmer, Michael
Prototype implementation of the algebraic kernelReport
2005Berberich, Eric
[Hemmer, Michael]
Kettner, Lutz
[Schömer, Elmar]
Wolpert, Nicola
An Exact, Complete and Efficient Implementation for Computing Planar Maps of Quadric Intersection Curves
In: 21st Annual Symposium on Computational Geometry (SCG'05), 99-106
Proceedings Article
2005Berberich, Eric
Eigenwillig, Arno
[Hemmer, Michael]
[Hert, Susan]
Kettner, Lutz
Mehlhorn, Kurt
Reichel, Joachim
Schmitt, Susanne
[Schömer, Elmar]
Wolpert, Nicola
Attachment IconEXACUS: Efficient and exact algorithms for curves and surfaces
In: 13th Annual European Symposium on Algorithms (ESA 2005), 155-166
Proceedings Article
2004Berberich, Eric
Eigenwillig, Arno
[Emiris, Ioannis]
[Fogel, Efraim]
[Hemmer, Michael]
[Halperin, Dan]
[Kakargias, Athanasios]
Kettner, Lutz
Mehlhorn, Kurt
[Pion, Sylvain]
[Schömer, Elmar]
[Teillaud, Monique]
[Wein, Ron]
Wolpert, Nicola
Attachment IconAn Empirical Comparison of Software for Constructing Arrangements of Curved ArcsReport
2004[Hemmer, Michael]
Kettner, Lutz
[Schömer, Elmar]
Effects of a Modular Filter on Geometric ApplicationsReport
2004Berberich, Eric
Eigenwillig, Arno
[Hemmer, Michael]
[Hert, Susan]
Kettner, Lutz
Mehlhorn, Kurt
Reichel, Joachim
Schmitt, Susanne
[Schömer, Elmar]
Weber, Dennis
Wolpert, Nicola
EXACUS: Efficient and Exact Algorithms for Curves and SurfacesReport
2002Berberich, Eric
Eigenwillig, Arno
Hemmer, Michael
Hert, Susan
Mehlhorn, Kurt
Schömer, Elmar
Attachment IconA Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 174-186
Proceedings Article
2002Hemmer, MichaelReliable computation of planar and spatial arrangements of quadrics
Universität des Saarlandes
Thesis - Masters thesis
2001Geismann, Nicola
Hemmer, Michael
Schömer, Elmar
Computing a 3-dimensional Cell in an Arrangement of Quadrics: Exactly and Actually!
In: Proceedings of the 17th Annual Symposium on Computational Geometry (SCG-01), 264-273
Proceedings Article
2001Geismann, Nicola
Hemmer, Michael
Schömer, Elmar
The Convex Hull of Ellipsoids (Video)
In: Proceedings of the 17th Annual Symposium on Computational Geometry (SCG-01), 321-322
Proceedings Article
3
Hide details for Hennessy, Matthew (ed.)Hennessy, Matthew (ed.)
2002Beier, Rene
Sanders, Peter
Sivadasan, Naveen
Energy Optimal Routing in Radio Networks Using Geometric Data Structures
In: Automata, Languages and Programming : 29th International Colloquium, ICALP 2002, 366-376
Proceedings Article
2002[Adler, Micah]
[Räcke, Harald]
Sivadasan, Naveen
[Sohler, Christian]
Vöcking, Berthold
Randomized Pursuit-Evasion in Graphs
In: Automata, Languages and Programming : 29th International Colloquium, ICALP 2002, 901-912
Proceedings Article
2002Fotakis, Dimitris
Kontogiannis, Spyros
[Koutsoupias, Elias]
[Mavronicolas, Marios]
[Spirakis, Paul G.]
Attachment IconThe Structure and Complexity of Nash Equilibria for a Selfish Routing Game
In: Automata, Languages and Programming : 29th International Colloquium, ICALP 2002, 123-134
Proceedings Article
1
Hide details for Henson, Van EmdenHenson, Van Emden
2011De Sterck, Hans
[Henson, Van Emden]
[Sanders, Geoff]
Multilevel Aggregation Methods for Small-World Graphs with Application to Random-Walk RankingUnpublished/Draft
2
Hide details for Henzinger, Monika R.Henzinger, Monika R.
2003[Henzinger, Monika R.]
Leonardi, Stefano
Scheduling multicasts on unit-capacity trees and meshes
In: Journal of Computer and System Sciences [66], 567-611
Journal Article
1997Albers, Susanne
[Henzinger, Monika R.]
Exploring Unknown Environments
In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC-97), 416-425
Proceedings Article
7
Hide details for Henzinger, Monika (ed.)Henzinger, Monika (ed.)
2011Doerr, Benjamin
[Fouz, Mahmoud]
Asymptotically Optimal Randomized Rumor Spreading
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 502-513
Proceedings Article
2011Hermelin, Danny
[Levy, Avivit]
[Weimann, Oren]
[Yuster, Raphael]
Distance Oracles for Vertex-Labeled Graphs
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 490-501
Proceedings Article
2011Hermelin, Danny
[Mnich, Matthias]
[van Leeuwen, Erik Jan]
[Woeginger, Gerhard J.]
Domination When the Stars Are Out
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 462-473
Proceedings Article
2011[Anand, S.]
[Garg, Naveen]
Megow, Nicole
Meeting deadlines: How much speed suffices?
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011. - Pt. I, 232-243
Proceedings Article
2011[Canzar,Stefan]
Elbassioni, Khaled
[Klau, Gunnar W.]
[Mestre, Julian]
On Tree-Constrained Matchings and Generalizations
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 98-109
Proceedings Article
2011Megow, Nicole
Mehlhorn, Kurt
Schweitzer, Pascal
Online Graph Exploration: New Results on Old and New Algorithms
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 478-489
Proceedings Article
2011[Boros, Endre]
Elbassioni, Khaled
[Fouz, Mahmoud]
[Gurvich, Vladimir]
[Makino, Kazuhisa]
[Manthey, Bodo]
Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 147-158
Proceedings Article
1
Hide details for Henz, MartinHenz, Martin
2004[Henz, Martin]
[Müller, Tobias]
Thiel, Sven
Global constraints for round robin tournament scheduling
In: European Journal of Operational Research [153], 92-101
Journal Article
1
Hide details for Herman, Gabor T. (ed.)Herman, Gabor T. (ed.)
2002Ray, Rahul
[Smid, MIchiel]
[Lange, Katharina]
[Wendt, Ulrich]
Attachment IconComputing Large Planar Regions in Terrains
In: IWCIA 2001, 8th International Workshop on Combinatorial Image Analysis (IWCIA-01), 139-152
Proceedings Article
19
Hide details for Hermelin, DannyHermelin, Danny
2012Hermelin, Danny
[Rizzi, Romeo]
[Vialette, Stephane]
Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph
In: Algorithms and Computation : 23rd International Symposium, ISAAC 2012, 465-474
Proceedings Article
2012Hermelin, Danny
[Mestre, Julian]
[Rawitz, Dror]
Optimization Problems in Dotted Interval Graphs
In: Graph-Theoretic Concepts in Computer Science : 38th InternationalWorkshop, WG 2012, 46-56
Proceedings Article
2012Hermelin, Danny
[Mnich, Matthias]
[van Leeuwen, Erik Jan]
Parameterized complexity of induced H-matching on claw-free graphs
In: Algorithms - ESA 2012 : 20th Annual European Symposium, 624-635
Proceedings Article
2012Hermelin, Danny
[Wu, Xi]
Weak compositions and their applications to polynomial lower bounds for kernelization
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 104-113
Proceedings Article
2012[Fellows, Michael R.]
Hermelin, Danny
[Rosamond, Fraces A.]
Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications
In: Algorithmica [64], 3-18
Journal Article
2011Fountoulakis, Nikolaos
Friedrich, Tobias
Hermelin, Danny
Average Case Parameterized ComplexityUnpublished/Draft
2011[Fellows, Michael R.]
Friedrich, Tobias
Hermelin, Danny
[Narodytska, Nina]
[Rosamond, Frances A.]
Constraint Satisfaction Problems: Convexity Makes All Different Constraints Tractable
In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI 2011), 522-527
Proceedings Article
2011Hermelin, Danny
[Levy, Avivit]
[Weimann, Oren]
[Yuster, Raphael]
Distance Oracles for Vertex-Labeled Graphs
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 490-501
Proceedings Article
2011Hermelin, Danny
[Mnich, Matthias]
[van Leeuwen, Erik Jan]
[Woeginger, Gerhard J.]
Domination When the Stars Are Out
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 462-473
Proceedings Article
2011[Fellows, Michael R.]
[Hartman, Tzvika]
Hermelin, Danny
[Landau, Gad M.]
[Rosamond, Frances A.]
[Rozenberg, Liat]
Haplotype Inference Constrained by Plausible Haplotype Data
In: IEEE/ACM Transactions on Computational Biology and Bioinformatics [8], 1692-1699
Journal Article
2011[Bar-Yehuda, Reuven]
Hermelin, Danny
[Rawitz, Dror]
Minimum vertex cover in rectangle graphs
In: Computational Geometry [44], 356-364
Journal Article
2011Hermelin, Danny
[Rawitz, Dror]
Optimization problems in multiple subtree graphs
In: Discrete Applied Mathematics [159], 588-594
Journal Article
2011Hermelin, Danny
[Huang, Chien-Chung]
[Kratsch, Stefan]
Wahlström, Magnus
Parameterized Two-Player Nash Equilibrium
In: Graph-Theoretic Concepts in Computer Science : 37th International Workshop, WG 2011, 215-226
Proceedings Article
2011[Ben-Zwi, Oren]
Hermelin, Danny
[Lokshtanov, Daniel]
[Newman, Ilan]
Treewidth governs the complexity of target set selection
In: Discrete Optimization [8], 87-96
Journal Article
2011[Fellows, Michael R.]
[Fertin, Guillaume]
Hermelin, Danny
[Vialette, Stephane]
Upper and lower bounds for finding connected motifs in vertex-colored graphs
In: Journal of Computer and System Sciences [77], 799-811
Journal Article
2010[Bar-Yehuda, Reuven]
Hermelin, Danny
[Rawitz, Dror]
Minimum Vertex Cover in Rectangle Graphs
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. I, 255-266
Proceedings Article
2010[Nor, Igor]
Hermelin, Danny
[Charlat, Sylvain]
[Engelstadter, Jan]
[Reuter, Max]
[Duron, Olivier Sagot, Marie-France]
Mod/Resc Parsimony Inference
In: Combinatorial Pattern Matching : 21st Annual Symposium, CPM 2010, 202-213
Proceedings Article
2010[Butman, Ayelet]
Hermelin, Danny
[Lewenstein, Moshe]
[Rawitz, Dror]
Optimization problems in multiple-interval graphs
In: ACM Transactions on Algorithms [6], 40,1-40,18
Journal Article
2010[Gotthilf, Zvi]
[Hermelin, Danny]
[Landau, Gad M.]
[Lewenstein, Moshe]
Restricted LCS
In: 17th International Symposium on String Processing and Information Retrieval, 250-257
Proceedings Article
1
Hide details for Hermlin, DannyHermlin, Danny
2012[Nor, Igor]
Hermlin, Danny
[Charlat, Sylvain]
[Engelstadter, Jan]
[Reuter, Max]
[Duron, Olivier]
[Sagot, Marie-France]
Mod/Resc Parsimony Inference: Theory and application
In: Information and Computation [213], 23-32
Journal Article
1
Hide details for Herrmann, ThomasHerrmann, Thomas
2001[Bäsken, Matthias]
[Brönnimann, Hervé]
[Frank, Da]
[Devillers, Olivier]
[Ester, Ezra]
[Fabri, Andreas]
[Flato, Eyal]
[Gärtner, Bernd]
[Giezeman, Geert-Jan]
[Halperin, Dan]
[Hanniel, Iddo]
[Har-Peled, Sariel]
[Herrmann, Thomas]
Hert, Susan
[Hirsch, Shai]
[Hoffmann, Michael]
Kettner, Lutz
[Nechushtan, Oren]
[Neyer, Gabriele]
[Pasechnik, Dmitrii]
[Pion, Sylvain]
Schirra, Stefan
[Schönherr, Sven]
Seel, Michael
[Teillaud, Monique]
[Veltkamp, Remco]
[Wein, Ron]
[Wesselink, Wieger]
[Yvinec, Mariette]
CGAL Reference and User ManualsUnknown Form: eBookForm
2
Hide details for Hershberger, John (ed.)Hershberger, John (ed.)
2009Doerr, Benjamin
[Friedrich, Tobias]
[Künnemann, Marvin]
[Sauerwald, Thomas]
Quasirandom Rumor Spreading: An Experimental Analysis
In: 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX), 145-153
Proceedings Article
2009Doerr, Benjamin
Wahlström, Magnus
Randomized Rounding in the Presence of a Cardinality Constraint
In: 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX), 162-174
Proceedings Article
4
Hide details for Hertel, StefanHertel, Stefan
1985Hertel, Stefan
Mehlhorn, Kurt
Attachment IconFast Triangulation of the Plane with Respect to Simple Polygons
In: Information and Control [64], 52-76
Journal Article
1984Hertel, Stefan
Mäntylä, Martti
Mehlhorn, Kurt
Nievergelt, Jurg
Attachment IconSpace Sweep Solves Intersection of Convex Polyhedra
In: Acta Informatica [21], 501-519
Journal Article
1984[Hertel, Stefan]
[Mehlhorn, Kurt]
[Mäntylä, Martti]
[Nievergelt, Jurg]
Attachment IconSpace sweep solves intersection of two convex polyhedra elegantlyReport
1983Hertel, Stefan
Mehlhorn, Kurt
Fast Triangulation of Simple Polygons
In: Fundamentals of Computation Theory, Proceedings of the 1983 International FCT-Conference (FCT 1983), 207-218
Proceedings Article
1
Hide details for Hertel, S.Hertel, S.
1982Becker, Michael
Degenhardt, W.
Doenhardt, J.
Hertel, S.
Kaninke, G.
Kerber, W.
Mehlhorn, Kurt
Näher, Stefan
Rohnert, H.
Winter, T.
Attachment IconA Probabilistic Algorithm for Vertex Connectivity of Graphs
In: Information Processing Letters [15], 135-136
Journal Article
2
Hide details for Hertzberger, Bob (ed.)Hertzberger, Bob (ed.)
1999Sanders, Peter
[Takkula, Tuomo]
[Wedelin, Dag]
High performance integer optimization for crew scheduling
In: Proceedings of the 7th International Conference on High-Performance Computing and Networking Europe (HPCN Europe-99), 3-12
Proceedings Article
1999[Jung, Bernd]
Lenhof, Hans-Peter
Müller, Peter
Rüb, Christine
Simulating synthetic polymer chains in parallel
In: Proceedings of the 7th International Conference on High-Performance Computing and Networking Europe (HPCN Europe-99), 13-22
Proceedings Article
14
Hide details for Hert, SusanHert, Susan
2007[Hert, Susan]
[Hoffmann, Michael]
Kettner, Lutz
[Pion, Sylvain]
[Seel, Michael]
An adaptable and extensible geometry kernel
In: Computational Geometry: Theory and Applications [38], 16-36
Journal Article
2007Hemmer, Michael
[Hert, Susan]
[Kettner, Lutz]
[Pion, Sylvain]
[Schirra, Stefan]
Number Types, CGAL - Computational Geometry Algorithms Library, release 3.3Manual
2005Berberich, Eric
Eigenwillig, Arno
[Hemmer, Michael]
[Hert, Susan]
Kettner, Lutz
Mehlhorn, Kurt
Reichel, Joachim
Schmitt, Susanne
[Schömer, Elmar]
Wolpert, Nicola
Attachment IconEXACUS: Efficient and exact algorithms for curves and surfaces
In: 13th Annual European Symposium on Algorithms (ESA 2005), 155-166
Proceedings Article
2004Berberich, Eric
Eigenwillig, Arno
[Hemmer, Michael]
[Hert, Susan]
Kettner, Lutz
Mehlhorn, Kurt
Reichel, Joachim
Schmitt, Susanne
[Schömer, Elmar]
Weber, Dennis
Wolpert, Nicola
EXACUS: Efficient and Exact Algorithms for Curves and SurfacesReport
2003Granados, Miguel
Hachenberger, Peter
Hert, Susan
Kettner, Lutz
Mehlhorn, Kurt
Seel, Michael
Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and ImplementationReport
2003Granados, Miguel
Hachenberger, Peter
Hert, Susan
Kettner, Lutz
Mehlhorn, Kurt
Seel, Michael
Attachment IconBoolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation
In: Algorithms - ESA 2003: 11th Annual European Symposium, 654-666
Proceedings Article
2003Berberich, Eric
Eigenwillig, Arno
[Fogel, Efi]
[Halperin, Dan]
Hert, Susan
Kettner, Lutz
[Teillaud, Monique]
[Wein, Ron]
Specification of the traits classes for CGAL arrangements of curvesReport
2002Berberich, Eric
Eigenwillig, Arno
Hemmer, Michael
Hert, Susan
Mehlhorn, Kurt
Schömer, Elmar
Attachment IconA Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 174-186
Proceedings Article
2002Hert, Susan
[Richards, Brad]
Multiple Robot Motion Planning = Parallel Processing + Geometry
In: Sensor Based Intelligent Robots, 183-205
Proceedings Article
2001Hert, Susan
[Hoffmann, Michael]
[Kettner, Lutz]
[Pion, Sylvain]
Seel, Michael
An Adaptable and Extensible Geometry Kernel
In: Proceedings of the 5th International Workshop on Algorithm Engineering (WAE-01), 79-90
Proceedings Article
2001[Bäsken, Matthias]
[Brönnimann, Hervé]
[Frank, Da]
[Devillers, Olivier]
[Ester, Ezra]
[Fabri, Andreas]
[Flato, Eyal]
[Gärtner, Bernd]
[Giezeman, Geert-Jan]
[Halperin, Dan]
[Hanniel, Iddo]
[Har-Peled, Sariel]
[Herrmann, Thomas]
Hert, Susan
[Hirsch, Shai]
[Hoffmann, Michael]
Kettner, Lutz
[Nechushtan, Oren]
[Neyer, Gabriele]
[Pasechnik, Dmitrii]
[Pion, Sylvain]
Schirra, Stefan
[Schönherr, Sven]
Seel, Michael
[Teillaud, Monique]
[Veltkamp, Remco]
[Wein, Ron]
[Wesselink, Wieger]
[Yvinec, Mariette]
CGAL Reference and User ManualsUnknown Form: eBookForm
2001Hert, SusanAttachment IconConnected Area Partitioning
In: Proceedings of the 17th European Workshop on Computational Geometry (CG-01), 35-38
Proceedings Article
2000Bast, Hannah
Hert, Susan
The Area Partitioning Problem
In: Proceedings of the 12th Annual Canadian Conference on Computational Geometry (CCCG-00), 163-171
Proceedings Article
1999Hert, Susan
Lumelsky, Vladimir
Motion Planning in R^3 for Multiple Tethered Robots
In: IEEE Transactions on Robotics and Automation [15], 623-639
Journal Article
1
Hide details for Hevia, Alejandro (ed.)Hevia, Alejandro (ed.)
2006Elbassioni, Khaled M.Finding All Minimal Infrequent Multi-dimensional Intervals
In: LATIN 2006: Theoretical Informatics, 7th Latin American Symposium, 423-434
Proceedings Article
3
Hide details for Heydrich, SandyHeydrich, Sandy
2015Heydrich, Sandy
[van Stee, Rob]
Dividing Connected Chores Fairly
In: Theoretical Computer Science [593], 51-61
Journal Article
2013[Heydrich, Sandy]
van Stee, Rob
Attachment IconDividing connected chores fairly
In: 6th International Symposium on Algorithmic Game Theory, 420-433
Proceedings Article
2012Heydrich, SandyDividing connected chores fairly
Universität des Saarlandes
Thesis - Bachelor thesis
2
Hide details for Heydthausen, ManfredHeydthausen, Manfred
1976Heydthausen, Manfred
Mehlhorn, Kurt
Top Down Parsing of Macro Grammars
In: GI - 6. Jahrestagung, 95-108
Proceedings Article
1976Heydthausen, Manfred
Mehlhorn, Kurt
Top down parsing of macro grammars (preliminary report)Report
4
Hide details for He, JunHe, Jun
2010Friedrich, Tobias
[He, Jun]
Hebbinghaus, Nils
Neumann, Frank
[Witt, Carsten]
Approximating Covering Problems by Randomized Search Heuristics using Multi-Objective Models
In: Evolutionary Computation [18], 617 - 633
Journal Article
2009Friedrich, Tobias
[He, Jun]
Hebbinghaus, Nils
Neumann, Frank
[Witt, Carsten]
Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem
In: Evolutionary Computation, [17], 3-19
Journal Article
2007Friedrich, Tobias
[He, Jun]
Hebbinghaus, Nils
Neumann, Frank
[Witt, Carsten]
Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models
In: Genetic and Evolutionary Computation Conference 2007, 797-804
Proceedings Article
2007Friedrich, Tobias
[He, Jun]
Hebbinghaus, Nils
Neumann, Frank
[Witt, Carsten]
On Improving Approximate Solutions by Evolutionary Algorithms
In: IEEE Congress on Evolutionary Computation 2007, 2614-2621
Proceedings Article
1
Hide details for Higashino, Teruo (ed.)Higashino, Teruo (ed.)
2005[Czyzowicz, Jurek]
Kowalski, Dariusz
[Markou, Euripides]
[Pelc, Andrzej]
Searching for a black hole in tree networks
In: Principles of distributed systems : 8th International Conference, OPODIS 2004, 67-80
Proceedings Article
1
Hide details for Hiller, BenjaminHiller, Benjamin
2010Berberich, Eric
[Hagen, Matthias]
[Hiller, Benjamin]
[Moser, Hannes]
Experiments
In: Algorithm Engineering : Bridging the Gap between Algorithm Theory and Practice, 325-388
Part of a Book
1
Hide details for Hilpert, PeterHilpert, Peter
1996Hilpert, PeterHeuristiken fur das euklidische Travelling Salesman Problem
Universitat des Saarlandes
Thesis - Masters thesis
1
Hide details for Hinkenjann, André (ed.)Hinkenjann, André (ed.)
2009Emeliyanenko, Pavel
Berberich, Eric
Sagraloff, Michael
Attachment IconVisualizing Arcs of Implicit Algebraic Curves, Exactly and Fast
In: Advances in Visual Computing : 5th International Symposium, ISVC 2009, 608-619
Proceedings Article
1
Hide details for Hippler, SteffenHippler, Steffen
2003[Hall, Alex]
[Hippler, Steffen]
Skutella, Martin
Attachment IconMulticommodity Flows Over Time: Efficient Algorithms and Complexity
In: Automata, languages and programming : 30th International Colloquium, ICALP 2003, 397-409
Proceedings Article
1
Hide details for Hiromasa, Suzuki (ed.)Hiromasa, Suzuki (ed.)
2002Lennerz, Christian
Schömer, Elmar
Efficient Distance Computation for Quadratic Curves and Surfaces
In: Proceedings of the 2nd Conference on Geometric Modeling and Processing, 60-69
Proceedings Article
3
Hide details for Hirschberg, Dan (ed.)Hirschberg, Dan (ed.)
1996[Brodal, Gerth Stølting]
Gasieniec, Leszek
Approximate Dictionary Queries
In: Combinatorial Pattern Matching: 7th Annual Symposium (CPM'96), 65-74
Proceedings Article
1996Arikati, Srinivasa Rao
[Dessmark, Anders]
[Lingas, Andrzej]
[Marathe, Madhav V.]
Approximation algorithms for maximum two-dimensional pattern matching
In: Combinatorial Pattern Matching: 7th Annual Symposium, CPM96, 348-360
Proceedings Article
1996Gasieniec, Leszek
[Karpinski, Marek]
[Plandowski, Wojciech]
[Rytter, Wojciech]
Randomized Efficient Algorithms for Compressed Strings: the Finger-Print Approach
In: Combinatorial Pattern Matching: 7th Annual Symposium (CPM'96), 39-49
Proceedings Article
1
Hide details for Hirsch, Edward (ed.)Hirsch, Edward (ed.)
2014[Diekert, Volker]
Jez, Artur
[Plandowski, Wojciech]
Finding All Solutions of Equations in Free Groups and Monoids with Involution
In: 9th International Computer Science Symposium in Russia (CSR 2014), 1-15
Proceedings Article
1
Hide details for Hirsch, ShaiHirsch, Shai
2001[Bäsken, Matthias]
[Brönnimann, Hervé]
[Frank, Da]
[Devillers, Olivier]
[Ester, Ezra]
[Fabri, Andreas]
[Flato, Eyal]
[Gärtner, Bernd]
[Giezeman, Geert-Jan]
[Halperin, Dan]
[Hanniel, Iddo]
[Har-Peled, Sariel]
[Herrmann, Thomas]
Hert, Susan
[Hirsch, Shai]
[Hoffmann, Michael]
Kettner, Lutz
[Nechushtan, Oren]
[Neyer, Gabriele]
[Pasechnik, Dmitrii]
[Pion, Sylvain]
Schirra, Stefan
[Schönherr, Sven]
Seel, Michael
[Teillaud, Monique]
[Veltkamp, Remco]
[Wein, Ron]
[Wesselink, Wieger]
[Yvinec, Mariette]
CGAL Reference and User ManualsUnknown Form: eBookForm
1
Hide details for Hitzelberger, ChristophHitzelberger, Christoph
2005[Xu, Chihao]
[Wahl, Jürgen]
[Eeisenbrand, Friedrich]
Karrenbauer, Andreas
[Soh, Kian Min]
[Hitzelberger, Christoph]
Verfahren zur Ansteuerung von MatrixanzeigenMiscellaneous
1
Hide details for Hlinený, Petr (ed.)Hlinený, Petr (ed.)
2010Kratsch, Stefan
[Marx, Dániel]
Wahlström, Magnus
Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems
In: Mathematical Foundations of Computer Science 2010 : 35th International Symposium, MFCS 2010, 489-500
Proceedings Article
1
Hide details for Hlinen{Hlinen{
1
Hide details for 'y}, Petr (ed.)'y}, Petr (ed.)
2010[Baruah, Sanjoy]
Bonifaci, Vincenzo
[D'Angelo, Gianlorenzo]
[Li, Haohan]
[Marchetti-Spaccamela, Alberto]
Megow, Nicole
[Stougie, Leen]
Attachment IconScheduling Real-Time Mixed-Criticality Jobs
In: Mathematical Foundations of Computer Science 2010 : 35th International Symposium, MFCS 2010, 90-101
Proceedings Article
2
Hide details for Hochbaum, Dorit S. (ed.)Hochbaum, Dorit S. (ed.)
1992Baumgarten, Hanna
Jung, Hermann
Mehlhorn, Kurt
Dynamic Point Location in General Subdivisions
In: Discrete algorithms (SODA-92) : 3rd annual ACM-SIAM symposium, 250-258
Proceedings Article
1992Mehlhorn, Kurt
Sharir, Micha
Welzl, Emo
Tail Estimates for the Space Complexity of Randomised Incremental Algorithms
In: Discrete algorithms (SODA-92) : 3rd annual ACM-SIAM symposium, 89-93
Proceedings Article
1
Hide details for Hochbaum, Dorit (ed.)Hochbaum, Dorit (ed.)
1999Solis-Oba, Roberto
[Jansen, Klaus]
[Sviridenko, Maxim]
A linear time approximation scheme for the job shop scheduling problem
In: Proceedings of the 3rd International Workshop on Randomization and Approximation Techniques in Computer Science, and 2nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (RANDOM-APPROX-99), 177-188
Proceedings Article
15
Hide details for Hoefer, MartinHoefer, Martin
2013Hoefer, Martin
[Skopalik, Alexander]
Altruism in Atomic Congestion Games
In: ACM Transactions on Economics and Computation [1], 21
Journal Article
2013Hoefer, Martin
Sauerwald, Thomas
Brief Announcement: Threshold Load Balancing in Networks
In: 32nd Symposium on Principles of Distributed Computing (PODC-13), 54-56
Proceedings Article
2013Hoefer, Martin
[Kesselheim, Thomas]
Brief Announcement: Universally Truthful Secondary Spectrum Auctions
In: 25th Symposium on Parallelism in Algorithms and Architectures (SPAA-13), 99-101
Proceedings Article
2013[Harks, Tobias]
Hoefer, Martin
[Klimm, Max]
[Skopalik, Alexander]
Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games
In: Mathematical Programming [141], 193-215
Journal Article
2013Hoefer, Martin
[Wagner, Lisa]
Designing Profit Shares in Matching and Coalition Formation Games
In: 9th Conference on Web and Internet Economics (WINE-13), 249-262
Proceedings Article
2013[Anshelevich, Elliot]
[Bhardwaj, Onkar]
Hoefer, Martin
Friendship and Stable Matching.
In: 21st European Symposium on Algorithms (ESA-13), 49-60
Proceedings Article
2013Hoefer, MartinLocal Matching Dynamics in Social Networks
In: Information & Computation [222], 20-35
Journal Article
2013Hoefer, Martin
[Wagner, Lisa]
Locally Stable Marriage with Strict Preferences
In: 40th International Colloquium on Automata, Languages and Programming (ICALP-13), 620-631
Proceedings Article
2013Hoefer, Martin
[Skopalik, Alexander]
On the Complexity of Pareto-optimal Nash and Strong Equilibria
In: Theory of Computing Systems [53], 441-453
Journal Article
2013[Fanghänel, Alexander]
[Geulen, Sascha]
Hoefer, Martin
[Vöcking, Berthold]
Online Capacity Maximization in Wireless Networks
In: Journal of Scheduling [16], 81-91
Journal Article
2013[Dams, Johannes]
Hoefer, Martin
[Kesselheim, Thomas]
Sleeping Experts in Wireless Networks
In: 27th International Symposium on Distributed Computing (DISC-13), 344-357
Proceedings Article
2013Hoefer, MartinStrategic Cooperation in Cost Sharing Games
In: International Journal of Game Theory [42], 29-53
Journal Article
2013Hoefer, Martin
[Kesselheim, Thomas]
[Vöcking, Berthold]
Truthfulness and Stochastic Dominance with Monetary Transfers.
In: 14th Conf. Electronic Commerce (EC-13), 567-582
Proceedings Article
2011[Berenbrink, Petra]
[Hoefer, Martin]
Sauerwald, Thomas
Distributed Selfish Load Balancing on Networks
In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 1487-1497
Proceedings Article
2003Hoefer, MartinExperimental comparison of heuristic and approximation algorithms for uncapacitated facility location
In: 2nd International Workshop on Experimental and Efficient Algorithms (WEA-03), 165-178
Proceedings Article
1
Hide details for Höhn, WiebkeHöhn, Wiebke
2012[Höhn, Wiebke]
[Jacobs, Tobias]
Megow, Nicole
On Eulerian extensions and their application to no-wait flowshop scheduling
In: Journal of Scheduling [15], 295-309
Journal Article
2
Hide details for Hoekstra, Alfons (ed.)Hoekstra, Alfons (ed.)
1999Sanders, Peter
[Takkula, Tuomo]
[Wedelin, Dag]
High performance integer optimization for crew scheduling
In: Proceedings of the 7th International Conference on High-Performance Computing and Networking Europe (HPCN Europe-99), 3-12
Proceedings Article
1999[Jung, Bernd]
Lenhof, Hans-Peter
Müller, Peter
Rüb, Christine
Simulating synthetic polymer chains in parallel
In: Proceedings of the 7th International Conference on High-Performance Computing and Networking Europe (HPCN Europe-99), 13-22
Proceedings Article
1
Hide details for Hoepman, Jaap-HenkHoepman, Jaap-Henk
1995[Hoepman, Jaap-Henk]
Papatriantafilou, Marina
Tsigas, Philippas
Self-Stabilization in Wait-Free Shared Memory Objects
In: Distributed Algorithms: 9th International Workshop (WDAG95), 273-287
Proceedings Article
1
Hide details for Hoffmann, KHoffmann, K
1984Hoffmann, K
Mehlhorn, Kurt
Intersecting a line and a simple polygon
In: EATCS Bulletin [22], 120-121
Journal Article
3
Hide details for Hoffmann, KurtHoffmann, Kurt
1986Hoffmann, Kurt
Mehlhorn, Kurt
Rosenstiehl, Pierre
Tarjan, Robert E.
Attachment IconSorting Jordan Sequences in Linear Time Using Level-Linked Search Trees
In: Information and Control [68], 170-184
Journal Article
1985Hoffmann, Kurt
Mehlhorn, Kurt
Rosenstiehl, Pierre
Tarjan, Robert E.
Sorting Jordan sequences in linear time
In: Computational geometry (SCG-85) : 1st symposium, 196-203
Proceedings Article
1984Hoffmann, Kurt
Mehlhorn, Kurt
Rosenstiehl, Pierre
Tarjan, Robert E.
Sorting Jordan sequences in linear timeReport
3
Hide details for Hoffmann, MichaelHoffmann, Michael
2007[Hert, Susan]
[Hoffmann, Michael]
Kettner, Lutz
[Pion, Sylvain]
[Seel, Michael]
An adaptable and extensible geometry kernel
In: Computational Geometry: Theory and Applications [38], 16-36
Journal Article
2001Hert, Susan
[Hoffmann, Michael]
[Kettner, Lutz]
[Pion, Sylvain]
Seel, Michael
An Adaptable and Extensible Geometry Kernel
In: Proceedings of the 5th International Workshop on Algorithm Engineering (WAE-01), 79-90
Proceedings Article
2001[Bäsken, Matthias]
[Brönnimann, Hervé]
[Frank, Da]
[Devillers, Olivier]
[Ester, Ezra]
[Fabri, Andreas]
[Flato, Eyal]
[Gärtner, Bernd]
[Giezeman, Geert-Jan]
[Halperin, Dan]
[Hanniel, Iddo]
[Har-Peled, Sariel]
[Herrmann, Thomas]
Hert, Susan
[Hirsch, Shai]
[Hoffmann, Michael]
Kettner, Lutz
[Nechushtan, Oren]
[Neyer, Gabriele]
[Pasechnik, Dmitrii]
[Pion, Sylvain]
Schirra, Stefan
[Schönherr, Sven]
Seel, Michael
[Teillaud, Monique]
[Veltkamp, Remco]
[Wein, Ron]
[Wesselink, Wieger]
[Yvinec, Mariette]
CGAL Reference and User ManualsUnknown Form: eBookForm
5
Hide details for Hoffmann, Michael (ed.)Hoffmann, Michael (ed.)
2007Elbassioni, Khaled
[Sitters, Rene]
[Zhang, Yan]
A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs
In: Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings, 451-462
Proceedings Article
2007[Bar-Yehuda, Reuven]
[Flysher, Guy]
Mestre, Julián
[Rawitz, Dror]
Approximation of Partial Capacitated Vertex Cover
In: 15th Annual European Symposium on Algorithms, 335-346
Proceedings Article
2007[Dupont, Laurent]
Hemmer, Michael
[Petitjean, Sylvain]
[Schömer, Elmar]
Attachment IconComplete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics
In: 15th Annual European Symposium on Algorithms, 633-644
Proceedings Article
2007Berberich, Eric
[Fogel, Efi]
[Halperin, Dan]
Mehlhorn, Kurt
[Wein, Ron]
Attachment IconSweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step
In: Algorithms - ESA 2007, 15th Annual European Symposium, 645-656
Proceedings Article
2007[Khuller, Samir]
[Malekian, Azarakhsh]
Mestre, Julián
To Fill or Not to Fill: The Gas Station Problem
In: 15th Annual European Symposium on Algorithms, 534-545
Proceedings Article
1
Hide details for Hoffmann, SebastianHoffmann, Sebastian
2011[Mainberger, Markus]
[Hoffmann, Sebastian]
[Weickert, Joachim]
Tang, Ching Hoo
[Johannsen, Daniel]
[Neumann, Frank]
Doerr, Benjamin
Optimising Spatial and Tonal Data for Homogeneous Diffusion Inpainting
In: Scale Space and Variational Methods in Computer Vision : Third International Conference, SSVM 2011, 26-37
Proceedings Article
1
Hide details for Holmes, John (ed.)Holmes, John (ed.)
2008GECCO 2008: Proceedings of the 10th Annual Conference on Genetic and Evolutionary ComputationProceedings
1
Hide details for Hong, Hoon (ed.)Hong, Hoon (ed.)
2009Sagraloff, Michael
Kerber, Michael
Hemmer, Michael
Certified Complex Root Isolation via Adaptive Root Separation Bounds
In: The Joint Conference of ASCM 2009 and MACIS 2009, 151-166
Proceedings Article
3
Hide details for Hong, Jia-WeiHong, Jia-Wei
1983Hong, Jia-Wei
Mehlhorn, Kurt
Rosenberg, Arnold L.
Attachment IconCost Trade-offs in Graph Embeddings, with Applications
In: Journal of the ACM [30], 709-728
Journal Article
1982Hong, Jia-Wei
Mehlhorn, Kurt
Cost tradeoffs in graph embeddings, with applicationsReport
1981Hong, Jia-Wei
Mehlhorn, Kurt
Rosenberg, Arnold L.
Cost Tradeoffs in Graph Embeddings, with Applications (Preliminary Version)
In: Automata, languages and programming (ICALP-81) : 8th international colloquium, 41-55
Proceedings Article
2
Hide details for Hong, Seok-Hee (ed.)Hong, Seok-Hee (ed.)
2008Bringmann, Karl
Friedrich, Tobias
Approximating the volume of unions and intersections of high-dimensional geometric objects.
In: Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC 2008), 436-447
Proceedings Article
2008Friedrich, Tobias
Hebbinghaus, Nils
Average Update Times for Fully-Dynamic All-Pairs Shortest Paths.
In: Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC 2008), 693-704
Proceedings Article
1
Hide details for Hoogeveen, HanHoogeveen, Han
2003[Hoogeveen, Han]
Skutella, Martin
[Woeginger, Gerhard J.]
Attachment IconPreemptive scheduling with rejection
In: Mathematical Programming [94], 361-374
Journal Article
1
Hide details for Hornby, Gergory (ed.)Hornby, Gergory (ed.)
2008GECCO 2008: Proceedings of the 10th Annual Conference on Genetic and Evolutionary ComputationProceedings
1
Hide details for Horoba, ChrisitianHoroba, Chrisitian
2009[Horoba, Chrisitian]
Neumann, Frank
Additive Approximations of Pareto-Optimal Sets by Evolutionary Multi-Objective Algorithms
In: FOGA'09 : Revised Selected Papers from ACM SIGEVO Foundations of Genetic Algorithms X, 79-86
Proceedings Article
5
Hide details for Horoba, ChristianHoroba, Christian
2011Friedrich, Tobias
[Horoba, Christian]
Neumann, Frank
Illustration of fairness in evolutionary multi-objective optimization
In: Theoretical Computer Science [412], 1546-1556
Journal Article
2009Doerr, Benjamin
[Eremeev, Anton]
[Horoba, Christian]
Neumann, Frank
[Theile, Madeleine]
Evolutionary Algorithms and Dynamic Programming
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 771-777
Proceedings Article
2009Friedrich, Tobias
[Horoba, Christian]
Neumann, Frank
Multiplicative Approximations and the Hypervolume Indicator
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 571-578
Proceedings Article
2008[Horoba, Christian]
Neumann, Frank
Benefits and Drawbacks for the Use of epsilon-Dominance in Evolutionary Multi-Objective Optimization
In: Genetic and Evolutionary Computation Conference 2008, 641-680
Proceedings Article
2008Friedrich, Tobias
[Horoba, Christian]
Neumann, Frank
Runtime Analyses for Using Fairness in Evolutionary Multi-Objective Optimization
In: Parallel Problem Solving from Nature (PPSN X), 671-680
Proceedings Article
1
Hide details for Hoss, Holger H. (ed.)Hoss, Holger H. (ed.)
2007Neumann, Frank
[Sudholt, Dirk]
[Witt, Carsten]
Attachment IconComparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions
In: Engineering Stochastic Local Search Algorithms 2007, 61-75
Proceedings Article
1
Hide details for Hota, AshishHota, Ashish
2012Doerr, Benjamin
[Hota, Ashish]
Kötzing, Timo
Ants easily solve stochastic shortest path problems
In: GECCO'12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, 17-24
Proceedings Article
1
Hide details for Hotho, Andreas (ed.)Hotho, Andreas (ed.)
2006Bast, Holger
[Dupret, Georges]
Majumdar, Debapriyo
[Piwowarski, Benjamin]
Discovering a Term Taxonomy from Term Similarities Using Principal Component Analysis
In: Semantics, web and mining : Joint International Workshops, EWMF 2005 and KDO 2005, 103-120
Proceedings Article
1
Hide details for Hotz, GünterHotz, Günter
2009Gärtner, Tobias
[Hotz, Günter]
Computability of Analytic Functions with Analytic Machines
In: Mathematical Theory and Computational Practice : 5th Conference on Computability in Europe, CiE 2009, 250-259
Proceedings Article
1
Hide details for Houle, Michael E. (ed.)Houle, Michael E. (ed.)
1996Mehlhorn, KurtThe LEDA Platform of Combinatorial and Geometric Computing
In: Proceedings of Conference on Computing: The Australian Theory Symposium, 126-126
Proceedings Article
1
Hide details for Howard, Daniel (ed.)Howard, Daniel (ed.)
2008GECCO 2008: Proceedings of the 10th Annual Conference on Genetic and Evolutionary ComputationProceedings
1
Hide details for Hoy, DarrellHoy, Darrell
2009[Bhaskar, Umang]
[Fleischer, Lisa]
[Hoy, Darrell]
Huang, Chien-Chung
Attachment IconEquilibria of Atomic Flow Games are not Unique
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 748-757
Proceedings Article
1
Hide details for Hromkovic, J. (ed.)Hromkovic, J. (ed.)
1998[Biedl, Therese]
[Kaufmann, Michael]
Mutzel, Petra
Drawing Planar Partitions II: HH-Drawings
In: Proceedings of the 24th Workshop on Graph-Theoretic Concepts in Computer Science (WG-98), 124-136
Proceedings Article
1
Hide details for Hsu, Ching-Hsien (ed.)Hsu, Ching-Hsien (ed.)
2010Emeliyanenko, PavelAttachment IconModular Resultant Algorithm for Graphics Processors
In: Algorithms and Architectures for Parallel Processing : 10th International Conference, ICA3PP 2010. - Pt. 1, 427-440
Proceedings Article
1
Hide details for Hsu, D.F.Hsu, D.F.
1998Sibeyn, Jop F.
[Grammatikakis, M.D.]
[Hsu, D.F.]
[Kraetzl, M.]
Packet Routing in Fixed-Connection Networks: A Survey
In: Journal of Parallel and Distributed Computing [54], 77-132
Journal Article
1
Hide details for Hsu, Tsan-sheng (ed.)Hsu, Tsan-sheng (ed.)
2012Hermelin, Danny
[Rizzi, Romeo]
[Vialette, Stephane]
Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph
In: Algorithms and Computation : 23rd International Symposium, ISAAC 2012, 465-474
Proceedings Article
1
Hide details for Hsu, Wen-Lian (ed.)Hsu, Wen-Lian (ed.)
1998Fleischer, RudolfOn the Bahncard problem
In: Proceedings of the 4th International Conference on Computing and Combinatorics (COCOON-98), 65-74
Proceedings Article
1
Hide details for Hsu, W.L. (ed.)Hsu, W.L. (ed.)
1991Lenhof, Hans-Peter
Smid, Michiel
An optimal construction method for generalized convex layers
In: ISA'91 Algorithms: 2nd International Symposium on Algorithms, 349-363
Proceedings Article
11
Hide details for Huang, Chien-ChungHuang, Chien-Chung
2013[Antoniadis, Antonios]
[Huang, Chien-Chung]
Ott, Sebastian
[Verschae, José]
How to Pack Your Items When You Have to Buy Your Knapsack
In: Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, 62-73
Proceedings Article
2012Huang, Chien-ChungNon-preemptive Speed Scaling
In: Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops, 249-260
Proceedings Article
2012Abed, Fidaa
[Huang, Chien-Chung]
Preemptive Coordination Mechanisms for Unrelated Machines
In: Algorithms - ESA 2012 : 20th Annual European Symposium, 12-23
Proceedings Article
2011Huang, Chien-Chung
[Kavitha, Telikepalli]
[Michael, Dimitrios]
[Nasr, Meghana]
Bounded Unpopularity Matchings
In: Algorithmica [61], 738-757
Journal Article
2011Huang, Chien-Chung
[Kavitha, Telikepalli]
Near-popular matchings in the Roommates problem
In: 19th European Symposium on Algorithms (ESA),
Proceedings Article
2011Hermelin, Danny
[Huang, Chien-Chung]
[Kratsch, Stefan]
Wahlström, Magnus
Parameterized Two-Player Nash Equilibrium
In: Graph-Theoretic Concepts in Computer Science : 37th International Workshop, WG 2011, 215-226
Proceedings Article
2011Huang, Chien-Chung
[Kavitha, Telikepalli]
Popular Matchings in the Stable Marriage Problem
In: 38th International Colloquium on Automata, Languages and Programming (ICALP),
Proceedings Article
2010Huang, Chien-ChungCircular stable matching and 3-way kidney transplant
In: Algorithmica [58], 137-150
Journal Article
2010Huang, Chien-ChungClassified stable matching
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1235-1253
Proceedings Article
2009[Bhaskar, Umang]
[Fleischer, Lisa]
[Hoy, Darrell]
Huang, Chien-Chung
Attachment IconEquilibria of Atomic Flow Games are not Unique
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 748-757
Proceedings Article
2008[Huang, Chien-Chung]
Kavitha, Telikepalli
[Michail, Dimitrios]
[Nasre, Meghana]
Bounded Unpopularity Matchings
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), 127-137
Proceedings Article
8
Hide details for Huber, AnnaHuber, Anna
2013Doerr, Benjamin
[Huber, Anna]
[Levavi, Ariel]
Strong robustness of randomized rumor spreading protocols
In: Discrete Applied Mathematics [161], 778-793
Journal Article
2010Huber, AnnaRandomized rounding and rumor spreading with stochastic dependencies
Universität des Saarlandes
Thesis - PhD thesis
2010Fountoulakis, Nikolaos
Huber, Anna
Panagiotou, Konstantinos
Reliable broadcasting in random networks and the effect of density
In: 2010 Proceedings IEEE INFOCOM, 2552-2560
Proceedings Article
2009Fountoulakis, Nikolaos
Huber, Anna
Panagiotou, Konstantinos
Brief Announcement: The Speed of Broadcasting in Random Networks - Density Does Not Matter
In: Distributed Computing : 23rd International Symposium, DISC 2009, 529-530
Proceedings Article
2009Fountoulakis, Nikolaos
Huber, Anna
Quasirandom rumor spreading on the complete graph is as fast as randomized rumor spreading
In: SIAM Journal on Discrete Mathematics [23], 1964-1991
Journal Article
2009Doerr, Benjamin
Huber, Anna
Levavi, Ariel
Strong robustness of randomized rumor spreading protocols
In: Algorithms and Computation : 20th International Symposium, ISAAC 2009, 812-821
Proceedings Article
2009Fountoulakis, Nikolaos
Huber, Anna
Panagiotou, Konstantinos
The Speed of Broadcasting in Random Networks: Density Does Not Matter
In: 23rd International Symposium on Distributed Computing (DISC '09), 529-530
Proceedings Article
2009Angelopoulos, Spyros
Doerr, Benjamin
Huber, Anna
Panagiotou, Konstantinos
Tight bounds for quasirandom rumor spreading
In: The Electronic Journal of Combinatorics [16], R102,1-R102,19
Electronic Journal Article
1
Hide details for Huddleston, ScottHuddleston, Scott
1982Huddleston, Scott
Mehlhorn, Kurt
A New Data Structure for Representing Sorted Lists
In: Acta Informatica [17], 157-184
Journal Article
1
Hide details for Huddleston, S.Huddleston, S.
1981Huddleston, S.
Mehlhorn, Kurt
Attachment IconRobust balancing in B-trees
In: Theoretical computer science : 5th GI-conference, 234-244
Proceedings Article
1
Hide details for Hüffner, FalkHüffner, Falk
2009[Böcker, Sebastian]
[Hüffner, Falk]
[Truss, Anke]
Wahlström, Magnus
A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams
In: Parameterized and Exact Computation : 4th International Workshop, IWPEC 2009, 38-49
Proceedings Article
2
Hide details for Hülse, DominikHülse, Dominik
2009Hemmer, Michael
[Hülse, Dominik]
Attachment IconGeneric implementation of a modular GCD over Algebraic Extension Fields
In: EuroCG'09 : 25th European Workshop on Computational Geometry, 321-324
Proceedings Article
2007Hemmer, Michael
[Hülse, Dominik]
Traits classes for polynomial gcd computation over algebraic extensionsReport
1
Hide details for Humble, MonikaHumble, Monika
1997Humble, MonikaDie Berechnung maximaler Flüsse in Netzwerken
Universität des Saarlandes
Thesis - Masters thesis
2
Hide details for Hundack, ChristophHundack, Christoph
1997Hundack, Christoph
Mutzel, Petra
[Pouchkarev, Igor]
[Thome, Stefan]
ArchE: A Graph Drawing System for Archaeology
In: Proceedings of the 5th Symposium on Graph Drawing (GD-97), 297-302
Proceedings Article
1997Hundack, Christoph
Prömel, Hans Jürgen
Steger, Angelika
Extremal Graph Problems for Graphs with a Color-Critical Vertex
In: Combinatorics, Geometry and Probability, 421-433
Part of a Book
2
Hide details for Hurtado, Ferran (ed.)Hurtado, Ferran (ed.)
2011Berberich, Eric
[Hemmer, Michael]
[Kerber, Michael]
A Generic Algebraic Kernel for Non-linear Geometric Applications
In: Proceedings of the 27th Annual Symposium on Computational Geometry (SCG'11), 179-186
Proceedings Article
2011Berberich, Eric
[Halperin, Dan]
[Kerber, Michael]
[Pogalnikova, Roza]
Deconstructing Approximate Offsets
In: Proceedings of the 27th Annual Symposium on Computational Geometry (SCG'11), 187-196
Proceedings Article
2
Hide details for Husfeldt, Thore (ed.)Husfeldt, Thore (ed.)
2014Jez, ArturContext Unification is in PSPACE
In: 41st International Colloquium on Automata, Languages, and Programming (ICALP 2014), 244-255
Proceedings Article
2014Gawrychowski, Pawel
[Mozes, Shay]
[Weimann, Oren]
Improved Submatrix Maximum Queries in Monge Matrices
In: Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I, 525-537
Proceedings Article
1
Hide details for Husinsky, I. (ed.)Husinsky, I. (ed.)
1995Meyer, Ulrich
Sibeyn, Jop F.
Simulating the Simulator: Determinstic PRAM Simulation on a Mesh Simulator
In: Eurosim '95, 285-290
Proceedings Article
3
Hide details for Hutchinson, David A.Hutchinson, David A.
2005[Hutchinson, David A.]
Sanders, Peter
[Vitter, Jeffrey Scott]
Duality Between Prefetching and Queued Writing with Parallel Disks
In: SIAM Journal on Computing [34], 1443-1463
Journal Article
2001[Hutchinson, David A.]
Sanders, Peter
[Vitter, Jeffrey Scott]
Duality Between Prefetching and Queued Writing with Parallel Disks
In: Proceedings of the 9th Annual European Symposium on Algorithms (ESA-01), 62-73
Proceedings Article
2001[Hutchinson, David A.]
Sanders, Peter
[Vitter, Jeffrey Scott]
The Power of Duality for Prefetching and Sorting with Parallel Disks
In: Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-01), 334-335
Proceedings Article
1
Hide details for Hutter, Marcus (ed.)Hutter, Marcus (ed.)
2010[Case, John]
Kötzing, Timo
Solutions to Open Questions for Non-U-Shaped Learning with Memory Limitations
In: Algorithmic Learning Theory : 21st International Conference, ALT 2010, 285-299
Proceedings Article
1
Hide details for Hu, XiaodongHu, Xiaodong
2012[Chen, Xujin]
Doerr, Benjamin
[Hu, Xiaodong]
[Ma, Weidong]
van Stee, Rob
Winzen, Carola
Attachment IconThe Price of Anarchy for Selfish Ring Routing is Two
In: Internet and Network Economics : 8th International Workshop, WINE 2012, 420-433
Proceedings Article
1
Hide details for Hyyrö, Heikki (ed.)Hyyrö, Heikki (ed.)
2009Celikik, Marjan
Bast, Hannah
Fast Single-Pass Construction of a Half-Inverted Index
In: String processing and information retrieval : 16th International Symposium, SPIRE 2009, 194-205
Proceedings Article
1
Hide details for H., Chintan RaoH., Chintan Rao
2010[Ambalath, Abhimanyu M.]
[Balasundaram, Radheshyam]
[H., Chintan Rao]
[Koppula, Venkata]
[Misra, Neeldhara]
Philip, Geevarghese
[Ramanujan, M. S.]
Attachment IconOn the Kernelization Complexity of Colorful Motifs
In: Parameterized and Exact Computation - 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings, 14-25
Proceedings Article
1
Hide details for Iacono, GiovanniIacono, Giovanni
2012[Soranzo, Nicola]
Ramezani, Fahimeh
[Iacono, Giovanni]
[Altafini, Claudio]
Decompositions of large-scale biological systems based on dynamical properties
In: Bioinformatics [28], 76-83
Journal Article
1
Hide details for Iacono, G.Iacono, G.
2010[Iacono, G.]
Ramezani, Fahimeh
[Soranzo, N.]
[Altafani, C.]
Determining the distance to monotonicity of a biological network: a graph-theoretical approach
In: IET Systems Biology [4], 223-235
Journal Article
1
Hide details for Iacono, John (ed.)Iacono, John (ed.)
2011Harren, Rolf
[Jansen, Klaus]
[Prädel, Lars]
van Stee, Rob
Attachment IconA (5/3 + ε)-Approximation for Strip Packing
In: Algorithms and Data Structures : 12th International Symposium, WADS 2011, 475-487
Proceedings Article
1
Hide details for Ibaraki, Toshihide (ed.)Ibaraki, Toshihide (ed.)
1990Klein, R.
Mehlhorn, Kurt
Meiser, Stefan
On the Construction of Abstract Voronoi Diagrams, II
In: Algorithms (ISA-90) : 1st international symposium (SIGAL-90), 138-154
Proceedings Article
1
Hide details for Ibarra, Oscar H. (ed.)Ibarra, Oscar H. (ed.)
1998Mutzel, Petra
Weiskircher, René
Attachment IconTwo-Layer Planarization in Graph Drawing
In: Proceedings of the 9th International Symposium on Algorithms and Computation (ISAAC-98), 69-78
Proceedings Article
2
Hide details for Ibarra, Oscar (ed.)Ibarra, Oscar (ed.)
2009[Kavitha, Telikepalli]
Mestre, Julian
Max-coloring paths: Tight bounds and extensions
In: Algorithms and Computation : 20th International Symposium, ISAAC 2009, 87-96
Proceedings Article
2009Doerr, Benjamin
Huber, Anna
Levavi, Ariel
Strong robustness of randomized rumor spreading protocols
In: Algorithms and Computation : 20th International Symposium, ISAAC 2009, 812-821
Proceedings Article
2
Hide details for Igel, ChristianIgel, Christian
2013Bringmann, Karl
[Friedrich, Tobias]
[Igel, Christian]
[Voß, Thomas]
Speeding Up Many-Objective Optimization by Monte Carlo Approximations
In: Artificial Intelligence [204], 22–29
Journal Article
2011Friedrich, Tobias
[Bringmann, Karl]
[Voss, Thomas]
[Igel, Christian]
The Logarithmic Hypervolume Indicator
In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, 81-92
Proceedings Article
2
Hide details for Iliopoulos, Costas S. (ed.)Iliopoulos, Costas S. (ed.)
2011[Arumugam, S.]
[Chandrasekar, K. Raja]
[Misra, Neeldhara]
Philip, Geevarghese
[Saurabh, Saket]
Attachment IconAlgorithmic Aspects of Dominator Colorings in Graphs
In: Combinatorial Algorithms - 22nd International Workshop, IWOCA 2011, Victoria, BC, Canada, July 20-22, 2011, Revised Selected Papers, 19-30
Proceedings Article
2011[Fernau, Henning]
[Fomin, Fedor V.]
[Lokshtanov, Daniel]
[Mnich, Matthias]
Philip, Geevarghese
[Saurabh, Saket]
Attachment IconRanking and Drawing in Subexponential Time
In: Combinatorial Algorithms - 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers,
Proceedings Article
1
Hide details for Imai, Hiroshi (ed.)Imai, Hiroshi (ed.)
1990Klein, R.
Mehlhorn, Kurt
Meiser, Stefan
On the Construction of Abstract Voronoi Diagrams, II
In: Algorithms (ISA-90) : 1st international symposium (SIGAL-90), 138-154
Proceedings Article
1
Hide details for Imai, H. (ed.)Imai, H. (ed.)
1999Krysta, Piotr
Solis-Oba, Roberto
Approximation algorithms for bounded facility location
In: Proceedings of the 5th Annual International Conference on Computing and Combinatorics (COCOON-99), 241-250
Proceedings Article
1
Hide details for Immich, StefanImmich, Stefan
2001Immich, StefanBerechnung der Momente von quadratischen Komplexen
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Immorlica, Nicole (ed.)Immorlica, Nicole (ed.)
2013Hoefer, Martin
[Wagner, Lisa]
Designing Profit Shares in Matching and Coalition Formation Games
In: 9th Conference on Web and Internet Economics (WINE-13), 249-262
Proceedings Article
1
Hide details for Imreh, CsanádImreh, Csanád
2002[Epstein, Leah]
Imreh, Csanád
[van Stee, Rob]
More on weighted servers or FIFO is better than LRU
In: Mathematical Foundations of Computer Science 2002 : 27th International Symposium, MFCS 2002, 257-268
Proceedings Article
2
Hide details for Indyk, PiotrIndyk, Piotr
1997Gasieniec, Leszek
[Indyk, Piotr]
Efficient Parallel Computing with Memory Faults
In: Proceedings of the 11th Symposium on Fundamentals of Computation Theory (FCT-97), 188-197
Proceedings Article
1997Gasieniec, Leszek
Indyk, Piotr
Krysta, Piotr
External inverse pattern matching
In: Proceedings of the 8th Symposium on Combinatorial Pattern Matching (CPM-97), 90-101
Proceedings Article
1
Hide details for Inenaga, ShunsukeInenaga, Shunsuke
2013[Bannai, Hideo]
Gawrychowski, Pawel
[Inenaga, Shunsuke]
[Takeda, Masayuki]
Converting SLP to LZ78 in almost Linear Time
In: Combinatorial Pattern Matching, 24th Annual Symposium (CPM 2013), 38-49
Proceedings Article
1
Hide details for Ingalalli, VijayIngalalli, Vijay
2011Ingalalli, VijayEvolutionary algorithms to compute lower bounds for the star discrepancy
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Ingólfsdóttir, Anna (ed.)Ingólfsdóttir, Anna (ed.)
2008Christodoulou, George
[Kovács, Annamária]
[Schapira, Michael]
Bayesian Combinatorial Auctions
In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I, 820-832
Proceedings Article
4
Hide details for Irving, Robert W.Irving, Robert W.
2007[Abraham, David J.]
[Irving, Robert W.]
[Kavitha, Telikepalli]
Mehlhorn, Kurt
Attachment IconPopular Matchings
In: SIAM Journal on Computing [37], 1030-1045
Journal Article
2006[Irving, Robert W.]
[Telikepalli, Kavitha]
Mehlhorn, Kurt
Michail, Dimitrios
[Paluch, Katarzyna]
Attachment IconRank-Maximal Matchings
In: ACM Transactions on Algorithms [2], 602-610
Journal Article
2005Abraham, David
[Irving, Robert W.]
Mehlhorn, Kurt
Telikepalli, Kavitha
Attachment IconPopular Matchings
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 424-432
Proceedings Article
2004Mehlhorn, Kurt
Michail, Dimitrios
Telikepalli, Kavitha
[Irving, Robert W.]
[Paluch, Katarzyna]
Attachment IconRank-Maximal Matchings
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 68-75
Proceedings Article
1
Hide details for Isopi, MarcIsopi, Marc
2013[Clementi, Andrea]
[Crescenzi, Pierluigi]
Doerr, Carola
[Fraigniaud, Pierre]
[Isopi, Marc]
[Panconesi, Alessandro]
[Pasquale, Francesco]
[Silvestri, Riccardo]
Rumor Spreading in Random Evolving Graphs
In: Proc. of the 21st European Symposium on Algorithms (ESA 2013), 325-336
Proceedings Article
1
Hide details for Issac, DavisIssac, Davis
2015Issac, DavisSampling in Space Restricted Settings
In: Computing and Combinatorics 2015,
Proceedings Article
3
Hide details for Istrail, Sorin (ed.)Istrail, Sorin (ed.)
2000Althaus, Ernst
Kohlbacher, Oliver
Lenhof, Hans-Peter
Müller, Peter
A Combinatorial Approach to Protein Docking with Flexible Side-Chains
In: Proceedings of the 4th Annual International Conference on Computational Molecular Biology (RECOMB-00), 15-24
Proceedings Article
1999Burkhardt, Stefan
Crauser, Andreas
[Ferragina, Paolo]
Lenhof, Hans-Peter
[Rivals, Eric]
[Vingron, Martin]
q-gram Based Database Searching Using a Suffix Array (QUASAR)
In: Proceedings of the 3rd Annual International Conference on Computational Molecular Biology (RECOMB-99), 77-83
Proceedings Article
1998Lenhof, Hans-Peter
Reinert, Knut
[Vingron, Martin]
A polyhedral approach to RNA sequence structure alignment
In: Proceedings of the 2nd Annual International Conference on Computational Molecular Biology (RECOMB-98), 153-162
Proceedings Article
1
Hide details for Italiano, GiuseppeItaliano, Giuseppe
1998[Alberts, David]
[Cattaneo, G]
[Italiano, Giuseppe]
[Nanni, Umberto]
Zaroliagis, Christos
A Software Library of Dynamic Graph Algorithms
In: Proceedings of Workshop on Algorithms and Experiments (ALEX-98), 129-136
Proceedings Article
13
Hide details for Italiano, Giuseppe F. (ed.)Italiano, Giuseppe F. (ed.)
2013[Curticapean, Radu]
Künnemann, Marvin
A Quantization Framework for Smoothed Analysis of Euclidean Optimization Problems
In: 21st Annual European Symposium on Algorithms (ESA 2013), 349-360
Proceedings Article
2013Khosla, MeghaBalls into Bins Made Faster
In: Algorithms - ESA 2013,
Proceedings Article
2006Mehlhorn, KurtReliable and Efficient Geometric Computing
In: Algorithms and Complexity : 6th Italian Conference, CIAC 2006, 1-2
Proceedings Article
2006Kovács, AnnamáriaTighter Approximation Bounds for LPT Scheduling in Two Special Cases
In: Algorithms and Complexity : 6th Italian Conference, CIAC 2006, 187-198
Proceedings Article
2005Elbassioni, Khaled M.
Fishkin, Aleksei V.
Mustafa, Nabil H.
Sitters, Rene
Approximation algorithms for Euclidean Group TSP
In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, 1115-1126
Proceedings Article
2005Kovács, AnnamáriaPolynomial Time Preemptive Sum-Multicoloring on Paths
In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, 840-852
Proceedings Article
2005Kaligosi, Kanela
Mehlhorn, Kurt
[Munro, J. Ian]
[Sanders, Peter]
Attachment IconTowards Optimal Multiple Selection
In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, 103-114
Proceedings Article
2004Dementiev, Roman
Kettner, Lutz
Mehnert, Jens
Sanders, Peter
Engineering a Sorted List Data Structure for 32 Bit Key
In: Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics (ALENEX-04), 142-151
Proceedings Article
1998Solis-Oba, Roberto2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 441-452
Proceedings Article
1998[Frigioni, Daniele]
Miller, Tobias
[Nanni, Umberto]
[Pasqualone, Giulio]
Schäfer, Guido
Zaroliagis, Christos
An experimental study of dynamic algorithms for directed graphs
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 368-380
Proceedings Article
1998Chong, Ka Wong
Ramos, Edgar A.
Improved deterministic parallel padded sorting
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 405-416
Proceedings Article
1998Bradford, Phillip Gnassi
[Golin, Mordecai J.]
[Larmore, Lawrence L.]
[Rytter, Wojciech]
Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 43-54
Proceedings Article
1998Meyer, Ulrich
Sanders, Peter
$\Delta$-Stepping: A Parallel Single Source Shortest Path Algorithm
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 393-404
Proceedings Article
4
Hide details for Italiano, Giuseppe (ed.)Italiano, Giuseppe (ed.)
2013[Anshelevich, Elliot]
[Bhardwaj, Onkar]
Hoefer, Martin
Friendship and Stable Matching.
In: 21st European Symposium on Algorithms (ESA-13), 49-60
Proceedings Article
1997Miller, Tobias
Zaroliagis, Christos
A First Experimental Study of a Dynamic Transitive Closure Algorithm
In: Proceedings of the Workshop on Algorithm Engineering (WAE-97), 64-73
Proceedings Article
Next Page