| BibTeX cite key | Author/Editor | Year | | Title | Type |
|---|
| 2006CTW_Propp | Doerr, Benjamin
Friedrich, Tobias | 2006 |  | Quasirandomness in Graphs
In: Electronic Notes in Discrete Mathematics [25], 61-64 | Journal Article |
| 2011STOC | Doerr, Benjamin
Fouz, Mahmoud
Friedrich, Tobias | 2011 | | Social Networks Spread Rumors in Sublogarithmic Time
In: STOC'11 : Proceedings of the 43rd ACM Symposium on Theory of Computing, 21-30 | Proceedings Article |
| a15-kavitha | Kavitha, Telikepalli
Mehlhorn, Kurt
Michail, Dimitrios
Paluch, Katarzyna E. | 2007 | | Strongly stable matchings in time O(nm) and extension to the hospitals-residents problem
In: ACM Transactions on Algorithms [3], 15.1-15.18 | Journal Article |
| Abed2012 | Abed, Fidaa
Huang, Chien-Chung | 2012 | | Preemptive Coordination Mechanisms for Unrelated Machines
In: Algorithms - ESA 2012 : 20th Annual European Symposium, 12-23 | Proceedings Article |
| Abraham2007Popular | Abraham, David J.
Irving, Robert W.
Kavitha, Telikepalli
Mehlhorn, Kurt | 2007 | | Popular Matchings
In: SIAM Journal on Computing [37], 1030-1045 | Journal Article |
| ACMM04 | Abraham, David
Cechlárová, Katarina
Manlove, David F.
Mehlhorn, Kurt | 2004 | | Pareto-optimality in house allocation problems
In: Algorithms and Computation: 15th International Symposium, ISAAC 2004, 3-15 | Proceedings Article |
| ACO-P2012 | Panagiotou, Konstantinos
Coja-Oghlan, Amin | 2012 | | Catching the k-NAESAT Threshold
In: STOC’12 : Proceedings of the 2012 ACM Symposium on Theory of Computing, 899-907 | Proceedings Article |
| ACS-TR-121108-01 | Eigenwillig, Arno
Kettner, Lutz
Wolpert, Nicola | 2007 | | Snap Rounding of Bézier Curves | Report |
| ACS-TR-121202-01 | Berberich, Eric
Hemmer, Michael | 2006 | | Prototype implementation of the algebraic kernel | Report |
| ACS-TR-121202-01 | Berberich, Eric
Hemmer, Michael
Karavelas, Menelaos
Pion, Sylvain
Teillaud, Monique
Tsigaridas, Elias | 2008 | | Prototype implementation of the algebraic kernel | Report |
| ACS-TR-123101-01 | Berberich, Eric
Hemmer, Michael
Karavelas, Menelaos
Pion, Sylvain
Teillaud, Monique
Tsigaridas, Elias | 2006 | | Interface specification of algebraic kernel | Report |
| ACS-TR-241402-01 | Hemmer, Michael
Dupont, Laurent
Petitjean, Sylvain
Schömer, Elmar | 2008 | | Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangment of Quadrics | Report |
| ACS-TR-241405-03 | Hemmer, Michael
Hülse, Dominik | 2007 | | Traits classes for polynomial gcd computation over algebraic extensions | Report |
| ACS-TR-243306-03 | Hemmer, Michael
Limbach, Sebastian | 2007 | | Benchmarks on a generic univariate algebraic kernel | Report |
| ACS-TR-243400-04 | Hemmer, Michael | 2008 | | CGAL package: Algebraic Foundations | Report |
| acs-tr-243404-03 | Kerber, Michael | 2008 | | On filter methods in CGAL's 2D curved kernel | Report |
| ACS-TR-243406-01 | Hemmer, Michael | 2008 | | CGAL package for modular arithmetic operations | Report |
| ACS-TR-361502-02 | Mehlhorn, Kurt
Osbild, Ralf
Sagraloff, Michael | 2008 | | A General Approach to the Analysis of Controlled Perturbation Algorithms | Report |
| ACS-TR-361502-03 | Mehlhorn, Kurt
Sagraloff, Michael | 2008 | | A deterministic Bitstream Descartes Algorithm | Report |
| ACS-TR-363501-01 | Hemmer, Michael | 2008 | | Evaluation of different approaches in 3D curved kernel for arrangements of quadrics | Report |
| acs-tr-363602-01 | Emeliyanenko, Pavel
Kerber, Michael | 2008 | | An implementation of the 2D Algebraic Kernel | Report |
| ACS-TR-363602-02 | Emiris,Ioannis
Hemmer, Michael
Karavelas, Menelaos
Limbach, Sebastian
Mourrain, Bernard
Tsigaridas, Elias
Zafeirakopoulos,Zafeirakis | 2008 | | Cross-benchmarks of univariate algebraic kernels | Report |
| ACS-TR-363603-01 | Emiris, Ioannis
Hemmer, Michael
Tsigaridas, Elias
Tzoumas, Georg | 2008 | | Voronoi diagram of ellipses: CGAL-based implementation | Report |
| ACS-TR-363606-01 | Hemmer, Michael
Limbach, Sebastian | 2008 | | Arrangements of quadrics in 3D: continued work on experimental implementation | Report |
| acs-tr-363608-02 | Emeliyanenko, Pavel
Kerber, Michael | 2008 | | Visualizing and Exploring Planar Algebraic Arrangements - a Web Application | Report |
| acstr123109-01 | Funke, Stefan
Klein, Christian
Mehlhorn, Kurt
Schmitt, Susanne | 2006 | | Controlled Perturbation for Delaunay Triangulations | Report |
| acs:bcw-carc-07 | Berberich, Eric
Caroli, Manuel
Wolpert, Nicola | 2007 | | Exact Computation of Arrangements of Rotated Conics | Report |
| acs:bek-dffbiaq-06 | Berberich, Eric
Ebert, Franziska
Kettner, Lutz | 2006 | | Definition of file format for benchmark instances for arrangements of Quadrics | Report |
| acs:bek-wbipca-06 | Berberich, Eric
Ebert, Franziska
Fogel, Efi
Kettner, Lutz | 2006 | | Web-site with benchmark instances for planar curve arrangements | Report |
| acs:bfhmw-smtaoq-07 | Berberich, Eric
Fogel, Efi
Halperin, Dan
Mehlhorn, Kurt
Wein, Ron | 2007 | | Sweeping and Maintaining Two-Dimensional Arrangements on Quadrics | Report |
| acs:bfm-uwibaqpac-07 | Berberich, Eric
Fogel, Efi
Meyer, Andreas | 2007 | | Updated Website to include Benchmark Instances for Arrangements of Quadrics and Planar Algebraic Curves | Report |
| acs:bh-dtqkc-07 | Berberich, Eric
Hemmer, Michael | 2007 | | Definition of the 3D Quadrical Kernel Content | Report |
| acs:bhkt-risak-06 | Berberich, Eric
Hemmer, Michael
Karavelas, Menelaos I.
Teillaud, Monique | 2007 | | Revision of interface specification of algebraic kernel | Report |
| acs:bm-ceq-07 | Berberich, Eric
Meyerovitch, Michal | 2007 | | Computing Envelopes of Quadrics | Report |
| acs:tr123203-04-08 | Berberich, Eric
Emeliyanenko, Pavel | 2008 | | CGAL's Curved Kernel via Analysis | Report |
| ACTAI::BeckerM1986 | Becker, Michael
Mehlhorn, Kurt | 1986 | | Algorithms for Routing in Planar Graphs
In: Acta Informatica [23], 163-176 | Journal Article |
| AdamaszekWiese2013 | Adamaszek, Anna
Wiese, Andreas | 2013 | | Approximation Schemes for Maximum Weight Independent Set of Rectangles
In: Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2013), | Proceedings Article |
| addobj07 | Brockhoff, Dimo
Friedrich, Tobias
Hebbinghaus, Nils
Klein, Christian
Neumann, Frank
Zitzler, Eckart | 2007 | | Do Additional Objectives Make a Problem Harder?
In: Genetic and Evolutionary Computation Conference 2007, 765-772 | Proceedings Article |
| ADHP2009 | Angelopoulos, Spyros
Doerr, Benjamin
Huber, Anna
Panagiotou, Konstantinos | 2009 | | Tight bounds for quasirandom rumor spreading
In: The Electronic Journal of Combinatorics [16], R102,1-R102,19 | Electronic Journal Article |
| ADKMNT03:dominance | Althaus, Ernst
Duchier, Denys
Koller, Alexander
Mehlhorn, Kurt
Niehren, Joachim
Thiel, Sven | 2003 | | An Efficient Algorithm for the Configuration Problem of Dominance Graphs
In: Journal of Algorithms [48], 194-219 | Journal Article |
| ADKMNT2001 | Althaus, Ernst
Duchier, Denys
Koller, Alexander
Mehlhorn, Kurt
Niehren, Joachim
Thiel, Sven | 2001 | | An Efficient Algorithm for the Configuration Problem of Dominance Graphs
In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), 815-824 | Proceedings Article |
| ADLO:08.listupdate | Angelopoulos, Spyros
Dorrigiv, Reza
Lopez-Ortiz, Alejandro | 2008 | | List Update with Locality of Reference
In: 8th Latin American Symposium on Theoretical Informatics (LATIN 2008), 399-410 | Proceedings Article |
| AEFM2004 | Althaus, Ernst
Eisenbrand, Friedrich
Funke, Stefan
Mehlhorn, Kurt | 2004 | | Point Containment in the Integer Hull of a Polyhedron
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 929-933 | Proceedings Article |
| af-hemmer-2007 | Hemmer, Michael | 2007 | | Algebraic Foundations, CGAL - Computational Geometry Algorithms Library, release 3.3 | Manual |
| AF10 | Ajwani, Deepak
Friedrich, Tobias | 2010 | | Average-case Analysis of Incremental Topological Ordering
In: Discrete Applied Mathematics [158], 240-250 | Journal Article |
| AFHKRS05 | Althaus, Ernst
Funke, Stefan
Har-Peled, Sariel
Könemann, Jochen
Ramos, Edgar A.
Skutella, Martin | 2005 | | Approximating k-Hop Minimum-Spanning Trees
In: Operations Research Letters [33], 115-120 | Journal Article |
| AFM06 | Ajwani, Deepak
Friedrich, Tobias
Meyer, Ulrich | 2006 | | An $O(n^2.75)$ algorithm for online topological ordering
In: Algorithm theory - SWAT 2006 : 10th Scandinavian Workshop on Algorithm Theory, 53-64 | Proceedings Article |
| AFM08 | Ajwani, Deepak
Friedrich, Tobias
Meyer, Ulrich | 2008 | | An $O(n^2.75)$ algorithm for incremental topological ordering
In: ACM Transactions on Algorithms [4], 1-14 | Journal Article |
| AFNPS02 | Andreou, Maria
Fotakis, Dimitris
Nikoletseas, Sotiris
Papadopoulou, Vicky
Spirakis, Paul G. | 2002 | | On Radiocoloring Hierarchically Specified Planar Graphs: PSPACE-Completeness and Approximations
In: Mathematical Foundations of Computer Science 2002 : 27th International Symposium, MFCS 2002, 81-92 | Proceedings Article |
| Afshani2013 | Afshani, Peyman
Agrawal, Manindra
Doerr, Benjamin
Doerr, Carola
Larsen, Kasper Green
Mehlhorn, Kurt | 2013 | | The Query Complexity of Finding a Hidden Permutation
In: Space-Efficient Data Structures, Streams, and Algorithms, 1-11 | Part of a Book |
| AfshaniADGLMW12eccc | Afshani, Peyman
Agrawal, Manindra
Doerr, Benjamin
Green Larsen, Kasper
Mehlhorn, Kurt
Winzen, Carola | 2012 | | 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 |
| Agarwal03 | Agarwal, Amit
Agarwal, Tarun
Chopra, Sumit
Feldmann, Anja
Kammenhuber, Nils
Krysta, Piotr
Vöcking, Berthold | 2003 | | 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 |
| Agarwal99 | Agarwal, Pankaj
Arge, Lars
Brodal, Gerth Stølting
Vitter, Jeffrey Scott | 1999 | | I/O-Efficient Dynamic Point Location in Monotone Subdivisions
In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), 11-20 | Proceedings Article |
| AGHSTW98 | Alefragis, Panayiotis
Goumopoulos, Christos
Sanders, Peter
Takkula, Tuomo
Wedelin, Dag | 1998 | | Parallel Crew Scheduling in PAROS
In: Proceedings of the 4th International Euro-Par Conference (Euro-Par-98), 1104-1113 | Proceedings Article |
| AGMN97 | Alberts, David
Gutwenger, Carsten
Mutzel, Petra
Näher, Stefan | 1997 | | AGD-Library: A Library of Algorithms for Graph Drawing
In: Proceedings of the Workshop on Algorithm Engineering (WAE-97), 112-123 | Proceedings Article |
| Ahuja-Mehlhorn-Orlin-Tarjan/90 | Ahuja, Ravindra K.
Mehlhorn, Kurt
Orlin, James B.
Tarjan, Robert E. | 1990 | | Faster algorithms for the shortest path problem
In: Journal of the ACM [37], 213-223 | Journal Article |
| AIJMR09 | Amaldi, Edoardo
Iuliano, Claudio
Jurkiewicz, Tomasz
Mehlhorn, Kurt
Rizzi, Romeo | 2009 | | Breaking the $O(m^2n)$ Barrier for Minimum Cycle Bases
In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, 301-312 | Proceedings Article |
| AIKM05 | Abraham, David
Irving, Robert W.
Mehlhorn, Kurt
Telikepalli, Kavitha | 2005 | | Popular Matchings
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 424-432 | Proceedings Article |
| Ailon2012 | Ailon, Nir
Avigdor-Elgrabli, Noa
Liberty, Edo
van Zuylen, Anke | 2012 | | Improved Approximation Algorithms for Bipartite Correlation Clustering
In: SIAM Journal on Computing [41], 1110-1121 | Journal Article |
| AilonESA2011 | Ailon, Nir
Avigdor-Elgrabli, Noa
Liberty, Noa
van Zuylen, Anke | 2011 | | Improved Approximation Algorithms for Bipartite Correlation Clustering
In: Algorithms - ESA 2011 : 19th Annual European Symposium, 25-36 | Proceedings Article |
| Ajwani05 | Ajwani, Deepak | 2005 | | Design, Implementation and Experimental Study of External Memory BFS Algorithms
Universität des Saarlandes | Thesis - Masters thesis |
| Ajwani06 | Ajwani, Deepak
Dementiev, Roman
Meyer, Ulrich | 2006 | | A computational study of external memory BFS algorithms
In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06, 601-610 | Proceedings Article |
| Ajwani07 | Ajwani, Deepak
Meyer, Ulrich
Osipov, Vitaly | 2007 | | Improved external memory BFS implementations
In: 9th Workshop on Algorithm Engineering and Experiments (ALENEX), 3-12 | Proceedings Article |
| Ajwani2012 | Ajwani, Deepak
Elbassioni, Khaled
Govindarajan, Sathish
Ray, Saurabh | 2012 | | Conflict-free coloring for rectangle ranges using O(n .382) colors
In: Discrete & Computational Geometry [48], 39-52 | Journal Article |
| AjwaniMeyerOsipov2009 | Ajwani, Deepak
Meyer, Ulrich
Osipov, Vitaly | 2009 | | Breadth first search on massive graphs
In: The shortest path problem : ninth DIMACS implemenation challenge, 291-307 | Part of a Book |
| AkbariBS2012 | Akbari, Hoda
Berenbrink, Petra
Sauerwald, Thomas | 2012 | | A simple approach for adapting continuous load balancing processes to discrete settings
In: PODC'12 : Proceedings of the 2012 ACM Symposium on Principles of Distributed Computing, 271-280 | Proceedings Article |
| AKL+2000 | Althaus, Ernst
Kohlbacher, Oliver
Lenhof, Hans-Peter
Müller, Peter | 2000 | | 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 |
| AKX08 | Albrecht, Marc
Karrenbauer, Andreas
Xu, Chihao | 2008 | | A clipper-free Algorithm for efficient HW-Implementation of local dimming LED-Backlight
In: Proceedings of the 28th International Display Research Conference (IDRC), 286-289 | Proceedings Article |
| Albers-et-al95 | Albers, Susanne
von Stengel, Bernhard
Wechner, Ralph | 1995 | | A combined BIT and TIMESTAMP algorithm for the list update problem
In: Information Processing Letters [56], 135-139 | Journal Article |
| Albers-Koga95 | Albers, Susanne
Koga, Hisashi | 1995 | | Page migration with limited local memory capacity
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 412-158 | Proceedings Article |
| Albers1998a | Albers, Susanne | 1998 | | A competitive analysis of the list update problem with lookahead
In: Theoretical Computer Science [197], 95-109 | Journal Article |
| Albers1998b | Albers, Susanne | 1998 | | Improved randomized on-line algorithms for the list update problem
In: SIAM Journal on Computing [27], 682-693 | Journal Article |
| Albers1999 | Albers, Susanne | 1999 | | Online-Algorithmen
Universität des Saarlandes | Thesis - Habilitation thesis |
| Albers2000 | Albers, Susanne | 1999 | | Better bounds for online scheduling
In: SIAM Journal on Computing [29], 459-473 | Journal Article |
| Albers95 | Albers, Susanne | 1995 | | Improved randomized on-line algorithms for the list update problem
In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95), 412-419 | Proceedings Article |
| Albers96 | Albers, Susanne
Mitzenmacher, Michael | 1996 | | Average Case Analysis of List Update Algorithms, with Applications to Data Compression
In: Automata, Languages and Programming: 23rd International Colloquium (ICALP'96), 514-525 | Proceedings Article |
| Albers97a | Albers, Susanne | 1997 | | Better Bounds for Online Scheduling
In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC-97), 130-139 | Proceedings Article |
| Albers97b | Albers, Susanne | 1997 | | On the Influence of Lookahead in Competitive Paging Algorithms
In: Algorithmica [18], 283-305 | Journal Article |
| AlbersAroraKhanna1999 | Albers, Susanne
Arora, Sanjeev
Khanna, Sanjeev | 1999 | | Page replacement for general caching problems
In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), 31-40 | Proceedings Article |
| AlbersCharikarMitzenmacher1998 | Albers, Susanne
Charikar, Moses
Mitzenmacher, Michael | 1998 | | On delayed information and action in on-line algorithms
In: Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science (FOCS-98), 71-80 | Proceedings Article |
| AlbersGargLeonardi1998 | Albers, Susanne
Garg, Naveen
Leonardi, Stefano | 1998 | | 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 |
| AlbersGargLeonardi2000 | Albers, Susanne
Garg, Naveen
Leonardi, Stefano | 2000 | | Minimizing stall time in single and parallel disk systems
In: Journal of the ACM [47], 969-986 | Journal Article |
| AlbersHagerup97 | Albers, Susanne
Hagerup, Torben | 1997 | | Improved Parallel Integer Sorting without Concurrent Writing
In: Information and Computation [136], 25-51 | Journal Article |
| AlbersHenzinger97 | Albers, Susanne
Henzinger, Monika R. | 1997 | | Exploring Unknown Environments
In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC-97), 416-425 | Proceedings Article |
| AlbersKoga1998 | Albers, Susanne
Koga, Hisashi | 1998 | | New on-line algorithms for the page replication problem
In: Journal of Algorithms [27], 75-96 | Journal Article |
| AlbersKursaweSchuierer1999 | Albers, Susanne
Kursawe, Klaus | 1999 | | Exploring unknown environments with obstacles
In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), 842-843 | Proceedings Article |
| AlbersMitzenmacher1998a | Albers, Susanne
Mitzenmacher, Michael | 1998 | | Average case analyses of list update algorithms, with applications to data compression
In: Algorithmica [21], 312-329 | Journal Article |
| AlbersMitzenmacher1998b | Albers, Susanne
Mitzenmacher, Michael | 1998 | | Average case analyses of First-Fit and Random-Fit bin packing
In: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-98), 290-299 | Proceedings Article |
| AlbersMitzenmacher97 | Albers, Susanne
Mitzenmacher, Michael | 1997 | | Revisiting the COUNTER algorithms for list update
In: Information Processing Letters [64], 155-160 | Journal Article |
| AlbersWestbrook1998 | Albers, Susanne
Westbrook, Jeffery | 1998 | | Self-organizing data structures
In: Online Algorithms: The State of the Art, 13-51 | Part of a Book |
| Albers/Mitzenmacher/2000 | Albers, Susanne
Mitzenmacher, Michael | 2000 | | Average-Case Analyses of First Fit and Random Fit Bin Packing
In: Random Structures & Algorithms [16], 240 - 259 | Journal Article |
| Alberts-et-al-98 | Alberts, David
Cattaneo, G
Italiano, Giuseppe
Nanni, Umberto
Zaroliagis, Christos | 1998 | | A Software Library of Dynamic Graph Algorithms
In: Proceedings of Workshop on Algorithms and Experiments (ALEX-98), 129-136 | Proceedings Article |
| Albrecht:1987:PAA | Albrecht, Jung, Mehlhorn (ed.) | 1987 | | Parallel algorithms and architectures (WPAA-87) : international workshop | Proceedings |
| Albrecht:1987:PAA | Albrecht, Jung, Mehlhorn (ed.) | 1987 | | Parallel algorithms and architectures : International Workshop | Proceedings |
| Albrecht:1987:PAAa | Alt, Helmut
Hagerup,Torben
Mehlhorn, Kurt
Preparata, Franco P. | 1987 | | Deterministic Simulation of Idealized Parallel Computers on more Realistic Ones
In: Parallel Algorithms and Architectures : International Workshop, 11-15 | Proceedings Article |
| AlcarayFKKMPB2012 | Alcaraz, Nicolas
Friedrich, Tobias
Kötzing, Timo
Krohmer, Anton
Müller, Joachim
Pauling, Josch
Baumbach, Jan | 2012 | | Efficient key pathway mining: combining networks and OMICS data
In: Integrative Biology [4], 756-764 | Journal Article |
| ALGOR::FleischerMRWY1992 | Fleischer, Rudolf
Mehlhorn, Kurt
Rote, Günter
Welzl, Emo
Yap, Chee-Keng | 1992 | | Simultaneous Inner and Outer Approximation of Shapes
In: Algorithmica [8], 365-389 | Journal Article |
| ALGOR::MehlhornN1990 | Mehlhorn, Kurt
Näher, Stefan | 1990 | | Dynamic Fractional Cascading
In: Algorithmica [5], 215-241 | Journal Article |
| ALGOR::MehlhornPS1986 | Mehlhorn, Kurt
Preparata, Franco P.
Sarrafzadeh, Maji | 1986 | | Channel Routing in Knock-Knee Mode: Simplified Algorithms and Proofs
In: Algorithmica [1], 213-221 | Journal Article |
| ALKM2001 | Althaus, Ernst
Kohlbacher, Oliver
Lenhof, Hans-Peter
Müller, Peter | 2002 | | A combinatorial approach to protein docking with flexible side chains
In: Journal of Computational Biology [9], 597-612 | Journal Article |
| ALNA2008 | Althaus, Ernst
Naujoks, Rouven | 2008 | | Reconstructing Phylogenetic Networks with One Recombination
In: Experimental Algorithms, 7th International Workshop, WEA 2008, 275-288 | Proceedings Article |
| ALOH:08.soft | Angelopoulos, Spyros
Lopez-Ortiz, Alejandro
Hamel,Angele | 2008 | | Optimal Scheduling of Contract Algorithms with Soft Deadlines
In: 23rd National Conference on Artificial Intelligence (AAAI 2008), 868-873 | Proceedings Article |
| AlPoVa2003-lpimprove | Althaus, Ernst
Polzin, Tobias
Vahdati Daneshmand, Siavash | 2003 | | Improving Linear Programming Approaches for the Steiner Tree Problem
In: Experimental and efficient algorithms : Second International Workshop, WEA 2003, 1-14 | Proceedings Article |
| Alt02/87 | Alt, Helmut
Mehlhorn, Kurt
Wagener, Hubert
Welzl, Emo | 1987 | | Congruence, similarity and symmetries of geometric objects | Report |
| AltCan2008 | Althaus, Ernst
Canzar, Stefan | 2008 | | LASA: A tool for non-heuristic alignment of multiple sequences
In: Bioinformatics Research and Development (BIRD’08), 489-498 | Proceedings Article |
| AltCanJOC08 | Althaus, Ernst
Canzar, Stefan | 2008 | | A Lagrangian relaxation approach for the multiple sequence alignment problem
In: Journal of Combinatorial Optimization [16], 127-154 | Journal Article |
| AltCanKar08 | Althaus, Ernst
Canzar, Stefan
Emmett, Mark
Karrenbauer, Andreas
Marshall, Alan
Meyer-Bäse, Anke
Zhang, Huimin | 2008 | | Computing H/D-exchange speeds of single residues from data of peptic fragments
In: 23rd Annual ACM Symposium on Applied Computing (SAC), 1273-1277 | Proceedings Article |
| AltGuibasMehlhornKarp96 | Alt, Helmut
Guibas, L.
Mehlhorn, Kurt
Karp, Richard M.
Wigderson, A. | 1996 | | A Method for Obtaining Randomized Algorithms with Small Tail Probabilities
In: Algorithmica [16], 543-547 | Journal Article |
| Althaus-et-al:experimental-curve | Althaus, Ernst
Mehlhorn, Kurt
Näher, Stefan
Schirra, Stefan | 2000 | | Experiments on curve reconstruction
In: Proceedings of 2nd Workshop on Algorithm Engineering and Experiments (ALENEX-00), 103-114 | Electronic Proceedings Article |
| althaus-mehlhorn98 | Althaus, Ernst
Mehlhorn, Kurt | 1998 | | Maximum Network Flow with Floating Point Arithmetic
In: Information Processing Letters [66], 109-113 | Journal Article |
| Althaus1998 | Althaus, Ernst | 1998 | | Berechnung optimaler Steinerbäume in der Ebene
Universität des Saarlandes | Thesis - Masters thesis |
| Althaus2001d | Althaus, Ernst | 2001 | | Curve Reconstruction and the Traveling Salesman Problem
Universität des Saarlandes | Thesis - PhD thesis |
| Althaus2002 | Althaus, Ernst
Bockmayr, Alexander
Elf, Matthias
Kasper, Thomas
Jünger, Michael
Mehlhorn, Kurt | 2002 | | SCIL - Symbolic Constraints in Integer Linear Programming.
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 75-87 | Proceedings Article |
| Althaus2002a | Althaus, Ernst
Fink, Christian | 2002 | | A Polyhedral Approach to Surface Reconstruction from Planar Contours.
In: Proceedings of the 9th International Conference on Integer Programming and Combinatorial Optimization, 258-272 | Proceedings Article |
| Althaus2002b | Althaus, Ernst
Caprara, Alberto
Lenhof, Hans-Peter
Reinert, Knut | 2002 | | Multiple sequence alignment with arbitrary gap costs: Computing an optimal solution using polyhedral combinatorics
In: Proceedings of the European Conference on Computational Biology (ECCB 2002), S4-S16 | Proceedings Article |
| Althaus2003 | Althaus, Ernst
Calinescu, Gruia
Mandoiu, Ion
Prasad, Sushil
Tchervenski, Nickolay
Zelikovsly, Alexander | 2003 | | Power Efficient Range Assignment in Ad-hoc Wireless
In: Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC-03), 1889-1894 | Proceedings Article |
| Althaus2004 | Althaus, Ernst
Karamanis, Nikiforos
Koller, Alexander | 2004 | | Computing Locally Coherent Discourses.
In: Proceedings of the conference and workshops, 42nd annual meeting of the Association for Computational Linguistics, 399-406 | Proceedings Article |
| Althaus2006 | Althaus, Ernst
Calinescu, Gruia
Mandoiu, Ion
Prasad, Sushil
Tchervenski, Nickolay
Zelikovsly, Alexander | 2006 | | Power efficient range assignment for symmetric connectivity in static ad-hoc wireless networks
In: Wireless Networks [12], 287-299 | Journal Article |
| Althaus2006 | Althaus, Ernst
Caprara, Alberto
Lenhof, Hans-Peter
Reinert, Knut | 2006 | | Aligning multiple sequences by cutting planes
In: Mathematical Programming [2006], 387-425 | Journal Article |
| [Replication or Save Conflict] |  | | | | |
| Althaus2007 | Althaus, Ernst
Canzar, Stefan | 2007 | | A Lagrangian relaxation approach for the multiple sequence alignment problem
In: Combinatorial Optimization and Applications : First International Conference, COCOA 2007, 267-278 | Proceedings Article |
| Althaus2007a | Althaus, Ernst
Baumann, Tobias
Schömer, Elmar
Werth, Kai | 2007 | | Trunk Packing Revisited
In: Experimental Algorithms, 6th International Workshop, 420-432 | Proceedings Article |
| Althaus2011 | Althaus, Ernst
Kupilas, Joschka
Naujoks, Rouven | 2011 | | On the Low-Dimensional Steiner Minimum Tree Problem in Hamming Metric
In: Theory and Applications of Models of Computation : 8th Annual Conference, TAMC 2011, 308-319 | Proceedings Article |
| AlthausD09 | Althaus, Ernst
Dumitriu, Daniel | 2009 | | Fast and Accurate Bounds on Linear Programs
In: Experimental Algorithms : 8th International Symposium on Experimental Algorithms (SEA 2009), 40-50 | Proceedings Article |
| AlthausMehlhorn1999 | Althaus, Ernst
Mehlhorn, Kurt | 2000 | | TSP-Based Curve Reconstruction in Polynomial Time
In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00), 686-695 | Proceedings Article |
| AltMeh2001j | Althaus, Ernst
Mehlhorn, Kurt | 2001 | | Traveling Salesman-Based Curve Reconstruction in Polynomial Time
In: SIAM Journal on Computing [31], 27-66 | Journal Article |
| AlvarezBCS12 | Alvarez, Victor
Bringmann, Karl
Curticapean, Radu
Ray, Saurabh | 2012 | | Counting Crossing Free Structures
In: Proceedings of the Twenty-Eight Annual Symposium on Computational Geometry (SCG'12), 61-68 | Proceedings Article |
| AlvarezBRS13 | Alvarez, Victor
Bringmann, Karl
Ray, Saurabh
Seidel, Raimund | 2013 | | Counting Triangulations Approximately
In: 25th Canadian Conference on Computational Geometry (CCCG-13), 85-89 | Proceedings Article |
| AmaldiIulianoetal009 | Amaldi, Edoardo
Iuliano, Claudio
Jurkiewicz, Tomasz
Mehlhorn, Kurt
Rizzi, Romeo | 2009 | | Breaking the $O(m^2n)$ Barrier for Minimum Cycle Bases
In: Algorithms - ESA 2009 : 17th Annual European Symposium, 301-312 | Proceedings Article |
| AmbalathBalasundaramHKoppulaMisraPhilipRamanujan2010 | Ambalath, Abhimanyu M.
Balasundaram, Radheshyam
H., Chintan Rao
Koppula, Venkata
Misra, Neeldhara
Philip, Geevarghese
Ramanujan, M. S. | 2010 | | On 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 |
| AmGoRa01 | Ramos, Edgar A.
Amato, Nancy M.
Goodrich, Michael T. | 2001 | | A Randomized Algorithm for Triangulating a Simple Polygon in Linear Time
In: Discrete and Computational Geometry [26], 246-265 | Journal Article |
| Amini2009a | Amini, Omid
Pérennes, Stéphane
Sau, Ignasi | 2009 | | Hardness and approximation of traffic grooming
In: Theoretical Computer Science [410], 3751-3760 | Journal Article |
| Aminietal2009 | Amini, Omid
Peleg, David
Pérennes, Stéphane
Sau, Ignasi
Saurabh, Saket | 2009 | | Degree-Constrained Subgraph Problems: Hardness and Approximation Results
In: Approximation and Online Algorithms : 6th International Workshop, WAOA 2008, 29-42 | Proceedings Article |
| AMM2005 | Arya, Sunil
Malamatos, Theocharis
Mount, David M. | 2005 | | Space-Time Tradeoffs for Approximate Spherical Range Counting
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 535-544 | Proceedings Article |
| AMM2006a | Arya, Sunil
Malamatos, Theocharis
Mount, David M. | 2006 | | On the Importance of Idempotence
In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, STOC'06, 564-573 | Proceedings Article |
| AMM2006b | Arya, Sunil
Malamatos, Theocharis
Mount, David M. | 2006 | | The Effect of Corners on the Complexity of Approximate Range Searching
In: Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06, 11-20 | Proceedings Article |
| AMTZ03 | Arge, Lars
Meyer, Ulrich
Toma, Laura
Zeh, Norbert | 2003 | | On external-memory planar depth first search
In: Journal of Graph Algorithms and Applications [7], 105-129 | Journal Article |
| Anagnostopoulos2013 | Anagnostopoulos, Aris
Grandoni, Fabrizio
Leonardi, Stefano
Wiese, Andreas | 2013 | | 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 |
| AnandBFGK13 | Anand, S
Bringmann, Karl
Friedrich, Tobias
Garg, Naveen
Kumar, Amit | 2013 | | Minimizing maximum (weighted) flow-time on related and unrelated machines
In: Automata, Languages, and Programming - 40th International Colloquium (ICALP-13), 13-24 | Proceedings Article |
| AnderssonHagerupetal2000 | Andersson, Arne
Hagerup, Torben
Hastad, Johan
Petersson, Ola | 2000 | | Tight bounds for searching a sorted array of strings
In: SIAM Journal on Computing [30], 1552-1578 | Journal Article |
| Angelopoulos2007SODA1 | Angelopoulos, Spyros | 2007 | | Improved bounds for the online steiner tree problem in graphs of bounded edge-asymmetry
In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, 248-257 | Proceedings Article |
| Angelopoulos2007SODA2 | Angelopoulos, Spyros
Dorrigiv, Reza
López-Ortiz, Alejandro | 2007 | | On the separation and equivalence of paging strategies
In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, 229-237 | Proceedings Article |
| Angelopoulos.Borodin:randomized.2010 | Angelopoulos, Spyros
Borodin, Allan | 2010 | | Randomized Priority Algorithms
In: Theoretical Computer Science [411], 2542-2558 | Journal Article |
| Angelopoulos:wads2009 | Angelopoulos, Spyros | 2009 | | Online Priority Steiner Tree Problems
In: Algorithms and Data Structures : 11th International Symposium, WADS 2009, 37-48 | Proceedings Article |
| Angelopoulos:waoa2009 | Angelopoulos, Spyros | 2010 | | On the Competitiveness of the Online Asymmetric and Euclidean Steiner Tree Problems
In: Approximation and Online Algorithms : 7th International Workshop, WAOA 2009, 1-12 | Proceedings Article |
| AngLop:ijcai09 | Angelopoulos, Spyros
Lopez-Ortiz, Alejandro | 2009 | | Intertruptible Algorithms for Multi Problem Solving
In: Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI 09), 380-386 | Proceedings Article |
| AngSch:2009.bijective | Angelopoulos, Spyros
Schweitzer, Pascal | 2009 | | Paging and List Update under Bijective Analysis
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 1136-1145 | Proceedings Article |
| Ang:08.steiner | Angelopoulos, Spyros | 2008 | | A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry
In: 16th Annual European Symposium on Algorithms (ESA 2008), 76-87 | Proceedings Article |
| AnshelevichBH2013 | Anshelevich, Elliot
Bhardwaj, Onkar
Hoefer, Martin | 2013 | | Friendship and Stable Matching.
In: 21st European Symposium on Algorithms (ESA-13), 49-60 | Proceedings Article |
| AntGECCO07 | Doerr, Benjamin
Neumann, Frank
Sudholt, Dirk
Witt, Carsten | 2007 | | On the Runtime Analysis of the 1-ANT ACO algorithm
In: Genetic and Evolutionary Computation Conference 2007, 33-40 | Proceedings Article |
| approxMestre2010 | Hajiaghayi, MohammadTaghi
Khandekar, Rohit
Kortsarz, Guy
Mestre, Julian | 2010 | | 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 |
| Arikati-Chaudhuri-Zaroliagis-98 | Arikati, Srinivasa Rao
Chaudhuri, Shiva
Zaroliagis, Christos | 1998 | | All-Pairs Min-Cut in Sparse Networks
In: Journal of Algorithms [29], 82-110 | Journal Article |
| Arikati-et-al95 | Arikati, Srinivasa Rao
Chaudhuri, Shiva
Zaroliagis, Christos | 1995 | | All-Pairs Min-Cut in Sparse Networks
In: Foundations of software technology and theoretical computer science (FSTTCS-95) : 15th conference, 363-376 | Proceedings Article |
| Arikati-et-al96 | Arikati, Srinivasa Rao
Dessmark, Anders
Lingas, Andrzej
Marathe, Madhav V. | 1996 | | Approximation algorithms for maximum two-dimensional pattern matching
In: Combinatorial Pattern Matching: 7th Annual Symposium, CPM96, 348-360 | Proceedings Article |
| Arikati-Maheshwari96 | Arikati, Srinivasa Rao
Maheshwari, Anil | 1996 | | Realizing degree sequences in parallel
In: SIAM Journal of Computing [9], 317-338 | Journal Article |
| Arikati-Mehlhorn | Arikati, Srinivasa Rao
Mehlhorn, Kurt | 1999 | | A correctness certificate for the Stoer-Wagner min-cut algorithm
In: Information Processing Letters [70], 251-254 | Journal Article |
| ArikatiDessmarketal2001 | Arikati, Srinivasa Rao
Dessmark, Anders
Lingas, Andrzej
Marathe, Madhav V. | 2001 | | Approximation algorithms for maximum two-dimensional pattern matching
In: Theoretical Computer Science [255], 51-62 | Journal Article |
| ArikatiMaheshwariZaroliagis97 | Arikati, Srinivasa Rao
Maheshwari, Anil
Zaroliagis, Christos | 1997 | | Efficient Computation of implicit representations of sparse graphs
In: Discrete Applied Mathematics [78], 1-16 | Journal Article |
| AritProg2001 | Doerr, Benjamin
Srivastav, Anand | 2001 | | Multi-Color Discrepancy of Arithmetic Progressions
In: Electronic Notes in Discrete Mathematics [8], 27-30 | Journal Article |
| ArMeTo04 | Arge, Lars
Meyer, Ulrich
Toma, Laura | 2004 | | External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs
In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, 146-157 | Proceedings Article |
| ArMeToZe2001 | Arge, Lars
Meyer, Ulrich
Toma, Laura
Zeh, Norbert | 2001 | | On External-Memory Planar Depth First Search
In: Proceedings of the 7th International Workshop on Algorithms and Data Structures (WADS-01), 471-482 | Proceedings Article |
| arumugamchandrasekarmisraphilipsaurabh2011 | Arumugam, S.
Chandrasekar, K. Raja
Misra, Neeldhara
Philip, Geevarghese
Saurabh, Saket | 2011 | | Algorithmic 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 |
| Arya-Mount-Narayan95 | Arya, Sunil
Mount, David M.
Narayan, Oruttom | 1995 | | Accounting for boundary effects in nearest neighbor searching
In: 11th Annual ACM Symposium on Computational Geometry (SCG95), 336-344 | Proceedings Article |
| Arya-Mount-Narayan96 | Arya, Sunil
Mount, David M.
Narayan, Oruttom | 1996 | | Accounting for boundary effects in nearest neighbor searching
In: Discrete & Computational Geometry [16], 155-176 | Journal Article |
| Arya-Mount95 | Arya, Sunil
Mount, David M. | 1995 | | Approximate range searching
In: 11th Annual ACM Symposium on Computational Geometry (SCG95), 172-181 | Proceedings Article |
| Arya-Smid95 | Arya, Sunil
Das, Gautam
Mount, David M.
Salowe, Jeffrey S.
Smid, Michiel | 1995 | | Euclidean spanners: short, thin, and lanky
In: 27th Annual ACM Symposium on Theory of Computing (STOC95), 489-498 | Proceedings Article |
| Arya-Smid96 | Arya, Sunil
Smid, Michiel | 1997 | | Efficient construction of a bounded degree spanner with low weight
In: Algorithmica [17], 33-54 | Journal Article |
| AryaMount2000 | Arya, Sunil
Mount, David M. | 2000 | | Approximate range searching
In: Computational Geometry [17], 135-152 | Journal Article |
| Ashoff2000 | Ashoff, Oliver | 2000 | | Agorithmen der modularen Arithmetik
Universität des Saarlandes | Thesis - Masters thesis |
| ASS12 | Agrawal, Manindra
Saha, Chandan
Saxena, Nitin | 2012 | | Quasi-polynomial Hitting-set for Set-depth-Delta Formulas
In: arXiv [abs/1209.2333], 1-13 | Electronic Journal Article |
| ASSS12 | Agrawal, Manindra
Saha, Chandan
Saptharishi, Ramprasad
Saxena, Nitin | 2012 | | Jacobian hits circuits: hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits
In: STOC'12 : Proceedings of the 2012 ACM Symposium on Theory of Computing, 599-614 | Proceedings Article |
| AugerD11 | Auger, Doerr (ed.) | 2011 | | Theory of Randomized Search Heuristics | Book |
| AulettaDinitzNutuvDomenico1999 | Auletta, Vincenzo
Dinitz, Yefim
Nutov, Zeev
Parente, Domenico | 1999 | | A 2-approximation algorithm for finding an optimum 3-vertex-connected spanning subgraph
In: Journal of Algorithms [32], 21-30 | Journal Article |
| avgFPTsubmitted | Fountoulakis, Nikolaos
Friedrich, Tobias
Hermelin, Danny | 2011 | | Average Case Parameterized Complexity | Unpublished/Draft |
| BachBecker2012 | Becker, Ruben | 2012 | | The Bolzano Method to Isolate the Roots of a Bitstream Polynomial
Universität des Saarlandes | Thesis - Bachelor thesis |
| BachCaroli06 | Caroli, Manuel | 2006 | | Exakte Arrangement-Berechnung gedrehter Quadratischer Kurven
Universität des Saarlandes | Thesis - Bachelor thesis |
| BachEbert05 | Ebert, Franziska | 2005 | | Benchmark Data Sets for Conic Arrangements
Universität des Saarlandes | Thesis - Bachelor thesis |
| BachFouz06 | Fouz, Mahmoud | 2006 | | Hereditary Discrepancy in Different Numbers of Colors
Universität des Saarlandes | Thesis - Bachelor thesis |
| BachrachEl-YanivReinstädtler2002 | Bachrach, Ran
El-Yaniv, Ran
Reinstädtler, Martin | 2002 | | On the competitive theory and practice of online list accessing algorithms
In: Algorithmica [32], 201-246 | Journal Article |
| BachSchmitt06 | Schmitt, Daniel | 2006 | | Implementierung einer Überlagerungvon konvexen Arrangements der Kugeloberfläche
Universität des Saarlandes | Thesis - Bachelor thesis |
| BachSteurer06 | Steurer, David | 2006 | | Tight Bounds on the Min-Max Boundary Decomposition Cost of Weighted Graphs
Universität des Saarlandes | Thesis - Bachelor thesis |
| Bacik-Mahajan95 | Bacik, Roman
Mahajan, Sanjeev | 1995 | | Semidefinite programming and its applications to NP problems
In: Computing and Combinatorics: 1st Annual International Conference (COCOON95), 566-575 | Proceedings Article |
| Backes1998Diplom | Backes, Werner | 1998 | | Berechnung kürzester Gittervektoren
Univesität des Saarlandes | Thesis - Masters thesis |
| BaGiePa2007 | Miklos, Balint
Giesen, Joachim
Pauly, Mark | 2007 | | Medial 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 |
| Banderier-LNCS1853-2000 | Banderier, Cyril | 2000 | | Planar Maps and Airy Phenomena,
In: Proceedings of ICALP'00, 388-402 | Proceedings Article |
| Banderier1999a | Banderier, Cyril | 1999 | | An Introduction to Analytic Number Theory | Miscellaneous |
| Banderier1999b | Banderier, Cyril | 1999 | | On Generating Functions of Generating Trees
In: Proceedings of FPSAC'99, 40-52 | Proceedings Article |
| Banderier2000 | Banderier, Cyril | 2000 | | A Generalized Cover Time for Random Walks on Graphs
In: Proceedings of FPSAC'00, 113-124 | Proceedings Article |
| Banderier2001_2 | Banderier, Cyril | 2001 | | Random Maps, Coalescing Saddles, Singularity Analysis, and Airy Phenomena
In: Random Structures & Algorithms [19], 194-246 | Journal Article |
| Banderier2001_3 | Banderier, Cyril
Bousquet-Mélou, Mireille
Denise, Alain
Flajolet, Philippe
Gardy, Danièle
Gouyou-Beauchamps, Dominique | 2002 | | Generating Functions for Generating Trees
In: Discrete Mathematics [246], 29-55 | Journal Article |
| Banderier2001_T | Banderier, Cyril | 2001 | | Combinatoire Analytique des chemins et des cartes
Université de Paris 6 | Thesis - PhD thesis |
| Banderier2002 | Banderier, Cyril
Flajolet, Philippe | 2002 | | Basic analytic combinatorics of directed lattice paths
In: Theoretical Computer Science [281], 37-80 | Journal Article |
| Bansal2010 | Bansal, Nikhil
Gupta, Anupam
Li, Jian
Mestre, Julián
Nagarajan, Viswanath
Rudra, Atri | 2010 | | 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 |
| Bar-YehudaHermelinRawitz2011 | Bar-Yehuda, Reuven
Hermelin, Danny
Rawitz, Dror | 2011 | | Minimum vertex cover in rectangle graphs
In: Computational Geometry [44], 356-364 | Journal Article |
| BaraqueDipl02 | Baraque, Raef | 2002 | | Effiziente Multiplikationsverfahren: ein numerischer Vergleich
Universität des Saarlandes | Thesis - Masters thesis |
| BarnesEdmondsSIAMJCOMPUT1998 | Barnes, Greg
Edmonds, Jeff A. | 1998 | | Time-Space Lower Bounds for Directed st-Connectivity on Graph Automata Models
In: SIAM Journal on Computing [27], 1190-1202 | Journal Article |
| Baruah:2010 | Baruah, Sanjoy
Bonifaci, Vincenzo
Marchetti-Spaccamela, Alberto
Stiller, Sebastian | 2010 | | Improved Multiprocessor Global Schedulability Analysis
In: Real-Time Systems [46], 3-24 | Journal Article |
| Basit2010 | Basit, Abdul
Mustafa, Nabil H.
Ray, Saurabh
Raza, Sarfraz | 2010 | | Centerpoints and Tverberg's technique
In: Computational Geometry [43], 593-600 | Journal Article |
| Bast-Hagerup95 | Bast, Hannah
Hagerup, Torben | 1995 | | Fast Parallel Space Allocation, Estimation, and Integer Sorting
In: Information and Computation [123], 72-110 | Journal Article |
| bast04selfstar | Bast, Holger | 2004 | | Dimension Reduction: A Powerful Principle for Automatically Finding Concepts in Unstructured Data
In: International Workshop on Self-* Properties in Complex Information Systems (SELF-STAR 2004), 113-116 | Proceedings Article |
| bast04stacs | Bast, Holger
Mehlhorn, Kurt
Schäfer, Guido
Tamaki, Hisao | 2004 | | Matching Algorithms Are Fast in Sparse Random Graphs
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 81-92 | Proceedings Article |
| bast05hz | Bast, Holger | 2005 | | Präzisionssuche im homöopathischen Netz
In: Homöopathie-Zeitschrift [I/05], 119-122 | Journal Article |
| Bast1998 | Bast, Hannah | 1998 | | Dynamic Scheduling with Incomplete Information
In: Proceedings of the 10th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-98), 182-191 | Proceedings Article |
| Bast2000b | Bast, Hannah | 2000 | | On Scheduling Parallel Tasks at Twilight
In: Theory of Computing Systems [33], 489-563 | Journal Article |
| Bast2002a | Bast, Hannah | 2002 | | Scheduling at Twilight the Easy Way
In: STACS 2002 : 19th Annual Symposium on Theoretical Aspects of Computer Science, 166-178 | Proceedings Article |
| Bast2006b | Bast, Holger | 2006 | | Intelligente Suche mit garantiert schnellen Antwortzeiten
In: MPG Jahrbuch [?], | Electronic Journal Article |
| Bast2009 | Bast, Hannah | 2009 | | Car or Public Transport -- Two Worlds
In: Efficient Algorithms : Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday, 355-367 | Part of a Book |
| Bast94 | Bast, Hannah | 1994 | | Fast Parallel Space Allocation, Estimation and Integer Sorting
Universität des Saarlandes | Thesis - Masters thesis |
| bastcelikik2009sac | Celikik, Marjan
Bast, Holger | 2009 | | Fast Error-Tolerant Search on Very Large Texts
In: The 24th Annual ACM Symposium on Applied Computing, 1724-1731 | Proceedings Article |
| bastcelikikmanolache2009-snippets | Celikik, Marjan
Bast, Holger
Manolache, Gabriel | 2011 | | Efficient Index-Based Snippet Generation | Unpublished/Draft |
| BastDH92 | Bast, Holger
Dietzfelbinger, Martin
Hagerup, Torben | 1992 | | A Perfect Parallel Dictionary
In: 17th International Symposium on Mathematical Foundations of Computer Science (MFCS'92), 133-141 | Proceedings Article |
| BastDMP06 | Bast, Holger
Dupret, Georges
Majumdar, Debapriyo
Piwowarski, Benjamin | 2006 | | 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 |
| bastetal06spire | Bast, Holger
Mortensen, Christian Worm
Weber, Ingmar | 2006 | | Output-Sensitive Autocompletion Search
In: String Processing and Information Retrieval : 13th International Conference, SPIRE 2006, 150-162 | Proceedings Article |
| bastetal07sigir | Bast, Holger
Chitea, Alexandru
Suchanek, Fabian
Weber, Ingmar | 2007 | | ESTER: Efficient Search in Text, Entities, and Relations
In: 30th International Conference on Research and Development in Information Retrieval (SIGIR'07), 671-678 | Proceedings Article |
| BastFM06 | Bast, Holger
Funke, Stefan
Matijevic, Domagoj | 2006 | | TRANSIT: Ultrafast Shortest-Path Queries with Linear-Time Preprocessing
In: 9th DIMACS Implementation Challenge --- Shortest Path, | Electronic Proceedings Article |
| BastFMSS07 | Bast, Holger
Funke, Stefan
Matijevic, Domagoj
Sanders, Peter
Schultes, Dominik | 2007 | | In Transit to Constant Time Shortest-Path Queries in Road Networks
In: 9th Workshop on Algorithm Enginneering and Experiments (ALENEX'07), 46-59 | Proceedings Article |
| BastFunkeMatjevic2009 | Bast, Holger
Funke, Stefan
Matijevic, Domagoj | 2009 | | Ultrafast shortest-path queries via transit nodes
In: The shortest path problem : ninth DIMACS implemenation challenge, 175-192 | Part of a Book |
| BastH91 | Bast, Holger
Hagerup, Torben | 1991 | | Fast and Reliable Parallel Hashing
In: 3rd Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'91), 50-61 | Proceedings Article |
| bastmajumdar05sigir | Bast, Holger
Majumdar, Debapriyo | 2005 | | Why Spectral Retrieval Works
In: 28th Annual International Conference on Research and Development in Information Retrieval (SIGIR'05), 11-18 | Proceedings Article |
| BastMSTW2006a | Bast, Holger
Majumdar, Debapriyo
Schenkel, Ralf
Theobald, Martin
Weikum, Gerhard | 2006 | | IO-Top-k: Index-Access Optimized Top-k Query Processing
In: Proceedings of the 32nd International Conference on Very Large Data Bases, VLDB 2006, 475-486 | Proceedings Article |
| BastMSTW2006trec | Bast, Holger
Majumdar, Debapriyo
Schenkel, Ralf
Theobald, Martin
Weikum, Gerhard | 2006 | | IO-Top-k at TREC 2006: Terabyte Track
In: The Fifteenth Text Retrieval Conference Proceedings, TREC 2006, 1-5 | Electronic Proceedings Article |
| BastMW07 | Bast, Holger
Majumdar, Debapriyo
Weber, Ingmar | 2007 | | Efficient interactive query expansion with CompleteSearch
In: 16th Conference on Information and Knowledge Management (CIKM'07), 857-860 | Proceedings Article |
| BastPhD2000 | Bast, Hannah | 2000 | | Provably Optimal Scheduling of Similar Tasks
Universität des Saarlandes | Thesis - PhD thesis |
| bastweber05wea | Bast, Holger
Weber, Ingmar | 2005 | | Don't Compare Averages
In: 4th International Workshop on Efficient and Experimental Algorithms (WEA'05), 67-76 | Proceedings Article |
| bastweber05wiri | Bast, Holger
Weber, Ingmar | 2005 | | Insights from Viewing Ranked Retrieval as Rank Aggregation
In: Workshop on Challenges in Web Information Retrieval and Integration (WIRI'05), 243-248 | Proceedings Article |
| bastweber06faceted | Bast, Holger
Weber, Ingmar | 2006 | | When You're Lost For Words: Faceted Search With Autocompletion
In: SIGIR'06 Workshop on Faceted Search, 31-35 | Proceedings Article |
| bastweber06sigir | Bast, Holger
Weber, Ingmar | 2006 | | Type 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 |
| bastweber07cidr | Bast, Holger
Weber, Ingmar | 2007 | | The CompleteSearch Engine: Interactive, Efficient, and Towards IR & DB integration
In: CIDR 2007 : 3rd Biennial Conference on Innovative Data Systems Research, 88-95 | Electronic Proceedings Article |
| bastweber07gwem | Bast, Holger
Weber, Ingmar | 2007 | | Managing Helpdesk Tasks with CompleteSearch: A Case Study
In: 4th Conference on Professional Knowledge Management (WM'07), 101-108 | Proceedings Article |
| Baswana2004b | Baswana, Surender
Sen, Sandeep | 2004 | | Randomized graph data-structures for approximate shortest path problem
In: Handbook of Data Structures and Applications, 38.1-38.19 | Part of a Book |
| BaswanaEtal2005 | Baswana, Surender
Telikepalli, Kavitha
Mehlhorn, Kurt
Pettie, Seth | 2005 | | New Constructions of (alpha, beta)-Spanners and Purely Additive Spanners
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 672-681 | Proceedings Article |
| BaswanaSen2007 | Baswana, Surender
Sen, Sandeep | 2007 | | A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
In: Random Structures & Algorithms [30], 532-563 | Journal Article |
| BatraSharma2010 | Batra, Prashant
Sharma, Vikram | 2010 | | Bounds on absolute positiveness of multivariate polynomials
In: Journal of Symbolic Computation [45], 617-628 | Journal Article |
| Baumann2004 | Baumann, Nadine
Köhler, Ekkehard | 2004 | | Approximating Earliest Arrival Flows with Flow-Dependent Transit Times
In: Mathematical foundations of computer science 2004 : 29th International Symposium, MFCS 2004, 599-610 | Proceedings Article |
| BaumbachFKKMP2011 | Baumbach, Jan
Friedrich, Tobias
Kötzing, Timo
Krohmer, Anton
Müller, Joachim
Pauling, Josch | 2012 | | Efficient algorithms for extracting biological key pathways with global constraints
In: GECCO'12 : Proceedings of the Fourteenth International Conference on
Genetic and Evolutionary Computation, 169-176 | Proceedings Article |
| BausDipl05 | Baus, Andreas | 2005 | | Symbolic Constraints in Linear Integer Programming
Universität des Saarlandes | Thesis - Masters thesis |
| Baus/Diplom04 | Baus, Andreas | 2004 | | Symbolic Constraints in Linear Integer Programming
Universität des Saarlandes | Thesis - Masters thesis |
| BBDFKN09 | Baswana, Surender
Biswas, Somenath
Doerr, Benjamin
Friedrich, Tobias
Kurur, Piyush P.
Neumann, Frank | 2009 | | 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 |
| BBP:SCG98 | Brönnimann, Hervé
Burnikel, Christoph
Pion, Sylvain | 1998 | | Interval analysis yields efficient dynamic filters for computational geometry
In: Proceedings of the 14th International Annual ACM Symposium on Computational Geometry (SCG-98), 165-174 | Proceedings Article |
| BCMP1999 | Brengel, Klaus
Crauser, Andreas
Meyer, Ulrich
Ferragina, Paolo | 1999 | | An Experimental Study of Priority Queues in External Memory
In: Algorithm engineering (WAE-99) : 3rd International Workshop, WAE'99, 345-359 | Proceedings Article |
| BCT03:SweepSynchro | Beldiceanu, Nicolas
Carlsson, Mats
Thiel, Sven | 2003 | | Sweep Synchronization as a Global Propagation Mechanism
In: Fifth International Workshop on Integration of AI and OR Techniques
in Constraint Programming for Combinatorial Optimization Problems, 139-152 | Electronic Proceedings Article |
| BCT2002:SumOfWeights | Beldiceanu, Nicolas
Carlsson, Mats
Thiel, Sven | 2002 | | Cost-Filtering Algorithms for the two Sides of the Sum of Weights of Distinct Values Constraint | Report |
| BCW-ECARC2007 | Berberich, Eric
Caroli, Manuel
Wolpert, Nicola | 2007 | | Exact Computation of Arrangements of Rotated Conics
In: Proceedings of 23rd European Workshop on Computational Geometry, 231-234 | Proceedings Article |
| BDN2010 | Böttcher, Süntje
Doerr, Benjamin
Neumann, Frank | 2010 | | Optimal fixed and adaptive mutation rates for the LeadingOnes problem
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 1-10 | Proceedings Article |
| Becchetti2003 | Becchetti, Luca
Leonardi, Stefano
Marchetti-Spaccamela, Alberto
Schäfer, Guido | 2003 | | Scheduling to minimize flow time metrics
In: International Parallel and Distributed Processing Symposium (IPDPS-03), 223b-CDROM | Proceedings Article |
| Becker2011 | Christodoulou, George
Mehlhorn, Kurt
Pyrga, Evangelia | 2011 | | Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms
In: Algorithms - ESA 2011 : 19th Annual European Symposium, 119-130 | Proceedings Article |
| Becker96 | Becker, Jörg | 1996 | | Allgemeine approximative Kongruenz zweier Punktmengen im R³
Universität des Saarlandes | Thesis - Masters thesis |
| beef-ecscaca-04 | Berberich, 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 | 2004 | | An Empirical Comparison of Software for Constructing Arrangements of Curved Arcs | Report |
| behhms-cbcabocp-2002 | Berberich, Eric
Eigenwillig, Arno
Hemmer, Michael
Hert, Susan
Mehlhorn, Kurt
Schömer, Elmar | 2002 | | A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 174-186 | Proceedings Article |
| Behle2007 | Behle, Markus | 2007 | | On threshold BDDs and the optimal variable ordering problem
In: Combinatorial Optimization and Applications : First International Conference, COCOA 2007, 124-135 | Proceedings Article |
| Behle2007A | Behle, Markus
Jünger, Michael
Liers, Frauke | 2007 | | A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem
In: Experimental Algorithms : 6th International Workshop, WEA 2007, 379-392 | Proceedings Article |
| Behrens2000 | Behrens, Christian | 2000 | | Solid Modeling durch Boolesche Operationen
Universität des Saarlandes | Thesis - Masters thesis |
| Bei2015 | Bei, Xiaohui | 2015 | | Solving 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 |
| Beier2000 | Beier, Rene | 2000 | | Eine Heuristik für das Gossiping-Problem
Universität des Saarlandes | Thesis - Masters thesis |
| Beier2003 | Beier, Rene
Vöcking, Berthold | 2003 | | Random Knapsack in Expected Polynomial Time
In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC-03), 232-241 | Proceedings Article |
| Beier2003a | Banderier, Cyril
Beier, Rene
Mehlhorn, Kurt | 2003 | | Smoothed Analysis of Three Combinatorial Problems
In: Mathematical foundations of computer science 2003 : 28th International Symposium, MFCS 2003, 198-207 | Proceedings Article |
| Beier2004a | Beier, Rene
Vöcking, Berthold | 2004 | | Probabilistic Analysis of Knapsack Core Algorithms
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 461-470 | Proceedings Article |
| Beier2004b | Beier, Rene
Krysta, Piotr
Czumaj, Artur
Vöcking, Berthold | 2004 | | Computing Equilibria for Congestion Games with (Im)perfect Information
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 739-748 | Proceedings Article |
| Beier2004c | Beier, Rene
Vöcking, Berthold | 2004 | | Typical Properties of Winners and Losers in Discrete Optimization
In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC-04), 343-352 | Proceedings Article |
| Beier2004e | Beier, René
Vöcking, Berthold | 2004 | | Random knapsack in expected polynomial time
In: Journal of Computer and System Sciences [69], 306-329 | Journal Article |
| Beier2006 | Beier, René
Vöcking, Berthold | 2006 | | Typical Properties of Winners and Losers in Discrete Optimization
In: SIAM Journal on Computing [35], 855-881 | Journal Article |
| Beier2006b | Beier, René
Vöcking, Berthold | 2006 | | An Experimental Study of Random Knapsack Problems
In: Algorithmica [45], 121-136 | Journal Article |
| Beier2006c | Beier, René
Czumaj, Artur
Krysta, Piotr
Vöcking, Berthold | 2006 | | Computing Equilibria for a Service Provider Game with (Im)perfect Information
In: ACM Transactions on Algorithms [2], 679-706 | Journal Article |
| Beier2007 | Beier, René
Röglin, Heiko
Vöcking, Berthold | 2007 | | The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
In: Integer Programming and Combinatorial Optimization : 12th International IPCO Conference, 53-67 | Proceedings Article |
| Beier2011 | Beier, Rene
Funke, Stefan
Matijevic, Domagoj
Sanders, Peter | 2011 | | Energy-Efficient Paths in Radio Networks
In: Algorithmica [61], 298-319 | Journal Article |
| BeierDiss04 | Beier, Rene | 2004 | | Probabilistic Analysis of Discrete Optimization Problems
Universität des Saarlandes | Thesis - PhD thesis |
| BeierSibeyn00 | Beier, Rene
Sibeyn, Jop F. | 2000 | | A powerful heuristic for telephone gossiping
In: Proceedings of the 7th International Colloquium on Structural Information and Communication Complexity (SIROCCO-00), 17-36 | Proceedings Article |
| BeinFleischerLarmore2000 | Bein, Wolfgang W.
Fleischer, Rudolf
Larmore, Lawrence L. | 2000 | | Limited bookmark randomized online algorithms for the paging problem
In: Information Processing Letters [76], 155-162 | Journal Article |
| BEKS:GEOTOP:2011 | Berberich, Eric
Emeliyanenko, Pavel
Kobel, Alexander
Sagraloff, Michael | 2012 | | Exact Symbolic-Numeric Computation of Planar Algebraic Curves
In: arXiv [abs/1201.1548v1], 1-46 | Electronic Journal Article |
| beks:snc:2011 | Berberich, Eric
Emeliyanenko, Pavel
Kobel, Alexander
Sagraloff, Michael | 2011 | | Arrangement Computation for Planar Algebraic Curves
In: Proceedings of the 4th Internal Workshop on Symbolic-Numeric Computation, 88-98 | Proceedings Article |
| beks:snc:2011a | Berberich, Eric
Emeliyanenko, Pavel
Kobel, Alexander
Sagraloff, Michael | 2011 | | Arrangement Computation for Planar Algebraic Curves
In: arXiv [abs/1103.4697], | Electronic Journal Article |
| BeldiceanuKatrielThiel2004 | Beldiceanu, Nicolas
Katriel, Irit
Thiel, Sven | 2004 | | Filtering algorithms for the Same and UsedBy constraints | Report |
| Ben-Asher-Schuster-Sibeyn95 | Ben-Asher, Y.
Schuster, Assaf
Sibeyn, Jop F. | 1995 | | Load balancing: A programmer's approach or the impact of task-length parameter on the load balancing performance of parallel programs
In: International Journal on High-Speed Computing [7], 303-326 | Journal Article |
| BenZwiHermelinLokshtanovNewman2011 | Ben-Zwi, Oren
Hermelin, Danny
Lokshtanov, Daniel
Newman, Ilan | 2011 | | Treewidth governs the complexity of target set selection
In: Discrete Optimization [8], 87-96 | Journal Article |
| Berberich05 | Berberich, Eric
Eigenwillig, Arno
Hemmer, Michael
Hert, Susan
Kettner, Lutz
Mehlhorn, Kurt
Reichel, Joachim
Schmitt, Susanne
Schömer, Elmar
Wolpert, Nicola | 2005 | | EXACUS: Efficient and exact algorithms for curves and surfaces
In: 13th Annual European Symposium on Algorithms (ESA 2005), 155-166 | Proceedings Article |
| Berberich2008 | Berberich, Eric | 2008 | | Robust and Efficient Software for Problems in 2.5-Dimensional Non-Linear Geometry - Algorithms and Implementations
Universität des Saarlandes | Thesis - PhD thesis |
| Berberich20131 | Berberich, Eric
Emeliyanenko, Pavel
Kobel, Alexander
Sagraloff, Michael | 2013 | | Exact symbolic–numeric computation of planar algebraic curves
In: Theoretical Computer Science [491], 1-32 | Journal Article |
| Berenbrink2011 | Berenbrink, Petra
Hoefer, Martin
Sauerwald, Thomas | 2011 | | Distributed Selfish Load Balancing on Networks
In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 1487-1497 | Proceedings Article |
| Berenbrink2011b | Berenbrink, Petra
Cooper, Colin
Friedetzky, Tom
Friedrich, Tobias
Sauerwald, Thomas | 2011 | | Randomized Diffusion for Indivisible Loads
In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 429-439 | Proceedings Article |
| BerenbrinkEFNS11 | Berenbrink, Petra
Friedetzky, Tom
Elsaesser, Robert
Nagel, Lars
Sauerwald, Thomas | 2011 | | Faster Coupon Collecting via Replication with Applications in Gossiping
In: 36th International Symposium on Mathematical Foundations of Computer Science (MFCS-11), 72-83 | Proceedings Article |
| Berman2003+ | Berman, Piotr
Krysta, Piotr | 2003 | | Optimizing Misdirection
In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 192-201 | Proceedings Article |
| BernasconiPanagiotouSteger2009 | Panagiotou, Konstantinos | 2009 | | The Degree Sequence of Random Graphs from Subcritical Classes
In: Combinatorics, Probability and Computing [18], 647-681 | Journal Article |
| bes-bisolve-2011 | Berberich, Eric
Emeliyanenko, Pavel
Sagraloff, Michael | 2011 | | An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks
In: 2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX), 35-47 | Proceedings Article |
| bes-bisolve-arxiv-2010 | Berberich, Eric
Emeliyanenko, Pavel
Sagraloff, Michael | 2010 | | An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks
In: CoRR [abs/1010.1386], 1-16 | Electronic Journal Article |
| BF08 | Bringmann, Karl
Friedrich, Tobias | 2008 | | 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 |
| BF09a | Bringmann, Karl
Friedrich, Tobias | 2009 | | 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 |
| BF09b | Bringmann, Karl
Friedrich, Tobias | 2009 | | 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 |
| BF2010GECCO | Bringmann, Karl
Friedrich, Tobias | 2010 | | The Maximum Hypervolume Set Yields Near-optimal Approximation
In: 12th annual conference on Genetic and evolutionary computation (GECCO 2010), 511-518 | Proceedings Article |
| BF2010PPSN | Bringmann, Karl
Friedrich, Tobias | 2010 | | Tight Bounds for the Approximation Ratio of the Hypervolume Indicator
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 607-616 | Proceedings Article |
| BFFMSS04 | Funke, Stefan
Mehlhorn, Kurt
Schmitt, Susanne
Burnikel, Christoph
Fleischer, Rudolf
Schirra, Stefan | 2004 | | The LEDA class real number -- extended version | Report |
| bfhks-aos2-2010 | Berberich, Eric
Fogel, Efi
Halperin, Dan
Kerber, Michael
Setter, Ophir | 2010 | | Arrangements on Parametric Surfaces II: Concretizations and Applications
In: Mathematics in Computer Science [4], 67-91 | Journal Article |
| bfhmw-aos1-2010 | Berberich, Eric
Fogel, Efi
Halperin, Dan
Mehlhorn, Kurt
Wein, Ron | 2010 | | Arrangements on Parametric Surfaces I: General Framework and Infrastructure
In: Mathematics in Computer Science [4], 45-66 | Journal Article |
| bfhmw-samtdaosafs-07 | Berberich, Eric
Fogel, Efi
Halperin, Dan
Mehlhorn, Kurt
Wein, Ron | 2007 | | Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step
In: Algorithms - ESA 2007, 15th Annual European Symposium, 645-656 | Proceedings Article |
| BFHW-SMTDAS2007 | Berberich, Eric
Fogel, Efi
Halperin, Dan
Wein, Ron | 2007 | | Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces
In: Proceedings of 23rd European Workshop on Computational Geometry, 223-226 | Proceedings Article |
| BFMS1999 | Burnikel, Christoph
Fleischer, Rudolf
Mehlhorn, Kurt
Schirra, Stefan | 1999 | | Efficient exact geometric computation made easy
In: Proceedings of the 15th Annual Symposium on Computational Geometry (SCG-99), 341-350 | Proceedings Article |
| BFMS2000 | Burnikel, Christoph
Fleischer, Rudolf
Mehlhorn, Kurt
Schirra, Stefan | 2000 | | A strong and easily computable separation bound for arithmetic expressions involving radicals
In: Algorithmica [27], 87-99 | Journal Article |
| BFMSS2001 | Burnikel, Christoph
Funke, Stefan
Mehlhorn, Kurt
Schirra, Stefan
Schmitt, Susanne | 2001 | | A Separation Bound for Real Algebraic Expressions
In: Proceedings of the 9th Annual European Symposium on Algorithms (ESA-01), 254-265 | Proceedings Article |
| BFMZ04 | Brodal, Gerth Stølting
Fagerberg, Rolf
Meyer, Ulrich
Zeh, Norbert | 2004 | | 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 |
| BFN2010 | Berghammer, Rudolf
Friedrich, Tobias
Neumann, Frank | 2010 | | Set-based Multi-Objective Optimization, Indicators, and Deteriorative Cycles
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 495-502 | Proceedings Article |
| BFSS07 | Bast, Holger
Funke, Stefan
Sanders, Peter
Schultes, Dominik | 2007 | | Fast Routing in Road Networks using Transit Nodes
In: Science [316], 566 | Journal Article |
| BGS2005 | Baswana, Surender
Goyal, Vishrut
Sen, Sandeep | 2005 | | All-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 |
| BGT01:non-overlap | Beldiceanu, Nicolas
Guo, Qi
Thiel, Sven | 2001 | | 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 |
| bh-app-00 | Bast, Hannah
Hert, Susan | 2000 | | The Area Partitioning Problem
In: Proceedings of the 12th Annual Canadian Conference on Computational Geometry (CCCG-00), 163-171 | Proceedings Article |
| bhhm-giae-exp-2010 | Berberich, Eric
Hagen, Matthias
Hiller, Benjamin
Moser, Hannes | 2010 | | Experiments
In: Algorithm Engineering : Bridging the Gap between Algorithm Theory and Practice, 325-388 | Part of a Book |
| bhk-ak2-2011 | Berberich, Eric
Hemmer, Michael
Kerber, Michael | 2011 | | 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 |
| bhk-ak2-inria-2010 | Berberich, Eric
Hemmer, Michael
Kerber, Michael | 2010 | | A Generic Algebraic Kernel for Non-linear Geometric Applications | Report |
| bhkp-deconstruct-journal-2012 | Berberich, Eric
Halperin, Dan
Kerber, Michael
Pogalnikova, Roza | 2012 | | Deconstructing Approximate Offsets
In: Discrete & Computational Geometry [48], 964-989 | Journal Article |
| bhkp-minkowksideconstruction-2011 | Berberich, Eric
Halperin, Dan
Kerber, Michael
Pogalnikova, Roza | 2011 | | Deconstructing Approximate Offsets
In: Proceedings of the 27th Annual Symposium on Computational Geometry (SCG'11), 187-196 | Proceedings Article |
| bhkp-minkowksideconstructiondcg-2011a | Berberich, Eric
Halperin, Dan
Kerber, Michael
Pogalnikova, Roza | 2011 | | Deconstructing Approximate Offsets
In: arXiv [abs/1109.2158], | Electronic Journal Article |
| bhkp-reconstruction-eurocg-2010 | Berberich, Eric
Halperin, Dan
Kerber, Michael
Pogalnikova, Roza | 2010 | | Polygonal Reconstruction from Approximate Offsets
In: 26th European Workshop on Computational Geometry : Workshop Proceedings, 65-68 | Electronic Proceedings Article |
| bhksw-eceicpmqic-05 | Berberich, Eric
Hemmer, Michael
Kettner, Lutz
Schömer, Elmar
Wolpert, Nicola | 2005 | | 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 |
| BHTWahlstroem2009 | Böcker, Sebastian
Hüffner, Falk
Truss, Anke
Wahlström, Magnus | 2009 | | A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams
In: Parameterized and Exact Computation : 4th International Workshop, IWPEC 2009, 38-49 | Proceedings Article |
| BiedlKaufmannMutzel1998 | Biedl, Therese
Kaufmann, Michael
Mutzel, Petra | 1998 | | 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 |
| BILLING97 | Lenhof, Hans-Peter | 1997 | | Parallel Protein Puzzle: A New Suite of Protein Docking Tools
In: Forschung und wissenschaftliches Rechnen: Beiträge zum Heinz-Billing-Preis 1996, 31-48 | Part of a Book |
| Birk97 | Birk, Rüdiger | 1997 | | Lösung von Varianten des Post-Office-Problems mit Hilfe von Skip List Range Trees
Universität des Saarlandes | Thesis - Masters thesis |
| BJM97 | Brandenburg, Franz J.
Jünger, Michael
Mutzel, Petra | 1997 | | Algorithmen zum automatischen Zeichnen von Graphen
In: Informatik Spektrum [20], 199-207 | Journal Article |
| bk-aosogo-08 | Berberich, Eric
Kerber, Michael | 2008 | | Arrangements on Surfaces of Genus One: Tori and Dupin Cyclides
In: 24th European Workshop on Computational Geometry - Collection of Abstracts, 209-212 | Proceedings Article |
| bk-eatdc-08 | Berberich, Eric
Kerber, Michael | 2008 | | Exact Arrangements on Tori and Dupin Cyclides
In: Proceedings of the 2008 ACM Symposium on Solid and Physical Modeling, 59-66 | Proceedings Article |
| bk-reorder-07 | Berberich, Eric
Kettner, Lutz | 2007 | | Linear-Time Reordering in a Sweep-line Algorithm for Algebraic Curves Intersecting in a Common Point | Report |
| bks-cgta-2009 | Berberich, Eric
Kerber, Michael
Sagraloff, Michael | 2010 | | An efficient algorithm for the stratification and triangulation of an algebraic surface
In: Computational Geometry: Theory and Applications (CGTA) [43], 257-278 | Journal Article |
| bks-egtaas-08 | Berberich, Eric
Kerber, Michael
Sagraloff, Michael | 2008 | | Exact Geometric-Topological Analysis of Algebraic Surfaces
In: Proceedings of the 24th ACM Symposium on Computational Geometry, 164-173 | Proceedings Article |
| bks-gaoasbopa-08 | Berberich, Eric
Kerber, Michael
Sagraloff, Michael | 2008 | | Geometric Analysis of Algebraic Surfaces Based on Planar Arrangements
In: 24th European Workshop on Computational Geometry - Collection of Abstracts, 29-32 | Proceedings Article |
| bks07 | Doerr, Benjamin
Klein, Christian
Storch, Tobias | 2007 | | Faster Evolutionary Algorithms by Superior Graph Representation
In: First IEEE Symposium on Foundations of Computational Intelligence (FOCI-2007), 245-250 | Proceedings Article |
| Blanchebarbe96 | Blanchebarbe, Markus | 1996 | | Untersuchung zur Implementierung eines parallelen Algorithmus mit guter asymptotischer Laufzeit auf einem Rechner mit verteiltem Speicher und Message-Passing
Universität des Saarlandes | Thesis - Masters thesis |
| BM-CEQ2007 | Berberich, Eric
Meyerovitch, Michal | 2007 | | Computing Envelopes of Quadrics
In: Proceedings of 23rd European Workshop on Computational Geometry, 235-238 | Proceedings Article |
| BMST03 | Bast, Holger
Mehlhorn, Kurt
Schäfer, Guido
Tamaki, Hisao | 2003 | | A Heuristic for Dijkstra's Algorithm With Many Targets and its Use in Weighted Matching Algorithms
In: Algorithmica [36], 75-88 | Journal Article |
| BMST05 | Bast, Holger
Mehlhorn, Kurt
Schäfer, Guido
Tamaki, Hisao | 2006 | | Matching Algorithms are Fast in Sparse Random Graphs
In: Theory of Computing Systems [39], 3-14 | Journal Article |
| BodirskyGroeplJohannsenKang2007a | Bodirsky, Manuel
Gröpl, Clemens
Johannsen, Daniel
Kang, Mihyun | 2007 | | A Direct Decomposition of 3-connected Planar Graphs
In: Séminaire Lotharingien de Combinatoire [B54Ak], 15 | Journal Article |
| BodirskyKutz2007 | Bodirsky, Manuel
Kutz, Martin | 2007 | | Determining the consistency of partial tree descriptions
In: Artificial Intelligence [171], 185-196 | Journal Article |
| Bodlaender-Hagerup95 | Bodlaender, Hans L.
Hagerup, Torben | 1995 | | Parallel Algorithms with Optimal Speedup for Bounded Treewidth
In: Automata, Languages, and Programming: 22nd International Colloquium (ICALP95), 268-279 | Proceedings Article |
| BodlaenderDeogunJansenKloksKratschMüllerTuza98 | Bodlaender, Hans L.
Deogun, Jitender S.
Jansen, Klaus
Kloks, Ton
Kratsch, Dieter
Müller, Haiko
Tuza, Zsolt | 1998 | | Ranking of Graphs
In: SIAM Journal on Discrete Mathematics [11], 168-181 | Journal Article |
| BodlaenderHagerup98 | Bodlaender, Hans L.
Hagerup, Torben | 1998 | | Parallel Algorithms with Optimal Speedup for Bounded Treewidth
In: SIAM Journal on Computing [27], 1725-1746 | Journal Article |
| BogdanSSS2012 | Bogdan, Paul
Sauerwald, Thomas
Stauffer, Alexandre
Sun, He | 2013 | | Balls into Bins via Local Search
In: 24th ACM-SIAM Symposium on Discrete Algorithms (SODA-13), 16-34 | Electronic Proceedings Article |
| BoghossianKohlbacherLenhof1999 | Boghossian, Nicolas Pascal
Kohlbacher, Oliver
Lenhof, Hans-Peter | 1999 | | BALL: Biochemical Algorithms Library
In: Algorithm engineering (WAE-99) : 3rd International Workshop, WAE'99, 330-344 | Proceedings Article |
| Bonifaci2011:b | Bonifaci, Vincenzo
Marchetti-Spaccamela, Alberto | 2012 | | Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems
In: Algorithmica [63], 763-780 | Journal Article |
| Bonifaci2012a | Bonifaci, Vincenzo
Mehlhorn, Kurt
Varma, Girish | 2012 | | Physarum Can Compute Shortest Paths
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 233-240 | Proceedings Article |
| Bonifaci2012b | Bonifaci, Vincenzo
Marchetti-Spaccamela, Alberto
Stiller, Sebastian | 2012 | | A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
In: Algorithmica [62], 1034-1049 | Journal Article |
| Bonifaci2012c | Bonifaci, Vincenzo
Mehlhorn, Kurt
Varma, Girish | 2012 | | Physarum Can Compute Shortest Paths
In: Journal of Theoretical Biology [309], 121-133 | Journal Article |
| Bonifaci2013 | Bonifaci, Vincenzo
Marchetti-Spaccamela, Alberto
Stiller, Sebastian
Wiese, Andreas | 2013 | | Feasibility Analysis in the Sporadic DAG Task Model
In: Proceedings of the 25th Euromicro Conference on Real-Time Systems (ECRTS 2013), | Proceedings Article |
| Bonifaci2013b | Bonifaci, Vincenzo
Marchetti-Spaccamela, Alberto
Megow, Nicole
Wiese, Andreas | 2013 | | Polynomial-Time Exact Schedulability Tests for Harmonic Real-Time Tasks
In: Proceedings of the 34th IEEE Real-Time Systems Symposium (RTSS 2013), | Proceedings Article |
| BonifaciCMM2012 | Bonifaci, Vincenzo
Chan, Ho-Leung
Marchetti-Spaccamela, Alberto
Megow, Nicole | 2012 | | Algorithms and Complexity for Periodic Real-Time Scheduling
In: ACM Transactions on Algorithms [9], 601-619 | Journal Article |
| Bonifaci:2009:a | Bonifaci, Vincenzo
Harks, Tobias
Schäfer, Guido | 2010 | | Stackelberg Routing in Arbitrary Networks
In: Mathematics of Operations Research [35], 330 - 346 | Journal Article |
| Bonifaci:2010:b | Bonifaci, Vincenzo
Chan, Ho-Leung
Marchetti-Spaccamela, Alberto
Megow, Nicole | 2010 | | Algorithms and Complexity for Periodic Real-Time Scheduling
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1350-1359 | Proceedings Article |
| Bonifaci:2010:c | Baruah, Sanjoy
Bonifaci, Vincenzo
D'Angelo, Gianlorenzo
Li, Haohan
Marchetti-Spaccamela, Alberto
Megow, Nicole
Stougie, Leen | 2010 | | Scheduling Real-Time Mixed-Criticality Jobs
In: Mathematical Foundations of Computer Science 2010 : 35th International Symposium, MFCS 2010, 90-101 | Proceedings Article |
| Bonifaci:2010:d | Bonifaci, Vincenzo
Marchetti-Spaccamela, Alberto | 2010 | | Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. II, 230-241 | Proceedings Article |
| Bonifaci:2011:a | Bonifaci, Vincenzo
Korteweg, Peter
Marchetti-Spaccamela, Alberto
Stougie, Leen | 2011 | | The Distributed Wireless Gathering Problem
In: Theoretical Computer Science [412], 633-641 | Journal Article |
| Bonifaci:2011:b | Bonifaci, Vincenzo
Korteweg, Peter
Marchetti-Spaccamela, Alberto
Stougie, Leen | 2011 | | Minimizing Flow Time in the Wireless Gathering Problem
In: ACM Transactions on Algorithms [7], 33:1-33:20 | Journal Article |
| Bonifaci:2011:c | Baruah, Sanjoy
Bonifaci, Vincenzo
D'Angelo, Gianlorenzo
Marchetti-Spaccamela, Alberto
van der Ster, Suzanne
Stougie, Leen | 2011 | | Mixed-criticality scheduling of sporadic task systems
In: Algorithms - ESA 2011 : 19th Annual European Symposium, 555-566 | Proceedings Article |
| BookNeumannWitt | Neumann, Frank
Witt, Carsten | 2010 | | Bioinspired Computation in Combinatorial Optimization : Algorithms and Their Computational Complexity | Book |
| books/wi/LoeckxMW89 | Loeckx, Jacques
Mehlhorn, Kurt
Wilhelm, Reinhard | 1989 | | Foundations of Programming Languages | Book |
| BorosElabassioniMakino2010 | Boros, Endre
Elbassioni, Khaled
Makino, Kazuhisa | 2010 | | Left-to-right multiplication for monotone Boolean dualization
In: SIAM Journal on Computing [39], 3424-3439 | Journal Article |
| BorosElbassioniGurvich2010 | Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa | 2010 | | On effectivity functions of game forms
In: Games and Economic Behavior [68], 512-531 | Journal Article |
| Boullay96 | Boullay, Johannes | 1996 | | Eine parallelisierbare Heuristik für das Min-Cost-Flow Problem
Universität des Saarlandes | Thesis - Masters thesis |
| Bradford-Capoyleas97 | Bradford, Phillip Gnassi
Capoyleas, Vasilis | 1997 | | Weak epsilon-Nets for Points on a Hypersphere
In: Discrete & Computational Geometry [18], 83-91 | Journal Article |
| Bradford-et-al95 | Bradford, Phillip Gnassi
Choppela, Venkatesh
Rawlins, Gregory J.E. | 1995 | | Lower Bounds for the Matrix Chain Ordering Problem
In: LATIN'95: Theoretical Informatics, 2nd Latin American Symposium, 112-130 | Proceedings Article |
| Bradford-et-al.98 | Bradford, Phillip Gnassi
Rawlins, Gregory J.E.
Shannon, Greogory E. | 1998 | | Efficient Matrix Chain Ordering in Polylog Time
In: SIAM Journal on Computing [27], 466-490 | Journal Article |
| Bradford-Fleischer-96 | Alon, Noga
Bradford, Phillip Gnassi
Fleischer, Rudolf | 1996 | | Matching nuts and bolts faster
In: Information Processing Letters [59], 123-127 | Journal Article |
| Bradford-Fleischer95 | Bradford, Phillip Gnassi
Fleischer, Rudolf | 1995 | | Matching nuts and bolts faster
In: Algorithms and Computation: 6th International Symposium (ISAAC'95), 402-408 | Proceedings Article |
| Bradford-Reinert-96 | Bradford, Phillip Gnassi
Reinert, Knut | 1996 | | Lower Bounds for Row Minima Searching
In: Automata Languages and Programming: 23rd International Colloquium (ICALP'96), 454-465 | Proceedings Article |
| BradfordGolinLarmore2002 | Bradford, Phillip Gnassi
Golin, Mordecai J.
Larmore, Lawrence L. | 2002 | | Optimal prefix-free codes for unequal letter costs: Dynamic programming with the Monge property
In: Journal of Algorithms [42], 277-303 | Journal Article |
| BradfordGolinLarmoreRytter1998 | Bradford, Phillip Gnassi
Golin, Mordecai J.
Larmore, Lawrence L.
Rytter, Wojciech | 1998 | | 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 |
| BramerDipl03 | Bramer, Andreas | 2003 | | Zwei Algorithmen zur Bestimmung kostenminimaler Flüsse in Netzwerken
Universität des Saarlandes | Thesis - Masters thesis |
| BrandenburgJuengerMutzelLengauer97 | Brandenburg, Franz J.
Jünger, Michael
Mutzel, Petra
Lengauer, Thomas | 1997 | | SPP 731 : Algorithmen zum automatischen Zeichnen von Graphen im Rahmen des DFG-Schwerpunkts "Effiziente Algorithmen für diskrete Probleme und ihre Anwendungen"
In: Informatik '97 : Informatik als Innovationsmotor : 27. Jahrestagung der Gesellschaft für Informatik, 58-67 | Proceedings Article |
| Braun2000 | Braun, Sebastian | 2000 | | Entwicklung und Test von für statische Graphen optimierte Datentypen
Universität des Saarlandes | Thesis - Masters thesis |
| brederecknichterleinniedermeierphilip2011a | Bredereck, Robert
Nichterlein, Andr{\'e}
Niedermeier, Rolf
Philip, Geevarghese | 2011 | | Pattern-Guided Data Anonymization and Clustering
In: Mathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011. Proceedings, 182-193 | Proceedings Article |
| BredereckNichterleinNiedermeierPhilip2011b | Bredereck, Robert
Nichterlein, Andr{\'e}
Niedermeier, Rolf
Philip, Geevarghese | 2011 | | The Effect of Homogeneity on the Complexity of $k$-Anonymity
In: Fundamentals of Computation Theory - 18th International Symposium, FCT 2011, Oslo, Norway, August 22-25, 2011. Proceedings, 53-64 | Proceedings Article |
| BrelauerJiangJiang97 | Breslauer, Dany
Jiang, Tao
Jiang, Zhigen | 1997 | | Rotations of periodic strings and short superstrings
In: Journal of Algorithms [24], 340-353 | Journal Article |
| Bremer95 | Bremer, Dirk | 1995 | | Analyse und Simulation eines Maximum-Flow Algorithmus für das Gitter
Universität des Saarlandes | Thesis - Masters thesis |
| Brengel2000 | Brengel, Klaus | 2000 | | Externe Prioritätswarteschlangen
Universität des Saarlandes | Thesis - Masters thesis |
| BreslauerRamesh96 | Breslauer, Dany
Ramesh, Hariharan | 1996 | | Optimal Parallel Construction of Minimal Suffix and Factor Automata
In: Parallel Processing Letters [6], 35-44 | Journal Article |
| BrFlSm97 | Bradford, Phillip Gnassi
Fleischer, Rudolf
Smid, Michiel | 1997 | | More efficient parallel totally monotone matrix searching
In: Journal of Algorithms [23], 386-400 | Journal Article |
| Brightwell2012 | Brightwell, Graham
Panagiotou, Konstantinos
Steger, Angelika | 2012 | | Extremal subgraphs of random graphs
In: Random Structures & Algorithms [41], 147-178 | Journal Article |
| Bringmann13 | Bringmann, Karl | 2013 | | Bringing Order to Special Cases of Klee’s Measure Problem
In: 38th International Symposium on Mathematical Foundations of Computer Science (MFCS-13), 207-218 | Proceedings Article |
| Bringmann2012d | Bringmann, Karl
Friedrich, Tobias | 2012 | | Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
In: Theoretical Computer Science [425], 104-116 | Journal Article |
| BringmannCGTA12 | Bringmann, Karl | 2012 | | An improved algorithm for Klee's measure problem on fat boxes
In: Computational Geometry: Theory and Applications [45], 225-233 | Journal Article |
| BringmannDoerrNeumannSliacan2013 | Bringmann, Karl
Doerr, Benjamin
Neumann, Adrian
Sliacan, Jakub | 2013 | | Online Checkpointing with Improved Worst-Case Guarantees
In: Automata, Languages, and Programming - 40th International Colloquium (ICALP 2013), 255-266 | Proceedings Article |
| BringmannEMR13 | Bringmann, Karl
Engels, Christian
Manthey, Bodo
Raghavendra Rao, B. V. | 2013 | | Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems
In: 38th International Symposium on Mathematical Foundations of Computer Science (MFCS-13), 219-230 | Proceedings Article |
| BringmannF12 | Bringmann, Karl
Friedrich, Tobias | 2012 | | Convergence of Hypervolume-Based Archiving Algorithms II: Competitiveness
In: GECCO'12 : Proceedings of the Fourteenth International Conference on
Genetic and Evolutionary Computation, 457-464 | Proceedings Article |
| BringmannF13 | Bringmann, Karl
Friedrich, Tobias | 2013 | | Parameterized Average-Case Complexity of the Hypervolume Indicator
In: 15th Annual Conference on Genetic and Evolutionary Computation (GECCO-13), 575-582 | Proceedings Article |
| BringmannF13-2 | Bringmann, Karl
Friedrich, Tobias | 2013 | | Exact and Efficient Generation of Geometric Random Variates and Random Graphs
In: Automata, Languages, and Programming - 40th International Colloquium (ICALP-13), 267-278 | Proceedings Article |
| BringmannF2011 | Bringmann, Karl
Friedrich, Tobias | 2011 | | Convergence of Hypervolume-Based Archiving Algorithms I: Effectiveness
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 745-752 | Proceedings Article |
| BringmannFIV13 | Bringmann, Karl
Friedrich, Tobias
Igel, Christian
Voß, Thomas | 2013 | | Speeding Up Many-Objective Optimization by Monte Carlo Approximations
In: Artificial Intelligence [204], 22–29 | Journal Article |
| BringmannFjournal13 | Bringmann, Karl
Friedrich, Tobias | 2013 | | Approximation Quality of the Hypervolume Indicator
In: Artificial Intelligence [195], 265–290 | Journal Article |
| BringmannFNW2011 | Bringmann, Karl
Friedrich, Tobias
Neumann, Frank
Wagner, Markus | 2011 | | Approximation-guided evolutionary multi-objective optimization
In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI 2011), 1198-1203 | Proceedings Article |
| BringmannGL | Bringmann, Karl
Green Larsen, Kasper | 2013 | | Succinct Sampling from Discrete Distributions
In: 45th ACM Symposium on Theory of Computing (STOC-13), 775-782 | Proceedings Article |
| BringmannP12 | Bringmann, Karl
Panagiotou, Konstantinos | 2012 | | Efficient Sampling Methods for Discrete Distributions
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 133-144 | Proceedings Article |
| BringmannSSS14 | Bringmann, Karl
Sauerwald, Thomas
Stauffer, Alexandre
Sun, He | 2014 | | Balls into bins via local search: cover time and maximum load
In: 31st Symposium on Theoretical Aspects of Computer Science (STACS-14), accepted | Proceedings Article |
| Brockenauer97 | Brockenauer, Ralf | 1997 | | Separierung von Kuratowski-Ungleichungen für das größte planare Untergraphenproblem
Universität des Saarlandes | Thesis - Masters thesis |
| Brodal-Chaudhuri-Radhakrishnan | Brodal, Gerth Stølting
Chaudhuri, Shiva
Radhakrishnan, R. | 1996 | | The randomized complexity of maintaining the minimum
In: Nordic Journal of Computing [3], 337-351 | Journal Article |
| Brodal-Traeff-Zaro97 | Brodal, Gerth Stølting
Träff, Jesper Larsson
Zaroliagis, Christos | 1997 | | A parallel priority data structure with applications
In: 11th Internatinal Parallel Processing Symposium (IPPS-97), 689-693 | Proceedings Article |
| Brodal1998b | Brodal, Gerth Stølting
Katajainen, Jyrki | 1998 | | Worst-Case Efficient External-Memory Priority Queues
In: Proceedings of the 6th Scandinavian Workshop on Algorithm Theory (SWAT-98), 107-118 | Proceedings Article |
| Brodal1998c | Brodal, Gerth Stølting
Pinotti, M. Cristina | 1998 | | Comparator Networks for Binary Heap Construction
In: Proceedings of the 6th Scandinavian Workshop on Algorithm Theory (SWAT-98), 158-168 | Proceedings Article |
| Brodal1998d | Brodal, Gerth Stølting
Träff, Jesper Larsson
Zaroliagis, Christos | 1998 | | A Parallel Priority Queue with Constant Time Operations
In: Journal of Parallel and Distributed Computing, Special Issue on Parallel Data Structures [49], 4-21 | Journal Article |
| Brodal96 | Brodal, Gerth Stølting | 1996 | | Priority queues on parallel machines
In: 5th Scandinavian Workshop on Algorithm Theory (SWAT96), 416-427 | Proceedings Article |
| Brodal97a | Brodal, Gerth Stølting | 1997 | | Predecessor Queries in Dynamic Integer Sets
In: Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science (STACS-97), 21-32 | Proceedings Article |
| Brodal98a | Brodal, Gerth Stølting | 1998 | | Finger Search Trees with Constant Update Time
In: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-98), 540-549 | Proceedings Article |
| BrodalChaudhuriRadhakrishnan96-CPM-7 | Brodal, Gerth Stølting
Chaudhuri, Shiva
Radhakrishnan, Jaikumar | 1996 | | The randomized complexity of maintaining the minimum
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 4-15 | Proceedings Article |
| BroetalTEC2009 | Brockhoff, Dimo
Friedrich, Tobias
Hebbinghaus, Nils
Klein, Christian
Neumann, Frank
Zitzler, Eckart | 2009 | | On the Effects of Adding Objectives to Plateau Functions
In: IEEE Transactions on Evolutionary Computation [13], 591-603 | Journal Article |
| BroFriNeuPPSN2008 | Brockhoff, Dimo
Friedrich, Tobias
Neumann, Frank | 2008 | | Analyzing Hypervolume Indicator Based Algorithms
In: Parallel Problem Solving from Nature (PPSN X), 651-660 | Proceedings Article |
| BrönnimannBurnikelPion2001 | Brönnimann, Hervé
Burnikel, Christoph
Pion, Sylvain | 2001 | | Interval arithmetic yields efficient dynamic filters for computational geometry
In: Discrete Applied Mathematics [109], 25-47 | Journal Article |
| BrownRizkallah2011 | Rizkallah, Christine | 2011 | | Glivenko and Kuroda for Simple Type Theory | Unpublished/Draft |
| bs-agffgtaas-08 | Berberich, Eric
Sagraloff, Michael | 2008 | | A 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 |
| bs-agffgtaas-cagd-09 | Berberich, Eric
Sagraloff, Michael | 2009 | | A Generic and Flexible Framework for the Geometrical and Topological Analysis of (Algebraic) Surfaces
In: Computer Aided Geometric Design (CAGD) [26], 627-647 | Journal Article |
| BS2004 | Baswana, Surender
Sen, Sandeep | 2004 | | Approximate distance oracle for unweighted graphs in Expected O(n²) time
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 271-280 | Proceedings Article |
| Buchheit1999 | Buchheit, Thomas | 1999 | | Oberflächenrekonstruktion mithilfe von Voronoi-Diagrammen
Universität des Saarlandes | Thesis - Masters thesis |
| Burkhardt1999/1 | Burkhardt, Stefan
Crauser, Andreas
Ferragina, Paolo
Lenhof, Hans-Peter
Rivals, Eric
Vingron, Martin | 1999 | | 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 |
| Burkhardt2001 | Burkhardt, Stefan
Kärkkäinen, Juha | 2001 | | Better Filtering with Gapped q-Grams
In: Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching, 73-85 | Proceedings Article |
| Burkhardt2002 | Burkhardt, Stefan
Kärkkäinen, Juha | 2002 | | One-Gapped q-Gram Filters for Levenshtein Distance
In: Combinatorial Pattern Matching : 13th Annual Symposium, CPM 2002, 225-234 | Proceedings Article |
| Burkhardt2003 | Burkhardt, Stefan
Kärkkäinen, Juha | 2003 | | Fast Lightweight Suffix Array Construction and Checking
In: Combinatorial Pattern Matching: 14th Annual Symposium, CPM 2003, 55-69 | Proceedings Article |
| BurkhardtDiss02 | Burkhardt, Stefan | 2002 | | Filter Algorithms for Approximate String Matching
Universität des Saarlandes | Thesis - PhD thesis |
| BurkhardtKarkkainen2003 | Burkhardt, Stefan
Kärkkäinen, Juha | 2003 | | Better Filtering with Gapped q-Grams
In: Fundamenta Informaticae [56], 51-70 | Journal Article |
| Burnikel-Diss96 | Burnikel, Christoph | 1996 | | Exact Computation of Voronoi Diagrams and Line Segment Intersections
Universität des Saarlandes | Thesis - PhD thesis |
| Burnikel-et-al95 | Burnikel, Christoph
Könemann, Jochen
Mehlhorn, Kurt
Näher, Stefan
Schirra, Stefan
Uhrig, Christian | 1995 | | Exact Geometric Computation in LEDA
In: 11th ACM Symposium on Computational Geometry (SCG95), C18-C19 | Proceedings Article |
| Burnikel-et-al97 | Mehlhorn, Kurt
Burnikel, Christoph
Fleischer, Rudolf
Schirra, Stefan | 1997 | | A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Square Roots
In: Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-97), 702-709 | Proceedings Article |
| Burnikel2009 | Burnikel, Christoph
Funke, Stefan
Mehlhorn, Kurt
Schirra, Stefan
Schmitt, Susanne | 2009 | | A Separation Bound for Real Algebraic Expressions
In: Algorithmica [55], 14-28 | Journal Article |
| BurnikelFunkeSeel2001 | Burnikel, Christoph
Funke, Stefan
Seel, Michael | 2001 | | Exact geometric computation using Cascading
In: International Journal of Computational Geometry & Applications [11], 245-266 | Journal Article |
| BuschBach2011 | Busch, Philip Johannes | 2011 | | Analysis of the KIT email graph, with an application of randomized rumour spreading protocols
Universität des Saarlandes | Thesis - Bachelor thesis |
| Butz98 | Butz, Bernd | 1997 | | Robuste Implementierung eines Algorithmus zur Berechnung eines Voronoi-Diagramms für Polygone
Universitaet des Saarlandes | Thesis - Masters thesis |
| CameronJohannsenPrellbergSchweitzer2008 | Cameron, Peter
Johannsen, Daniel
Prellberg, Thomas
Schweitzer, Pascal | 2008 | | Counting Defective Parking Functions
In: Electronic Journal of Combinatorics [15], R92 | Electronic Journal Article |
| Canzar2006 | Canzar, Stefan
Remy, Jan | 2006 | | Shape Distributions and Protein Similarity
In: GCB, 1-10 | Proceedings Article |
| CaragiannisFishkin2007 | Caragiannis, Ioannis
Fishkin, Aleksei V.
Kaklamanis, Christos
Papaioannou, Evi | 2007 | | Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs
In: 29th Symposium on Mathematical Foundations of Computer Science MFCS 2004, 119-136 | Proceedings Article |
| Caragioannis2007 | Caragiannis, Ioannis
Fishkin, Aleksei V.
Kaklamanis, Christos
Papaioannou, Evi | 2007 | | A tight bound for online colouring of disk graphs
In: Theoretical Computer Science [384], 152-160 | Journal Article |
| Caroli07Evaluation | Caroli, Manuel | 2007 | | Evaluation of a Generic Method for Analyzing Controlled-Perturbation Algorithms
Universität des Saarlandes | Thesis - Masters thesis |
| Cas-Koe:c:11:StacsEpit | Case, John
Kötzing, Timo | 2011 | | Measuring Learning Complexity with Criteria Epitomizers
In: 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011), 320-331 | Electronic Proceedings Article |
| CaseKoetzing2012:DynMod | Case, John
Kötzing, Timo | 2012 | | Learning secrets interactively. Dynamic modeling in inductive inference
In: Information and Computation [220-221], 60-73 | Journal Article |
| CaseKoetzing2012:MemLim | Case, John
Kötzing, Timo | 2013 | | Memory-limited non-U-shaped learning with solved open problems
In: Theoretical Computer Science [473], 100-123 | Electronic Journal Article |
| CaseKoetzing2012:PhilTrans | Case, John
Kötzing, Timo | 2012 | | Computability-theoretic learning complexity
In: Philosophical Transaction of the Royal Society A [370], 3570-3596 | Journal Article |
| category_based_routing_2012 | Bringmann, Karl
Mehlhorn, Kurt
Neumann, Adrian | 2012 | | Remarks on Category-Based Routing in Social Networks | Unpublished/Draft |
| CCLPS2009 | Christodoulou, George
Chung, Christine
Ligett, Katrina
Pyrga, Evangelia
van Stee, Rob | 2010 | | On the price of stability for undirected network design
In: Approximation and Online Algorithms : 7th International Workshop, WAOA 2009, 86-97 | Proceedings Article |
| CDGKS2009 | Chan, T-H. Hubert
Dhamdhere, Kedar
Gupta, Anupam
Kleinberg, Jon
Slivkins, Aleksandrs | 2009 | | Metric Embeddings with Relaxed Guarantees
In: SIAM Journal on Computing [38], 2303-2329 | Journal Article |
| CDHMSW12 | Chen, Xujin
Doerr, Benjamin
Hu, Xiaodong
Ma, Weidong
van Stee, Rob
Winzen, Carola | 2012 | | The Price of Anarchy for Selfish Ring Routing is Two
In: Internet and Network Economics : 8th International Workshop, WINE 2012, 420-433 | Proceedings Article |
| CDoerrSP2006 | Cooper, Joshua
Doerr, Benjamin
Spencer, Joel
Tardos, Gabor | 2006 | | Deterministic Random Walks on the Integers
In: ??? [?], 1-27 | Miscellaneous |
| CDoerrST2007 | Cooper, Joshua
Doerr, Benjamin
Spencer, Joel
Tardos, Gábor | 2007 | | Deterministic random walks on the integers
In: European Journal of Combinatorics [28], 2072-2090 | Journal Article |
| celikikbast2009spire | Celikik, Marjan
Bast, Hannah | 2009 | | Fast Single-Pass Construction of a Half-Inverted Index
In: String processing and information retrieval : 16th International Symposium, SPIRE 2009, 194-205 | Proceedings Article |
| Certifying3EdgeConnectivity2012 | Mehlhorn, Kurt
Neumann, Adrian
Schmidt, Jens M. | 2012 | | Certifying 3-Edge-Connectivity | Unpublished/Draft |
| CertifyingAlgs | Mehlhorn, Kurt
Eigenwillig, Arno
Kaligosi, Kanela
Kratsch, Dieter
McConnell, Ross
Meyer, Ulrich
Spinrad, Jeremy P. | 2005 | | Certifying Algorithms (draft) | Unpublished/Draft |
| CFGKPR2003 | Cheng, Siu-Wing
Funke, Stefan
Golin, Mordecai J.
Kumar, Piyush
Poon, Sheung-Hung
Ramos, Edgar A. | 2003 | | Curve Reconstruction from Noisy Samples
In: Proceedings of the 19th Annual Symposium on Computational Geometry (SCG-03), 420-429 | Proceedings Article |
| CFMMR1999 | Crauser, Andreas
Ferragina, Paolo
Mehlhorn, Kurt
Meyer, Ulrich
Ramos, Edgar A. | 1999 | | I/O-optimal computation of segment intersections
In: Proceedings of the DIMACS Workshop on External Algorithms and Visualization, 131-138 | Proceedings Article |
| CFMMR2001 | Crauser, Andreas
Ferragina, Paolo
Mehlhorn, Kurt
Meyer, Ulrich
Ramos, Edgar A. | 2001 | | Randomized External-Memory Algorithms for Line Segment Intersection and Other Geometric Problems
In: International Journal of Computational Geometry & Applications [11], 305-337 | Journal Article |
| CFMMR98 | Crauser, Andreas
Ferragina, Paolo
Mehlhorn, Kurt
Meyer, Ulrich
Ramos, Edgar A. | 1998 | | Randomized External-Memory Algorithms for some Geometric Problems
In: Proceedings of the 14th International Annual ACM Symposium on Computational Geometry (SCG-98), 259-268 | Proceedings Article |
| cgal-manual-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 | 2001 | | CGAL Reference and User Manuals | Unknown Form: eBookForm |
| CGP2007 | Christodoulou, George
Gourves, Laurent
Pascual, Fanny | 2007 | | Scheduling Selfish Tasks: About the Performance of Truthful Algorithms
In: Computing and Combinatorics : 13th Annual International Conference, COCOON 2007, 187-197 | Proceedings Article |
| Chan2008 | Bansal, Nikhil
Chan, Ho-Leung | 2009 | | Weighted flow time does not admit O(1)-competitive algorithms
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 1238-1244 | Proceedings Article |
| Chan2008b | Bansal, Nikhil
Chan, Ho-Leung
Pruhs, Kirk | 2009 | | Speed Scaling with an Arbitrary Power Function
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 693-701 | Proceedings Article |
| Chan2008c | Chan, Ho-Leung
Edmonds, Jeff
Lam, Tak-Wah
Lee, Lap-Kei
Marchetti-Spaccamela, Alberto
Pruhs, Kirk | 2009 | | Nonclairvoyant Speed Scaling for Flow and Energy
In: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS), 255-264 | Electronic Proceedings Article |
| Chan2011 | Bansal, Nikhil
Chan, Ho-Leung
Pruhs, KIrk | 2011 | | Competitive Algorithms for Due Date Schedulin
In: Algorithmica [59], 569-582 | Journal Article |
| ChandranSivadasan2004 | Chandran, L. Sunil
Sivadasan, Naveen | 2004 | | On the Hadwiger's Conjecture for Graph Products | Report |
| Chang2006 | Chang, Kevin L.
Kannan, Ravi | 2006 | | The Space Complexity of Pass-Efficient Algorithms for Clustering
In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06, 1157-1166 | Proceedings Article |
| Chang2007 | Chang, Kevin | 2007 | | Multiple pass streaming algorithms for learning mixtures of distributions in $R^d$
In: Algorithmic Learning Theory, 18th International Conference, Proceedings, 16 | Proceedings Article |
| Chang2008a | Chang, Kevin
Johnson, Aaron | 2008 | | Online and offline selling in limit order markets
In: 4th International Workshop on Internet and Network Economics (WINE 2008), 41-52 | Proceedings Article |
| ChanGupta2009 | Chan, T.-H. Hubert
Gupta, Anupam | 2009 | | Small Hop-diameter Sparse Spanners for Doubling Metrics
In: Discrete and Computational Geometry [41], 28-44 | Journal Article |
| ChanSPAA2009 | Chan, Ho-Leung
Edmonds, Jeff
Pruhs, Kirk | 2009 | | Speed Scaling of Processes with Arbitrary Speedup Curves on a Multiprocessor
In: SPAA'09 : proceedings of the Twenty-First Annual Symposium on Parallelism in Algorithms and Architectures, 1-10 | Proceedings Article |
| Chaudhuri-Radhakrishnan97 | Chaudhuri, Shiva
Radhakrishnan, Jaikumar | 1997 | | The Complexity of Parallel Prefix Problems on Small Domains
In: Information and Computation [138], 1-22 | Journal Article |
| Chaudhuri-Zaroliagis-2-97 | Chaudhuri, Shiva
Zaroliagis, Christos | 1998 | | Shortest paths in digraphs of small treewidth. Part II: Optimal parallel algorithms
In: Theoretical Computer Science [203], 205-223 | Journal Article |
| Chaudhuri-Zaroliagis-96 | Chaudhuri, Shiva
Dimopoulos, Yannis
Zaroliagis, Christos | 1996 | | On the Parallel Complexity of Acyclic Logic Programs
In: Parallel Processing Letters [6], 223-230 | Journal Article |
| Chaudhuri96 | Chaudhuri, Shiva | 1996 | | Sensitive functions and approximate problems
In: Information and Computation [126], 161-168 | Journal Article |
| ChaudhuriDubhashi97 | Chaudhuri, Shiva
Dubhashi, Devdatt | 1997 | | Probabilistic recurrence relations revisited
In: Theoretical Computer Science [181], 45-56 | Journal Article |
| ChaudhuriGargRavi | Chaudhuri, Shiva
Garg, Naveen
Ravi, R. | 1998 | | The $p$-neighbor $k$-center problem
In: Information Processing Letters [65], 131-134 | Journal Article |
| ChaudhuriRadhakrishnan96 | Chaudhuri, Shiva
Radhakrishnan, Jaikumar | 1996 | | Deterministic restrictions in circuit complexity
In: Theory of Computing : 28th Annual ACM Symposium (STOC-28), 30-36 | Proceedings Article |
| ChaudhuriSubrahmanyamWagnerZaroliagis2000 | Chaudhuri, Shiva
Subrahmanyam, K. V.
Wagner, Frank
Zaroliagis, Christos | 2000 | | Computing mimicking networks
In: Algorithmica [26], 31-49 | Journal Article |
| ChaudhuriZaroliagis2000 | Chaudhuri, Shiva
Zaroliagis, Christos | 2000 | | Shortest paths in digraphs of small treewidth. Part I, Sequential algorithms
In: Algorithmica [27], 212-226 | Journal Article |
| Chauduri-Subrahmanyam-Wagner-Zaroliagis-98 | Chaudhuri, Shiva
Subrahmanyam, K. V.
Wagner, Frank
Zaroliagis, Christos | 1998 | | Computing Mimicking Networks
In: Proceedings of the 25th International Colloquium on Automata, Languages and Programming (ICALP-98), 556-567 | Proceedings Article |
| Chen-Das-Smid96 | Chen, Danny Z.
Das, Gautam
Smid, Michiel | 1996 | | Lower bounds for computing geometric spanners and approximate shortest paths
In: 8th Canadian Conference on Computing, 155-160 | Proceedings Article |
| ChEpKS13 | Chen, Xujin
Epstein, Leah
Kleiman, Elena
van Stee, Rob | 2013 | | Maximizing the minimum load: The cost of selfishness
In: Theoretical Computer Science [482], 9-19 | Journal Article |
| Cheriyan-Hagerup-Mehlhorn96 | Cheriyan, Joseph
Hagerup, Torben
Mehlhorn, Kurt | 1996 | | 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 |
| Cheriyan-Hagerup95 | Cheriyan, Joseph
Hagerup, Torben | 1995 | | A Randomized Maximum-Flow Algorithm
In: SIAM Journal on Computing [24], 203-226 | Journal Article |
| Cheriyan-Mehlhorn96 | Cheriyan, Joseph
Mehlhorn, Kurt | 1996 | | Algorithms for Dense Graphs and Networks on the Random Access Computer
In: Algorithmica [15], 521-549 | Journal Article |
| Cheriyan-Mehlhorn99 | Cheriyan, Joseph
Mehlhorn, Kurt | 1999 | | An analysis of the highest-level selection rule in the preflow-push max-flow algorithm
In: Information Processing Letters [69], 239-242 | Journal Article |
| Ching:1990:DDD | Ching, Yu-Tai
Mehlhorn, Kurt
Smid, Michiel H. M. | 1990 | | Dynamic deferred data structuring
In: Information Processing Letters [35], 37-40 | Journal Article |
| ChKoSt10 | Christodoulou, George
Kovacs, Annamaria
van Stee, Rob | 2010 | | A truthful constant approximation for maximizing the minimum load on related machines
In: Internet and Network Economics : 6th International Workshop, WINE 2010, 182-193 | Proceedings Article |
| ChKoSt2013 | Christodoulou, George
Kovacs, Annamaria
van Stee, Rob | 2013 | | A truthful constant approximation for maximizing the minimum load on related machines
In: Theoretical Computer Science [489-490], 88-98 | Journal Article |
| ChlebusCzumajSibeyn97 | Chlebus, Bogdan S.
Czumaj, Artur
Sibeyn, Jop F. | 1997 | | 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 |
| ChMeSS12 | Chan, Ho-Leung
Megow, Nicole
Sitters, René
van Stee, Rob | 2012 | | A note on sorting buffers offline
In: Theoretical Computer Science [423], 11-18 | Journal Article |
| Chong-1-96 | Chong, Ka Wong | 1996 | | Finding minimum spanning trees on the EREW PRAM
In: International Computer Symposium, 7-14 | Proceedings Article |
| Chong-Lam96 | Chong, Ka Wong
Lam, Tak Wah | 1996 | | Towards more precise parallel biconnectivity approximation
In: 7th Annual International Symposium on Algorithms and Computation, 223-232 | Proceedings Article |
| Chong-Ramos1998 | Chong, Ka Wong
Ramos, Edgar A. | 1998 | | Improved deterministic parallel padded sorting
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 405-416 | Proceedings Article |
| Chong1998 | Chong, Ka Wong
Lam, Tak Wah | 1998 | | Approximating Biconnectivity in Parallel
In: Algorithmica [21], 395-410 | Journal Article |
| Christodoulou2008 | Christodoulou, George | 2008 | | Price of Anarchy
In: Encyclopedia of Algorithms, 1-99 | Part of a Book |
| ChristodoulouKavacs2010 | Christodoulou, George
Kovács, Annamária | 2010 | | A deterministic truthful PTAS for scheduling related machines
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1005-1016 | Proceedings Article |
| ChristodoulouKS2008 | Christodoulou, George
Kovács, Annamária
Schapira, Michael | 2008 | | 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 |
| ChristodoulouKV2008 | Christodoulou, George
Koutsoupias, Elias
Vidali, Angelina | 2008 | | 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 |
| Chrobak2007 | Chrobak, Marek
Gasieniec, Leszek
Kowalski, Dariusz R. | 2007 | | The wake-up problem in multihop radio networks
In: SIAM Journal on Computing [36], 1453-1471 | Journal Article |
| Cilleruelo2009 | Cilleruelo, Javier
Hebbinghaus, Nils | 2009 | | Discrepancy in generalized arithmetic progressions
In: European Journal of Combinatorics [30], 1607-1611 | Journal Article |
| CJKMR97 | Christof, Thomas
Jünger, Michael
Kececioglu, John
Mutzel, Petra
Reinelt, Gerhard | 1997 | | A Branch-And-Cut Approach to Physical Mapping of Chromosomes by Unique End-Probes
In: Journal of Computational Biology [4], 433-447 | Journal Article |
| CK-PODC | Chlebus, Bogdan S.
Kowalski, Dariusz | 2004 | | A better wake-up in radio networks
In: Proceedings of the 23rd Annual ACM Symposium on Principles of Distributed Computing, PODC 2004, 266-274 | Proceedings Article |
| CK-STOC | Chlebus, Bogdan S.
Kowalski, Dariusz | 2005 | | Cooperative asynchronous update of shared memory
In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC 2005), 733-739 | Proceedings Article |
| CK2009 | Christodoulou, George
Koutsoupias, Elias | 2009 | | Mechanism Design for Scheduling
In: Bulletin of European Association for Theoretical Computer Science [97], 40-59 | Journal Article |
| CKK07 | Christodoulou, George
Koutsoupias, Elias
Kovács, Annamária | 2007 | | Mechanism design for fractional scheduling on unrelated machines
In: Automata, Languages and Programming : 34th International Colloquium, ICALP 2007, 40-52 | Proceedings Article |
| CKK2009 | Christodoulou, George
Koutsoupias, Elias
Kovács, Annamária | 2010 | | Mechanism Design for Fractional Scheduling on Unrelated Machines
In: ACM Transactions on Algorithms [6], 38:1-38:18 | Journal Article |
| CKMP-manus | Czyzowicz, Jurek
Kowalski, Dariusz
Markou, Euripides
Pelc, Andrzej | 2006 | | Complexity of searching for a black hole | Unpublished/Draft |
| CKMP-OPODIS | Czyzowicz, Jurek
Kowalski, Dariusz
Markou, Euripides
Pelc, Andrzej | 2005 | | Searching for a black hole in tree networks
In: Principles of distributed systems : 8th International Conference, OPODIS 2004, 67-80 | Proceedings Article |
| CKV07 | Christodoulou, George
Koutsoupias, Elias
Vidali, Angelina | 2007 | | A lower bound for scheduling mechanisms
In: ACM-SIAM Symposium on Discrete Algorithms (SODA), 1163-1170 | Proceedings Article |
| CKV2009 | Christodoulou, George
Koutsoupias, Elias
Nanavati, Akash | 2009 | | Coordination Mechanisms
In: Theoretical Computer Science [410], 3327-3336 | Journal Article |
| CKValgorithmica2008 | Christodoulou, George
Koutsoupias, Elias
Vidali, Angelina | 2009 | | A lower bound for scheduling mechanisms
In: Algorithmica [85], 729-740 | Journal Article |
| Clanget1999 | Clanget, Ulrich | 1999 | | Plattformunabhängiges Toolkit für Grafische Benutzerschnittstellen (GUI)
Universität des Saarlandes | Thesis - Masters thesis |
| CMMS1998a | Crauser, Andreas
Mehlhorn, Kurt
Meyer, Ulrich
Sanders, Peter | 1998 | | A 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 |
| COCOA07 | Mehlhorn, Kurt | 2007 | | Matchings in Graphs Variations of the Problem
In: Combinatorial Optimization and Applications : First International Conference, COCOA 2007, 1-2 | Proceedings Article |
| Cole-Hariharan96 | Cole, Richard
Hariharan, Ramesh | 1996 | | 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 |
| ColeFarachetal2000 | Cole, Richard
Farach-Colton, Martin
Hariharan, Ramesh
Przytycka, Teresa
Thorup, Mikkel | 2000 | | 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 |
| conf/compgeom/GaoJKMR89 | Gao, Shaodi
Jerrum, Mark
Kaufmann, Michael
Mehlhorn, Kurt
Rülling, Wolfgang | 1988 | | On Continuous Homotopic One Layer Routing
In: Computational geometry (SCG-88) : 4th symposium, 392-402 | Proceedings Article |
| conf/esa/Bar-YehudaFMR2007 | Bar-Yehuda, Reuven
Flysher, Guy
Mestre, Julián
Rawitz, Dror | 2007 | | Approximation of Partial Capacitated Vertex Cover
In: 15th Annual European Symposium on Algorithms, 335-346 | Proceedings Article |
| conf/esa/KhullerM2008 | Khuller, Samir
Mestre, Julián | 2008 | | An Optimal Incremental Algorithm for Minimizing Lateness with Rejection
In: 16th Annual European Symposium on Algorithms (ESA), 601-610 | Proceedings Article |
| conf/esa/KhullerMM2007 | Khuller, Samir
Malekian, Azarakhsh
Mestre, Julián | 2007 | | To Fill or Not to Fill: The Gas Station Problem
In: 15th Annual European Symposium on Algorithms, 534-545 | Proceedings Article |
| conf/gi/MehlhornZ88 | Mehlhorn, Kurt | 1988 | | SFB 124: VLSI-Entwurfsmethoden und Parallelität
In: GI - 18. Jahrestagung II, Vernetzte and komplexe Informatik-Systems, 3-29 | Proceedings Article |
| conf/soda/Mestre2008 | Mestre, Julián | 2008 | | Adaptive Local Ratio
In: 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 152-160 | Proceedings Article |
| conf/stacs/ElbassioniKMMS2009 | Elbassioni, Khaled
Krohn, Erik
Matijevic, Domagoj
Mestre, Julián
Severdija, Domagoj | 2009 | | Improved Approximation Algorithms for 1.5D Terrain Guarding
In: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS), 361-371 | Electronic Proceedings Article |
| conf/stacs/MehlhornP86 | Mehlhorn, Kurt
Preparata, Franco P. | 1986 | | Area-time Optimal Division for T=Omega(log n)$^1+epsilon$"
In: STACS 86, 3rd Annual Symposium on Theoretical Aspects of Computer Science, 341-352 | Proceedings Article |
| conf/stacs/Mestre2008 | Mestre, Julián | 2008 | | Lagrangian Relaxation and Partial Cover (Extended Abstract)
In: 25th International Symposium on Theoretical Aspects of Computer Science (STACS), 539-550 | Proceedings Article |
| conf/swat/AlthausCEKM2008 | Althaus, Ernst
Canzar, Stefan
Elbassioni, Khaled
Karrenbauer, Andreas
Mestre, Julián | 2008 | | Approximating the Interval Constrained Coloring Problem
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), 210-221 | Proceedings Article |
| ContRound2006 | Doerr, Benjamin
Klein, Christian | 2006 | | Controlled Randomized Rounding
In: Electronic Notes in Discrete Mathematics [25], 39-40 | Electronic Journal Article |
| CooperFriezeMehlhornPriebe00 | Cooper, Colin
Frieze, Alan M.
Mehlhorn, Kurt
Priebe, Volker | 2000 | | Average-Case Complexity of Shortest-Paths Problems in the Vertex-Potential Model
In: Random Structures & Algorithms [16], 33-46 | Journal Article |
| CooperFriezeMehlhornPriebe97 | Cooper, Colin
Frieze, Alan M.
Mehlhorn, Kurt
Priebe, Volker | 1997 | | Average-case complexity of shortest-paths problems in the vertex-potential model
In: International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM-97), 15-26 | Proceedings Article |
| CorreaMRS2009 | Correa, Jose R.
Megow, Nicole
Raman, Rajiv
Suchan, Karol | 2009 | | Cardinality Constrained Graph Partitioning into Cliques with Submodular Costs
In: 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2009), 347-350 | Proceedings Article |
| CPL2010 | Christodoulou, Giorgos
Ligett, Katrina
Pyrga, Evangelia | 2010 | | Contention Resolution under Selfishness
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010. - Pt. II, 430-441 | Proceedings Article |
| CraMehMey97 | Crauser, Andreas
Mehlhorn, Kurt
Meyer, Ulrich | 1997 | | Kürzeste-Wege-Berechnung bei sehr großen Datenmengen
In: Promotion tut not: Innovationsmotor "Graduiertenkolleg", 113-132 | Proceedings Article |
| Crauser-Ferragina2001 | Crauser, Andreas
Ferragina, Paolo | 2002 | | A theoretical and experimental study on the construction of suffix arrays in external memory
In: Algorithmica [32], 1-35 | Journal Article |
| Crauser1999 | Crauser, Andreas
Ferragina, Paolo | 1999 | | On Constructing Suffix Arrays in External Memory
In: Proceedings of the 7th Annual European Symposium on Algorithms (ESA-99), 224-235 | Proceedings Article |
| Crauser1999a | Crauser, Andreas
Mehlhorn, Kurt | 1999 | | LEDA-SM : Extending LEDA to Secondary Memory
In: Algorithm engineering (WAE-99) : 3rd International Workshop, WAE'99, 228-242 | Proceedings Article |
| Crauser2000 | Crauser, Andreas
Meyer, Ulrich
Brengel, Klaus | 2001 | | An experimental study of priority queues in external memory
In: Journal of Experimental Algorithmics [5], 24 | Unpublished/Draft |
| Crauser2001 | Crauser, Andreas | 2001 | | LEDA-SM:External Memory Algorithms and Data Structures in Theory and Practice
Universität des Saarlandes | Thesis - PhD thesis |
| Crochemore-et-al.97 | Crochemore, Maxime
Galil, Zvi
Gasieniec, Leszek
Park, Kunsoo
Rytter, Wojciech | 1997 | | Constant-time Randomized Parallel String Matching
In: SIAM Journal on Computing [26], 950-960 | Journal Article |
| Crochemore-Gasieniec-Rytter97 | Crochemore, Maxime
Gasieniec, Leszek
Rytter, Wojciech | 1998 | | Constant-space string-matching in sublinear average time
In: Compression and Complexity of SEQUENCES 1997, 230-239 | Proceedings Article |
| croi13 | Croitoru, Cosmina | 2013 | | Abstract Debates
In: IEEE International Conference on Tools with Artificial Intelligence (ICTAI) - 2013, | Proceedings Article |
| croikotzi12 | Croitoru, Cosmina
Kötzing, Timo | 2012 | | Deliberative Acceptability of Arguments
In: STAIRS 2012 - Proceedings of the Sixth Starting AI Researchers' Symposium, 71-82 | Proceedings Article |
| croikotzi13 | Croitoru, Cosmina
Kötzing, Timo | 2014 | | A Normal Form for Argumentation Frameworks
In: Theory and Applications of Formal Argumentation (TAFA'13), 32-45 | Proceedings Article |
| CroitoruMaster2012 | Croitoru, Cosima | 2012 | | Algorithmic aspects of abstract argumentation frameworks
Universität des Saarlandes | Thesis - Masters thesis |
| CromemoreGasienicHariharanMuthukrishnanRytterSIAMJCOMPUT1998 | Crochemore, Maxime
Gasieniec, Leszek
Hariharan, Ramesh
Muthukrishnan, S.
Rytter, Wojciech | 1998 | | A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching
In: SIAM Journal on Computing [27], 668-681 | Journal Article |
| crs98a | Sridharan, K
Subramanian, C. R.
Sudha, N | 1998 | | Some Properties of Touching Distances for Polygons and Polyhedra
In: Applied Mathematics Letters [11], 1-7 | Journal Article |
| CRS98b | Subramanian, C. R.
Fürer, Martin
Veni Madhavan, C. E. | 1998 | | Algorithms for Coloring Semi-random Graphs
In: Random Structures & Algorithms [13], 125-158 | Journal Article |
| crs98c | Schnorr, C. P.
Subramanian, C. R. | 1998 | | Almost optimal (on the average) algorithms for boolean matrix product witnesses, computing the diameter
In: Proceedings of the 2nd International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM-98), 218-231 | Proceedings Article |
| crscpc | Subramanian, C. R. | 2000 | | Algorithms for Colouring Random k-colourable Graphs
In: Combinatorics, Probability and Computing [9], 45-77 | Journal Article |
| crsjalg | Subramanian, C. R. | 1999 | | Minimum Coloring k-Colorable Graphs in Polynomial Average Time
In: Journal of Algorithms [33], 112-123 | Journal Article |
| crsoda99 | Subramanian, C. R. | 1999 | | A Generalization of Janson inequalities and its application to finding shortest paths
In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), 795-804 | Proceedings Article |
| Csaba06 | Csaba, Bela
Lodha, S. | 2006 | | A randomized on-line algorithm for the k-server problem on the line
In: Random Structures and Algorithms [29], 82-104 | Journal Article |
| Csaba07 | Csaba, Bela | 2007 | | On the Bollobas-Eidrigde conjecture for bipartite graphs
In: Combinatorics, Probability and Computing [16], 1-31 | Journal Article |
| Csaba2001 | Csaba, Bela
Lodha, Sachin | 2001 | | A randomized on-line algorithm for the k-server problem on a line | Report |
| Csaba2003a | Csaba, Bela | 2003 | | Proof of a conjecture of Bollobas and Eldridge for graphs of maximum degree three
In: Combinatorica [23], 35-72 | Journal Article |
| CurticapeanK2013 | Curticapean, Radu
Künnemann, Marvin | 2013 | | A Quantization Framework for Smoothed Analysis of Euclidean Optimization Problems
In: 21st Annual European Symposium on Algorithms (ESA 2013), 349-360 | Proceedings Article |
| CycleBasisSimplified | Mehlhorn, K.
Michail, D. | 2009 | | Minimum Cycle Bases: Faster and Simpler
In: ACM Transactions on Algorithms [6], 8:1-8:13 | Electronic Journal Article |
| CyganKratschPilipczukPilipczukWahlstroem2012 | Cygan, Marek
Kratsch, Stefan
Pilipczuk, Marcin
Pilipczuk, Michał
Wahlström, Magnus | 2012 | | Clique Cover and Graph Separation: New Incompressibility Results
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 254-265 | Proceedings Article |
| CyganPhilipPilipczukPilipczukWojtaszczyk2011 | Cygan, Marek
Philip, Geevarghese
Pilipczuk, Marcin
Pilipczuk, Micha\l{}
Wojtaszczyk, Jakub Onufry | 2011 | | Dominating set is fixed parameter tractable in claw-free graphs
In: Theoretical Computer Science [412], 6982-7000 | Journal Article |
| CzumajBV02+ | Czumaj, Artur
Vöcking, Berthold | 2002 | | Tight bounds for worst-case equilibria
In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-02), 413-420 | Proceedings Article |
| DamsHK2013 | Dams, Johannes
Hoefer, Martin
Kesselheim, Thomas | 2013 | | Sleeping Experts in Wireless Networks
In: 27th International Symposium on Distributed Computing (DISC-13), 344-357 | Proceedings Article |
| Das-et-al97 | Das, Gautam
Fleischer, Rudolf
Gasieniec, Leszek
Gunopulos, Dimitrios
Kärkkäinen, Juha | 1997 | | Episode matching
In: Combinatorial pattern matching : 8th annual symposium (CPM-97), 12-27 | Proceedings Article |
| Das-Kapoor-Smid96 | Das, Gautam
Kapoor, Sanjiv
Smid, Michiel | 1996 | | On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees
In: Foundations of software technology and theoretical computer science (FSTTCS-96) : 16th conference, 64-75 | Proceedings Article |
| Das-Kapoor-Smid97 | Das, Gautam
Kapoor, Sanjiv
Smid, Michiel | 1997 | | On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees
In: 16th Conference on Foundations of Software Technology and Theoretical Computer Science, 447-460
In: Algorithmica [19], 447-460 | Journal Article |
| DBLP:conf/gi/NaherM90 | Näher, Stefan
Mehlhorn, Kurt | 1990 | | LEDA - A Library of Efficient Data Types and Algorithms
In: GI - 20. Jahrestagung I, Informatik auf dem Weg zum Anwender, 35-39 | Proceedings Article |
| DBLP:conf/stacs/Meyer08 | Meyer, Ulrich | 2008 | | On Dynamic Breadth-First Search in External-Memory
In: Proc. 25th Annual Symposium on Theoretical Aspects (STACS), 551-560 | Proceedings Article |
| DBLP:journals/corr/abs-1304-8069 | Kobel, Alexander
Sagraloff, Michael | 2013 | | Fast Approximate Polynomial Multipoint Evaluation and Applications
In: arXiv [abs/1304.8069], 17 | Electronic Journal Article |
| DCFS2010 | Cooper, Joshua
Doerr, Benjamin
Friedrich, Tobias
Spencer, Joel | 2010 | | Deterministic Random Walks on Regular Trees
In: Random Structures and Algorithms [37], 353-366 | Journal Article |
| DDJMRR96 | De Simone, Caterina
Diehl, Martin
Jünger, Michael
Mutzel, Petra
Reinelt, Gerhard
Rinaldi, Giovanni | 1996 | | Exact Ground States of Two-Dimensional +-J Ising Spin Glasses
In: Journal of Statistical Physics [84], 1363-1371 | Journal Article |
| deBerg-vanKreveld-Schirra1998 | de Berg, Marc
van Kreveld, Marc
Schirra, Stefan | 1998 | | Topologically correct subdivision simplification using the bandwidth criterion
In: Cartography and Geographic Information Systems [25], 243-257 | Journal Article |
| deBerg-vanKreveld-Schirra95 | Berg, Marc de
Kreveld, Marc van
Schirra, Stefan | 1995 | | A new approach to subdivision simplification
In: ACSM/ASPRS Annual Convention & Exposition Technical Papers, 79-88 | Proceedings Article |
| deBergSchirra2002 | de Berg, Schirra (ed.) | 2002 | | Selected papers from the 16th Annual Symposium on Computational Geometry (SoCG-00) | Proceedings |
| deBergSchirraSoCG2002 | de Berg, Marc
Schirra, Stefan | 2002 | | Guest Editors' Foreword
In: Selected papers from the 16th Annual Symposium on Computational Geometry (SoCG-00), 1-2 | Proceedings Article |
| Dedo-Gergov-Hagerup95 | Dedorath, Jürgen
Gergov, Jordan
Hagerup, Torben | 1995 | | More Efficient Parallel Flow Algorithms
In: Algorithms and Computation: 6th International Symposium (ISAAC95), 234-243 | Proceedings Article |
| Dementiev2004SearchTree | Dementiev, Roman
Kettner, Lutz
Mehnert, Jens
Sanders, Peter | 2004 | | 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 |
| DeMeRa1999 | Dey, Tamal K.
Mehlhorn, Kurt
Ramos, Edgar A. | 1999 | | Curve reconstruction: Connecting dots with good reason
In: Proceedings of the 15th Annual Symposium on Computational Geometry (SCG-99), 197-206 | Proceedings Article |
| DemSan03 | Dementiev, Roman
Sanders, Peter | 2003 | | Asynchronous Parallel Disk Sorting
In: Proceedings of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA-03), 138-148 | Proceedings Article |
| Deng-Mahajan97 | Deng, Xiaotie
Mahajan, Sanjeev | 1997 | | The Cost of Derandomization: Computability or Competitiveness
In: SIAM Journal on Computing [26], 786-802 | Journal Article |
| Denny03 | Denny, Markus | 2003 | | Solving geometric optimization problems using graphics hardware
In: EUROGRAPHICS 2003 : the European Association for Computer Graphics 24th Annual Conference, 441-451 | Proceedings Article |
| Denny94 | Denny, Markus | 1994 | | Monotones Häufen und Token Distribution auf dem Hypercube
Universität des Saarlandes | Thesis - Masters thesis |
| DeSterckDescent | De Sterck, Hans | 2012 | | Steepest Descent Preconditioning for Nonlinear GMRES Optimization | Unpublished/Draft |
| DeSterckNGMRES | De Sterck, Hans | 2012 | | A Nonlinear GMRES Optimization Algorithm for Canonical Tensor Decomposition
In: SIAM Journal on Scientific Computing [34], A1351-A1379 | Journal Article |
| DeSterckSVD | De Sterck, Hans | 2012 | | A Self-learning Algebraic Multigrid Method for Extremal Singular Triplets and Eigenpairs
In: SIAM Journal on Scientific Computing [34], A2092-A2117 | Journal Article |
| DF2006 | Doerr, Benjamin
Friedrich, Tobias | 2006 | | Deterministic Random Walks on the Two-Dimensional Grid
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 474-483 | Proceedings Article |
| DF2009 | Doerr, Benjamin
Friedrich, Tobias | 2009 | | Deterministic Random Walks on the Two-Dimensional Grid
In: Combinatorics, Probability and Computing [18], 123-144 | Journal Article |
| DF2010b | Doerr, Benjamin
Fouz, Mahmoud | 2011 | | Quasi-random rumor spreading: Reducing randomness can be costly
In: Information Processing Letters [111], 227-230 | Journal Article |
| DFF11 | Doerr, Benjamin
Fouz, Mahmoud
Friedrich, Tobias | 2011 | | 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 |
| DFKM08 | Dumitriu, Daniel
Funke, Stefan
Kutz, Martin
Milosavljevic, Nikola | 2008 | | How much Geometry it takes to Reconstruct a 2-Manifold in $R^3$
In: 10th Workshop on Algorithm Engineering and Experiments (ALENEX-2008), 65-74 | Proceedings Article |
| DFKM2008b | Dumitriu, Daniel
Funke, Stefan
Kutz, Martin
Milosavljevic, Nikola | 2008 | | On the Locality of Extracting a 2-Manifold in $R^3$
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT-2008), 270-281 | Proceedings Article |
| DFKM2009 | Dumitriu, Daniel
Funke, Stefan
Kutz, Martin
Milosavljevic, Nikola | 2009 | | How Much Geometry It Takes to Reconstruct a 2-Manifold in R 3
In: ACM Journal of Experimental Algorithms [14], 2.2:1-2.2:17 | Electronic Journal Article |
| dfkmsssw2003 | Dhiflaoui, Marcel
Funke, Stefan
Kwappik, Carsten
Mehlhorn, Kurt
Seel, Michael
Schömer, Elmar
Schulte, Ralph
Weber, Dennis | 2003 | | Certifying and Repairing Solutions to Large LPs - How Good are LP-Solvers?
In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 255-256 | Proceedings Article |
| DFKO05 | Doerr, Benjamin
Friedrich, Tobias
Klein, Christian
Osbild, Ralf | 2005 | | Rounding of Sequences and Matrices, with Applications
In: Third Workshop on Approximation and Online Algorithms (WAOA 2005), 96-109 | Proceedings Article |
| DFKO06 | Doerr, Benjamin
Friedrich, Tobias
Klein, Christian
Osbild, Ralf | 2006 | | Unbiased Matrix Rounding
In: Algorithm theory - SWAT 2006 : 10th Scandinavian Workshop on Algorithm Theory, 102-112 | Proceedings Article |
| DFKP | Dessmark, Anders
Fraigniaud, Pierre
Kowalski, Dariusz
Pelc, Andrzej | 2006 | | Deterministic rendezvous in graphs | Unpublished/Draft |
| DFKP2006 | Dessmark, Anders
Fraigniaud, Pierre
Kowalski, Dariusz
Pelc, Andrzej | 2006 | | Deterministic Rendezvous in Graphs
In: Algorithmica [46], 69-96 | Journal Article |
| DFKS09 | Doerr, Benjamin
Friedrich, Tobias
Künnemann, Marvin
Sauerwald, Thomas | 2009 | | Quasirandom Rumor Spreading: An Experimental Analysis
In: 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX), 145-153 | Proceedings Article |
| DFR2001 | Dey, Tamal K.
Funke, Stefan
Ramos, Edgar A. | 2001 | | Surface Reconstruction in almost Linear Time under Locally Uniform Sampling
In: Proceedings of the 17th European Workshop on Computational Geometry (EWCG-01), 129-132 | Electronic Proceedings Article |
| DG2010a | Doerr, Benjamin
Goldberg, Leslie Ann | 2010 | | Drift Analysis with Tail Bounds
In: Parallel Problem Solving from Nature – PPSN XI. - Pt. 1, 174-183 | Proceedings Article |
| DG2010b | Doerr, Benjamin
Goldberg, Leslie Ann | 2010 | | Adaptive Drift Analysis
In: Parallel Problem Solving from Nature -- PPSN XI. -- Pt. 1, 32-41 | Proceedings Article |
| DGW10 | Doerr, Benjamin
Gnewuch, Michael
Wahlström, Magnus | 2010 | | Algorithmic construction of low-discrepancy point sets via dependent randomized rounding
In: Journal of Complexity [26], 490-507 | Journal Article |
| DHL2009 | Doerr, Benjamin
Huber, Anna
Levavi, Ariel | 2009 | | Strong robustness of randomized rumor spreading protocols
In: Algorithms and Computation : 20th International Symposium, ISAAC 2009, 812-821 | Proceedings Article |
| DHS2011 | De Sterck, Hans
Henson, Van Emden
Sanders, Geoff | 2011 | | Multilevel Aggregation Methods for Small-World Graphs with Application to Random-Walk Ranking | Unpublished/Draft |
| Dickert2000 | Dickert, Peter | 2000 | | Berechnung von Einfach-und Zweifachzusammenhangskomponenten auf einer PRAM
Universität des Saarlandes | Thesis - Masters thesis |
| DiedrichHarrenJansenThoeleThomas2008 | Diedrich, Florian
Harren, Rolf
Jansen, Klaus
Thöle, Ralf
Thomas, Henning | 2008 | | Approximation Algorithms for 3D Orthogonal Knapsack
In: Journal of Science and Technology [23], 749-762 | Journal Article |
| DieKehNeu2008 | Diedrich, Florian
Kehden, Britta
Neumann, Frank | 2008 | | Multi-objective Problems in Terms of Relational Algebra
In: Relations and Kleene Algebra in Computer Science 2008, 84-98 | Proceedings Article |
| DieNeuCEC2008 | Diedrich, Florian
Neumann, Frank | 2008 | | Using Fast Matrix Multiplication in Bio-Inspired Computation for Complex Optimization Problems
In: IEEE Congress on Evolutionary Computation 2008, 3828-3833 | Proceedings Article |
| Diete95 | Diete, Iris | 1995 | | Berechnung der Kontaktoberfläche eines Moleküls
Universität des Saarlandes | Thesis - Masters thesis |
| DigHalf2003 | Doerr, Benjamin | 2006 | | Non-independent Randomized Rounding, Linear Discrepancy and an Application to Digital Halftoning
In: Eurocomb '03 [3], 95-99 | Journal Article |
| Diks-Hagerup96 | Diks, Krzysztof
Hagerup, Torben | 1996 | | 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 |
| DiksHagerup1998 | Diks, Krzysztof
Hagerup, Torben | 1998 | | More general parallel tree contraction: Register allocation and broadcasting in a tree
In: Theoretical Computer Science [203], 3-29 | Journal Article |
| Dimitrios2007 | Michail, Dimitrios | 2007 | | Reducing rank-maximal to maximum weight matching
In: Theoretical Computer Science [389], 125-132 | Journal Article |
| DinitzGargGoemans1999 | Dinitz, Yefim
Garg, Naveen
Goemans, Michel X. | 1999 | | On the single-source unsplittable flow problem
In: Combinatorica [19], 17-41 | Journal Article |
| DinitzZeev1999 | Dinitz, Yefim
Nutov, Zeev | 1999 | | A 3-approximation algorithm for finding optimum 4,5-vertex-connected spanning subgraphs
In: Journal of Algorithms [32], 21-30 | Journal Article |
| Dipl03/Ding | Ding, Wei | 2003 | | Geometric Rounding without changing the Topology
Universität des Saarlandes | Thesis - Masters thesis |
| Dipl03/Eigenwillig | Eigenwillig, Arno | 2003 | | Exact Arrangement Computation for Cubic Curves
Universität des Saarlandes | Thesis - Masters thesis |
| Dipl03/Fontaine | Fontaine, Marc | 2003 | | Computing the Filtration Efficiency of Shape-Index-Filters for Approximate String Matching
Universität des Saarlandes | Thesis - Masters thesis |
| Dipl04/Berberich | Berberich, Eric | 2004 | | Exact Arrangements of Quadric Intersection Curves
Universität des Saarlandes | Thesis - Masters thesis |
| DiplPohl06 | Pohl, Sebastian | 2006 | | Exact Integer Linear Programming with Bounded Variables in a Branch- and Cut Algorithm
Universität des Saarlandes | Thesis - Masters thesis |
| DiplWeber06 | Weber, Dennis | 2006 | | Solving large Sparse Linear Systems exactly
Universität des Saarlandes | Thesis - Masters thesis |
| Diss06Dementiev | Dementiev, Roman | 2006 | | Algorithm Engineering for Large Data Sets
Universität des Saarlandes | Thesis - PhD thesis |
| Diss06Hach | Hachenberger, Peter | 2006 | | Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms Optimized Implementation, Experiments and Applications
Universität des Saarlandes | Thesis - PhD thesis |
| DissReichel06 | Reichel, Joachim | 2006 | | Combinatorial Approaches for the Trunk Packing Problem
Universität des Saarlandes | Thesis - PhD thesis |
| Djidjev-Pantziou-Zaro-1-95 | Djidjev, Hristo N.
Pantziou, Grammati E.
Zaroliagis, Christos | 1995 | | On-line and Dynamic Algorithms for Shortest Path Problems
In: STACS95: 12th Annual Symposium on Theoretical Aspects of Computer Science, 193-204 | Proceedings Article |
| Djidjev-Pantziou-Zaro-2-95 | Djidjev, Hristo N.
Pantziou, Grammati E.
Zaroliagis, Christos | 1995 | | Fast Algorithms for Maintaining Shortest Paths
In: Fundamentals of Computation Theory: 10th International Conference (FCT95), 191-200 | Proceedings Article |
| DjidjevPantziouZaroliagis2000 | Djidjev, Hristo N.
Pantziou, G. E.
Zaroliagis, Christos | 2000 | | Improved algorithms for dynamic shortest paths
In: Algorithmica [28], 367-389 | Journal Article |
| DK2012 | Duan, Ran
Mehlhorn, Kurt | 2012 | | A Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market
In: arXiv [abs/1212.0979v1], 1-8 | Electronic Journal Article |
| DKMS05 | Dementiev, Roman
Kärkkäinen, Juha
Mehnert, Jens
Sanders, Peter | 2005 | | Better External Memory Suffix Array Construction
In: Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics
(ALENEX/ANALCO 2005), 86-97 | Proceedings Article |
| DKW2011 | Doerr, Benjamin
Künnemann, Marvin
Wahlström, Magnus | 2011 | | Dependent Randomized Rounding: The Bipartite Case
In: 2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX), 96-106 | Proceedings Article |
| DLMNOPSW2012 | Cygan, Marek
Dell, Holger
Lokshtanov, Daniel
Marx, Daniel
Nederlof, Jesper
Okamoto, Yoshio
Paturi, Ramamohan
Saurabh, Saket
Wahlström, Magnus | 2012 | | On Problems as Hard as CNF-SAT
In: 2012 IEEE 27th Conference on Computational Complexity (CCC 2012), 74-84 | Proceedings Article |
| DMSW2010 | De Sterck, Hans
Miller, Killian
Sanders, Geoff
Winlaw, Manda | 2011 | | Recursively accelerated multilevel aggregation for Markov chains
In: SIAM Journal on Scientific Computing [32], 1652-1671 | Journal Article |
| Dobkin-Gunopulos96 | Dobkin, David P.
Gunopulos, Dimitrios | 1996 | | Geometric problems in machine learning
In: Applied Computational Geometry: Towards Geometric Engineering (FCRC96 Workshop, WACG96), 121-132 | Proceedings Article |
| Doe-Joh-Koe-Neu-The:c:10:APSPCrossover | Doerr, Benjamin
Johannsen, Daniel
Kötzing, Timo
Neumann, Frank
Theile, Madeleine | 2010 | | More Effective Crossover Operators for the All-Pairs Shortest Path Problem
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 184-193 | Proceedings Article |
| Doerr11 | Doerr, Benjamin | 2011 | | Drift analysis
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 1311-1320 | Proceedings Article |
| Doerr12GECCO | Doerr, Benjamin | 2012 | | Black-box complexity: from complexity theory to playing mastermind
In: GECCO'12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, 1079-1092 | Proceedings Article |
| Doerr2005 | Doerr, Benjamin | 2005 | | Matrix Rounding with Low Error in Small Submatrices
In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), 1067-1068 | Proceedings Article |
| Doerr2005EurocombPropp | Cooper, Joshua
Doerr, Benjamin
Spencer, Joel
Tardos, Gabor | 2005 | | Deterministic Random Walks on the Integers
In: 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 73-76
In: Discrete Mathematics & Theoretical Computer Science [AE], 73-76 | Proceedings Article |
| Doerr2005gitter | Doerr, Benjamin
Gnewuch, Michael
Srivastav, Anand | 2005 | | Bounds and Constructions for the Star-Discrepancy via Delta-Covers
In: Journal of Complexity [21], 691-709 | Journal Article |
| Doerr2005Habil | Doerr, Benjamin | 2005 | | Integral Approximation
Christian-Albrechts-Universität zu Kiel | Thesis - Habilitation thesis |
| Doerr2005minload | Ahuja, Nitin
Baltz, Andreas
Doerr, Benjamin
Privetivy, Ales
Srivastav, Anand | 2005 | | On the Minimum Load Coloring Problem
In: Third Workshop on Approximation and Online Algorithms (WAOA 2005), 15-26 | Proceedings Article |
| Doerr2006gametrees | Doerr, Benjamin
Lorenz, Ulf | 2006 | | Error Propagation in Game Trees
In: Mathematical Methods of Operations Research [64], 79-93 | Journal Article |
| Doerr2007-CECa | Doerr, Benjamin
Happ, Edda
Klein, Christian | 2007 | | 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 |
| Doerr2007-CECb | Doerr, Benjamin
Gnewuch, Michael
Hebbinghaus, Nils
Neumann, Frank | 2007 | | A Rigorous View On Neutrality
In: IEEE Congress on Evolutionary Computation 2007, 2591-2597 | Proceedings Article |
| Doerr2007-ENDMa | Cooper, Joshua
Doerr, Benjamin
Friedrich, Tobias
Spencer, Joel | 2007 | | Deterministic Random Walks on Regular Trees
In: Electronic Notes in Discrete Mathematics [29], 509-513 | Journal Article |
| Doerr2007-ENDMb | Doerr, Benjamin
Friedrich, Tobias
Klein, Christian
Osbild, Ralf | 2007 | | Unbiased Matrix Rounding
In: Electronic Notes in Discrete Mathematics [28], 41-46 | Journal Article |
| Doerr2007GeccoProc | Thierens, Beyer, Bongard, Branke, Clark, Cliff, Congdon, Deb, Doerr, Kovacs, Kumar, Miller, Moore, Neumann, Pelikan, Poli, Sastry, Stanley, Stützle, Watson, Wegener (ed.) | 2007 | | GECCO 2007: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation | Proceedings |
| Doerr2007nitin | Ahuja, Nitin
Baltz, Andreas
Doerr, Benjamin
Privetivy, Ales
Srivastav, Anand | 2007 | | On the Minimum Load Coloring Problem
In: Journal of Discrete Algorithms [5], 533-545 | Journal Article |
| Doerr2007partial | Doerr, Benjamin | 2007 | | Partial Colorings of Unimodular Hypergraphs
In: Electronic Notes in Discrete Mathematics [29], 359-363 | Journal Article |
| Doerr2008-SODA | Doerr, Benjamin
Friedrich, Tobias
Sauerwald, Thomas | 2008 | | Quasirandom Rumor Spreading
In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, 773-781 | Proceedings Article |
| Doerr2008-SODAb | Cooper, Joshua
Doerr, Benjamin
Friedrich, Tobias
Spencer, Joel | 2008 | | Deterministic Random Walks on Regular Trees
In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, 766-772 | Proceedings Article |
| Doerr2008GeccoProc | Keizer, Antoniol, Congdon, Deb, Doerr, Hansen, Holmes, Hornby, Howard, Kennedy, Kumar, Lobo, Miller, Moore, Neumann, Pelikan, Pollack, Sastry, Stanley, Stoica, Talbi, Wegener (ed.) | 2008 | | GECCO 2008: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation | Proceedings |
| Doerr2009 | Doerr, Benjamin | 2009 | | Introducing Quasirandomness to Computer Science
In: Efficient Algorithms : Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday, 99-111
In: Lecture Notes in Computer Science [5760], 99-111 | Part of a Book |
| Doerr2011 | Doerr, Benjamin
Johannsen, Daniel
Kötzing, Timo
Lehre, Per Christian
Wagner, Markus
Winzen, Carola | 2011 | | Faster black-box algorithms through higher arity operators
In: Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI (FOGA 2011), 163-172 | Proceedings Article |
| Doerr2012x | Doerr, Benjamin
Doerr, Carola
Spöhel, Reto
Thomas, Henning | 2013 | | Playing Mastermind with Many Colors
In: arXiv [abs/1207.0773], 1-22 | Electronic Journal Article |
| Doerr2013AppAlg | Doerr, Benjamin | 2013 | | Improved approximation algorithms for the Min-Max Selecting Items problem
In: Information Processing Letters [113], 747-749 | Journal Article |
| Doerr2013CECemo | Doerr, Benjamin
Kodric, Bojana
Voigt, Marco | 2013 | | Lower bounds for the runtime of a global multi-objective evolutionary algorithm
In: IEEE Congress on Evolutionary Computation, 432-439 | Proceedings Article |
| Doerr2013z | Doerr, C.
Schmidt, Jens M.
Ramakrishna, G. | 2013 | | Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time
In: 39th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'13), 225-236 | Proceedings Article |
| DoerrA11CCCG | Asano, Tetsuo
Doerr, Benjamin | 2011 | | Memory-constrained algorithms for shortest path problem
In: 23rd Annual Canadian Conference on Computational Geometry (CCCG 2011), 315-319 | Proceedings Article |
| DoerrANALCO06 | Cooper, Joshua
Doerr, Benjamin
Spencer, Joel
Tardos, Gábor | 2006 | | Deterministic Random Walks
In: Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments and the Third Workshop on Analytic Algorithmics and Combinatorics (ALENEX'06 / ANALCO'06), 185-197 | Proceedings Article |
| DoerrDE13 | Doerr, Benjamin
Doerr, Carola
Ebel, Franziska | 2013 | | Lessons From the Black-Box: Fast Crossover-Based Genetic Algorithms
In: Proc. of Genetic and Evolutionary Computation Conference (GECCO 2013), 781-788 | Proceedings Article |
| DoerrDR2013 | Doerr, Carola
De Rainville, François-Michel | 2013 | | Constructing Low Star Discrepancy Point Sets with Genetic Algorithms
In: Proc. of Genetic and Evolutionary Computation Conference (GECCO 2013), 789-796 | Proceedings Article |
| DoerrENTT11 | Doerr, Benjamin
Eremeev, Anton
Neumann, Frank
Theile, Madeleine
Thyssen, Christian | 2011 | | Evolutionary algorithms and dynamic programming
In: Theoretical Computer Science [412], 6020-6035 | Journal Article |
| Doerretal2010b | Doerr, Benjamin
Goldberg, Leslie Ann
Minder, Lorenz
Sauerwald, Thomas
Scheideler, Christian | 2010 | | Brief Announcement: Stabilizing Consensus with the Power of Two Choices
In: Distributed Computing : 24th International Symposium, DISC 2010, 528-530 | Proceedings Article |
| DoerretalGECCO2009 | Doerr, Benjamin
Eremeev, Anton
Horoba, Christian
Neumann, Frank
Theile, Madeleine | 2009 | | Evolutionary Algorithms and Dynamic Programming
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 771-777 | Proceedings Article |
| DoerrF12 | Doerr, Benjamin
Fouz, Mahmoud | 2011 | | Asymptotically optimal randomized rumor spreading
In: Electronic Notes in Discrete Mathematics [38], 297-302 | Electronic Journal Article |
| DoerrFF12CACM | Doerr, Benjamin
Fouz, Mahmoud
Friedrich, Tobias | 2012 | | Why Rumors Spread Fast in Social Networks
In: Communications of the ACM [55], 70-75 | Journal Article |
| DoerrFF12MedAlg | Doerr, Benjamin
Fouz, Mahmoud
Friedrich, Tobias | 2012 | | Experimental analysis of rumor spreading in social networks
In: Design and Analysis of Algorithms First Mediterranean Conference on Algorithms, MedAlg 2012, 159-173 | Proceedings Article |
| DoerrFF12SWAT | Doerr, Benjamin
Fouz, Mahmoud
Friedrich, Tobias | 2012 | | Asynchronous rumor spreading in preferential attachment graphs
In: Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops, 307-315 | Proceedings Article |
| DoerrFKS12 | Doerr, Benjamin
Friedrich, Tobias
Künnemann, Marvin
Sauerwald, Thomas | 2011 | | Quasirandom Rumor Spreading: An Experimental Analysis
In: ACM Journal of Experimental Algorithmics [16], Article No. 3.3 | Journal Article |
| DoerrFouz2006 | Doerr, Benjamin
Fouz, Mahmoud | 2006 | | Hereditary Discrepancies in Different Numbers of Colors II
In: ??? [?], 1-19 | Miscellaneous |
| doerrfouz2009 | Doerr, Benjamin
Fouz, Mahmoud | 2009 | | A Time-Randomness Tradeoff for Quasi-Random Rumour Spreading
In: Electronic Notes in Discrete Mathematics [34], 335 - 339 | Journal Article |
| DoerrFouz2010 | Doerr, Benjamin
Fouz, Mahmoud | 2010 | | Hereditary Discrepancies in Different Numbers of Colors II
In: SIAM Journal on Discrete Mathematics [24], 1205-1213 | Journal Article |
| DoerrFouzSchmidtWahlstroem2009 | Doerr, Benjamin
Fouz, Mahmoud
Schmidt, Martin
Wahlström, Magnus | 2009 | | BBOB: Nelder-Mead with resize and halfruns
In: Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference (GECCO 2009), 2239-2246 | Proceedings Article |
| DoerrFriedrichSauerwald09 | Doerr, Benjamin
Friedrich, Tobias
Sauerwald, Thomas | 2009 | | Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, 366-377 | Proceedings Article |
| doerrfriedrichsauerwald2009 | Doerr, Benjamin
Friedrich, Tobias
Sauerwald, Thomas | 2009 | | Quasirandom Rumor Spreading on Expanders
In: Electronic Notes in Discrete Mathematics [34], 243 - 247 | Journal Article |
| DoerrFW11 | Doerr, Benjamin
Fouz, Mahmoud
Witt, Carsten | 2011 | | Sharp bounds by probability-generating functions and variable drift
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 2083-2090 | Proceedings Article |
| DoerrFW2010 | Doerr, Benjamin
Fouz, Mahmoud
Witt, Carsten | 2010 | | Quasirandom Evolutionary Algorithms
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1457-1464 | Proceedings Article |
| DoerrG13algo | Doerr, Benjamin
Goldberg, Leslie Ann | 2013 | | Adaptive Drift Analysis
In: Algorithmica [65], 224-250 | Journal Article |
| DoerrGKP08 | Doerr, Benjamin
Gnewuch, Michael
Kritzer, Peter
Pillichshammer, Peter | 2008 | | Component-by-component construction of low-discrepancy point sets of small size
In: Monte Carlo Methods Applications [14], 129-150 | Journal Article |
| DoerrGMSS11 | Doerr, Benjamin
Goldberg, Leslie Ann
Minder, Lorenz
Sauerwald, Thomas
Scheideler, Christian | 2011 | | Stabilizing consensus with the power of two choices
In: 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA-11), 149-158 | Proceedings Article |
| DoerrGnewuch2008 | Doerr, Benjamin
Gnewuch, Michael | 2008 | | 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 |
| DoerrGnewuchKritzerPillichshammer2008 | Doerr, Benjamin
Gnewuch, Michael
Kritzer, Peter
Pillichshammer, Friedrich | 2008 | | Component-by-component construction of low-discrepancy point sets of small size
In: Monte Carlo Methods and Applications [14], 129-149 | Journal Article |
| DoerrGW2009 | Doerr, Benjamin
Gnewuch, Michael
Wahlström, Magnus | 2009 | | 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 |
| DoerrHapp2008 | Doerr, Benjamin
Happ, Edda | 2008 | | Directed trees: A Powerful Representation for Sorting and Ordering Problems
In: Proceedings of CEC 2008, 3606-3613 | Proceedings Article |
| DoerrHK11 | Doerr, Benjamin
Happ, Edda
Klein, Christian | 2011 | | Tight Analysis of the (1+1)-EA for the Single Source Shortest Path Problem
In: Evolutionary Computation [19], 673-691 | Journal Article |
| DoerrHK2012GECCO | Doerr, Benjamin
Hota, Ashish
Kötzing, Timo | 2012 | | 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 |
| DoerrHK2012TCS | Doerr, Benjamin
Happ, Edda
Klein, Christian | 2012 | | Crossover can provably be useful in evolutionary computation
In: Theoretical Computer Science [425], 17-33 | Journal Article |
| DoerrHL13 | Doerr, Benjamin
Huber, Anna
Levavi, Ariel | 2013 | | Strong robustness of randomized rumor spreading protocols
In: Discrete Applied Mathematics [161], 778-793 | Journal Article |
| DoerrJ11 | Doerr, Benjamin
Jansen, Thomas | 2011 | | Theory of Evolutionary Computation
In: Algorithmica [59], 299-300 | Journal Article |
| DoerrJ2010 | Doerr, Benjamin
Johannsen, Daniel | 2010 | | Edge-based representation beats vertex-based representation in shortest path problems
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 759-766 | Proceedings Article |
| DoerrJansenKlein2008 | Doerr, Benjamin
Jansen, Thomas
Klein, Christian | 2008 | | Comparing local and global mutations on bit-strings.
In: Genetic and Evolutionary Computation Conference 2008, 929-936 | Proceedings Article |
| DoerrJKNT13 | Doerr, Benjamin
Johannsen, Daniel
Kötzing, Timo
Neumann, Frank
Theile, Madeleine | 2013 | | More effective crossover operators for the all-pairs shortest path problem
In: Theoretical Computer Science [471], 12-26 | Journal Article |
| DoerrJohannsen07a | Doerr, Benjamin
Johannsen, Daniel | 2007 | | Adjacency List Matchings --- An Ideal Genotype for Cycle Covers
In: Genetic and Evolutionary Computation Conference (GECCO-2007), 1203-1210 | Proceedings Article |
| DoerrJohannsen2007b | Doerr, Benjamin
Johannsen, Daniel | 2007 | | Refined Runtime Analysis of a Basic Ant Colony Optimization Algorithm
In: IEEE Congress on Evolutionary Computation 2007, 501-507 | Proceedings Article |
| DoerrJohannsenTang2008a | Doerr, Benjamin
Johannsen, Daniel
Tang, Ching Hoo | 2008 | | How Single Ant ACO Systems Optimize Pseudo-Boolean Functions
In: Parallel Problem Solving from Nature – PPSN X, 378-388 | Proceedings Article |
| DoerrJSWZ10 | Doerr, Benjamin
Jansen, Thomas
Sudholt, Dirk
Winzen, Carola
Zarges, Christine | 2010 | | Optimizing Monotone Functions Can Be Difficult
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 42-51 | Proceedings Article |
| DoerrJSWZ13EvCo | Doerr, Benjamin
Jansen, Thomas
Sudholt, Dirk
Winzen, Carola
Zarges, Christine | 2013 | | Mutation rate matters even when optimizing monotonic functions
In: Evolutionary Computation [21], 1-27 | Journal Article |
| DoerrJW10a | Doerr, Benjamin
Johannsen, Daniel
Winzen, Carola | 2010 | | Multiplicative Drift Analysis
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1449-1456 | Proceedings Article |
| DoerrJW10b | Doerr, Benjamin
Johannsen, Daniel
Winzen, Carola | 2010 | | Drift Analysis and Linear Functions Revisited
In: Proceedings of the IEEE Congress on Evolutionary Computation (CEC 2010). - Pt. 3, 1967-1974 | Proceedings Article |
| DoerrJW12 | Doerr, Benjamin
Johannsen, Daniel
Winzen, Carola | 2012 | | Non-existence of linear universal drift functions
In: Theoretical Computer Science [436], 71-86 | Journal Article |
| DoerrJW12Multi | Doerr, Benjamin
Johannsen, Daniel
Winzen, Carola | 2012 | | Multiplicative Drift Analysis
In: Algorithmica [64], 673-697 | Journal Article |
| DoerrK2013a | Doerr, Benjamin
Künnemann, Marvin | 2013 | | Royal Road Functions and the (1 + λ) Evolutionary Algorithm: Almost no Speed-up from Larger Offspring Populations
In: 2013 IEEE Congress on Evolutionary Computation (CEC 2013), 424-431 | Proceedings Article |
| DoerrK2013b | Doerr, Benjamin
Künnemann, Marvin | 2013 | | How the (1+λ) Evolutionary Algorithm Optimizes Linear Functions
In: 15th Annual Conference on Genetic and Evolutionary Computation Conference (GECCO '13), 1589-1596 | Proceedings Article |
| DoerrKLW13 | Doerr, Benjamin
Kötzing, Timo
Lengler, Johannes
Winzen, Carola | 2013 | | Black-Box Complexities of Combinatorial Problems
In: Theoretical Computer Science [471], 84-106 | Journal Article |
| DoerrKuennemann2010 | Doerr, Benjamin
Künnemann, Marvin
Wahlström, Magnus | 2010 | | Randomized Rounding for Routing and Covering Problems: Experiments and Improvements
In: Experimental Algorithms : 9th International Symposium, SEA 2010, 190-201 | Proceedings Article |
| DoerrKW11 | Doerr, Benjamin
Kötzing, Timo
Winzen, Carola | 2011 | | Too fast unbiased black-box algorithms
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 2043-2050 | Proceedings Article |
| DoerrLKW11 | Doerr, Benjamin
Lengler, Johannes
Kötzing, Timo
Winzen, Carola | 2011 | | Black-box complexities of combinatorial problems
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 981-988 | Proceedings Article |
| DoerrM11 | Doerr, Benjamin
Fouz, Mahmoud | 2011 | | Asymptotically Optimal Randomized Rumor Spreading
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 502-513 | Proceedings Article |
| DoerrMJ11 | Doerr, Benjamin
Johannsen, Daniel
Schmidt, Martin | 2011 | | Runtime analysis of the (1+1) evolutionary algorithm on strings over finite alphabets
In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, 119-126 | Proceedings Article |
| DoerrMMW2012arxiv | Doerr, Benjamin
Moran, Shay
Moran, Shlomo
Winzen, Carola | 2012 | | Simple and Optimal Fault-Tolerant Rumor Spreading
In: arXiv [abs/1209.6158], 1-18 | Electronic Journal Article |
| DoerrNeumann | Doerr, Benjamin
Neumann, Frank | 2010 | | In Memoriam: Ingo Wegener
In: Algorithmica [58], 541-542 | Journal Article |
| DoerrNeumannWegener2010 | Doerr, Benjamin
Neumann, Frank
Wegener, Ingo | 2010 | | Editorial
In: Algorithmica [57], 119-120 | Journal Article |
| DoerrNSW11 | Doerr, Benjamin
Neumann, Frank
Sudholt, Dirk
Witt, Carsten | 2011 | | Runtime analysis of the 1-ANT ant colony optimizer
In: Theoretical Computer Science [412], 1629-1644 | Journal Article |
| DoerrP12GECCO | Doerr, Benjamin
Pohl, Sebastian | 2012 | | Run-time analysis of the (1+1) evolutionary algorithm optimizing linear functions over a finite alphabet
In: GECCO'12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, 1317-1324 | Proceedings Article |
| DoerrSTACS2005 | Doerr, Benjamin | 2005 | | Roundings Respecting Hard Constraints
In: STACS 2005 : 22nd Annual Symposium on Theoretical Aspects of Computer Science (STACS'05), 617-628 | Proceedings Article |
| DoerrStacs2006 | Doerr, Benjamin | 2006 | | Generating Randomized Roundings with Cardinality Constraints and Derandomizations
In: STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, 571-583 | Proceedings Article |
| DoerrSTW12 | Doerr, Benjamin
Spöhel, Reto
Thomas, Henning
Winzen, Carola | 2012 | | Playing Mastermind with Many Colors
In: Proc. of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2012), | Proceedings Article |
| DoerrSTW13 | Doerr, Benjamin
Spöhel, Reto
Thomas, Henning
Winzen, Carola | 2013 | | Playing Mastermind with many colors
In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), 695-704 | Proceedings Article |
| DoerrSW2013FOGA | Doerr, Benjamin
Sudholt, Dirk
Witt, Carsten | 2013 | | When Do Evolutionary Algorithms Optimize Separable Functions in Parallel?
In: ACM/SIGEVO Foundations of Genetic Algorithms (FOGA 2013), 51-63 | Proceedings Article |
| DoerrTCS2007 | Doerr, Benjamin | 2007 | | Roundings respecting hard constraints
In: Theory of Computing Systems [40], 467-483 | Journal Article |
| DoerrTheileGECCO2009 | Doerr, Benjamin
Theile, Madeleine | 2009 | | Improved Analysis Methods for Crossover-Based Algorithms
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 247-254 | Proceedings Article |
| DoerrTusnady | Doerr, Benjamin | 2007 | | Matrix approximation and Tusnády's problem
In: European Journal of Combinatorics [28], 990-995 | Journal Article |
| DoerrW10 | Doerr, Benjamin
Winzen, Carola | 2011 | | Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity
In: Computer Science - Theory and Applications : 6th International Computer Science Symposium in Russia (CSR 2011), 15-28 | Proceedings Article |
| DoerrW11ECCC | Doerr, Benjamin
Winzen, Carola | 2011 | | Memory-Restricted Black-Box Complexity
In: Electronic Colloquium on Computational Complexity [18], 7 | Electronic Journal Article |
| DoerrW12 | Doerr, Benjamin
Winzen, Carola | 2012 | | Memory-restricted black-box complexity of OneMax
In: Information Processing Letters [112], 32-34 | Journal Article |
| DoerrW12EA | Doerr, Benjamin
Winzen, Carola | 2012 | | 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 |
| DoerrW12GECCO | Doerr, Benjamin
Winzen, Carola | 2012 | | Reducing the arity in unbiased black-box complexity
In: GECCO'12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, 1309-1316 | Proceedings Article |
| DoerrW12Ranking | Doerr, Benjamin
Winzen, Carola | 2014 | | Ranking-Based Black-Box Complexity
In: Algorithmica [?], ? | Journal Article |
| DoerrW12STACS | Doerr, Benjamin
Winzen, Carola | 2012 | | Playing Mastermind with Constant-Size Memory
In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 441-452 | Electronic Proceedings Article |
| DoerrW12ToCS | Doerr, Benjamin
Winzen, Carola | 2012 | | Playing Mastermind with Constant-Size Memory
In: Theory of Computing Systems [Online First], 1-27 | Electronic Journal Article |
| Donato-etal-Web-07 | Donato, Debora
Laura, Luigi
Leonardi, Stefano
Millozzi, Stefano
Meyer, Ulrich
Sibeyn, Jop F. | 2006 | | Algorithms and Experiments for the Webgraph
In: Journal of Graph Algorithms and Applications [10], 219-236 | Electronic Journal Article |
| Dorchain96 | Dorchain, Jörg | 1996 | | An Implementation of a Convex Hull Algorithm Version 2.0
Universität des Saarlandes | Thesis - Masters thesis |
| DSSS04 | Dementiev, Roman
Sanders, Peter
Schultes, Dominik
Sibeyn, Jop F. | 2004 | | Engineering an External Memory Minimum Spanning Tree Algorithm
In: 3rd IFIP International Conference on Theoretical Computer Science (TSC2004), 195-208 | Proceedings Article |
| Duan2013 | Duan, Ran | 2013 | | Breaking the $O(n^2.5)$ Deterministic Time Barrier for Undirected Unit-Capacity Maximum Flow
In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), 1171-1179 | Proceedings Article |
| DubhashiRanjan98 | Dubhashi, Devdatt
Ranjan, Desh | 1998 | | Balls and Bins: A Study in Negative Dependence
In: Random Structures & Algorithms [13], 99-124 | Journal Article |
| Dumitriu2007 | Dumitriu, Daniel | 2007 | | Graph-based Conservative Surface Reconstruction
Universität des Saarlandes | Thesis - Masters thesis |
| Dumitriu2008a | Dumitriu, Daniel
Funke, Stefan
Kutz, Martin
Milosavljevic, Nikola | 2008 | | On the Locality of Extracting a 2-Manifold in $R^3$
In: Collection of abstracts of the 24th European Workshop on Computational Geometry, 205-208 | Proceedings Article |
| Duncan-Goodrich-Ramos97 | Duncan, C.A.
Goodrich, Michael T.
Ramos, Edgar A. | 1997 | | 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 |
| DW09 | Doerr, Benjamin
Wahlström, Magnus | 2009 | | 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 |
| DynamicGraphRumor | Clementi, Andrea
Crescenzi, Pierluigi
Doerr, Carola
Fraigniaud, Pierre
Pasquale, Francesco
Silvestri, Riccardo | 2013 | | Diffusion probabiliste dans les reseaux dynamiques
In: Proc. of the 15èmes Rencontres Francophones pour les Aspects Algorithmiques des Télécommunications (AlgoTel 2013), | Proceedings Article |
| EadesMutzel1998 | Eades, Peter
Mutzel, Petra | 1998 | | Graph Drawing Algorithms
In: Algorithms and Theory of Computation Handbook, 9-26 | Part of a Book |
| EadesMutzel1999 | Mutzel, Petra
Eades, Peter | 1999 | | Graph Drawing Algorithms
In: Algorithms & Theory of Computation Handbook, 9-1-9-26 | Part of a Book |
| EadMarksMutzelNorth1998 | Eades, Peter
Marks, Joe
Mutzel, Petra
North, Stephen | 1998 | | Graph Drawing Contest Report
In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 423-435 | Proceedings Article |
| EBS_09 | Emeliyanenko, Pavel
Berberich, Eric
Sagraloff, Michael | 2009 | | Visualizing Arcs of Implicit Algebraic Curves, Exactly and Fast
In: Advances in Visual Computing : 5th International Symposium, ISVC 2009, 608-619 | Proceedings Article |
| ecg:beh-eeeac-04 | Berberich, Eric
Eigenwillig, Arno
Hemmer, Michael
Hert, Susan
Kettner, Lutz
Mehlhorn, Kurt
Reichel, Joachim
Schmitt, Susanne
Schömer, Elmar
Weber, Dennis
Wolpert, Nicola | 2004 | | EXACUS: Efficient and Exact Algorithms for Curves and Surfaces | Report |
| ecg:fhw-stcca-03 | Berberich, Eric
Eigenwillig, Arno
Fogel, Efi
Halperin, Dan
Hert, Susan
Kettner, Lutz
Teillaud, Monique
Wein, Ron | 2003 | | Specification of the traits classes for CGAL arrangements of curves | Report |
| ecg:ghh-boscd-03 | Granados, Miguel
Hachenberger, Peter
Hert, Susan
Kettner, Lutz
Mehlhorn, Kurt
Seel, Michael | 2003 | | Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation | Report |
| ecg:hks-emfga-04 | Hemmer, Michael
Kettner, Lutz
Schömer, Elmar | 2004 | | Effects of a Modular Filter on Geometric Applications | Report |
| ecg:kmp-cerpg-03 | Kettner, Lutz
Mehlhorn, Kurt
Pion, Sylvain
Schirra, Stefan
Yap, Chee | 2004 | | Classroom Examples of Robustness Problems in Geometric Computations | Report |
| EdelkampMeyer2001 | Edelkamp, Stefan
Meyer, Ulrich | 2001 | | Theory and Practice of Time-Space Trade-Offs in Memory Limited Search
In: Proceedings of the Joint German/Austrian Conference on AI: Advances in Artificial Intelligence (KI-01), 169-184 | Proceedings Article |
| Edelsbrunner-Ramos97 | Edelsbrunner, Herbert
Ramos, Edgar A. | 1997 | | Inclusion-exclusion complexes for pseudo-disk collections
In: Discrete and Computational Geometry [17], 287-306 | Journal Article |
| efgk2003 | Eisenbrand, Friedrich
Funke, Stefan
Garg, Naveen
Könemann, Jochen | 2003 | | 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 |
| EFK00 | Eiglsperger, Markus
Fekete, Sandor P.
Klau, Gunnar W. | 2001 | | Orthogonal Graph Drawing
In: Drawing Graphs: Methods and Models, 121-171 | Part of a Book |
| EFKM2005 | Eisenbrand, Friedrich
Funke, Stefan
Karrenbauer, Andreas
Matijevic, Domagoj | 2005 | | Energy-Aware Stage Illumination
In: Proceedings of the 21st Annual Symposium on Computational Geometry : (SCG05), 336-346 | Proceedings Article |
| EFKM2008 | Eisenbrand, Friedrich
Funke, Stefan
Karrenbauer, Andreas
Matijevic, Domagoj | 2008 | | Energy-Aware Stage Illumination
In: International Journal of Computational Geometry and Applications [18], 107-129 | Journal Article |
| eigenwillig-phd-08 | Eigenwillig, Arno | 2008 | | Real Root Isolation for Exact and Approximate Polynomials Using Descartes' Rule of Signs
Universität des Saarlandes | Thesis - PhD thesis |
| Eigenwillig2004a | Eigenwillig, Arno
Kettner, Lutz
Schömer, Elmar
Wolpert, Nicola | 2004 | | Complete, Exact and Efficient Computations with Cubic Curves
In: Proceedings of the Twentieth Annual Symposium on Computational Geometry : (SCG'04), 409-418 | Proceedings Article |
| Eigenwillig2005 | Eigenwillig, Arno
Kettner, Lutz
Krandick, Werner
Mehlhorn, Kurt
Schmitt, Susanne
Wolpert, Nicola | 2005 | | A Descartes algorithm for polynomials with bit-stream coefficients
In: Computer Algebra in Scientific Computing : 8th International Workshop, CASC 2005, 138-149 | Proceedings Article |
| Eigenwillig2006a | Eigenwillig, Arno
Sharma, Vikram
Yap, Chee K. | 2006 | | Almost Tight Recursion Tree Bounds for the Descartes Method
In: ISSAC '06: Proceedings of the 2006 international symposium on Symbolic and algebraic computation, 71-78 | Electronic Proceedings Article |
| Eigenwillig2007a | Eigenwillig, Arno | 2007 | | On Multiple Roots in Descartes' Rule and Their Distance to Roots of Higher Derivatives
In: Journal of Computational and Applied Mathematics [200], 226-230 | Journal Article |
| Eigenwillig2007b | Eigenwillig, Arno
Kettner, Lutz
Wolpert, Nicola | 2007 | | Snap rounding of Bézier curves
In: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07), 158-167 | Proceedings Article |
| EisenbrandIJCGA2007 | Eisenbrand, Friedrich
Funke, Stefan
Karrenbauer, Andreas
Reichel, Joachim
Schömer, Elmar | 2007 | | Packing a truck - Now with a twist!
In: International Journal of Computational Geometry & Applications [17], 505-527 | Journal Article |
| ek-eae2aoaac-08 | Eigenwillig, Arno
Kerber, Michael | 2008 | | Exact and Efficient 2D-Arrangements of Arbitrary Algebraic Curves
In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA08), 122-131 | Proceedings Article |
| ek-vaepaa-08 | Emeliyanenko, Pavel
Kerber, Michael | 2008 | | Visualizing and Exploring Planar Algebraic Arrangements -- a Web Application
In: Proceedings of the 24th ACM Symposium on Computational Geometry, 224-225 | Proceedings Article |
| eksw-eecaccc-06 | Eigenwillig, Arno
Kettner, Lutz
Schömer, Elmar
Wolpert, Nicola | 2006 | | Exact, Efficient and Complete Arrangement Computation for Cubic Curves
In: Computational Geometry [35], 36-73 | Journal Article |
| EKSX2006 | Eisenbrand, Friedrich
Karrenbauer, Andreas
Skutella, Martin
Xu, Chihao | 2006 | | Multiline Addressing by Network Flow
In: Algorithms - ESA 2006 : 14th Annual European Symposium, 744-755 | Proceedings Article |
| EKSX2008 | Eisenbrand, Friedrich
Karrenbauer, Andreas
Skutella, Martin
Xu, Chihao | 2009 | | Multiline Addressing by Network Flow
In: Algorithmica [53], 583-596 | Journal Article |
| ekw-fast-2007 | Eigenwillig, Arno
Kerber, Michael
Wolpert, Nicola | 2007 | | Fast and Exact Geometric Analysis of Real Algebraic Plane Curves
In: Proceedings of the 2007 International Symposium on Symbolic and Algebraic Computation, 151-158 | Proceedings Article |
| EKX2007 | Eisenbrand, Friedrich
Karrenbauer, Andreas
Xu, Chihao | 2007 | | Algorithms for longer OLED Lifetime
In: WEA 2007, 338-351 | Proceedings Article |
| Elbassioni2000 | Boros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir | 2000 | | An Efficient Incremental Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension
In: Parallel Processing Letters [10], 14 | Journal Article |
| Elbassioni2001 | Boros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir
Makino, Kazuhisa | 2001 | | On 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 |
| Elbassioni2002a | Boros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir
Makino, Kazuhisa | 2002 | | Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities
In: SIAM Journal on Computing [31], 20 | Journal Article |
| Elbassioni2002b | Boros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir | 2002 | | Matroid Intersections, Polymatroid Inequalities, and Related Problems
In: Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, 143-154 | Proceedings Article |
| Elbassioni2002bz | Boros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir | 2002 | | Generating Dual-Bounded Hypergraphs
In: Optimization Methods and Software [17], 33 | Electronic Journal Article |
| [Replication or Save Conflict] | | | | | |
| Elbassioni2002d | Elbassioni, Khaled M. | 2002 | | An Algorithm for Dualization in Products of Lattices and Its Applications
In: Algorithms - ESA 2002, 10th Annual European Symposium, 424-435 | Proceedings Article |
| Elbassioni2003a | Boros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir | 2003 | | An Inequality for Polymatroid Functions and its Applications
In: Discrete Applied mathematics [131], 27 | Journal Article |
| Elbassioni2003b | Boros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir | 2003 | | Extending 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 |
| Elbassioni2003c | Boros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
Khachiyan, Leonid | 2003 | | Algorithms for Enumerating Circuits in Matroids.
In: Algorithms and Computation, 14th International Symposium, ISAAC 2003, 485-494 | Proceedings Article |
| Elbassioni2003d | Boros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
Khachiyan, Leonid
Makino, Kazuhisa | 2003 | | An Intersection Inequality for Discrete Distributions and Related Generation Problems
In: Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, 543-555 | Proceedings Article |
| Elbassioni2003dz | Elbassioni, Khaled M.
Elmasry, Amr
Kamel, Ibrahim | 2003 | | An Efficient Indexing Scheme for Multi-dimensional Moving Objects
In: Database Theory - ICDT 2003, 9th International Conference, 425-439 | Proceedings Article |
| Elbassioni2003e | Boros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir | 2003 | | An Efficient Implementation of a Quasi-polynomial Algorithm for Generating Hypergraph Transversals
In: Algorithms - ESA 2003, 11th Annual European Symposium, 556-567 | Proceedings Article |
| Elbassioni2004 | Elbassioni, Khaled M. | 2002 | | On Dualization in Products of Forests.
In: STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, 142-153 | Proceedings Article |
| Elbassioni2004a | Boros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
Khachiyan, Leonid | 2004 | | An Efficient Implementation of a Joint Generation Algorithm
In: Experimental and efficient algorithms : Third International Workshop, WEA 2004, 114-128 | Proceedings Article |
| Elbassioni2004b | Boros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
Khachiyan, Leonid
Makino, Kazuhisa | 2004 | | Generating Paths and Cuts in Multi-pole (Di)graphs
In: Mathematical foundations of computer science 2004 : 29th International Symposium, MFCS 2004, 298-309 | Proceedings Article |
| Elbassioni2004d | Boros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
Khachiyan, Leonid | 2004 | | Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections
In: LATIN 2004: Theoretical Informatics, 6th Latin American Symposium, 488-498 | Proceedings Article |
| Elbassioni2004e | Boros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
Khachiyan, Leonid | 2004 | | Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems
In: Integer programming and combinatorial optimization : 10th International IPCO Conference, 152-162 | Proceedings Article |
| Elbassioni2004f | Mokbel, Mohamed F.
Aref, Walid G.
Elbassioni, Khaled M.
Kamel, Ibrahim | 2004 | | Scalable Multimedia Disk Scheduling
In: 20th International Conference on Data Engineering, ICDE 2004, 498-509 | Proceedings Article |
| Elbassioni2004g | Boros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir | 2004 | | Algorithms 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 |
| Elbassioni2005a | Elbassioni, Khaled M.
Mustafa, Nabil H. | 2005 | | Conflict-Free Colorings of Rectangle Ranges for Wireless Networks | Unpublished/Draft |
| Elbassioni2005d | Khachiyan, Leonid
Boros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir | 2005 | | A New Algorithm for the Hypergraph Transversal Problem
In: Computing and combinatorics : 11th Annual International Conference, COCOON 2005, 767-776 | Proceedings Article |
| Elbassioni2005e | Khachiyan, Leonid
Boros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir | 2005 | | 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 |
| Elbassioni2005f | Khachiyan, Leonid
Boros, Endre
Borys, Konrad
Elbassioni, Khaled M.
Gurvich, Vladimir | 2005 | | Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 156-165 | Proceedings Article |
| Elbassioni2005g | Elbassioni, Khaled M.
Katriel, Irit
Kutz, Martin
Mahajan, Meena | 2005 | | Simultaneous Matchings
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 106-115 | Proceedings Article |
| Elbassioni2005ja | Elbassioni, Khaled M.
Elmasry, Amr
Kamel, Ibrahim | 2005 | | An Indexing Method for Answering Queries on Moving Objects
In: Distributed and Parallel Databases [17], 215-249 | Journal Article |
| Elbassioni2005jb | Khachiyan, Leonid
Boros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
Makino, Kazuhisa | 2005 | | On the Complexity of Some Enumeration Problems for Matroids
In: SIAM Journal on Discrete Mathematics [19], 966-984 | Journal Article |
| Elbassioni2006 | Elbassioni, Khaled M. | 2006 | | On the Complexity of Monotone Boolean Duality Testing | Report |
| Elbassioni2006a | Khachiyan, Leonid
Boros, Endre
Borys, Konrad
Elbassioni, Khaled M.
Gurvich, Vladimir | 2006 | | 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 |
| Elbassioni2006b | Elbassioni, Khaled M.
Mustafa, Nabil H. | 2006 | | Conflict-Free Colorings of Rectangle Ranges
In: STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, 254-263 | Proceedings Article |
| Elbassioni2006c | Elbassioni, Khaled M. | 2006 | | Finding All Minimal Infrequent Multi-dimensional Intervals
In: LATIN 2006: Theoretical Informatics, 7th Latin American Symposium, 423-434 | Proceedings Article |
| Elbassioni2006d | Elbassioni, Khaled M. | 2006 | | On the Complexity of the Multiplication Method for Monotone CNF/DNF Dualization
In: Algorithms - ESA 2006, 14th Annual European Symposium, 340-351 | Proceedings Article |
| Elbassioni2006e | Elbassioni, Khaled M.
Lotker, Zvi
Seidel, Raimund | 2006 | | Upper bound on the number of vertices of polyhedra with 0, 1-constraint matrices
In: Information Processing Letters [100], 69 - 71 | Journal Article |
| Elbassioni2006f | Khachiyan, Leonid
Boros, Endre
Borys, Konrad
Elbassioni, Khaled M.
Gurvich, Vladimir
Makino, Kazuhisa | 2006 | | Enumerating Spanning and Connected Subsets in Graphs and Matroids
In: Algorithms - ESA 2006, 14th Annual European Symposium, 444-455 | Proceedings Article |
| Elbassioni2006g | Elbassioni, Khaled M.
Fishkin, Aleksei V.
Sitters, Rene | 2006 | | On Approximating the TSP with Intersecting Neighborhoods
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 213-222 | Proceedings Article |
| Elbassioni2007a | Ajwani, Deepak
Elbassioni, Khaled M.
Govindarajan, Sathish
Ray, Saurabh | 2007 | | 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 |
| Elbassioni2007b | Elbassioni, Khaled M.
Sitters, Rene
Zhang, Yan | 2007 | | A Quasi-PTAS for Envy-free Pricing on Line Graphs | Unpublished/Draft |
| Elbassioni2007c | Boros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
Makino, Kazuhisa | 2007 | | Generating Vertices of Polyhedra and Related Monotone Generation Problems | Unpublished/Draft |
| Elbassioni2007d | Elbassioni, Khaled
Sitters, Rene
Zhang, Yan | 2007 | | 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 |
| Elbassioni2007e | Boros, Endre
Borys, Konrad
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa
Rudolf, Gabor | 2007 | | Generating Minimal k-Vertex Connected Spanning Subgraphs
In: Computing and Combinatorics, 13th Annual International Conference, COCOON 2007, Proceedings, 222-231 | Proceedings Article |
| Elbassioni2007f | Ajwani, Deepak
Elbassioni, Khaled
Govindarajan, Sathish
Ray, Saurabh | 2007 | | 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 |
| Elbassioni2007g | Khachiyan, Leonid
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa | 2007 | | Enumerating disjunctions and conjunctions of paths and cuts in reliability theory
In: Discrete Applied Mathematics [155], 137-149 | Journal Article |
| Elbassioni2007h | Khachiyan, Leonid
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir | 2007 | | A global parallel algorithm for the hypergraph transversal problem
In: Information Processing Letters [101], 148-155 | Journal Article |
| Elbassioni2007i | Khachiyan, Leonid
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa | 2007 | | 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 |
| Elbassioni2007j | Khachiyan, Leonid
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir | 2007 | | On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs
In: Theoretical Computer Science [382], 139-150 | Journal Article |
| Elbassioni2008 | Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Tiwary, Hans Raj | 2008 | | 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 |
| Elbassioni2008a | Tiwary, Hans Raj
Elbassioni, Khaled | 2008 | | On the complexity of checking self-duality of polytopes and its relations to vertex enumeration and graph isomorphism
In: Symposium on Computational Geometry 2008, 192-198 | Proceedings Article |
| Elbassioni2008b | Elbassioni, Khaled
Hagen, Matthias
Rauf, Imran | 2008 | | 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 |
| Elbassioni2008c | Boros, Endre
Elbassioni, Khaled
Makino, Kazuhisa | 2008 | | On Berge Multiplication for Monotone Boolean Dualization
In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, 48-59 | Proceedings Article |
| Elbassioni2008d | Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa
Oudalov, Vladimir | 2008 | | 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 |
| Elbassioni2008e | Elbassioni, Khaled
Tiwary, Hans Raj | 2008 | | On a Cone Covering Problem
In: Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 171-174 | Proceedings Article |
| Elbassioni2008f | Khachiyan, Leonid
Boros, Endre
Borys, Konrad
Elbassioni, Khaled
Gurvich, Vladimir
Rudolf, Gabor
Zhao, Jihui | 2008 | | On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction
In: Theory Comput. Syst. [43], 204-233 | Journal Article |
| Elbassioni2008g | Kutz, Martin
Elbassioni, Khaled
Katriel, Irit
Mahajan, Meena | 2008 | | Simultaneous matchings: Hardness and approximation
In: J. Comput. Syst. Sci. [74], 884-897 | Journal Article |
| Elbassioni2008h | Elbassioni, Khaled | 2008 | | A note on systems with max-min and max-product constraints
In: Fuzzy Sets and Systems [159], 2272-2277 | Journal Article |
| Elbassioni2008i | Elbassioni, Khaled | 2008 | | On the complexity of monotone dualization and generating minimal hypergraph transversals
In: Discrete Applied Mathematics [156], 2109-2123 | Journal Article |
| Elbassioni2008j | Khachiyan, Leonid
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir | 2008 | | 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 |
| Elbassioni2008k | Khachiyan, Leonid
Boros, Endre
Borys, Konrad
Elbassioni, Khaled
Gurvich, Vladimir | 2008 | | Generating All Vertices of a Polyhedron Is Hard
In: Discrete & Computational Geometry [39], 174-190 | Journal Article |
| Elbassioni2008l | Elbassioni, Khaled
Tiwary, Hans Raj | 2008 | | On Computing the Vertex Centroid of a Polyhedron
In: CoRR [abs/0806.3456], x-x | Journal Article |
| Elbassioni2008m | Khachiyan, Leonid
Boros, Endre
Borys, Konrad
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa | 2008 | | Generating Cut Conjunctions in Graphs and Related Problems
In: Algorithmica [51], 239-263 | Journal Article |
| Elbassioni2008n | Khachiyan, Leonid
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir | 2008 | | On Enumerating Minimal Dicuts and Strongly Connected Subgraphs
In: Algorithmica [50], 159-172 | Journal Article |
| Elbassioni2008o | Elbassioni, Khaled
Elmasry, Amr
Kamel, Ibrahim | 2008 | | Indexing Schemes for Multi-dimensional Moving Objects
In: Encyclopedia of GIS, 523-529 | Part of a Book |
| Elbassioni2008p | Elbassioni, Khaled | 2009 | | Algorithms for Dualization over Products of Partially Ordered Sets
In: SIAM Journal on Discrete Mathematics [23], 487-510 | Journal Article |
| Elbassioni2009a | Elbassioni, Khaled
Raman, Rajiv
Ray, Saurabh
Sitters, Rene | 2009 | | On the approximability of the maximum feasible subsystem problem with 0/1-coefficients
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 1210-1219 | Proceedings Article |
| Elbassioni2009d | Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa | 2010 | | 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 |
| Elbassioni2009ISAAC | Elbassioni, Khaled
Tiwary, Hans Raj | 2009 | | Complexity of Approximating the Vertex Centroid of a Polyhedron
In: Algorithms and Computation, 20th International Symposium (ISAAC), 413-422 | Proceedings Article |
| Elbassioni2009x | Elbassioni, Khaled
Fishkin, Aleksei V.
Sitters, René | 2009 | | Approximation algorithms for the Euclidean traveling salesman problem with discrete and continuous neighborhoods
In: International Journal of Computational Geometry & Applications [19], 173-193 | Journal Article |
| Elbassioni2010 | Canzar, Stefan
Elbassioni, Khaled
Elmasry, Amr
Raman, Rajiv | 2010 | | On the Approximability of the Maximum Interval Constrained Coloring Problem
In: Algorithms and Computation : 21st International Symposium, ISAAC 2010. - Pt. II, 168-179 | Proceedings Article |
| Elbassioni2010a | Elbassioni, Khaled
Chan, Hubert | 2010 | | A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics
In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 256-267 | Proceedings Article |
| Elbassioni2010b | Elbassioni, Khaled
Matijevic, Domagoj
Severdija, Domagoj | 2010 | | Guarding 1.5-Dimensional with Demands
In: 26th European Workshop on Computational Geometry (EuroCG 2010), 133-136 | Proceedings Article |
| Elbassioni2010g | Elbassioni, Khaled
Fouz, Mahmoud
Swamy, Chaitanya | 2010 | | Approximation Algorithms for Non-single-minded Profit-Maximization Problems with Limited Supply
In: Internet and Network Economics : 6th International Workshop, WINE 2010, 462-472 | Proceedings Article |
| Elbassioni2010h | Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa | 2010 | | On Nash Equilibria and Improvement Cycles in Pure Positional Strategies for Chess-like and Backgammon-like $n$-person Games | Unpublished/Draft |
| Elbassioni2010i | Christodoulou, George
Elbassioni, Khaled
Fouz, Mahmoud | 2010 | | Truthful Mechanisms for Exhibitions
In: Internet and Network Economics : 6th International Workshop, WINE 2010, 170-181 | Proceedings Article |
| Elbassioni2011a | Elbassioni, Khaled
Tiwary, Hans Raj | 2011 | | On a cone covering problem
In: Computational Geometry [44], 129-134 | Journal Article |
| Elbassioni2011d | Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa | 2011 | | A lower bound for discounting algorithms solving two-person zero-sum limit average payoff stochastic games | Unpublished/Draft |
| Elbassioni2011e | Boros, Endre
Elbassioni, Khaled
Fouz, Mahmoud
Gurvich, Vladimir
Makino, Kazuhisa
Manthey, Bodo | 2011 | | Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 147-158 | Proceedings Article |
| Elbassioni2011f | Canzar,Stefan
Elbassioni, Khaled
Klau, Gunnar W.
Mestre, Julian | 2011 | | On Tree-Constrained Matchings and Generalizations
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 98-109 | Proceedings Article |
| Elbassioni2011g | Elbassioni, Khaled
Rauf, Imran
Ray, Saurabh | 2011 | | Enumerating Minimal Transversals of Geometric Hypergraphs
In: 23rd Canadian Conference on Computational Geometry (CCCG 2011), 437-442 | Electronic Proceedings Article |
| Elbassioni2011h | Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa | 2012 | | Every Stochastic Game with Perfect Information Admits a Canonical Form
In: 2nd International ICST Conference on Game Theory for Networks (GameNets 2011), | Unpublished/Draft |
| Elbassioni2011i | Elbassioni, Khaled
Elmasry, Amr
Makino, Kazuhisa | 2011 | | Finding Simplices containing the Origin in Two and Three Dimensions
In: International Journal of Computational Geometry & Applications [21], 495-506 | Journal Article |
| Elbassioni2011j | Chan, T.-H. Hubert
Elbassioni, Khaled | 2011 | | A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics
In: Discrete & Computational Geometry [46], 704-723 | Journal Article |
| Elbassioni2011k | Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Tiwary, Hans Raj | 2011 | | The negative cycles polyhedron and hardness of checking some polyhedral properties
In: Annals of Operations Research [188], 63-76 | Journal Article |
| Elbassioni2011l | Althaus, Ernst
Canzar, Stefan
Elbassioni, Khaled
Karrenbauer, Andreas
Mestre, Julian | 2011 | | Approximation Algorithms for the Interval Constrained Coloring Problem
In: Algorithmica [61], 342-361 | Journal Article |
| Elbassioni2011m | Elbassioni, Khaled
Krohn, Erik
Matijevic, Domagoj
Mestre, Julian
Severdija, Domagoj | 2011 | | Improved Approximations for Guarding 1.5-Dimensional Terrains
In: Algorithmica [60], 451-463 | Journal Article |
| Elbassioni2011n | Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa | 2012 | | 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 |
| Elbassioni2012a | Elbassioni, Khaled
Paluch, Katarzyna
van Zuylen, Anke | 2012 | | Simpler Approximation of the Maximum Asymmetric Traveling Salesman Problem
In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 501-506 | Electronic Proceedings Article |
| Elbassioni2012b | Elbassioni, Khaled
Tiwary, Hans Raj | 2012 | | Complexity of Approximating the Vertex Centroid of a Polyhedron
In: Theoretical Computer Science [421], 56-61 | Journal Article |
| Elbassioni2012c | Canzar, Stefan
El-Kebir, Mohammed
Pool, Rene
Elbassioni, Khaled
Malde, Alpeshkumar K.
Mark, Alan E.
Geerke, Daan P.
Stougie, Leen
Klau, Gunnar W. | 2012 | | Charge Group Partitioning in Biomolecular Simulation
In: Research in Computational Molecular Biology : 16th Annual International Conference, RECOMB 2012, 29-43 | Proceedings Article |
| Elbassioni2012d | Elbassioni, Khaled
Rauf, Imran
Ray, Saurabh | ?? | | On Enumerating Minimal Transversals of Geometric Hypergraphs | Unpublished/Draft |
| Elbassioni2012e | Elbassioni, Khaled | 2012 | | A QPTAS for ε-Envy-Free Profit-Maximizing Pricing on Line Graphs
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 513-524 | Proceedings Article |
| Elbassioni2012f | Elbassioni, Khaled
Fouad, Mohamed
Bertino, Elisa | 2012 | | Modeling the Risk & Utility of Information Sharing in Social Networks
In: 2012 ASE/IEEE International Conference on Privacy, Security, Risk and Trust and
2012 ASE/IEEE International Conference on Social Computing : SocialCom/PASSAT 2012, 441-450 | Proceedings Article |
| Elbassioni2012g | Elbassioni, Khaled
Garg, Naveen
Gupta, Divya
Kumar, Amit
Narula, Vishal
Pal, Arindam | 2012 | | 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 |
| Elbassioni2012h | Elbassioni, Khaled
Raman, Rajiv
Ray, Saurabh
Sitters, René | 2012 | | On the complexity of the highway problem
In: Theoretical Computer Science [460], 70-77 | Journal Article |
| Elbassioni2012i | Elbassioni, Khaled
Jeli´c, Slobodan
Matijevi`c, Domagoj | 2012 | | The relation of Connected Set Cover and Group Steiner Tree
In: Theoretical Computer Science [438], 96-101 | Journal Article |
| Elbassioni2012j | Canzar, Stefan
Elbassioni, Khaled
Klau, Gunnar W.
Mestre, Julian | 2011 | | On Tree-Constrained Matchings and Generalizations | Unpublished/Draft |
| Elbassioni2012z | Elbassioni, Khaled
Matijevic, Domagoj
Severdija, Domagoj | 2012 | | Guarding 1.5D terrains with demands
In: International Journal of Computer Mathematics [89], 2143-2151 | Journal Article |
| Elbassioni2013a | Elbassioni, Khaled
Chalermsook, Parinya
Nanongkai, Danupon
Sun, He | 2013 | | Multi-Attribute Profit-Maximizing Pricing | Unpublished/Draft |
| ElbassioniKatriel2004 | Elbassioni, Khaled M.
Katriel, Irit | 2005 | | Multiconsistency and Robustness with Global Constraints
In: Integration of AI and OR techniques in constraint programming for combinatorial optimization problems : Second International Conference, CPAIOR 2005, 168-182 | Proceedings Article |
| ElbassioniKatriel2006 | Elbassioni, Khaled M. | 2006 | | Multiconsistency and Robustness with Global Constraints
In: Constraints [11], 335-352 | Journal Article |
| ElbassioniMestre2009a | Elbassioni, Khaled M.
Krohn, Erik
Matijevic, Domagoj
Mestre, Julián
Severdija, Domagoj | 2009 | | Improved Approximations for Guarding 1.5-Dimensional Terrains
In: Algorithmica [Online First], 1-13 | Electronic Journal Article |
| ElbassioniRauf2010 | Elbassioni, Khaled
Rauf, Imran | 2010 | | Polynomial-time dualization of r-exact hypergraphs with applications in geometry
In: Discrete Mathematics [310], 2356-2363 | Journal Article |
| ElbRau09a | Elbassioni, Khaled
Rauf, Imran | 2010 | | Polynomial-time Dualization of $r$-Exact Hypergraphs with Applications in Geometry | Unpublished/Draft |
| ElKahoui1996 | El Kahoui, M'hammed | 1996 | | An Improved Upper Complexity Bound for the Topology Computation of a Real Algebraic Plane Curve
In: Journal of Complexity [12], 527-544 | Journal Article |
| ElKahoui2000 | El Kahoui, M'hammed | 2000 | | Deciding Hopf bifurcations by quantifier elimination in a software-component architecture
In: Journal of Symbolic Computation [30], 161-179 | Journal Article |
| ElKahoui2001 | El Kahoui, M'hammed | 2001 | | Improved algorithms for linear complementarity problems arising from collision response
In: Mathematics and Computers in Simulation [56], 69-93 | Journal Article |
| ElKahoui2002a | Bouziane, Driss
El Kahoui, M'hammed | 2002 | | Computation of the dual of a plane projective curve
In: Journal of Symbolic Computation [34], 105-117 | Journal Article |
| ElKahoui2002b | El Kahoui, M'hammed | 2002 | | On plane polynomial vector fields and the Poincar\'e problem
In: Electronic Journal of Differential Equations [2002], 1-23 | Journal Article |
| ElKahoui2003 | El Kahoui, M'hammed | 2003 | | An elementary approach to subresultants theory
In: Journal of Symbolic Computation [35], 281-292 | Journal Article |
| ElKahoui2004a | El Kahoui, M'hammed | 2004 | | Contants of derivations in polynomial rings over unique factorization domains
In: Proceedings of the Amercian Mathematical Society [132], 2537-2541 | Journal Article |
| ElKahoui2004b | El Kahoui, M'hammed | 2004 | | Subresultants and locally nilpotent derivations
In: Linear Algebra and its Applications [380], 253-261 | Journal Article |
| ElKahoui2004c | El Kahoui, M'hammed | 2004 | | Algorithms 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 |
| ElKahoui2005a | El Kahoui, M'hammed | 2005 | | Birational properties of the gap subresultant varieties
In: Journal of Symbolic Computation [39], 61-71 | Journal Article |
| ElKahoui2005b | El Kahoui, M'hammed | 2005 | | $D$-resultant and subresultants
In: Proceedings of the Amercian Mathematical Society [133], 2193-2199 | Journal Article |
| ElKahoui2005c | El Kahoui, M'hammed | 2005 | | UFDs with commuting linearly independent locally nilpotent derivations
In: Journal of Algebra [289], 446-452 | Journal Article |
| ElKahoui2005d | Brown, Christopher
El Kahoui, M'hammed
Novotni, Dominik
Weber, Andreas | 2006 | | Algorithmic methods for investigating equilibria in epidemic modeling
In: Journal of Symbolic Computation [41], 1157-1173 | Journal Article |
| ElKahoui2005e | El Kahoui, M'hammed | 2008 | | Computing with algebraic curves in generic position | Miscellaneous |
| ElKahoui2005f | El Kahoui, M'hammed | 2008 | | Polynomial parametrization of nonsingular algebraic curves | Miscellaneous |
| ElKahoui2005g | El Kahoui, M'hammed
Rakrak, Said | 2007 | | Structure of Groebner bases with respect to block orders
In: Mathematics of Computation [76], 2181-2187 | Journal Article |
| Elmasry2008a | Elmasry, Amr
Hammad, Abdelrahman | 2008 | | Inversion-Sensitive Sorting Algorithms in Practice
In: ACM Journal of Experimental Algorithmics [13], 1-18 | Journal Article |
| Elmasry2008b | Elmasry, Amr
Jensen, Claus
Katajainen, Jyrki | 2008 | | Multipartite Priority Queues
In: ACM Transactions on Algorithms [5], 1-19 | Journal Article |
| Elmasry2008c | Elmasry, Amr
Jensen, Claus
Katajainen, Jyrki | 2008 | | Two New Methods for Constructing Double-Ended Priority Queues from Priority Queues
In: Computing [83], 193-204 | Journal Article |
| Elmasry2008d | Elmasry, Amr | 2008 | | Violation Heaps: A Better Substitute for Fibonacci Heaps | Report |
| Elmasry2009 | Elmasry, Amr | 2009 | | Pairing Heaps with O(log log n) decrease Cost
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 471-476 | Proceedings Article |
| Elmasry2009x | Elmasry, Amr | 2009 | | Computing the subset partial order for dense families of sets
In: Information Processing Letters [109], 1082-1086 | Journal Article |
| Elmasry2010 | Elmasry, Amr | 2010 | | Pairing heaps, scrambled pairing and square-root trees
In: International Journal of Computer Mathematics [87], 3096-3110 | Journal Article |
| Elmasry2010a | Elmasry, Amr | 2010 | | The longest almost-increasing subsequence
In: Information Processing Letters [110], 655-658 | Journal Article |
| Elmasry2010b | Elmasry, Amr
Jensen, Claus
Katajainen, Jyrki | 2010 | | Strictly-regular number system and data structures
In: Algorithm Theory - SWAT 2010 : 12th Scandinavian Symposium and Workshops
on Algorithm Theory, 26-37 | Proceedings Article |
| Elmasry2010c | Elmasry, Amr
Jensen, Claus
Katajainen, Jyrki | 2010 | | The Magic of a Number System
In: Fun with Algorithms : 5th International Conference, FUN 2010, 156-165 | Proceedings Article |
| Elmasry2012 | Elmasry, Amr
Mehlhorn, Kurt
Schmidt, Jens M. | 2012 | | An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs
In: Algorithmica [62], 754-766 | Journal Article |
| Elmasry2013 | Elmasry, Amr
Mehlhorn, Kurt
Schmidt, Jens M. | 2013 | | Every DFS tree of a 3-connected graph contains a contractible edge
In: Journal of Graph Theory [72], 112-121 | Journal Article |
| ElmasryMehlhornSchmidt2010 | Elmasry, Amr
Mehlhorn, Kurt
Schmidt, Jens M. | 2010 | | An $O(m+n)$ Certifying Triconnectivity Algorithm for Hamiltonian Graphs
In: Algorithmica [Online First], 1-13 | Electronic Journal Article |
| ElsaesserS2011 | Elsaesser, Robert
Sauerwald, Thomas | 2011 | | Tight bounds for the cover time of multiple random walks
In: Theoretical Computer Science [412], 2623-2641 | Journal Article |
| emel-gcd-11 | Emeliyanenko, Pavel | 2011 | | High-performance polynomial GCD computations on graphics processors
In: Proceedings of the 2011 International Conference on High Performance Computing & Simulation (HPCS 2011), 215-224 | Proceedings Article |
| Emel-gtc-10 | Emeliyanenko, Pavel | 2010 | | Accelerating Symbolic Computations on NVIDIA Fermi
In: Poster presentation at GTC'10 (NVIDIA research summit), - | Poster |
| emel-res-2012 | Emeliyanenko, Pavel | 2012 | | Computing resultants on Graphics Processing Units: Towards GPU-accelerated computer algebra
In: Journal of Parallel and Distributed Computing [In press], 1-14 | Electronic Journal Article |
| Emel2007 | Emeliyanenko, Pavel | 2007 | | Visualization of Points and Segments of Real Algebraic Plane Curves
Universität des Saarlandes | Thesis - Masters thesis |
| emel_gpgpu_09 | Emeliyanenko, Pavel | 2009 | | Efficient Multiplication of Polynomials on Graphics Hardware
In: Advanced Parallel Processing Technologies : 8th International Symposium, APPT 2009, 134-149 | Proceedings Article |
| emel_gpures_2010 | Emeliyanenko, Pavel | 2010 | | Modular Resultant Algorithm for Graphics Processors
In: Algorithms and Architectures for Parallel Processing : 10th International Conference, ICA3PP 2010. - Pt. 1, 427-440 | Proceedings Article |
| Emminghaus95 | Emminghaus, Frank | 1995 | | Effiziente Sortieralgorithmen für den d-dimensionalen Hypercube
Universität des Saarlandes | Thesis - Masters thesis |
| EMR09 | Elbassioni, Khaled
Makino, Kazuhisa
Rauf, Imran | 2009 | | On the Readability of Monotone Boolean Formulae
In: Computing and Combinatorics :15th Annual International Conference, COCOON 2009, 496-505 | Proceedings Article |
| EpJeSS12 | Epstein, Leah
Jez, Lukasz
Sgall, Jiri
van Stee, Rob | 2012 | | Online 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 |
| EpKlSt2009 | Epstein, Leah
Kleiman, Elena
van Stee, Rob | 2009 | | Maximizing the Minimum Load: The Cost of Selfishness
In: Internet and Network Economics : 5th International Workshop, WINE 2009, 232-243 | Proceedings Article |
| EpLeSt10 | Epstein, Leah
Levin, Asaf
van Stee, Rob | 2010 | | Max-min online allocations with a reordering buffer
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010, 336-347 | Proceedings Article |
| EpLeSt11a | Epstein, Leah
Levin, Asaf
van Stee, Rob | 2011 | | Max-min online allocations with a reordering buffer
In: SIAM Journal on Discrete Mathematics [25], 1230-1250 | Journal Article |
| EpLeSt12 | Epstein, Leah
Levin, Asaf
van Stee, Rob | 2012 | | Approximation Schemes for Packing Splittable Items with Cardinality Constraints
In: Algorithmica [62], 102-129 | Journal Article |
| EpLeSt13 | Epstein, Leah
Levin, Asaf
van Stee, Rob | 2013 | | A unified approach to truthful scheduling on related machines
In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, 1243-1252 | Proceedings Article |
| EpsSte11 | Epstein, Leah
van Stee, Rob | 2011 | | Improved results for a memory allocation problem
In: Theory of Computing Systems [48], 79-92 | Journal Article |
| EpsSte12 | Epstein, Leah
van Stee, Rob | 2012 | | The price of anarchy on uniformly related machines revisited
In: Information and Computation [212], 37-54 | Journal Article |
| EpsSte2009 | Epstein, Leah
van Stee, Rob | 2010 | | Maximizing the minimum load for selfish agents
In: Theoretical Computer Science [411], 44-57 | Journal Article |
| Epstein2006 | Epstein, Leah
Kesselman, Alexander | 2006 | | On the remote server problem or more about TCP acknowledgments
In: Theoretical Computer Science [369], 285 | Journal Article |
| EpsteinAMMMSS2010 | Epstein, Leah
Levin, Asaf
Marchetti-Spaccamela, Alberto
Megow, Nicole
Mestre, Julian
Skutella, Martin
Stougie, Leen | 2010 | | Universal sequencing on a single machine
In: Integer Programming and Combinatorial Optimization : 14th International Conference, IPCO 2010, 230-243 | Proceedings Article |
| EpStTa2009 | Epstein, Leah
van Stee, Rob
Tamir, Tami | 2009 | | Paging with request sets
In: Theory of Computing Systems [44], 67-81 | Journal Article |
| ES-complexity-12 | Emeliyanenko, Pavel
Sagraloff, Michael | 2012 | | On the Complexity of Solving a Bivariate Polynomial System
In: ISSAC 2012 : Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, 154-161 | Proceedings Article |
| ESA:EMR09 | Elbassioni, Khaled
Makino, Kazuhisa
Rauf, Imran | 2009 | | Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs
In: Algorithms - ESA 2009 : 17th Annual European Symposium, 143-154 | Proceedings Article |
| esw-sacsee-02 | Eigenwillig, Arno
Schömer, Elmar
Wolpert, Nicola | 2002 | | Sweeping Arrangements of Cubic Segments Exactly and Efficiently | Report |
| EulerECJ07 | Doerr, Benjamin
Hebbinghaus, Nils
Neumann, Frank | 2007 | | Speeding up Evolutionary Algorithms Through Asymmetric Mutation Operators
In: Evolutionary Computation [15], 401-410 | Journal Article |
| FanghaenelGHV2013 | Fanghänel, Alexander
Geulen, Sascha
Hoefer, Martin
Vöcking, Berthold | 2013 | | Online Capacity Maximization in Wireless Networks
In: Journal of Scheduling [16], 81-91 | Journal Article |
| Farzan2010 | Farzan, Arash
Gagie, Travis
Navarro, Gonzalo | 2010 | | Entropy-Bounded Representation of Point Grids
In: Algorithms and Computation : 21st International Symposium, ISAAC 2010. - Pt. II, 327-338 | Proceedings Article |
| Farzan2010a | Blelloch, Guy E.
Farzan, Arash | 2010 | | Succinct Representations of Separable Graphs
In: Combinatorial Pattern Matching : 21st Annual Symposium, CPM 2010, 138-150 | Proceedings Article |
| FarzanDynamic2011 | Farzan, Arash
Munro, J. Ian | 2011 | | Succinct representation of dynamic trees
In: Theoretical Computer Science [412], 2668-2678 | Journal Article |
| Fatourou2000 | Fatourou, Panagiota
Spirakis, Paul G. | 2000 | | Efficient Scheduling of Strict Multithreaded Computations
In: Theory of Computing Systems [33], 173-232 | Journal Article |
| FBVI2011 | Friedrich, Tobias
Bringmann, Karl
Voss, Thomas
Igel, Christian | 2011 | | The Logarithmic Hypervolume Indicator
In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, 81-92 | Proceedings Article |
| Feld98 | Feld, Thomas | 1998 | | Analyse und Implementierung von Algorithmen zum Minimum Cost Circulation Problem
Universität des Saarlandes | Thesis - Masters thesis |
| FeldmannBachelor2012 | Feldmann, Matthias | 2012 | | Stochastic optimization with fitness proportional ant systems
Universität des Saarlandes | Thesis - Bachelor thesis |
| Fellows2012 | Fellows, Michael R.
Hermelin, Danny
Rosamond, Fraces A. | 2012 | | Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications
In: Algorithmica [64], 3-18 | Journal Article |
| FellowsFertinHermelinVialette2011 | Fellows, Michael R.
Fertin, Guillaume
Hermelin, Danny
Vialette, Stephane | 2011 | | Upper and lower bounds for finding connected motifs in vertex-colored graphs
In: Journal of Computer and System Sciences [77], 799-811 | Journal Article |
| FellowsFriedrichHermelinEtAL2011 | Fellows, Michael R.
Friedrich, Tobias
Hermelin, Danny
Narodytska, Nina
Rosamond, Frances A. | 2011 | | 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 |
| FellowsHatrmanHermelinEtAl2011 | Fellows, Michael R.
Hartman, Tzvika
Hermelin, Danny
Landau, Gad M.
Rosamond, Frances A.
Rozenberg, Liat | 2011 | | Haplotype Inference Constrained by Plausible Haplotype Data
In: IEEE/ACM Transactions on Computational Biology and Bioinformatics [8], 1692-1699 | Journal Article |
| FernauFominLokshtanovMnichPhilipSaurabh2010 | Fernau, Henning
Fomin, Fedor V.
Lokshtanov, Daniel
Mnich, Matthias
Philip, Geevarghese
Saurabh, Saket | 2011 | | Ranking and Drawing in Subexponential Time
In: Combinatorial Algorithms - 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers, | Proceedings Article |
| FernauFominPhilipSaurabh2010 | Fernau, Henning
Fomin, Fedor V.
Philip, Geevarghese
Saurabh, Saket | 2010 | | The Curse of Connectivity: $t$-Total Vertex (Edge) Cover
In: Computing and Combinatorics, 16th Annual International Conference, COCOON 2010, Nha Trang, Vietnam, July 19-21, 2010. Proceedings, 34-43 | Proceedings Article |
| FerraginaGrossSIAMJCOMPUT1998 | Ferragina, Paolo
Gross, Roberto | 1998 | | Optimal On-Line Search and Sublinear Time Update in String Matching
In: SIAM Journal on Computing [27], 713-736 | Journal Article |
| fffmo-eropmoffsi-14 | Fekete, Sándor P.
Fiethe, Björn
Friedrichs, Stephan
Michalik, Harald
Orlis, Christos | 2014 | | Efficient reconfiguration of processing modules on FPGAs for space instruments
In: Adaptive Hardware and Systems (AHS), 2014 NASA/ESA Conference on, 15-22 | Proceedings Article |
| ffks-ffagp-13 | Fekete, Sándor P.
Friedrichs, Stephan
Kröller, Alexander
Schmidt, Christiane | 2013 | | Facets for Art Gallery Problems
In: Computing and Combinatorics, 208-220 | Proceedings Article |
| FH08 | Friedrich, Tobias
Hebbinghaus, Nils | 2008 | | 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 |
| FHHNW10 | Friedrich, Tobias
He, Jun
Hebbinghaus, Nils
Neumann, Frank
Witt, Carsten | 2010 | | Approximating Covering Problems by Randomized Search Heuristics using Multi-Objective Models
In: Evolutionary Computation [18], 617 - 633 | Journal Article |
| FHN10 | Friedrich, Tobias
Hebbinhaus, Nils
Neumann, Frank | 2010 | | Plateaus Can Be Harder in Multi-Objective Optimization
In: Theoretical Computer Science [411], 854-864 | Journal Article |
| FHP2009 | Fountoulakis, Nikolaos
Huber, Anna
Panagiotou, Konstantinos | 2009 | | 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 |
| FHPInfocom10 | Fountoulakis, Nikolaos
Huber, Anna
Panagiotou, Konstantinos | 2010 | | Reliable broadcasting in random networks and the effect of density
In: 2010 Proceedings IEEE INFOCOM, 2552-2560 | Proceedings Article |
| Fialko97 | Fialko, Sergej | 1997 | | Das planare Augmentierungsproblem
Universität des Saarlandes | Thesis - Masters thesis |
| FinkDipl01 | Fink, Christian | 2001 | | Oberflächenrekonstruktion von planaren Konturen
Universität des Saarlandes | Thesis - Masters thesis |
| Finkler-Diss97 | Finkler, Ulrich | 1997 | | Design of Efficient and Correct Algorithms: Theoretical Results and Runtime Prediction of Implementations in Practice
Universität des Saarlandes | Thesis - PhD thesis |
| Finkler-et-al96 | Calinescu, Gruia
Fernandes, Cristina G.
Finkler, Ulrich
Karloff, Howard | 1996 | | A better approximation algorithm for finding planar subgraphs
In: 7th ACM-SIAM Symposium on Discrete Algorithms (SODA96), 16-25 | Proceedings Article |
| Finkler-et-al97 | Calinescu, Gruia
Fernandes, Cristina G.
Finkler, Ulrich
Karloff, Howard | 1998 | | A Better Approximation Algorithm for Finding Planar Subgraphs
In: Journal of Algorithms [27], 269-302 | Journal Article |
| Finkler-Mehlhorn97 | Finkler, Ulrich
Mehlhorn, Kurt | 1997 | | Runtime Prediction of Real Programs on Real Machines
In: Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-97), 380-389 | Proceedings Article |
| FK2006 | Funke, Stefan
Klein, Christian | 2006 | | Hole Detection or: "How Much Geometry Hides in Connectivity?"
In: Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06, 377-385 | Proceedings Article |
| FKesselmanMeyerS2006 | Funke, Stefan
Kesselman, Alexander
Meyer, Ulrich
Segal, Michael | 2006 | | A Simple Improved Distributed Algorithm for Minimum CDS in Unit Disk Graphs
In: ACM Transactions on Sensor Networks [2], 444-453 | Journal Article |
| FKKLS07 | Funke, Stefan
Kesselman, Alexander
Kuhn, Fabian
Lotker, Zvi
Segal, Michael | 2007 | | Improved approximation algorithms for connected sensor cover
In: Wireless Networks [13], 153-164 | Journal Article |
| FKKMS02 | Fotakis, Dimitris
Kontogiannis, Spyros
Koutsoupias, Elias
Mavronicolas, Marios
Spirakis, Paul G. | 2002 | | The 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 |
| FKLS2004 | Funke, Stefan
Kesselman, Alexander
Lotker, Zvi
Segal, Michael | 2004 | | Improved Approximation Algorithms for Connected Sensor Cover
In: Ad-hoc, mobil and wireless networks : Third International Conference, ADHOC-NOW 2004, 56-69 | Proceedings Article |
| FKMcEJC2010 | Fountoulakis, Nikolaos
Kang, Ross
McDiarmid, Colin | 2010 | | The t-stability number of a random graph
In: The Electronic Journal of Combinatorics [17], R59,1-R59,29 | Electronic Journal Article |
| FKMS2005 | Funke, Stefan
Klein, Christian
Mehlhorn, Kurt
Schmitt, Susanne | 2005 | | Controlled Perturbation for Delaunay Triangulations
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 1047-1056 | Proceedings Article |
| FKMS2005b | Funke, Stefan
Kesselman, Alexander
Meyer, Ulrich
Segal, Michael | 2005 | | A Simple Improved Distributed Algorithm for Minimum CDS in Unit Disk Graphs
In: 1st IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob 2005), 220-223 | Proceedings Article |
| fkw-eevsopcowsn-14 | Friedrichs, Stephan
Kulau, Ulf
Wolf, Lars | 2014 | | Energy-efficient voltage scheduling of peripheral components on wireless sensor nodes
In: Communications Workshops (ICC), 2014 IEEE International Conference on, 860-865 | Proceedings Article |
| FL2007 | Funke, Stefan
Laue, Sören | 2007 | | Bounded-Hop Energy-Efficient Broadcast in Low-Dimensional Metrics Via Coresets
In: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, 272-283 | Proceedings Article |
| Flash-WEA-2008 | Ajwani, Deepak
Malinger, Itay
Meyer, Ulrich
Toledo, Sivan | 2008 | | Characterizing the Performance of Flash Memory Storage Devices and Its Impact on Algorithm Design
In: Proc. 7th Intern. Workshop on Experimental Algorithms (WEA), 208-219 | Proceedings Article |
| Fleischer-FUN-1999 | Fleischer, Rudolf | 1999 | | FUN with implementing algorithms
In: Proceedings of the International Conference on FUN with Algorithms (FUN-98), 88-98 | Proceedings Article |
| Fleischer-Jung-Mehlhorn95 | Fleischer, Rudolf
Jung, Hermann
Mehlhorn, Kurt | 1995 | | A communication-randomness tradeoff for two-processor systems
In: Information and Computation [116], 155-161 | Journal Article |
| Fleischer1998bahncard | Fleischer, Rudolf | 1998 | | On the Bahncard problem
In: Proceedings of the 4th International Conference on Computing and Combinatorics (COCOON-98), 65-74 | Proceedings Article |
| Fleischer1999 | Fleischer, Rudolf | 1999 | | Effiziente und Online-Algorithmen
Universität des Saarlandes | Thesis - Habilitation thesis |
| Fleischer96 | Fleischer, Rudolf | 1996 | | A simple balanced search tree with $O(1)$ worst-case update time
In: International Journal of Foundations of Computer Science [7], 137-149 | Journal Article |
| FleischerSkutella2003 | Fleischer, Lisa
Skutella, Martin | 2003 | | Minimum Cost Flows Over Time without Intermediate Storage
In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 66-75 | Proceedings Article |
| Fleischer_dectrees_1999 | Fleischer, Rudolf | 1999 | | Decision trees: old and new results
In: Information and computation [152], 44-61 | Journal Article |
| FLN2007 | Funke, Stefan
Laue, Sören
Naujoks, Rouven | 2007 | | Minimum Energy Broadcast with Few Senders
In: Distributed Computing in Sensor Systems : Third IEEE International Conference, DCOSS 2007, 404-416 | Proceedings Article |
| FLNL2008 | Funke, Stefan
Laue, Sören
Naujoks, Rouven
Lotker, Zvi | 2008 | | Power Assignment Problems in Wireless Communication: Covering Points by Disks, Reaching few Receivers Quickly, and Energy-Efficient Travelling Salesman Tours
In: Distributed Computing in Sensor Systems, 4th IEEE International Conference, DCOSS 2008, 282-295 | Proceedings Article |
| fm-lalokfgc-00 | Funke, Stefan
Mehlhorn, Kurt | 2000 | | LOOK - a Lazy Object-Oriented Kernel for Geometric Computation
In: Proceedings of the 16th Annual Symposium on Computational Geometry (SCG-00), 156-165 | Proceedings Article |
| fm-look-2002 | Funke, Stefan
Mehlhorn, Kurt | 2002 | | LOOK - A Lazy Object-Oriented Kernel for Geometric Computation
In: Computational Geometry - Theory and Applications [22], 99-118 | Journal Article |
| FM2007 | Funke, Stefan
Milosavljevic, Nikola | 2007 | | Network Sketching or: "How much Geometry hides in Connectivity? - Part II"
In: Proceedings of the eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-07), 958-967 | Proceedings Article |
| FM2007b | Funke, Stefan
Milosavljevic, Nikola | 2007 | | Guaranteed-delivery Geographic Routing under Uncertain Node Locations
In: IEEE INFOCOM 2007 : 26th IEEE International Conference on Computer Communications, 1244-1252 | Proceedings Article |
| FM97 | Fialko, Sergej
Mutzel, Petra | 1998 | | A new approximation algorithm for the planar augmentation problem
In: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-98), 260-269 | Proceedings Article |
| FMMW2006 | Funke, Stefan
Malamatos, Theocharis
Matijevic, Domagoj
Wolpert, Nicola | 2006 | | (Approximate) Conic Nearest Neighbors and the induced Voronoi Diagram
In: 18th Canadian Conference on Computational Geometry, 23-26 | Proceedings Article |
| FMN1999 | Funke, Stefan
Mehlhorn, Kurt
Näher, Stefan | 1999 | | Structural Filtering: a Paradigm for Efficient and Exact Geometric Programs
In: Abstracts for the 11th Canadian Conference on Computational Geometry (CCCG-99), 39-42 | Proceedings Article |
| FMR2004 | Funke, Stefan
Malamatos, Theocharis
Ray, Rahul | 2004 | | Finding Planar Regions in a Terrain: In Practice and with a Guarantee
In: Proceedings of the Twentieth Annual Symposium on Computational Geometry : (SCG'04), 96-105 | Proceedings Article |
| FMR2004b | Funke, Stefan
Malamatos, Theocharis
Ray, Rahul | 2004 | | Finding Planar Regions in a Terrain
In: 20th European Workshop on Computational Geometry (EWCG), 1-4 | Proceedings Article |
| FMS2003 | Funke, Stefan
Matijevic, Domagoj
Sanders, Peter | 2003 | | Approximating Energy Efficient Paths in Wireless Multi-hop Networks
In: Algorithms - ESA 2003: 11th Annual European Symposium, 230-241 | Proceedings Article |
| FMS2004 | Funke, Stefan
Matijevic, Domagoj
Sanders, Peter | 2004 | | Constant Time Queries for Energy Efficient Paths in Multi-Hop Wireless Networks
In: First International Workshop on Algorithms for Wireless and Mobile Networks, 97-111 | Proceedings Article |
| FNPS02 | Fotakis, Dimitris
Nikoletseas, Sotiris
Papadopoulou, Vicky
Spirakis, Paul G. | 2002 | | Radiocolorings in Periodic Planar Graphs: PSPACE-Completeness and Efficient Approximations for the Optimal Range of Frequencies
In: Graph-Theoretic Concepts in Computer Science : 28th International Workshop, WG 2002, 223-234 | Proceedings Article |
| FOCS::DietzfelbingerKMHRT1988 | Dietzfelbinger, Martin
Karlin, Anna
Mehlhorn, Kurt
Meyer auf der Heide, Friedhelm
Rohnert, Hans
Tarjan, Robert E. | 1988 | | Dynamic Perfect Hashing: Upper and Lower Bounds
In: 29th Annual Symposium on Foundations of Computer Science (FOCS 1988), 524-531 | Proceedings Article |
| FOCS::MehlhornNR1989 | Mehlhorn, Kurt
Näher, Stefan
Rauch, Monika | 1989 | | On the Complexity of a Game Related to the Dictionary Problem
In: 30th Annual Symposium on Foundations of Computer Science (FOCS 1989), 546-548 | Proceedings Article |
| FollertSchoemerSellenSmidThiel97 | Follert, Frank
Schömer, Elmar
Sellen, Jürgen
Smid, Michiel
Thiel, Christian | 1997 | | Computing the largest empty anchored cylinder, and related problems
In: International Journal of Computational Geometry and Applications [7], 563-580 | Journal Article |
| FominLokshtanovMisraPhilipSaurabh2011 | Fomin, Fedor V.
Lokshtanov, Daniel
Misra, Neeldhara
Philip, Geevarghese
Saurabh, Saket | 2011 | | Hitting forbidden minors: Approximation and Kernelization
In: 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany, 189-200 | Proceedings Article |
| FominPhilipVillanger2011 | Fomin, Fedor V.
Philip, Geevarghese
Villanger, Yngve | 2011 | | Minimum Fill-in of Sparse Graphs: Kernelization and Approximation
In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, 164-175 | Proceedings Article |
| FormalVerificationofCertifyingComputations | Alkassar, Eyad
Böhme, Sascha
Mehlhorn, Kurt
Rizkallah, Christine | 2011 | | Verification of Certifying Computations
In: Computer Aided Verification : 23rd International Conference, CAV 2011, 67-82 | Proceedings Article |
| FOSW08 | Friedrich, Tobias
Oliveto, Pietro
Sudholt, Dirk
Witt, Carsten | 2008 | | Theoretical Analysis of Diversity Mechanisms for Global Exploration
In: Proceedings of the 10th annual conference on Genetic and evolutionary computation (GECCO 2008), 945-952 | Proceedings Article |
| Fot03 | Fotakis, Dimitris | 2003 | | On the Competitive Ratio for Online Facility Location
In: Automata, languages and programming : 30th International Colloquium, ICALP 2003, 637-652 | Proceedings Article |
| Fotakis2004a | Fotakis, Dimitris | 2004 | | Incremental Algorithms for Facility Location and k-Median
In: Algorithms – ESA 2004: 12th Annual European Symposium, 347-358 | Proceedings Article |
| Fountoulakis2007 | Fountoulakis, Nikolaos
Reed, Bruce | 2007 | | Faster Mixing and Small Bottlenecks
In: Probability Theory and Related Fields [137], 475-486 | Journal Article |
| Fountoulakis2008 | Fountoulakis, Nikolaos
Reed, Bruce | 2008 | | The evolution of the mixing rate of a simple random walk on the giant component of a random graph
In: Random Structures and Algorithms [33], 68-86 | Journal Article |
| Fountoulakis2008a | Cooley, Oliver
Fountoulakis, Nikolaos
Kühn, Daniela
Osthus, Deryk | 2008 | | 3-Uniform hypergraphs of bounded degree have linear Ramsey numbers
In: Journal of Combinatorial Theory B [98], 484-505 | Journal Article |
| Fountoulakis2008b | Fountoulakis, Nikolaos
Kühn, Daniela
Osthus, Deryk | 2008 | | The order of the largest complete minor in a random graph
In: Random Structures and Algorithms [33], 127-141 | Journal Article |
| Fountoulakis2009 | Cooley, Oliver
Fountoulakis, Nikolaos
Kühn, Daniela
Osthus, Deryk | 2009 | | Embeddings and Ramsey numbers of sparse k-uniform hypergraphs
In: Combinatorica [29], 263-297 | Journal Article |
| Fountoulakis2009a | Fountoulakis, Nikolaos | 2007 | | Percolation on sparse random graphs with given degree sequence
In: Internet Mathematics [4], 329-356 | Journal Article |
| Fountoulakis2009b | Fountoulakis, Nikolaos
Kühn, Daniela
Osthus, Deryk | 2009 | | Minors in random regular graphs
In: Random Structures and Algorithms [35], 444-463 | Journal Article |
| Fountoulakis2011 | Fountoulakis, Nikolaos
Panagiotou, Konstantinos | 2011 | | 3-Connected Cores In Random Planar Graphs
In: Combinatorics, Probability & Computing [20], 381-412 | Journal Article |
| FountoulakisHuberPanagiotouBrief2010 | Fountoulakis, Nikolaos
Huber, Anna
Panagiotou, Konstantinos | 2009 | | The Speed of Broadcasting in Random Networks: Density Does Not Matter
In: 23rd International Symposium on Distributed Computing (DISC '09), 529-530 | Proceedings Article |
| FountoulakisKhoslaPanagiotou2010 | Fountoulakis, Nikolaos
Khosla, Megha
Panagiotou, Konstantinos | 2011 | | The Multiple-orientability Thresholds for Random Hypergraphs
In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), 1222-1236 | Proceedings Article |
| FountoulakisPS12 | Fountoulakis, Nikolaos
Panagiotou, Konstantinos
Sauerwald, Thomas | 2012 | | Ultra-fast rumor spreading in social networks
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 1642-1660 | Proceedings Article |
| FouzDiss2012 | Fouz, Mahmoud | 2012 | | Randomized Rumor Spreading in Social Networks & Complete Graphs
Universität des Saarlandes | Thesis - PhD thesis |
| FP12RSA | Fountoulakis, Nikolaos
Panagiotou, Konstantinos | 2012 | | Tight Load Thresholds for Cuckoo Hashing
In: Random Structures and Algorithms [41], 306-333 | Journal Article |
| FPIcalp2010 | Fountoulakis, Nikolaos
Panagiotou, Konstantinos | 2010 | | 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 |
| FPRandom10 | Fountoulakis, Nikolaos
Panagiotou, Konstantinos | 2010 | | Rumor spreading on random regular graphs and expanders
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 13th Internationa lWorkshop, APPROX 2010 and 14th International Workshop, RANDOM 2010, 560-573 | Proceedings Article |
| FPSS03 | Fotakis, Dimitris
Pagh, Rasmus
Sanders, Peter
Spirakis, Paul G. | 2003 | | Space 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 |
| FPSSICOMP2013 | Fountoulakis, Nikolaos
Panagiotou, Konstantinos | 2013 | | On the Insertion Time of Cuckoo Hashing
In: SIAM Journal on Computing [?], ?-? | Journal Article |
| fr-rcwcae-01 | Funke, Stefan
Ramos, Edgar A. | 2001 | | Reconstructing a Collection of Curves with Corners and Endpoints
In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), 344-353 | Proceedings Article |
| fr-ssrinlt-02 | Funke, Stefan
Ramos, Edgar A. | 2002 | | Smooth-Surface Reconstruction in Near-Linear Time
In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-02), 781-790 | Proceedings Article |
| FredericksonSolis-Oba98 | Frederickson, Greg N.
Solis-Oba, Roberto | 1998 | | Algorithms for Measuring Perturbability in Matroid Optimization
In: Combinatorica [18], 503-518 | Journal Article |
| FredmanKhachiyan96 | Fredman, Michael
Khachiyan, Leonid | 1996 | | On the Complexity of Dualization of Monotone Disjunctive Normal Forms
In: J. Algorithms [21], 618-628 | Journal Article |
| Friedrich2005 | Friedrich, Tobias | 2005 | | Deterministic Random Walks on Infinite Grids
Friedrich-Schiller-Universität Jena | Thesis - Masters thesis |
| Friedrich2009 | Friedrich, Tobias
Gairing, Martin
Sauerwald, Thomas | 2010 | | Quasirandom Load Balancing
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1620-1629 | Proceedings Article |
| FriedrichDAM2011 | Friedrich, Tobias
Hebbinghaus, Nils | 2011 | | Average update times for fully-dynamic all-pairs shortest paths
In: Discrete Applied Mathematics [159], 1751-1758 | Journal Article |
| FriedrichGS2012 | Friedrich, Tobias
Gairing, Martin
Sauerwald, Thomas | 2012 | | Quasirandom Load Balancing
In: SIAM Journal on Computing [41], 747-771 | Journal Article |
| FriedrichKN2011 | Friedrich, Tobias
Kroeger, Trent
Neumann, Frank | 2012 | | Weighted preferences in evolutionary multi-objective optimization
In: International Journal of Machine Learning and Cybernetics [Online First], 1-10 | Electronic Journal Article |
