| Author/Editor [Non Institute] | Year | | Title | Type |
|---|
Abed, Huang
(Ed: Epstein, Ferragina)
[-] | 2012 | | Preemptive Coordination Mechanisms for Unrelated Machines
In: Algorithms - ESA 2012 : 20th Annual European Symposium, 12-23 | Proceedings Article |
Abo-Hasna
[-] | 1994 | | Verdrahtung von Kanälen mit Seitenanschlüssen
Universität des Saarlandes | Thesis - Masters thesis |
Abraham, Cechlárová, Manlove, Mehlhorn
(Ed: Deng, Du)
[-] | 2005 | | Pareto Optimality in House Allocation Problems
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 1163-1175 | Proceedings Article |
Abraham, Cechlárová, Manlove, Mehlhorn
(Ed: Fleischer, Trippen)
[-] | 2004 |  | Pareto-optimality in house allocation problems
In: Algorithms and Computation: 15th International Symposium, ISAAC 2004, 3-15 | Proceedings Article |
Abraham, Irving, Kavitha, Mehlhorn
[-] | 2007 | | Popular Matchings
In: SIAM Journal on Computing [37], 1030-1045 | Journal Article |
Abraham, Irving, Mehlhorn, Telikepalli
[-] | 2005 | | Popular Matchings
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 424-432 | Proceedings Article |
Adamaszek, Wiese
[-] | 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 |
Adler, Räcke, Sivadasan, Sohler, Vöcking
(Ed: Widmayer, Triguero, Morales, Hennessy, Eidenbenz, Conejo)
[-] | 2002 | | Randomized Pursuit-Evasion in Graphs
In: Automata, Languages and Programming : 29th International Colloquium, ICALP 2002, 901-912 | Proceedings Article |
Adler, Räcke, Sivadasan, Sohler, Vöcking
[-] | 2003 | | Randomized Pursuit-Evasion in Graphs
In: Combinatorics, Probability and Computing [12], 225-244 | Journal Article |
Afshani, Agrawal, Doerr, Doerr, Larsen, Mehlhorn
(Ed: Brodnik, López-Ortiz, Raman, Viola)
[-] | 2013 | | The Query Complexity of Finding a Hidden Permutation
In: Space-Efficient Data Structures, Streams, and Algorithms, 1-11 | Part of a Book |
Afshani, Agrawal, Doerr, Green Larsen, Mehlhorn, Winzen
[-] | 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 |
Agarwal, Agarwal, Chopra, Feldmann, Kammenhuber, Krysta, Vöcking
(Ed: Kosch, Böszörményi, Hellwagner)
[-] | 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 |
Agarwal, Arge, Brodal, Vitter
[Agarwal, Arge, Vitter] | 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 |
Agarwal, Hagerup, Ray, Sharir, Smid, Welzl
(Ed: Möhring, Raman)
[-] | 2002 | | Translating a Planar Object to Maximize Point Containment
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 42-53 | Proceedings Article |
Agrawal, Saha, Saptharishi, Saxena
[-] | 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 |
Agrawal, Saha, Saxena
[-] | 2013 | | A Case of Depth-3 Identity Testing, Sparse Factorization and Duality
In: 45th ACM Symposium on the Theory of Computing (STOC-13), toappear | Proceedings Article |
Agrawal, Saha, Saxena
[-] | 2012 | | Quasi-polynomial Hitting-set for Set-depth-Delta Formulas
In: arXiv [abs/1209.2333], 1-13 | Electronic Journal Article |
Ahuja, Baltz, Doerr, Privetivy, Srivastav
(Ed: Erlebach, Persiano)
[-] | 2005 | | On the Minimum Load Coloring Problem
In: Third Workshop on Approximation and Online Algorithms (WAOA 2005), 15-26 | Proceedings Article |
Ahuja, Baltz, Doerr, Privetivy, Srivastav
[-] | 2007 | | On the Minimum Load Coloring Problem
In: Journal of Discrete Algorithms [5], 533-545 | Journal Article |
Ahuja, Baltz, Doerr, Srivastav
[-] | 2004 | | Coloring Graphs with Minimal Load
In: Electronic Notes in Discrete Mathematics [17], 129-133 | Journal Article |
Ahuja, Mehlhorn, Orlin, Tarjan
[-] | 1990 | | Faster algorithms for the shortest path problem
In: Journal of the ACM [37], 213-223 | Journal Article |
Ahuja, Mehlhorn, Orlin, Tarjan
[-] | 1988 | | Faster Algorithms for the Shortest Path Problem | Report |
Ahuja, Mehlhorn, Orlin, Tarjan
[-] | 1988 | | Faster Algorithms for the Shortest Path Problem | Report |
Ailon, Avigdor-Elgrabli, Liberty, van Zuylen
(Ed: Demetrescu, Halldórsson)
[-] | 2011 | | Improved Approximation Algorithms for Bipartite Correlation Clustering
In: Algorithms - ESA 2011 : 19th Annual European Symposium, 25-36 | Proceedings Article |
Ailon, Avigdor-Elgrabli, Liberty, van Zuylen
[-] | 2012 | | Improved Approximation Algorithms for Bipartite Correlation Clustering
In: SIAM Journal on Computing [41], 1110-1121 | Journal Article |
Ajwani
[-] | 2005 | | Design, Implementation and Experimental Study of External Memory BFS Algorithms
Universität des Saarlandes | Thesis - Masters thesis |
Ajwani, Dementiev, Meyer
[-] | 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 |
Ajwani, Elbassioni, Govindarajan, Ray
(Ed: Gibbons, Scheideler)
[-] | 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 |
Ajwani, Elbassioni, Govindarajan, Ray
[-] | 2012 | | Conflict-free coloring for rectangle ranges using O(n .382) colors
In: Discrete & Computational Geometry [48], 39-52 | Journal Article |
Ajwani, Elbassioni, Govindarajan, Ray
[-] | 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 |
Ajwani, Friedrich
(Ed: Tokuyama)
[-] | 2007 | | Average-Case Analysis of Online Topological Ordering
In: Algorithms and Computation : 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007. Proceedings, 464-475 | Proceedings Article |
Ajwani, Friedrich
[-] | 2010 | | Average-case Analysis of Incremental Topological Ordering
In: Discrete Applied Mathematics [158], 240-250 | Journal Article |
Ajwani, Friedrich, Meyer
(Ed: Arge, Freivalds)
[-] | 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 |
Ajwani, Friedrich, Meyer
[-] | 2008 | | An $O(n^2.75)$ algorithm for incremental topological ordering
In: ACM Transactions on Algorithms [4], 1-14 | Journal Article |
Ajwani, Malinger, Meyer, Toledo
(Ed: McGeoch)
[-] | 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 |
Ajwani, Meyer, Osipov
(Ed: Applegate, Brodal)
[-] | 2007 | | Improved external memory BFS implementations
In: 9th Workshop on Algorithm Engineering and Experiments (ALENEX), 3-12 | Proceedings Article |
Ajwani, Meyer, Osipov
(Ed: Demetrescu, Goldberg, Johnson)
[-] | 2009 | | Breadth first search on massive graphs
In: The shortest path problem : ninth DIMACS implemenation challenge, 291-307 | Part of a Book |
Ajwani, Ray, Seidel, Tiwary
(Ed: Dehne, Sack, Zeh)
[-] | 2007 | | On Computing the Centroid of the Vertices of an Arrangement and Related Problems
In: 10th Workshop on Algorithms and Data Structures (WADS), 519-528 | Proceedings Article |
Akbari, Berenbrink, Sauerwald
(Ed: Kowalski, Panconesi)
[-] | 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 |
Albers
[-] | 1999 | | Better bounds for online scheduling
In: SIAM Journal on Computing [29], 459-473 | Journal Article |
Albers
[-] | 1999 | | Online-Algorithmen
Universität des Saarlandes | Thesis - Habilitation thesis |
Albers
[-] | 1998 | | A competitive analysis of the list update problem with lookahead
In: Theoretical Computer Science [197], 95-109 | Journal Article |
Albers
[-] | 1998 | | Improved randomized on-line algorithms for the list update problem
In: SIAM Journal on Computing [27], 682-693 | Journal Article |
Albers
[-] | 1997 | | Better Bounds for Online Scheduling
In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC-97), 130-139 | Proceedings Article |
Albers
[-] | 1997 | | On the Influence of Lookahead in Competitive Paging Algorithms
In: Algorithmica [18], 283-305 | Journal Article |
Albers
[-] | 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 |
Albers, Arora, Khanna
[Arora, Khanna] | 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 |
Albers, Charikar, Mitzenmacher
[Charikar, Mitzenmacher] | 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 |
Albers, Garg, Leonardi
[-] | 2000 | | Minimizing stall time in single and parallel disk systems
In: Journal of the ACM [47], 969-986 | Journal Article |
Albers, Garg, Leonardi
[Garg, Leonardi] | 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 |
Albers, Hagerup
[-] | 1997 | | Improved Parallel Integer Sorting without Concurrent Writing
In: Information and Computation [136], 25-51 | Journal Article |
Albers, Henzinger
[Henzinger] | 1997 | | Exploring Unknown Environments
In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC-97), 416-425 | Proceedings Article |
Albers, Koga
(Ed: Akl, Dehne, Sack, Santoro)
[Koga, Akl, Dehne, Sack, Santoro] | 1995 | | Page migration with limited local memory capacity
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 412-158 | Proceedings Article |
Albers, Koga
[Koga] | 1998 | | New on-line algorithms for the page replication problem
In: Journal of Algorithms [27], 75-96 | Journal Article |
Albers, Kursawe
[-] | 1999 | | Exploring unknown environments with obstacles
In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), 842-843 | Proceedings Article |
Albers, Kursawe, Schuierer
[-] | 2002 | | Exploring unkown environments with obstacles
In: Algorithmica [32], 123-143 | Journal Article |
Albers, Mitzenmacher
(Ed: Meyer auf der Heide, Monien)
[Mitzenmacher] | 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 |
Albers, Mitzenmacher
[Mitzenmacher] | 2000 | | Average-Case Analyses of First Fit and Random Fit Bin Packing
In: Random Structures & Algorithms [16], 240 - 259 | Journal Article |
Albers, Mitzenmacher
[Mitzenmacher] | 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 |
Albers, Mitzenmacher
[Mitzenmacher] | 1998 | | Average case analyses of list update algorithms, with applications to data compression
In: Algorithmica [21], 312-329 | Journal Article |
Albers, Mitzenmacher
[Mitzenmacher] | 1997 | | Revisiting the COUNTER algorithms for list update
In: Information Processing Letters [64], 155-160 | Journal Article |
Albers, von Stengel, Wechner
[von Stengel, Wechner] | 1995 | | A combined BIT and TIMESTAMP algorithm for the list update problem
In: Information Processing Letters [56], 135-139 | Journal Article |
Albers, Westbrook
(Ed: Fiat, Woeginger)
[Westbrook, Fiat, Woeginger] | 1998 | | Self-organizing data structures
In: Online Algorithms: The State of the Art, 13-51 | Part of a Book |
Alberts, Cattaneo, Italiano, Nanni, Zaroliagis
(Ed: Battiti, Bertosi)
[Alberts, Cattaneo, Italiano, Nanni, Battiti, Bertosi] | 1998 | | A Software Library of Dynamic Graph Algorithms
In: Proceedings of Workshop on Algorithms and Experiments (ALEX-98), 129-136 | Proceedings Article |
Alberts, Gutwenger, Mutzel, Näher
(Ed: Italiano, Orlando)
[Alberts, Näher] | 1997 | | AGD-Library: A Library of Algorithms for Graph Drawing
In: Proceedings of the Workshop on Algorithm Engineering (WAE-97), 112-123 | Proceedings Article |
Albrecht, Jung, Mehlhorn (ed.)
(Ed: Albrecht, Jung, Mehlhorn)
[-] | 1987 | | Parallel algorithms and architectures (WPAA-87) : international workshop | Proceedings |
Albrecht, Jung, Mehlhorn (ed.)
(Ed: Albrecht, Jung, Mehlhorn)
[-] | 1987 | | Parallel algorithms and architectures : International Workshop | Proceedings |
Albrecht, Karrenbauer, Xu
[-] | 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 |
Alcaraz, Friedrich, Kötzing, Krohmer, Müller, Pauling, Baumbach
[-] | 2012 | | Efficient key pathway mining: combining networks and OMICS data
In: Integrative Biology [4], 756-764 | Journal Article |
Alefragis, Goumopoulos, Sanders, Takkula, Wedelin
(Ed: Pritchard, Reeve)
[Alefragis, Goumopoulos, Takkula, Pritchard, Reeve, Wedelin] | 1998 | | Parallel Crew Scheduling in PAROS
In: Proceedings of the 4th International Euro-Par Conference (Euro-Par-98), 1104-1113 | Proceedings Article |
Alkassar, Böhme, Mehlhorn, Rizkallah
(Ed: Gopalakrishnan, Qadeer)
[-] | 2011 | | Verification of Certifying Computations
In: Computer Aided Verification : 23rd International Conference, CAV 2011, 67-82 | Proceedings Article |
Alkassar, Böhme, Mehlhorn, Rizkallah
[-] | 2013 | | A Framework for the Verification of Certifying Computations | Unpublished/Draft |
Alon, Bradford, Fleischer
[Alon] | 1996 | | Matching nuts and bolts faster
In: Information Processing Letters [59], 123-127 | Journal Article |
Altenkamp, Mehlhorn
(Ed: Ausiello, Böhm)
[-] | 1978 | | Codes: Unequal Probabilities, Unequal Letter Cost
In: Automata, languages and programming (ICALP-78): 5th international colloquium, 15-25 | Proceedings Article |
Altenkamp, Mehlhorn
[-] | 1980 | | Codes: Unequal Probabilities, Unequal Letter Cost
In: Journal of the ACM [27], 412-427 | Journal Article |
Altenkamp, Mehlhorn
[-] | 1978 | | Codes: Unequal Probabilities, Unequal Letter Cost | Report |
| [Replication or Save Conflict] | | | | |
Althaus
[-] | 2001 | | Curve Reconstruction and the Traveling Salesman Problem
Universität des Saarlandes | Thesis - PhD thesis |
Althaus
[-] | 1998 | | Berechnung optimaler Steinerbäume in der Ebene
Universität des Saarlandes | Thesis - Masters thesis |
Althaus, Altmeyer, Naujoks
(Ed: Becker, Damm, Fränzle, Olderog, Podelski, Wilhelm)
[-] | 2010 | | A New Combinatorial Approach to Parametric Path Analysis | Report |
Althaus, Baumann, Schömer, Werth
[-] | 2007 | | Trunk Packing Revisited
In: Experimental Algorithms, 6th International Workshop, 420-432 | Proceedings Article |
Althaus, Bockmayr, Elf, Kasper, Jünger, Mehlhorn
(Ed: Möhring, Raman)
[-] | 2002 | | SCIL - Symbolic Constraints in Integer Linear Programming.
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 75-87 | Proceedings Article |
Althaus, Calinescu, Mandoiu, Prasad, Tchervenski, Zelikovsly
[-] | 2006 | | Power efficient range assignment for symmetric connectivity in static ad-hoc wireless networks
In: Wireless Networks [12], 287-299 | Journal Article |
| [Replication or Save Conflict] |  | | | |
Althaus, Calinescu, Mandoiu, Prasad, Tchervenski, Zelikovsly
[-] | 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 |
Althaus, Canzar
(Ed: Dress, Xu, Zhu)
[-] | 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 |
Althaus, Canzar
[-] | 2008 | | A Lagrangian relaxation approach for the multiple sequence alignment problem
In: Journal of Combinatorial Optimization [16], 127-154 | Journal Article |
Althaus, Canzar
[-] | 2008 | | LASA: A tool for non-heuristic alignment of multiple sequences
In: Bioinformatics Research and Development (BIRD’08), 489-498 | Proceedings Article |
Althaus, Canzar, Elbassioni, Karrenbauer, Mestre
[-] | 2011 | | Approximation Algorithms for the Interval Constrained Coloring Problem
In: Algorithmica [61], 342-361 | Journal Article |
Althaus, Canzar, Elbassioni, Karrenbauer, Mestre
[-] | 2008 | | Approximating the Interval Constrained Coloring Problem
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), 210-221 | Proceedings Article |
Althaus, Canzar, Emmett, Karrenbauer, Marshall, Meyer-Bäse, Zhang
[-] | 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 |
Althaus, Caprara, Lenhof, Reinert
(Ed: Lengauer)
[-] | 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 |
Althaus, Caprara, Lenhof, Reinert
[-] | 2006 | | Aligning multiple sequences by cutting planes
In: Mathematical Programming [2006], 387-425 | Journal Article |
Althaus, Duchier, Koller, Mehlhorn, Niehren, Thiel
[-] | 2003 | | An Efficient Algorithm for the Configuration Problem of Dominance Graphs
In: Journal of Algorithms [48], 194-219 | Journal Article |
Althaus, Duchier, Koller, Mehlhorn, Niehren, Thiel
[Duchier, Koller, Niehren] | 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 |
Althaus, Dumitriu
(Ed: Vahrenhold)
[-] | 2009 | | Fast and Accurate Bounds on Linear Programs
In: Experimental Algorithms : 8th International Symposium on Experimental Algorithms (SEA 2009), 40-50 | Proceedings Article |
Althaus, Eisenbrand, Funke, Mehlhorn
[-] | 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 |
Althaus, Fink
(Ed: Cook, Schulz)
[-] | 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 |
Althaus, Funke, Har-Peled, Könemann, Ramos, Skutella
[-] | 2005 | | Approximating k-Hop Minimum-Spanning Trees
In: Operations Research Letters [33], 115-120 | Journal Article |
Althaus, Karamanis, Koller
[-] | 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 |
Althaus, Kohlbacher, Lenhof, Müller
(Ed: Shamir, Miyano, Istrail, Pevzner, Waterman)
[-] | 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 |
Althaus, Kohlbacher, Lenhof, Müller
[-] | 2002 | | A combinatorial approach to protein docking with flexible side chains
In: Journal of Computational Biology [9], 597-612 | Journal Article |
Althaus, Kupilas, Naujoks
(Ed: Ogihara, Tarui)
[-] | 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 |
Althaus, Mehlhorn
[-] | 2001 | | Traveling Salesman-Based Curve Reconstruction in Polynomial Time
In: SIAM Journal on Computing [31], 27-66 | Journal Article |
Althaus, Mehlhorn
[-] | 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 |
Althaus, Mehlhorn
[-] | 1998 | | Maximum Network Flow with Floating Point Arithmetic
In: Information Processing Letters [66], 109-113 | Journal Article |
Althaus, Mehlhorn, Näher, Schirra
[Naeher] | 2000 | | Experiments on curve reconstruction
In: Proceedings of 2nd Workshop on Algorithm Engineering and Experiments (ALENEX-00), 103-114 | Electronic Proceedings Article |
Althaus, Naujoks
(Ed: McGeoch)
[-] | 2008 | | Reconstructing Phylogenetic Networks with One Recombination
In: Experimental Algorithms, 7th International Workshop, WEA 2008, 275-288 | Proceedings Article |
Althaus, Naujoks
[-] | 2006 | | Computing Steiner Minimal Trees in Hamming Metric
In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06, 172-181 | Proceedings Article |
Althaus, Polzin, Vahdati Daneshmand
(Ed: Jansen, Margraf, Mastrolli, Rolim)
[Vahdati Daneshmand] | 2003 | | Improving Linear Programming Approaches for the Steiner Tree Problem
In: Experimental and efficient algorithms : Second International Workshop, WEA 2003, 1-14 | Proceedings Article |
Alt, Blum, Mehlhorn, Paul
[-] | 1991 | | Computing a maximum cardinality matching in a bipartite graph in time $O(n^1.5 \sqrtm/\log n)$
In: Information Processing Letters [37], 237-240 | Journal Article |
Alt, Fleischer, Kaufmann, Mehlhorn, Näher, Schirra, Uhrig
[-] | 1992 | | Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
In: Algorithmica [8], 391-408 | Journal Article |
Alt, Fleischer, Kaufmann, Mehlhorn, Näher, Schirra, Uhrig
[-] | 1990 | | Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures
In: Computational geometry (SCG-90) : 6th annual symposium, 281-289 | Proceedings Article |
Alt, Geffert, Mehlhorn
[-] | 1992 | | A lower bound for the nondeterministic space complexity of context-free recognition
In: Information Processing Letters [42], 25-27 | Journal Article |
Alt, Guibas, Mehlhorn, Karp, Wigderson
[-] | 1996 | | A Method for Obtaining Randomized Algorithms with Small Tail Probabilities
In: Algorithmica [16], 543-547 | Journal Article |
Alt, Guibas, Mehlhorn, Karp, Wigderson
[-] | 1991 | | A Method for Obtaining Randomized Algorithms with Small Tail Probabilities | Report |
Alt, Hagerup, Mehlhorn, Preparata
(Ed: Albrecht, Jung, Mehlhorn)
[-] | 1987 | | Deterministic Simulation of Idealized Parallel Computers on more Realistic Ones
In: Parallel Algorithms and Architectures : International Workshop, 11-15 | Proceedings Article |
Alt, Hagerup, Mehlhorn, Preparata
(Ed: Gruska, Rovan, Wiedermann)
[-] | 1986 | | Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
In: Mathematical Foundations of Computer Science, 12th Symposium (MFCS 1986), 199-208 | Proceedings Article |
Alt, Hagerup, Mehlhorn, Preparata
[-] | 1987 | | Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
In: SIAM Journal on Computing [16], 808-835 | Journal Article |
Alt, Hagerup, Mehlhorn, Preparata
[-] | 1985 | | Deterministic simulation of idealized parallel computers on more realistic ones | Report |
Alt, Mehlhorn
(Ed: Michaelson, Milner)
[-] | 1976 | | Lower Bounds for the Space Complexity of Context-Free Recognition
In: Third International Colloquium on Automata, Languages and Programming, 338-354 | Proceedings Article |
Alt, Mehlhorn
[-] | 1985 | | Searching Semisorted Tables
In: SIAM Journal on Computing [14], 840-848 | Journal Article |
Alt, Mehlhorn
[-] | 1979 | | Complexity arguments in algebraic language theory
In: Revue française d'automatique, d'informatique et de recherche opérationnelle : RAIRO / Association Française pour la Cybernétique Economique et Technique [13], 217-225 | Journal Article |
Alt, Mehlhorn
[-] | 1978 | | Complexity Arguments in Algebraic Language Theory | Report |
Alt, Mehlhorn
[-] | 1975 | | A Language over a One Symbol Alphabet Requiring only O(log log n) Space
In: SIGACT News [7], 31-33 | Journal Article |
Alt, Mehlhorn
[-] | 1975 | | Untere Schranken für den Platzbedarf bei der kontext-freien Analyse | Report |
Alt, Mehlhorn, Munro
(Ed: Gruska, Chytil)
[-] | 1981 | | Partial Match Retrieval in Implicit Data Structures
In: Mathematical foundations of computer science (MFCS-81) : 10th symposium, ,, 156-161 | Proceedings Article |
Alt, Mehlhorn, Munro
[-] | 1984 | | On the complexity of partial match retrieval
In: Information Processing Letters [19], 61-65 | Journal Article |
Alt, Mehlhorn, Munro
[-] | 1984 | | Partial match retrieval in implicit data structures
In: Information Processing Letters [19], 61-65 | Journal Article |
Alt, Mehlhorn, Wagener, Welzl
[-] | 1988 | | Congruence, Similarity, and Symmetries of Geometric Objects
In: Discrete and Computational Geometry [3], 237-256 | Journal Article |
Alt, Mehlhorn, Wagener, Welzl
[-] | 1987 | | Convergence, Similarity and Symmetries of Geometric Objects
In: Computational geometry (SCG-87) : 3rd symposium, 308-315 | Proceedings Article |
Alt, Mehlhorn, Wagener, Welzl
[Wagener, Welzl] | 1987 | | Congruence, similarity and symmetries of geometric objects | Report |
Alvarez, Bringmann, Curticapean, Ray
(Ed: Dey, Whitesides)
[-] | 2012 | | Counting Crossing Free Structures
In: Proceedings of the Twenty-Eight Annual Symposium on Computational Geometry (SCG'12), 61-68 | Proceedings Article |
Alvarez, Bringmann, Ray, Seidel
[-] | 2013 | | Counting Triangulations Approximately
In: 25th Canadian Conference on Computational Geometry (CCCG-13), 85-89 | Proceedings Article |
Amaldi, Iuliano, Jurkiewicz, Mehlhorn, Rizzi
(Ed: Fiat, Sanders)
[-] | 2009 | | Breaking the $O(m^2n)$ Barrier for Minimum Cycle Bases
In: Algorithms - ESA 2009 : 17th Annual European Symposium, 301-312 | Proceedings Article |
Amaldi, Iuliano, Jurkiewicz, Mehlhorn, Rizzi
(Ed: Fiat, Sanders)
[-] | 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 |
Amato, Goodrich, Ramos
[Amato, Goodrich] | 2000 | | Linear-Time Triangulation of a Simple Polygon Made Easier Via Randomization
In: Proceedings of the 16th Annual Symposium on Computational Geometry (SCG-00), 201-212 | Proceedings Article |
Ambalath, Balasundaram, H., Koppula, Misra, Philip, Ramanujan
(Ed: Raman, Saurabh)
[-] | 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 |
Amini, Manjunath
[-] | 2010 | | Riemann-Roch for sublattices of the root lattice $A\_n$
In: Electronic Journal of Combinatorics [17], R124,1-R124,50 | Electronic Journal Article |
Amini, Peleg, Pérennes, Sau, Saurabh
(Ed: Bampis, Skutella)
[-] | 2009 | | Degree-Constrained Subgraph Problems: Hardness and Approximation Results
In: Approximation and Online Algorithms : 6th International Workshop, WAOA 2008, 29-42 | Proceedings Article |
Amini, Pérennes, Sau
[-] | 2009 | | Hardness and approximation of traffic grooming
In: Theoretical Computer Science [410], 3751-3760 | Journal Article |
Anagnostopoulos, Grandoni, Leonardi, Wiese
[-] | 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 |
Anand, Bringmann, Friedrich, Garg, Kumar
(Ed: Fomin, Freivalds, Kwiatkowska, Peleg)
[-] | 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 |
Anand, Garg, Megow
(Ed: Aceto, Henzinger, Sgall)
[-] | 2011 | | Meeting deadlines: How much speed suffices?
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011. - Pt. I, 232-243 | Proceedings Article |
Andersson, Hagerup, Hastad, Petersson
[-] | 2000 | | Tight bounds for searching a sorted array of strings
In: SIAM Journal on Computing [30], 1552-1578 | Journal Article |
Andersson, Hagerup, Nilsson, Raman
[Andersson, Nilsson, Raman] | 1995 | | Sorting in Linear Time?
In: 27th Annual ACM Symposium on Theory of Computing (STOC95), 427-436 | Proceedings Article |
Andreou, Fotakis, Nikoletseas, Papadopoulou, Spirakis
(Ed: Diks, Rytter)
[-] | 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 |
Angelopoulos
(Ed: Bampis, Jansen)
[-] | 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 |
Angelopoulos
(Ed: Dehne, Gavrilova, Sack, Tóth)
[-] | 2009 | | Online Priority Steiner Tree Problems
In: Algorithms and Data Structures : 11th International Symposium, WADS 2009, 37-48 | Proceedings Article |
Angelopoulos
[-] | 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 |
Angelopoulos
[-] | 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 |
Angelopoulos, Borodin
[-] | 2010 | | Randomized Priority Algorithms
In: Theoretical Computer Science [411], 2542-2558 | Journal Article |
Angelopoulos, Doerr, Huber, Panagiotou
[-] | 2009 | | Tight bounds for quasirandom rumor spreading
In: The Electronic Journal of Combinatorics [16], R102,1-R102,19 | Electronic Journal Article |
Angelopoulos, Dorrigiv, Lopez-Ortiz
[-] | 2008 | | List Update with Locality of Reference
In: 8th Latin American Symposium on Theoretical Informatics (LATIN 2008), 399-410 | Proceedings Article |
Angelopoulos, Dorrigiv, López-Ortiz
[-] | 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, Lopez-Ortiz
[-] | 2009 | | Intertruptible Algorithms for Multi Problem Solving
In: Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI 09), 380-386 | Proceedings Article |
Angelopoulos, Lopez-Ortiz, Hamel
[-] | 2008 | | Optimal Scheduling of Contract Algorithms with Soft Deadlines
In: 23rd National Conference on Artificial Intelligence (AAAI 2008), 868-873 | Proceedings Article |
Angelopoulos, Schweitzer
(Ed: Mathieu)
[-] | 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 |
Anshelevich, Bhardwaj, Hoefer
(Ed: Bodlaender, Italiano)
[-] | 2013 | | Friendship and Stable Matching.
In: 21st European Symposium on Algorithms (ESA-13), 49-60 | Proceedings Article |
Antoniadis, Huang, Ott, Verschae
(Ed: Chatterjee, Sgall)
[-] | 2013 | | How to Pack Your Items When You Have to Buy Your Knapsack
In: Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, 62-73 | Proceedings Article |
Aranov, Asano, Katoh, Mehlhorn, Tokuyama
(Ed: Fleischer, Trippen)
[-] | 2004 | | Polyline Fitting of Planar Points Under Min-sum Criteria
In: Algorithms and Computation: 15th International Symposium, ISAAC 2004, 77-88 | Proceedings Article |
Arge, Meyer, Toma
(Ed: Diaz, Karhumäki, Lepistö, Sannella)
[-] | 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 |
Arge, Meyer, Toma, Zeh
(Ed: Dehne, Sack, Tamassia)
[Arge, Toma, Zeh, Dehne, Sack, Tamassia] | 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 |
Arge, Meyer, Toma, Zeh
[-] | 2003 | | On external-memory planar depth first search
In: Journal of Graph Algorithms and Applications [7], 105-129 | Journal Article |
Arikati, Chaudhuri, Zaroliagis
(Ed: Thiagarajan)
[Thiagarajan] | 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, Chaudhuri, Zaroliagis
[-] | 1998 | | All-Pairs Min-Cut in Sparse Networks
In: Journal of Algorithms [29], 82-110 | Journal Article |
Arikati, Chen, Chew, Das, Smid, Zaroliagis
(Ed: Diaz, Serna)
[Arikati, Chen, Chew, Das, Diaz, Serna, Smid] | 1996 | | Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane
In: Algorithms - ESA '96: 4th Annual European Symposium, 514-528 | Proceedings Article |
Arikati, Dessmark, Lingas, Marathe
(Ed: Hirschberg, Myers)
[Dessmark, Hirschberg, Lingas, Marathe, Myers] | 1996 | | Approximation algorithms for maximum two-dimensional pattern matching
In: Combinatorial Pattern Matching: 7th Annual Symposium, CPM96, 348-360 | Proceedings Article |
Arikati, Dessmark, Lingas, Marathe
[-] | 2001 | | Approximation algorithms for maximum two-dimensional pattern matching
In: Theoretical Computer Science [255], 51-62 | Journal Article |
Arikati, Maheshwari
[Maheshwari] | 1996 | | Realizing degree sequences in parallel
In: SIAM Journal of Computing [9], 317-338 | Journal Article |
Arikati, Maheshwari, Zaroliagis
[-] | 1997 | | Efficient Computation of implicit representations of sparse graphs
In: Discrete Applied Mathematics [78], 1-16 | Journal Article |
Arikati, Mehlhorn
[Arikati] | 1999 | | A correctness certificate for the Stoer-Wagner min-cut algorithm
In: Information Processing Letters [70], 251-254 | Journal Article |
Aronov, Asano, Funke
(Ed: Tokuyama)
[-] | 2007 | | Optimal Triangulation with Steiner Points
In: Algorithms and Computation : 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007. Proceedings, 681-691 | Proceedings Article |
Aronov, Asano, Katoh, Mehlhorn, Tokuyama
[-] | 2006 | | Polyline Fitting of Planar Points under Min-sum Criteria
In: International Journal of Computational Geometry and Applications [16], 97-116 | Journal Article |
Arumugam, Chandrasekar, Misra, Philip, Saurabh
(Ed: Iliopoulos, Smyth)
[-] | 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, Das, Mount, Salowe, Smid
[Das, Mount, Salowe] | 1995 | | Euclidean spanners: short, thin, and lanky
In: 27th Annual ACM Symposium on Theory of Computing (STOC95), 489-498 | Proceedings Article |
Arya, Golin, Mehlhorn
[-] | 1999 | | On the Expected Depth of Random Circuits
In: Combinatorics, Probability and Computing [8], 209-228 | Journal Article |
Arya, Malamatos, Mount
(Ed: Amenta, Cheong)
[-] | 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 |
Arya, Malamatos, Mount
[-] | 2007 | | A simple entropy-based algorithm for planar point location
In: ACM Transactions on Algorithms [3], 17 | Journal Article |
Arya, Malamatos, Mount
[-] | 2006 | | On the Importance of Idempotence
In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, STOC'06, 564-573 | Proceedings Article |
Arya, Malamatos, Mount
[-] | 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 |
Arya, Malamatos, Mount, Wong
[-] | 2007 | | Optimal expected-case planar point location
In: SIAM Journal on Computing [37], 584-610 | Journal Article |
Arya, Mount
[Mount] | 2000 | | Approximate range searching
In: Computational Geometry [17], 135-152 | Journal Article |
Arya, Mount
[Mount] | 1995 | | Approximate range searching
In: 11th Annual ACM Symposium on Computational Geometry (SCG95), 172-181 | Proceedings Article |
Arya, Mount, Narayan
[Mount, Narayan] | 1996 | | Accounting for boundary effects in nearest neighbor searching
In: Discrete & Computational Geometry [16], 155-176 | Journal Article |
Arya, Mount, Narayan
[Mount, Narayan] | 1995 | | Accounting for boundary effects in nearest neighbor searching
In: 11th Annual ACM Symposium on Computational Geometry (SCG95), 336-344 | Proceedings Article |
Arya, Smid
[-] | 1997 | | Efficient construction of a bounded degree spanner with low weight
In: Algorithmica [17], 33-54 | Journal Article |
Asano, Doerr
[-] | 2011 | | Memory-constrained algorithms for shortest path problem
In: 23rd Annual Canadian Conference on Computational Geometry (CCCG 2011), 315-319 | Proceedings Article |
Ashoff
[-] | 2000 | | Agorithmen der modularen Arithmetik
Universität des Saarlandes | Thesis - Masters thesis |
Auger, Doerr (ed.)
(Ed: Auger, Doerr)
[-] | 2011 | | Theory of Randomized Search Heuristics | Book |
Auletta, Dinitz, Nutov, Parente
[Auletta, Dinitz, Parente] | 1999 | | A 2-approximation algorithm for finding an optimum 3-vertex-connected spanning subgraph
In: Journal of Algorithms [32], 21-30 | Journal Article |
Awerbuch, Azar, Grove, Kao, Krishnan, Vitter
[Awerbuch, Azar, Kao, Krishnan, Vitter] | 1995 | | Load Balancing in the Euclidean Norm
In: 36th Annual Symposium on Foundations of Computer Science, 383-391 | Proceedings Article |
Babenko, Gawrychowski, Kociumaka, Starikovskaya
(Ed: Kulikov, Kuznetsov, Pevzner)
[-] | 2014 | | Computing Minimal and Maximal Suffixes of a Substring Revisited
In: Combinatorial Pattern Matching - 25th Annual Symposium, CPM 2014, Moscow, Russia, June 16-18, 2014. Proceedings, 30-39 | Proceedings Article |
Bachrach, El-Yaniv, Reinstädtler
[-] | 2002 | | On the competitive theory and practice of online list accessing algorithms
In: Algorithmica [32], 201-246 | Journal Article |
Bacik, Mahajan
(Ed: Du, Li)
[Bacik, Du, Li] | 1995 | | Semidefinite programming and its applications to NP problems
In: Computing and Combinatorics: 1st Annual International Conference (COCOON95), 566-575 | Proceedings Article |
Backes
[-] | 1998 | | Berechnung kürzester Gittervektoren
Univesität des Saarlandes | Thesis - Masters thesis |
Bader, Moret, Sanders
(Ed: Fleischer, Moret, Meineche Schmidt)
[-] | 2002 | | Algorithm Engineering for Parallel Computation
In: Experimental Algorithmics, 1-23 | Part of a Book |
Banderier
[-] | 2001 | | Combinatoire Analytique des chemins et des cartes
Université de Paris 6 | Thesis - PhD thesis |
Banderier
[-] | 2000 | | A Generalized Cover Time for Random Walks on Graphs
In: Proceedings of FPSAC'00, 113-124 | Proceedings Article |
Banderier
[Bousquet-Mélou, Denise, Flajolet, Gardy, Gouyou-Beauchamps] | 1999 | | On Generating Functions of Generating Trees
In: Proceedings of FPSAC'99, 40-52 | Proceedings Article |
Banderier
[Flajolet, Schaeffer, Soria] | 2001 | | Random Maps, Coalescing Saddles, Singularity Analysis, and Airy Phenomena
In: Random Structures & Algorithms [19], 194-246 | Journal Article |
Banderier
[Flajolet, Schaeffer, Soria] | 2000 | | Planar Maps and Airy Phenomena,
In: Proceedings of ICALP'00, 388-402 | Proceedings Article |
Banderier
[Vardi] | 1999 | | An Introduction to Analytic Number Theory | Miscellaneous |
Banderier, Beier, Mehlhorn
(Ed: Rovan, Vojtas)
[-] | 2003 | | Smoothed Analysis of Three Combinatorial Problems
In: Mathematical foundations of computer science 2003 : 28th International Symposium, MFCS 2003, 198-207 | Proceedings Article |
Banderier, Bousquet-Mélou, Denise, Flajolet, Gardy, Gouyou-Beauchamps
[-] | 2002 | | Generating Functions for Generating Trees
In: Discrete Mathematics [246], 29-55 | Journal Article |
Banderier, Flajolet
[-] | 2002 | | Basic analytic combinatorics of directed lattice paths
In: Theoretical Computer Science [281], 37-80 | Journal Article |
Bannai, Gawrychowski, Inenaga, Takeda
(Ed: Fischer, Sanders)
[-] | 2013 | | Converting SLP to LZ78 in almost Linear Time
In: Combinatorial Pattern Matching, 24th Annual Symposium (CPM 2013), 38-49 | Proceedings Article |
Bansal, Chan
(Ed: Mathieu)
[-] | 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 |
Bansal, Chan, Pruhs
(Ed: Mathieu)
[-] | 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 |
Bansal, Chan, Pruhs
[-] | 2011 | | Competitive Algorithms for Due Date Schedulin
In: Algorithmica [59], 569-582 | Journal Article |
Bansal, Gupta, Li, Mestre, Nagarajan, Rudra
(Ed: de Berg, Meyer)
[-] | 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-Yehuda, Flysher, Mestre, Rawitz
(Ed: Arge, Hoffmann, Welzl)
[-] | 2007 | | Approximation of Partial Capacitated Vertex Cover
In: 15th Annual European Symposium on Algorithms, 335-346 | Proceedings Article |
Bar-Yehuda, Hermelin, Rawitz
(Ed: de Berg, Meyer)
[-] | 2010 | | Minimum Vertex Cover in Rectangle Graphs
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. I, 255-266 | Proceedings Article |
Bar-Yehuda, Hermelin, Rawitz
[-] | 2011 | | Minimum vertex cover in rectangle graphs
In: Computational Geometry [44], 356-364 | Journal Article |
Bárány, Doerr
[-] | 2006 | | Balanced partitions of vector sequences
In: Linear Algebra and Its Applications [414], 464-469 | Journal Article |
Baraque
[-] | 2002 | | Effiziente Multiplikationsverfahren: ein numerischer Vergleich
Universität des Saarlandes | Thesis - Masters thesis |
Barnes, Edmonds
[Edmonds] | 1998 | | Time-Space Lower Bounds for Directed st-Connectivity on Graph Automata Models
In: SIAM Journal on Computing [27], 1190-1202 | Journal Article |
Bartal, Leonardi, Shallom, Sitters
(Ed: Diaz, Jansen, Rolim, Zwick)
[-] | 2006 | | On the value of preemption in scheduling
In: 9th Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX, 39-48 | Proceedings Article |
Baruah, Bonifaci, D'Angelo, Li, Marchetti-Spaccamela, Megow, Stougie
(Ed: Hlinen{\'y}, Kucera)
[-] | 2010 | | Scheduling Real-Time Mixed-Criticality Jobs
In: Mathematical Foundations of Computer Science 2010 : 35th International Symposium, MFCS 2010, 90-101 | Proceedings Article |
Baruah, Bonifaci, D'Angelo, Li, Marchetti-Spaccamela, Megow, Stougie
[-] | 2012 | | Scheduling Real-Time Mixed-Criticality Jobs
In: IEEE Transactions on Computers [61], 1140-1152 | Journal Article |
Baruah, Bonifaci, D'Angelo, Marchetti-Spaccamela, van der Ster, Stougie
(Ed: Demetrescu, Halldórsson)
[-] | 2011 | | Mixed-criticality scheduling of sporadic task systems
In: Algorithms - ESA 2011 : 19th Annual European Symposium, 555-566 | Proceedings Article |
Baruah, Bonifaci, Marchetti-Spaccamela, Stiller
[-] | 2010 | | Improved Multiprocessor Global Schedulability Analysis
In: Real-Time Systems [46], 3-24 | Journal Article |
Barve, Grove, Vitter
[Barve, Vitter] | 1995 | | An Application-Controlled Paging Algorithm for a Shared Cache
In: 36th Annual Symposium on Foundations of Computer Science, 204-213 | Proceedings Article |
Basit, Mustafa, Ray, Raza
[-] | 2010 | | Centerpoints and Tverberg's technique
In: Computational Geometry [43], 593-600 | Journal Article |
Bäsken, Brönnimann, Frank, Devillers, Ester, Fabri, Flato, Gärtner, Giezeman, Halperin, Hanniel, Har-Peled, Herrmann, Hert, Hirsch, Hoffmann, Kettner, Nechushtan, Neyer, Pasechnik, Pion, Schirra, Schönherr, Seel, Teillaud, Veltkamp, Wein, Wesselink, Yvinec
[Bäsken, Brönnimann, Frank, Devillers, Ester, Fabri, Flato, Gärtner, Giezeman, Halperin, Hanniel, Har-Peled, Herrmann, Hirsch, Hoffmann, Nechushtan, Neyer, Pasechnik, Pion, Schönherr, Teillaud, Veltkamp, Wein, Wesselink, Yvinec] | 2001 | | CGAL Reference and User Manuals | Unknown Form: eBookForm |
Bast
(Ed: Albers, Alt, Näher)
[-] | 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 |
Bast
(Ed: Babaoglu, Jelasity, Montresor, van Steen, van Moorsel, Fetzer, Leonardi)
[-] | 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 |
Bast
(Ed: Ferreira, Alt)
[-] | 2002 | | Scheduling at Twilight the Easy Way
In: STACS 2002 : 19th Annual Symposium on Theoretical Aspects of Computer Science, 166-178 | Proceedings Article |
Bast
[-] | 2006 | | Intelligente Suche mit garantiert schnellen Antwortzeiten
In: MPG Jahrbuch [?], | Electronic Journal Article |
Bast
[-] | 2005 | | Präzisionssuche im homöopathischen Netz
In: Homöopathie-Zeitschrift [I/05], 119-122 | Journal Article |
Bast
[-] | 2000 | | On Scheduling Parallel Tasks at Twilight
In: Theory of Computing Systems [33], 489-563 | Journal Article |
Bast
[-] | 2000 | | Provably Optimal Scheduling of Similar Tasks
Universität des Saarlandes | Thesis - PhD thesis |
Bast
[-] | 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 |
Bast
[-] | 1994 | | Fast Parallel Space Allocation, Estimation and Integer Sorting
Universität des Saarlandes | Thesis - Masters thesis |
Bast, Chitea, Suchanek, Weber
(Ed: Clarke, Fuhr, Kando)
[-] | 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 |
Bast, Dietzfelbinger, Hagerup
[-] | 1992 | | A Perfect Parallel Dictionary
In: 17th International Symposium on Mathematical Foundations of Computer Science (MFCS'92), 133-141 | Proceedings Article |
Bast, Dupret, Majumdar, Piwowarski
(Ed: Ackermann, Berendt, Grobelnik, Hotho, Mladenic, Semeraro, Spiliopoulou, Stumme, Svatek, van Someren)
[-] | 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 |
Bast, Funke, Matijevic
(Ed: Demetrescu, Goldberg, Johnson)
[-] | 2009 | | Ultrafast shortest-path queries via transit nodes
In: The shortest path problem : ninth DIMACS implemenation challenge, 175-192 | Part of a Book |
Bast, Funke, Matijevic
(Ed: Demetrescu, Goldberg, Johnson)
[-] | 2006 | | TRANSIT: Ultrafast Shortest-Path Queries with Linear-Time Preprocessing
In: 9th DIMACS Implementation Challenge --- Shortest Path, | Electronic Proceedings Article |
Bast, Funke, Matijevic, Sanders, Schultes
(Ed: Applegate, Brodal)
[-] | 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 |
Bast, Funke, Sanders, Schultes
[-] | 2007 | | Fast Routing in Road Networks using Transit Nodes
In: Science [316], 566 | Journal Article |
Bast, Hagerup
[-] | 1995 | | Fast Parallel Space Allocation, Estimation, and Integer Sorting
In: Information and Computation [123], 72-110 | Journal Article |
Bast, Hagerup
[-] | 1991 | | Fast and Reliable Parallel Hashing
In: 3rd Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'91), 50-61 | Proceedings Article |
Bast, Hert
(Ed: Bremner)
[-] | 2000 | | The Area Partitioning Problem
In: Proceedings of the 12th Annual Canadian Conference on Computational Geometry (CCCG-00), 163-171 | Proceedings Article |
Bast, Majumdar
(Ed: Marchionini, Moffat, Tait, Baeza-Yates, Ziviani)
[-] | 2005 | | Why Spectral Retrieval Works
In: 28th Annual International Conference on Research and Development in Information Retrieval (SIGIR'05), 11-18 | Proceedings Article |
Bast, Majumdar, Schenkel, Theobald, Weikum
(Ed: Dayal, Whang, Lomet, Alonso, Lohman, Kersten, Cha, Kim)
[-] | 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 |
Bast, Majumdar, Schenkel, Theobald, Weikum
(Ed: Voorhees, Buckland)
[-] | 2006 | | IO-Top-k at TREC 2006: Terabyte Track
In: The Fifteenth Text Retrieval Conference Proceedings, TREC 2006, 1-5 | Electronic Proceedings Article |
Bast, Majumdar, Schenkel, Theobald, Weikum
[-] | 2006 | | IO-Top-k: Index-Access Optimized Top-k Query Processing | Report |
Bast, Majumdar, Weber
(Ed: Mário J. Silva, Alberto H. F. Laender, Ricardo A. Baeza-Yates, Deborah L. McGuinness, Bj{\o}rn Olstad, {\O}ystein Haug Olsen, André O. Falc{\~a}o)
[-] | 2007 | | Efficient interactive query expansion with CompleteSearch
In: 16th Conference on Information and Knowledge Management (CIKM'07), 857-860 | Proceedings Article |
Bast, Mehlhorn, Schäfer, Tamaki
(Ed: Diekert, Habib)
[-] | 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 |
Bast, Mehlhorn, Schäfer, Tamaki
[-] | 2006 | | Matching Algorithms are Fast in Sparse Random Graphs
In: Theory of Computing Systems [39], 3-14 | Journal Article |
Bast, Mehlhorn, Schäfer, Tamaki
[-] | 2003 | | A Heuristic for Dijkstra's Algorithm With Many Targets and its Use in Weighted Matching Algorithms
In: Algorithmica [36], 75-88 | Journal Article |
Bast, Mortensen, Weber
(Ed: Crestani, Ferragina, Sanderson)
[-] | 2006 | | Output-Sensitive Autocompletion Search
In: String Processing and Information Retrieval : 13th International Conference, SPIRE 2006, 150-162 | Proceedings Article |
Bast, Weber
(Ed: Adachi, Shan, Vakali)
[-] | 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 |
Bast, Weber
(Ed: Broder, Maarek)
[-] | 2006 | | When You're Lost For Words: Faceted Search With Autocompletion
In: SIGIR'06 Workshop on Faceted Search, 31-35 | Proceedings Article |
Bast, Weber
(Ed: Efthimiadis, Dumais, Hawking, Järvellin)
[-] | 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 |
Bast, Weber
(Ed: Gronau)
[-] | 2007 | | Managing Helpdesk Tasks with CompleteSearch: A Case Study
In: 4th Conference on Professional Knowledge Management (WM'07), 101-108 | Proceedings Article |
Bast, Weber
(Ed: Nikoletseas)
[-] | 2005 | | Don't Compare Averages
In: 4th International Workshop on Efficient and Experimental Algorithms (WEA'05), 67-76 | Proceedings Article |
Bast, Weber
(Ed: Weikum)
[-] | 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 |
Baswana, Biswas, Doerr, Friedrich, Kurur, Neumann
(Ed: Jansen, Garibay, Wiegand, Wu)
[-] | 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 |
Baswana, Goyal, Sen
(Ed: Diekert, Durand)
[-] | 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 |
Baswana, Kavitha, Mehlhorn, Pettie
[-] | 2011 | | Additive Spanners and (α, β)-Spanners
In: ACM Transactions on Algorithms [7], 5:1-5:26 | Journal Article |
Baswana, Sen
(Ed: Sahni, Mehta)
[-] | 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 |
Baswana, Sen
[-] | 2007 | | A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
In: Random Structures & Algorithms [30], 532-563 | Journal Article |
Baswana, Sen
[-] | 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 |
Baswana, Telikepalli, Mehlhorn, Pettie
[-] | 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 |
Batra, Sharma
[-] | 2010 | | Bounds on absolute positiveness of multivariate polynomials
In: Journal of Symbolic Computation [45], 617-628 | Journal Article |
Baumann, Köhler
(Ed: Fiala, Koubek, Kratochvil)
[-] | 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 |
Baumbach, Friedrich, Kötzing, Krohmer, Müller, Pauling
[-] | 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 |
Baumgarten, Jung, Mehlhorn
(Ed: Frederickson, Graham, Hochbaum, Johnson, Kosaraju, Luby, Megiddo, Schieber, Vaidya, Yao)
[-] | 1992 | | Dynamic Point Location in General Subdivisions
In: Discrete algorithms (SODA-92) : 3rd annual ACM-SIAM symposium, 250-258 | Proceedings Article |
Baumgarten, Jung, Mehlhorn
[-] | 1994 | | Dynamic point location in general subdivisions
In: Journal of Algorithms [3], 342-380 | Journal Article |
Baus
[-] | 2005 | | Symbolic Constraints in Linear Integer Programming
Universität des Saarlandes | Thesis - Masters thesis |
Baus
[-] | 2004 | | Symbolic Constraints in Linear Integer Programming
Universität des Saarlandes | Thesis - Masters thesis |
Becchetti, Leonardi, Marchetti-Spaccamela, Schäfer
[-] | 2003 | | Scheduling to minimize flow time metrics
In: International Parallel and Distributed Processing Symposium (IPDPS-03), 223b-CDROM | Proceedings Article |
Becchetti, Leonardi, Marchetti-Spaccamela, Schäfer, Vredeveld
[-] | 2003 | | Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm
In: 44th Annual Symposium on Foundations of Computer Science (FOCS-03), 462-471 | Proceedings Article |
Becker
[-] | 2012 | | The Bolzano Method to Isolate the Roots of a Bitstream Polynomial
Universität des Saarlandes | Thesis - Bachelor thesis |
Becker
[-] | 1996 | | Allgemeine approximative Kongruenz zweier Punktmengen im R³
Universität des Saarlandes | Thesis - Masters thesis |
Becker, Degenhardt, Doenhardt, Hertel, Kaninke, Kerber, Mehlhorn, Näher, Rohnert, Winter
[-] | 1982 | | A Probabilistic Algorithm for Vertex Connectivity of Graphs
In: Information Processing Letters [15], 135-136 | Journal Article |
Becker, Mehlhorn
[-] | 1986 | | Algorithms for Routing in Planar Graphs
In: Acta Informatica [23], 163-176 | Journal Article |
Becker, Mehlhorn
[-] | 1984 | | Algorithms for routing in planar graphs | Report |
Behle
(Ed: Dress, Xu, Zhu)
[-] | 2007 | | On threshold BDDs and the optimal variable ordering problem
In: Combinatorial Optimization and Applications : First International Conference, COCOA 2007, 124-135 | Proceedings Article |
Behle, Jünger, Liers
(Ed: Demetrescu)
[-] | 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 |
Behrens
[-] | 2000 | | Solid Modeling durch Boolesche Operationen
Universität des Saarlandes | Thesis - Masters thesis |
Bei
(Ed: Halldórsson, Iwama, Kobayashi, Speckmann)
[-] | 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 |
Beier
[-] | 2004 | | Probabilistic Analysis of Discrete Optimization Problems
Universität des Saarlandes | Thesis - PhD thesis |
Beier
[-] | 2000 | | Eine Heuristik für das Gossiping-Problem
Universität des Saarlandes | Thesis - Masters thesis |
Beier, Czumaj, Krysta, Vöcking
[-] | 2006 | | Computing Equilibria for a Service Provider Game with (Im)perfect Information
In: ACM Transactions on Algorithms [2], 679-706 | Journal Article |
Beier, Funke, Matijevic, Sanders
[-] | 2011 | | Energy-Efficient Paths in Radio Networks
In: Algorithmica [61], 298-319 | Journal Article |
Beier, Krysta, Czumaj, Vöcking
[-] | 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 |
Beier, Röglin, Vöcking
(Ed: Fischettim, Williamson)
[-] | 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 |
Beier, Sanders, Sivadasan
(Ed: Widmayer, Triguero, Morales, Hennessy, Eidenbenz, Conejo)
[-] | 2002 | | Energy Optimal Routing in Radio Networks Using Geometric Data Structures
In: Automata, Languages and Programming : 29th International Colloquium, ICALP 2002, 366-376 | Proceedings Article |
Beier, Sibeyn
(Ed: Flammini, Nardelli, Proietti, Spirakis)
[Flammini, Nardelli, Proietti, Spirakis] | 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 |
Beier, Vöcking
[-] | 2006 | | An Experimental Study of Random Knapsack Problems
In: Algorithmica [45], 121-136 | Journal Article |
Beier, Vöcking
[-] | 2006 | | Typical Properties of Winners and Losers in Discrete Optimization
In: SIAM Journal on Computing [35], 855-881 | Journal Article |
Beier, Vöcking
[-] | 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 |
Beier, Vöcking
[-] | 2004 | | Random knapsack in expected polynomial time
In: Journal of Computer and System Sciences [69], 306-329 | Journal Article |
Beier, Vöcking
[-] | 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 |
Beier, Vöcking
[-] | 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 |
Bein, Fleischer, Larmore
[Bein, Larmore] | 2000 | | Limited bookmark randomized online algorithms for the paging problem
In: Information Processing Letters [76], 155-162 | Journal Article |
Beldiceanu, Carlsson, Thiel
[-] | 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 |
Beldiceanu, Carlsson, Thiel
[-] | 2002 | | Cost-Filtering Algorithms for the two Sides of the Sum of Weights of Distinct Values Constraint | Report |
Beldiceanu, Guo, Thiel
(Ed: Walsh)
[Beldiceanu, Guo, Walsh] | 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 |
Beldiceanu, Katriel, Thiel
(Ed: Faltings, Petcu, Fages, Rossi)
[-] | 2005 | | GCC-like Restrictions on the Same constraint
In: Constraint Satisfaction and Constraint Logic Programming : ERCIM/CoLogNet International Workshop, CSCLP 2004, 1-11
In: Recent Advances in Constraints [3419], 1-11 | Proceedings Article |
Beldiceanu, Katriel, Thiel
(Ed: Régin, Rueher)
[-] | 2004 | | Filtering algorithms for the Same constraint
In: Integration of AI and OR techniques in constraint programming for combinatorial optimization problems : First International Conference, CPAIOR 2004, 65-79 | Proceedings Article |
Beldiceanu, Katriel, Thiel
[-] | 2007 | | Filtering Algorithms for the Same and UsedBy Constraints
In: Archives of Control Sciences [to appear], to appear | Journal Article |
Beldiceanu, Katriel, Thiel
[-] | 2004 | | Filtering algorithms for the Same and UsedBy constraints | Report |
Belfrage, Mütze, Spöhel
[-] | 2012 | | Probabilistic one-player Ramsey games via deterministic two-player games
In: SIAM Journal on Discrete Mathematics [26], 1031-1049 | Journal Article |
Ben-Asher, Schuster, Sibeyn
[Ben-Asher, Schuster] | 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 |
Ben-Zwi, Hermelin, Lokshtanov, Newman
[-] | 2011 | | Treewidth governs the complexity of target set selection
In: Discrete Optimization [8], 87-96 | Journal Article |
Berberich
[-] | 2008 | | Robust and Efficient Software for Problems in 2.5-Dimensional Non-Linear Geometry - Algorithms and Implementations
Universität des Saarlandes | Thesis - PhD thesis |
Berberich
[-] | 2004 | | Exact Arrangements of Quadric Intersection Curves
Universität des Saarlandes | Thesis - Masters thesis |
Berberich, Caroli, Wolpert
[-] | 2007 | | Exact Computation of Arrangements of Rotated Conics | Report |
Berberich, Caroli, Wolpert
[-] | 2007 | | Exact Computation of Arrangements of Rotated Conics
In: Proceedings of 23rd European Workshop on Computational Geometry, 231-234 | Proceedings Article |
Berberich, Ebert, Fogel, Kettner
[-] | 2006 | | Web-site with benchmark instances for planar curve arrangements | Report |
Berberich, Ebert, Kettner
[-] | 2006 | | Definition of file format for benchmark instances for arrangements of Quadrics | Report |
Berberich, Eigenwillig, Emiris, Fogel, Hemmer, Halperin, Kakargias, Kettner, Mehlhorn, Pion, Schömer, Teillaud, Wein, Wolpert
[-] | 2004 | | An Empirical Comparison of Software for Constructing Arrangements of Curved Arcs | Report |
Berberich, Eigenwillig, Fogel, Halperin, Hert, Kettner, Teillaud, Wein
[-] | 2003 | | Specification of the traits classes for CGAL arrangements of curves | Report |
Berberich, Eigenwillig, Hemmer, Hert, Kettner, Mehlhorn, Reichel, Schmitt, Schömer, Weber, Wolpert
[-] | 2004 | | EXACUS: Efficient and Exact Algorithms for Curves and Surfaces | Report |
Berberich, Eigenwillig, Hemmer, Hert, Kettner, Mehlhorn, Reichel, Schmitt, Schömer, Wolpert
(Ed: Brodal, Leonardi)
[-] | 2005 | | EXACUS: Efficient and exact algorithms for curves and surfaces
In: 13th Annual European Symposium on Algorithms (ESA 2005), 155-166 | Proceedings Article |
Berberich, Eigenwillig, Hemmer, Hert, Mehlhorn, Schömer
(Ed: Möhring, Raman)
[-] | 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 |
Berberich, Emeliyanenko
[-] | 2008 | | CGAL's Curved Kernel via Analysis | Report |
Berberich, Emeliyanenko, Kobel, Sagraloff
(Ed: Moreno Maza)
[-] | 2011 | | Arrangement Computation for Planar Algebraic Curves
In: Proceedings of the 4th Internal Workshop on Symbolic-Numeric Computation, 88-98 | Proceedings Article |
Berberich, Emeliyanenko, Kobel, Sagraloff
[-] | 2013 | | Exact symbolic–numeric computation of planar algebraic curves
In: Theoretical Computer Science [491], 1-32 | Journal Article |
Berberich, Emeliyanenko, Kobel, Sagraloff
[-] | 2012 | | Exact Symbolic-Numeric Computation of Planar Algebraic Curves
In: arXiv [abs/1201.1548v1], 1-46 | Electronic Journal Article |
Berberich, Emeliyanenko, Kobel, Sagraloff
[-] | 2011 | | Arrangement Computation for Planar Algebraic Curves
In: arXiv [abs/1103.4697], | Electronic Journal Article |
Berberich, Emeliyanenko, Sagraloff
(Ed: Müller-Hannemann, Werneck)
[-] | 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 |
Berberich, Emeliyanenko, Sagraloff
[-] | 2010 | | An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks
In: CoRR [abs/1010.1386], 1-16 | Electronic Journal Article |
Berberich, Fogel, Halperin, Kerber, Setter
[-] | 2010 | | Arrangements on Parametric Surfaces II: Concretizations and Applications
In: Mathematics in Computer Science [4], 67-91 | Journal Article |
Berberich, Fogel, Halperin, Mehlhorn, Wein
(Ed: Arge, Hoffmann, Welzl)
[-] | 2007 | | Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step
In: Algorithms - ESA 2007, 15th Annual European Symposium, 645-656 | Proceedings Article |
Berberich, Fogel, Halperin, Mehlhorn, Wein
[-] | 2010 | | Arrangements on Parametric Surfaces I: General Framework and Infrastructure
In: Mathematics in Computer Science [4], 45-66 | Journal Article |
Berberich, Fogel, Halperin, Mehlhorn, Wein
[-] | 2007 | | Sweeping and Maintaining Two-Dimensional Arrangements on Quadrics | Report |
Berberich, Fogel, Halperin, Wein
[-] | 2007 | | Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces
In: Proceedings of 23rd European Workshop on Computational Geometry, 223-226 | Proceedings Article |
Berberich, Fogel, Meyer
[-] | 2007 | | Updated Website to include Benchmark Instances for Arrangements of Quadrics and Planar Algebraic Curves | Report |
Berberich, Hagen, Hiller, Moser
(Ed: Müller-Hannemann, Schirra)
[-] | 2010 | | Experiments
In: Algorithm Engineering : Bridging the Gap between Algorithm Theory and Practice, 325-388 | Part of a Book |
Berberich, Halperin, Kerber, Pogalnikova
(Ed: Hurtado, van Krefeld)
[-] | 2011 | | Deconstructing Approximate Offsets
In: Proceedings of the 27th Annual Symposium on Computational Geometry (SCG'11), 187-196 | Proceedings Article |
Berberich, Halperin, Kerber, Pogalnikova
(Ed: Vahrenhold)
[-] | 2010 | | Polygonal Reconstruction from Approximate Offsets
In: 26th European Workshop on Computational Geometry : Workshop Proceedings, 65-68 | Electronic Proceedings Article |
Berberich, Halperin, Kerber, Pogalnikova
[-] | 2012 | | Deconstructing Approximate Offsets
In: Discrete & Computational Geometry [48], 964-989 | Journal Article |
Berberich, Halperin, Kerber, Pogalnikova
[-] | 2011 | | Deconstructing Approximate Offsets
In: arXiv [abs/1109.2158], | Electronic Journal Article |
Berberich, Hemmer
(Ed: Kettner)
[-] | 2006 | | Prototype implementation of the algebraic kernel | Report |
Berberich, Hemmer
[-] | 2007 | | Definition of the 3D Quadrical Kernel Content | Report |
Berberich, Hemmer, Karavelas, Pion, Teillaud, Tsigaridas
(Ed: Kettner)
[-] | 2006 | | Interface specification of algebraic kernel | Report |
Berberich, Hemmer, Karavelas, Pion, Teillaud, Tsigaridas
[-] | 2008 | | Prototype implementation of the algebraic kernel | Report |
Berberich, Hemmer, Karavelas, Teillaud
[-] | 2007 | | Revision of interface specification of algebraic kernel | Report |
Berberich, Hemmer, Kerber
(Ed: Hurtado, van Krefeld)
[-] | 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 |
Berberich, Hemmer, Kerber
[-] | 2010 | | A Generic Algebraic Kernel for Non-linear Geometric Applications | Report |
Berberich, Hemmer, Kettner, Schömer, Wolpert
(Ed: Mitchell, Rote, Kettner)
[-] | 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 |
Berberich, Kerber
(Ed: Haines, McGuire)
[-] | 2008 | | Exact Arrangements on Tori and Dupin Cyclides
In: Proceedings of the 2008 ACM Symposium on Solid and Physical Modeling, 59-66 | Proceedings Article |
Berberich, Kerber
(Ed: Petitjean)
[-] | 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 |
Berberich, Kerber, Sagraloff
(Ed: Petitjean)
[-] | 2008 | | Geometric Analysis of Algebraic Surfaces Based on Planar Arrangements
In: 24th European Workshop on Computational Geometry - Collection of Abstracts, 29-32 | Proceedings Article |
Berberich, Kerber, Sagraloff
(Ed: Teillaud, Welzl)
[-] | 2008 | | Exact Geometric-Topological Analysis of Algebraic Surfaces
In: Proceedings of the 24th ACM Symposium on Computational Geometry, 164-173 | Proceedings Article |
Berberich, Kerber, Sagraloff
[-] | 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 |
Berberich, Kettner
[-] | 2007 | | Linear-Time Reordering in a Sweep-line Algorithm for Algebraic Curves Intersecting in a Common Point | Report |
Berberich, Meyerovitch
[-] | 2007 | | Computing Envelopes of Quadrics | Report |
Berberich, Meyerovitch
[-] | 2007 | | Computing Envelopes of Quadrics
In: Proceedings of 23rd European Workshop on Computational Geometry, 235-238 | Proceedings Article |
Berberich, Sagraloff
(Ed: Haines, McGuire)
[-] | 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 |
Berberich, Sagraloff
[-] | 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 |
Berenbrink, Cooper, Friedetzky, Friedrich, Sauerwald
(Ed: Randall)
[-] | 2011 | | Randomized Diffusion for Indivisible Loads
In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 429-439 | Proceedings Article |
Berenbrink, Friedetzky, Elsaesser, Nagel, Sauerwald
(Ed: Murlak, Sankowski)
[-] | 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 |
Berenbrink, Hoefer, Sauerwald
(Ed: Randall)
[-] | 2011 | | Distributed Selfish Load Balancing on Networks
In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 1487-1497 | Proceedings Article |
Berghammer, Friedrich, Neumann
(Ed: Pelikan, Branke)
[-] | 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 |
Berg, Kreveld, Schirra
[Berg, Kreveld] | 1995 | | A new approach to subdivision simplification
In: ACSM/ASPRS Annual Convention & Exposition Technical Papers, 79-88 | Proceedings Article |
Berman, Krysta
[-] | 2003 | | Optimizing Misdirection
In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 192-201 | Proceedings Article |
Berthomé, Duboux, Hagerup, Newman, Schuster
(Ed: Spirakis)
[Berthomé, Duboux, Newman, Schuster, Spirakis] | 1995 | | Self-Simulation for the Passive Optical Star Model
In: Algorithms-ESA'95: 3rd Annual European Symposium, 268-380 | Proceedings Article |
Bhaskar, Fleischer, Hoy, Huang
(Ed: Mathieu)
[-] | 2009 | | Equilibria of Atomic Flow Games are not Unique
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 748-757 | Proceedings Article |
Biedl, Kaufmann, Mutzel
(Ed: Hromkovic, Sykora)
[Biedl, Kaufmann, Hromkovic, Sykora] | 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 |
Bifet, Castillo, Chirita, Weber
(Ed: Davison)
[-] | 2005 | | An Analysis of Factors Used in Search Engine Ranking
In: 1st International Workshop on Adversarial Information Retrieval on the Web (AIRWeb'05), 1-10 | Electronic Proceedings Article |
Bilardi, Chaudhuri, Dubhashi, Mehlhorn
[-] | 1994 | | A lower bound for area-universal graphs
In: Information Processing Letters [51], 101-105 | Journal Article |
Birk
[-] | 1997 | | Lösung von Varianten des Post-Office-Problems mit Hilfe von Skip List Range Trees
Universität des Saarlandes | Thesis - Masters thesis |
Blanchebarbe
[-] | 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 |
Blelloch, Farzan
(Ed: Amir, Parida)
[-] | 2010 | | Succinct Representations of Separable Graphs
In: Combinatorial Pattern Matching : 21st Annual Symposium, CPM 2010, 138-150 | Proceedings Article |
Blum, Mehlhorn
(Ed: Weihrauch)
[-] | 1979 | | Mittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten Bäumen
In: Theoretical Computer Science, 4th GI-Conference, 67-78 | Proceedings Article |
Blum, Mehlhorn
[-] | 1980 | | On the Average Number of Rebalancing Operations in Weight-Balanced Trees
In: Theoretical Computer Science [11], 303-320 | Journal Article |
Blum, Mehlhorn
[-] | 1978 | | On the Average Number of Rebalancing Operations in Weight-Balanced Trees | Report |
Böcker, Hüffner, Truss, Wahlström
(Ed: Chen, Fomin)
[-] | 2009 | | A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams
In: Parameterized and Exact Computation : 4th International Workshop, IWPEC 2009, 38-49 | Proceedings Article |
Bodirsky, Gröpl, Johannsen, Kang
[-] | 2007 | | A Direct Decomposition of 3-connected Planar Graphs
In: Séminaire Lotharingien de Combinatoire [B54Ak], 15 | Journal Article |
Bodirsky, Kutz
[-] | 2007 | | Determining the consistency of partial tree descriptions
In: Artificial Intelligence [171], 185-196 | Journal Article |
Bodlaender, Deogun, Jansen, Kloks, Kratsch, Müller, Tuza
[Bodlaender, Deogun, , Kloks, Kratsch, Müller, Tuza] | 1998 | | Ranking of Graphs
In: SIAM Journal on Discrete Mathematics [11], 168-181 | Journal Article |
Bodlaender, Feremans, Grigoriev, Penninkx, Sitters, Wolle
(Ed: Erlebach, Kaklamanis)
[-] | 2006 | | On the minimum corridor connection and other generalized geometric problems
In: 4th Workshop on Approximation and Online Algorithms, WAOA, 69-82 | Proceedings Article |
Bodlaender, Hagerup
(Ed: Fülöp, Gecseg)
[Bodlaender, Fülöp, Gecseg] | 1995 | | Parallel Algorithms with Optimal Speedup for Bounded Treewidth
In: Automata, Languages, and Programming: 22nd International Colloquium (ICALP95), 268-279 | Proceedings Article |
Bodlaender, Hagerup
[Bodlaender] | 1998 | | Parallel Algorithms with Optimal Speedup for Bounded Treewidth
In: SIAM Journal on Computing [27], 1725-1746 | Journal Article |
Bogdan, Sauerwald, Stauffer, Sun
(Ed: Sanjeev Khanna)
[-] | 2013 | | Balls into Bins via Local Search
In: 24th ACM-SIAM Symposium on Discrete Algorithms (SODA-13), 16-34 | Electronic Proceedings Article |
Boghossian, Kohlbacher, Lenhof
(Ed: Vitter, Zaroliagis)
[Vitter, Zaroliagis] | 1999 | | BALL: Biochemical Algorithms Library
In: Algorithm engineering (WAE-99) : 3rd International Workshop, WAE'99, 330-344 | Proceedings Article |
Bonifaci, Chan, Marchetti-Spaccamela, Megow
(Ed: Charikar)
[-] | 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, Chan, Marchetti-Spaccamela, Megow
[-] | 2012 | | Algorithms and Complexity for Periodic Real-Time Scheduling
In: ACM Transactions on Algorithms [9], 601-619 | Journal Article |
Bonifaci, Harks, Schäfer
[-] | 2010 | | Stackelberg Routing in Arbitrary Networks
In: Mathematics of Operations Research [35], 330 - 346 | Journal Article |
Bonifaci, Korteweg, Marchetti-Spaccamela, Stougie
[-] | 2011 | | Minimizing Flow Time in the Wireless Gathering Problem
In: ACM Transactions on Algorithms [7], 33:1-33:20 | Journal Article |
Bonifaci, Korteweg, Marchetti-Spaccamela, Stougie
[-] | 2011 | | The Distributed Wireless Gathering Problem
In: Theoretical Computer Science [412], 633-641 | Journal Article |
Bonifaci, Marchetti-Spaccamela
(Ed: de Berg, Meyer)
[-] | 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, Marchetti-Spaccamela
[-] | 2012 | | Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems
In: Algorithmica [63], 763-780 | Journal Article |
Bonifaci, Marchetti-Spaccamela, Megow, Wiese
[-] | 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 |
Bonifaci, Marchetti-Spaccamela, Stiller
[-] | 2012 | | A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
In: Algorithmica [62], 1034-1049 | Journal Article |
Bonifaci, Marchetti-Spaccamela, Stiller, Wiese
[-] | 2013 | | Feasibility Analysis in the Sporadic DAG Task Model
In: Proceedings of the 25th Euromicro Conference on Real-Time Systems (ECRTS 2013), | Proceedings Article |
Bonifaci, Mehlhorn, Varma
(Ed: Ravani)
[-] | 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 |
Bonifaci, Mehlhorn, Varma
[-] | 2012 | | Physarum Can Compute Shortest Paths
In: Journal of Theoretical Biology [309], 121-133 | Journal Article |
Boros, Borys, Elbassioni, Gurvich, Makino, Rudolf
(Ed: Lin)
[-] | 2007 | | Generating Minimal k-Vertex Connected Spanning Subgraphs
In: Computing and Combinatorics, 13th Annual International Conference, COCOON 2007, Proceedings, 222-231 | Proceedings Article |
Boros, Elbassioni, Fouz, Gurvich, Makino, Manthey
(Ed: Aceto, Henzinger, Sgall)
[-] | 2011 | | Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 147-158 | Proceedings Article |
Boros, Elbassioni, Gurvich
(Ed: Albers, Radzik)
[-] | 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 |
Boros, Elbassioni, Gurvich, Khachiyan
(Ed: Bienstock, Nemhauser)
[-] | 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 |
Boros, Elbassioni, Gurvich, Khachiyan
(Ed: Farach-Colton)
[-] | 2004 | | Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections
In: LATIN 2004: Theoretical Informatics, 6th Latin American Symposium, 488-498 | Proceedings Article |
Boros, Elbassioni, Gurvich, Khachiyan
(Ed: Ribeiro, Martins)
[-] | 2004 | | An Efficient Implementation of a Joint Generation Algorithm
In: Experimental and efficient algorithms : Third International Workshop, WEA 2004, 114-128 | Proceedings Article |
Boros, Elbassioni, Gurvich, Khachiyan
[-] | 2003 | | Algorithms for Enumerating Circuits in Matroids.
In: Algorithms and Computation, 14th International Symposium, ISAAC 2003, 485-494 | Proceedings Article |
Boros, Elbassioni, Gurvich, Khachiyan, Makino
(Ed: Fiala, Koubek, Kratochvíl)
[-] | 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 |
Boros, Elbassioni, Gurvich, Khachiyan, Makino
[-] | 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 |
Boros, Elbassioni, Gurvich, Makino
(Ed: Eisenbrand, Shepherd)
[-] | 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 |
Boros, Elbassioni, Gurvich, Makino
[-] | 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 |
Boros, Elbassioni, Gurvich, Makino
[-] | 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 |
Boros, Elbassioni, Gurvich, Makino
[-] | 2011 | | A lower bound for discounting algorithms solving two-person zero-sum limit average payoff stochastic games | Unpublished/Draft |
Boros, Elbassioni, Gurvich, Makino
[-] | 2010 | | On effectivity functions of game forms
In: Games and Economic Behavior [68], 512-531 | Journal Article |
Boros, Elbassioni, Gurvich, Makino
[-] | 2010 | | On Nash Equilibria and Improvement Cycles in Pure Positional Strategies for Chess-like and Backgammon-like $n$-person Games | Unpublished/Draft |
Boros, Elbassioni, Gurvich, Makino
[-] | 2007 | | Generating Vertices of Polyhedra and Related Monotone Generation Problems | Unpublished/Draft |
Boros, Elbassioni, Gurvich, Makino, Oudalov
[-] | 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 |
Boros, Elbassioni, Gurvich, Tiwary
[-] | 2011 | | The negative cycles polyhedron and hardness of checking some polyhedral properties
In: Annals of Operations Research [188], 63-76 | Journal Article |
Boros, Elbassioni, Gurvich, Tiwary
[-] | 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 |
Boros, Elbassioni, Khachiyan, Gurvich
[-] | 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 |
Boros, Elbassioni, Khachiyan, Gurvich
[-] | 2003 | | An Inequality for Polymatroid Functions and its Applications
In: Discrete Applied mathematics [131], 27 | Journal Article |
Boros, Elbassioni, Khachiyan, Gurvich
[-] | 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 |
Boros, Elbassioni, Khachiyan, Gurvich
[-] | 2002 | | Generating Dual-Bounded Hypergraphs
In: Optimization Methods and Software [17], 33 | Electronic Journal Article |
| [Replication or Save Conflict] | | | | |
Boros, Elbassioni, Khachiyan, Gurvich
[-] | 2002 | | Matroid Intersections, Polymatroid Inequalities, and Related Problems
In: Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, 143-154 | Proceedings Article |
Boros, Elbassioni, Khachiyan, Gurvich
[-] | 2000 | | An Efficient Incremental Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension
In: Parallel Processing Letters [10], 14 | Journal Article |
Boros, Elbassioni, Khachiyan, Gurvich, Makino
[-] | 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 |
Boros, Elbassioni, Khachiyan, Gurvich, Makino
[-] | 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 |
Boros, Elbassioni, Makino
[-] | 2010 | | Left-to-right multiplication for monotone Boolean dualization
In: SIAM Journal on Computing [39], 3424-3439 | Journal Article |
Boros, Elbassioni, Makino
[-] | 2008 | | On Berge Multiplication for Monotone Boolean Dualization
In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, 48-59 | Proceedings Article |
Böttcher, Doerr, Neumann
(Ed: Schaefer, Cotta, Kolodziej, Rudolph)
[-] | 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 |
Boullay
[-] | 1996 | | Eine parallelisierbare Heuristik für das Min-Cost-Flow Problem
Universität des Saarlandes | Thesis - Masters thesis |
Bouziane, El Kahoui
[-] | 2002 | | Computation of the dual of a plane projective curve
In: Journal of Symbolic Computation [34], 105-117 | Journal Article |
Bradford, Capoyleas
[-] | 1997 | | Weak epsilon-Nets for Points on a Hypersphere
In: Discrete & Computational Geometry [18], 83-91 | Journal Article |
Bradford, Choppela, Rawlins
(Ed: Baeza-Yates, Goles, Poblete)
[Baeza-Yates, Choppela, Goles, Poblete, Rawlins] | 1995 | | Lower Bounds for the Matrix Chain Ordering Problem
In: LATIN'95: Theoretical Informatics, 2nd Latin American Symposium, 112-130 | Proceedings Article |
Bradford, Fleischer
(Ed: Staples, Eades, Katoh, Moffat)
[Staples, Eades, Katoh, Moffat] | 1995 | | Matching nuts and bolts faster
In: Algorithms and Computation: 6th International Symposium (ISAAC'95), 402-408 | Proceedings Article |
Bradford, Fleischer, Smid
[-] | 1997 | | More efficient parallel totally monotone matrix searching
In: Journal of Algorithms [23], 386-400 | Journal Article |
Bradford, Golin, Larmore
[-] | 2002 | | Optimal prefix-free codes for unequal letter costs: Dynamic programming with the Monge property
In: Journal of Algorithms [42], 277-303 | Journal Article |
Bradford, Golin, Larmore, Rytter
(Ed: Bilardi, Italiano, Pietracaprina, Pucci)
[Golin, Larmore, Rytter, Bilardi, Italiano, Pietracaprina] | 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 |
Bradford, Rawlins, Shannon
[Rawlins, Shannon] | 1998 | | Efficient Matrix Chain Ordering in Polylog Time
In: SIAM Journal on Computing [27], 466-490 | Journal Article |
Bradford, Reinert
(Ed: Meyer auf der Heide, Monien)
[Meyer auf der Heide, Monien] | 1996 | | Lower Bounds for Row Minima Searching
In: Automata Languages and Programming: 23rd International Colloquium (ICALP'96), 454-465 | Proceedings Article |
Bradonjić, Elsässer, Friedrich, Sauerwald, Stauffer
(Ed: Charikar)
[-] | 2010 | | Efficient Broadcast on Random Geometric Graphs
In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1412-1421 | Proceedings Article |
Bramer
[-] | 2003 | | Zwei Algorithmen zur Bestimmung kostenminimaler Flüsse in Netzwerken
Universität des Saarlandes | Thesis - Masters thesis |
Brandenburg, Jünger, Mutzel
[Brandenburg, Jünger] | 1997 | | Algorithmen zum automatischen Zeichnen von Graphen
In: Informatik Spektrum [20], 199-207 | Journal Article |
Brandenburg, Jünger, Mutzel, Lengauer
(Ed: Jarke, Pasedach, Pohl)
[Brandenburg, Jünger, Lengauer] | 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 |
Brandenburg, Schreiber, Jünger, Marks, Mutzel
(Ed: Kratochvíl)
[Brandenburg, Schreiber, Jünger, Marks, Kratochvil] | 1999 | | Graph Drawing Contest Report
In: Proceedings of the 7th International Symposium on Graph Drawing (GD-99), 400-409 | Proceedings Article |
Braun
[-] | 2000 | | Entwicklung und Test von für statische Graphen optimierte Datentypen
Universität des Saarlandes | Thesis - Masters thesis |
Bredereck, Nichterlein, Niedermeier, Philip
(Ed: Murlak, Sankowski)
[-] | 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 |
Bredereck, Nichterlein, Niedermeier, Philip
(Ed: Owe, Steffen, Telle)
[-] | 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 |
Bremer
[-] | 1995 | | Analyse und Simulation eines Maximum-Flow Algorithmus für das Gitter
Universität des Saarlandes | Thesis - Masters thesis |
Brengel
[-] | 2000 | | Externe Prioritätswarteschlangen
Universität des Saarlandes | Thesis - Masters thesis |
Brengel, Crauser, Meyer, Ferragina
(Ed: Vitter, Zaroliagis)
[Ferragina, Vitter, Zaroliagis] | 1999 | | An Experimental Study of Priority Queues in External Memory
In: Algorithm engineering (WAE-99) : 3rd International Workshop, WAE'99, 345-359 | Proceedings Article |
Breslauer, Jiang, Jiang
[Jiang, Jiang] | 1997 | | Rotations of periodic strings and short superstrings
In: Journal of Algorithms [24], 340-353 | Journal Article |
Breslauer, Ramesh
[?] | 1996 | | Optimal Parallel Construction of Minimal Suffix and Factor Automata
In: Parallel Processing Letters [6], 35-44 | Journal Article |
Brightwell, Panagiotou, Steger
[-] | 2012 | | Extremal subgraphs of random graphs
In: Random Structures & Algorithms [41], 147-178 | Journal Article |
Bringmann
(Ed: Chatterjee, Sgall)
[-] | 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 |
Bringmann
[-] | 2012 | | An improved algorithm for Klee's measure problem on fat boxes
In: Computational Geometry: Theory and Applications [45], 225-233 | Journal Article |
Bringmann, Doerr, Neumann, Sliacan
(Ed: Fomin, Freivalds, Kwiatkowska, Peleg)
[-] | 2013 | | Online Checkpointing with Improved Worst-Case Guarantees
In: Automata, Languages, and Programming - 40th International Colloquium (ICALP 2013), 255-266 | Proceedings Article |
Bringmann, Engels, Manthey, Raghavendra Rao
(Ed: Chatterjee, Sgall)
[-] | 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 |
Bringmann, Friedrich
(Ed: Ehrgott, Fonseca, Gandibleux, Hao, Sevaux)
[-] | 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 |
Bringmann, Friedrich
(Ed: Fomin, Freivalds, Kwiatkowska, Peleg)
[-] | 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 |
Bringmann, Friedrich
(Ed: Hong, Nagamochi, Fukunaga)
[-] | 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 |
Bringmann, Friedrich
(Ed: Jansen, Garibay, Paul, Wu)
[-] | 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 |
Bringmann, Friedrich
(Ed: Krasnogor, Lanzim)
[-] | 2011 | | Convergence of Hypervolume-Based Archiving Algorithms I: Effectiveness
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 745-752 | Proceedings Article |
Bringmann, Friedrich
(Ed: Schaefer, Cotta, Kolodziej, Rudolph)
[-] | 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 |
Bringmann, Friedrich
[-] | 2013 | | Approximation Quality of the Hypervolume Indicator
In: Artificial Intelligence [195], 265–290 | Journal Article |
Bringmann, Friedrich
[-] | 2013 | | Parameterized Average-Case Complexity of the Hypervolume Indicator
In: 15th Annual Conference on Genetic and Evolutionary Computation (GECCO-13), 575-582 | Proceedings Article |
Bringmann, Friedrich
[-] | 2012 | | Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
In: Theoretical Computer Science [425], 104-116 | Journal Article |
Bringmann, Friedrich
[-] | 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 |
Bringmann, Friedrich
[-] | 2010 | | An Efficient Algorithm for Computing Hypervolume Contributions
In: Evolutionary Computation [18], 383-402 | Journal Article |
Bringmann, Friedrich
[-] | 2010 | | Approximating the volume of unions and intersections of high-dimensional geometric objects
In: Computational Geometry [43], 601-610 | Journal Article |
Bringmann, Friedrich
[-] | 2010 | | The Maximum Hypervolume Set Yields Near-optimal Approximation
In: 12th annual conference on Genetic and evolutionary computation (GECCO 2010), 511-518 | Proceedings Article |
Bringmann, Friedrich, Igel, Voß
[-] | 2013 | | Speeding Up Many-Objective Optimization by Monte Carlo Approximations
In: Artificial Intelligence [204], 22–29 | Journal Article |
Bringmann, Friedrich, Neumann, Wagner
(Ed: Walsh)
[-] | 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 |
Bringmann, Green Larsen
[-] | 2013 | | Succinct Sampling from Discrete Distributions
In: 45th ACM Symposium on Theory of Computing (STOC-13), 775-782 | Proceedings Article |
Bringmann, Mehlhorn, Neumann
[-] | 2012 | | Remarks on Category-Based Routing in Social Networks | Unpublished/Draft |
Bringmann, Panagiotou
(Ed: Czumaj, Mehlhorn, Pitts, Wattenhofer)
[-] | 2012 | | Efficient Sampling Methods for Discrete Distributions
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 133-144 | Proceedings Article |
Bringmann, Sauerwald, Stauffer, Sun
[-] | 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 |
Brockenauer
[-] | 1997 | | Separierung von Kuratowski-Ungleichungen für das größte planare Untergraphenproblem
Universität des Saarlandes | Thesis - Masters thesis |
Brockhoff, Friedrich, Hebbinghaus, Klein, Neumann, Zitzler
(Ed: Dirk Thierens)
[-] | 2007 | | Do Additional Objectives Make a Problem Harder?
In: Genetic and Evolutionary Computation Conference 2007, 765-772 | Proceedings Article |
Brockhoff, Friedrich, Hebbinghaus, Klein, Neumann, Zitzler
[-] | 2009 | | On the Effects of Adding Objectives to Plateau Functions
In: IEEE Transactions on Evolutionary Computation [13], 591-603 | Journal Article |
Brockhoff, Friedrich, Neumann
(Ed: Rudolph, Jansen, Lucas, Poloni, Beume)
[-] | 2008 | | Analyzing Hypervolume Indicator Based Algorithms
In: Parallel Problem Solving from Nature (PPSN X), 651-660 | Proceedings Article |
Brodal
(Ed: Reischuk, Morvan)
[-] | 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 |
Brodal
[-] | 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 |
Brodal
[-] | 1996 | | Priority queues on parallel machines
In: 5th Scandinavian Workshop on Algorithm Theory (SWAT96), 416-427 | Proceedings Article |
Brodal, Chaudhuri, Radhakrishnan
(Ed: Karlsson, Lingas)
[Radhakrishnan, Karlsson, Lingas] | 1996 | | The randomized complexity of maintaining the minimum
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 4-15 | Proceedings Article |
Brodal, Chaudhuri, Radhakrishnan
[Radhakrishnan] | 1996 | | The randomized complexity of maintaining the minimum
In: Nordic Journal of Computing [3], 337-351 | Journal Article |
Brodal, Fagerberg, Meyer, Zeh
(Ed: Hagerup, Katajainen)
[-] | 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 |
Brodal, Gasieniec
(Ed: Hirschberg, Myers)
[Brodal, Hirschberg, Myers] | 1996 | | Approximate Dictionary Queries
In: Combinatorial Pattern Matching: 7th Annual Symposium (CPM'96), 65-74 | Proceedings Article |
Brodal, Kaligosi, Katriel, Kutz
(Ed: Moshe, Gabriel)
[-] | 2006 | | Faster Algorithms for Computing Longest Common Increasing Subsequences
In: Combinatorial Pattern Matching, 17th Annual Symposium, CPM 2006, 330-341 | Proceedings Article |
Brodal, Katajainen
(Ed: Arnborg, Ivansson)
[Katajainen, Arnborg, Ivansson] | 1998 | | Worst-Case Efficient External-Memory Priority Queues
In: Proceedings of the 6th Scandinavian Workshop on Algorithm Theory (SWAT-98), 107-118 | Proceedings Article |
Brodal, Pinotti
(Ed: Arnborg, Ivansson)
[Pinotti, Arnborg, Ivansson] | 1998 | | Comparator Networks for Binary Heap Construction
In: Proceedings of the 6th Scandinavian Workshop on Algorithm Theory (SWAT-98), 158-168 | Proceedings Article |
Brodal, Träff, Zaroliagis
(Ed: Feitelson, Rudolph)
[-] | 1997 | | A parallel priority data structure with applications
In: 11th Internatinal Parallel Processing Symposium (IPPS-97), 689-693 | Proceedings Article |
Brodal, Träff, Zaroliagis
[-] | 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 |
Brönnimann, Burnikel, Pion
[Brönnimann, Pion] | 2001 | | Interval arithmetic yields efficient dynamic filters for computational geometry
In: Discrete Applied Mathematics [109], 25-47 | Journal Article |
Brönnimann, Burnikel, Pion
[Brönnimann, Pion] | 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 |
Brönnimann, Kettner, Pocchiola, Snoeyink
(Ed: Demetrescu, Tamassia, Sedgewick)
[-] | 2005 | | Counting and enumerating pointed pseudo-triangulations with the greedy flip algorithm
In: Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics
(ALENEX/ANALCO 2005), 98-110 | Proceedings Article |
Brönnimann, Kettner, Pocchiola, Snoeyink
[-] | 2006 | | Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm
In: SIAM Journal on Computing [36], 721-739 | Journal Article |
Brönnimann, Kettner, Schirra, Veltkamp
(Ed: Jazayeri, Loos, Musser)
[Brönnimann, Kettner, Veltkamp, Jazayeri, Loos, Musser] | 2000 | | Applications of the Generic Programming Paradigm in the Design of CGAL
In: Generic programming - International Seminar on Generic Programming Dagstuhl Castle, Germany, April 27 - May 1, 1998, selected papers, 206-216 | Part of a Book |
Brown, El Kahoui, Novotni, Weber
[-] | 2006 | | Algorithmic methods for investigating equilibria in epidemic modeling
In: Journal of Symbolic Computation [41], 1157-1173 | Journal Article |
Buchberger, Mehlhorn, Näher, Nievergelt (ed.)
(Ed: Buchberger, Mehlhorn, Näher, Nievergelt)
[-] | 1994 | | Special issue on “algorithms: implementation, libraries and use” | Book |
Buchheit
[-] | 1999 | | Oberflächenrekonstruktion mithilfe von Voronoi-Diagrammen
Universität des Saarlandes | Thesis - Masters thesis |
Bundy, Hebbinghaus, Stellmacher
[-] | 2006 | | The Local C(G,T) Theorem
In: Journal of Algebra [300], 741-789 | Journal Article |
Burkhardt
[-] | 2002 | | Filter Algorithms for Approximate String Matching
Universität des Saarlandes | Thesis - PhD thesis |
Burkhardt, Crauser, Ferragina, Lenhof, Rivals, Vingron
(Ed: Istrail, Pevzner, Waterman)
[Ferragina, Rivals, Vingron, Istrail, Pevzner, Waterman] | 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 |
Burkhardt, Kärkkäinen
(Ed: Amir, Landau)
[Amir, Landau] | 2001 | | Better Filtering with Gapped q-Grams
In: Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching, 73-85 | Proceedings Article |
Burkhardt, Kärkkäinen
(Ed: Apostolico, Takeda)
[-] | 2002 | | One-Gapped q-Gram Filters for Levenshtein Distance
In: Combinatorial Pattern Matching : 13th Annual Symposium, CPM 2002, 225-234 | Proceedings Article |
Burkhardt, Kärkkäinen
(Ed: Baeza-Yates, Chávez, Crochemore)
[-] | 2003 | | Fast Lightweight Suffix Array Construction and Checking
In: Combinatorial Pattern Matching: 14th Annual Symposium, CPM 2003, 55-69 | Proceedings Article |
Burkhardt, Kärkkäinen
[-] | 2003 | | Better Filtering with Gapped q-Grams
In: Fundamenta Informaticae [56], 51-70 | Journal Article |
Burnikel
[-] | 1996 | | Exact Computation of Voronoi Diagrams and Line Segment Intersections
Universität des Saarlandes | Thesis - PhD thesis |
Burnikel, Fleischer, Mehlhorn, Schirra
[-] | 2000 | | A strong and easily computable separation bound for arithmetic expressions involving radicals
In: Algorithmica [27], 87-99 | Journal Article |
Burnikel, Fleischer, Mehlhorn, Schirra
[-] | 1999 | | Efficient exact geometric computation made easy
In: Proceedings of the 15th Annual Symposium on Computational Geometry (SCG-99), 341-350 | Proceedings Article |
Burnikel, Funke, Mehlhorn, Schirra, Schmitt
(Ed: Meyer auf der Heide)
[Burnikel, Schirra] | 2001 | | A Separation Bound for Real Algebraic Expressions
In: Proceedings of the 9th Annual European Symposium on Algorithms (ESA-01), 254-265 | Proceedings Article |
Burnikel, Funke, Mehlhorn, Schirra, Schmitt
[-] | 2009 | | A Separation Bound for Real Algebraic Expressions
In: Algorithmica [55], 14-28 | Journal Article |
Burnikel, Funke, Seel
[-] | 2001 | | Exact geometric computation using Cascading
In: International Journal of Computational Geometry & Applications [11], 245-266 | Journal Article |
Burnikel, Funke, Seel
[-] | 1998 | | Exact Geometric Predicates using Cascaded Computation
In: Proceedings of the 14th International Annual ACM Symposium on Computational Geometry (SCG-98), 175-183 | Proceedings Article |
Burnikel, Könemann, Mehlhorn, Näher, Schirra, Uhrig
[Näher] | 1995 | | Exact Geometric Computation in LEDA
In: 11th ACM Symposium on Computational Geometry (SCG95), C18-C19 | Proceedings Article |
Burnikel, Mehlhorn, Schirra
(Ed: van Leeuwen)
[?] | 1994 | | How to Compute the Voronoi Diagram of Line Segments:
Theoretical and Experimental Results
In: Algorithms (ESA-94) : 2nd annual European symposium, 227-239 | Proceedings Article |
Burnikel, Mehlhorn, Schirra
[-] | 1994 | | On degeneracy in geometric computations
In: Discrete algorithms (SODA-94) : 5th annual ACM-SIAM symposium, 16-23 | Proceedings Article |
Busch
[-] | 2011 | | Analysis of the KIT email graph, with an application of randomized rumour spreading protocols
Universität des Saarlandes | Thesis - Bachelor thesis |
Butman, Hermelin, Lewenstein, Rawitz
[-] | 2010 | | Optimization problems in multiple-interval graphs
In: ACM Transactions on Algorithms [6], 40,1-40,18 | Journal Article |
Butz
[-] | 1997 | | Robuste Implementierung eines Algorithmus zur Berechnung eines Voronoi-Diagramms für Polygone
Universitaet des Saarlandes | Thesis - Masters thesis |
Cai, Lu, Xia
[-] | 2013 | | Dichotomy for Holant* Problems with a Function on Domain Size 3
In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 1278-1295 | Proceedings Article |
Calinescu, Fernandes, Finkler, Karloff
[Calinescu, Fernandes, Karloff] | 1998 | | A Better Approximation Algorithm for Finding Planar Subgraphs
In: Journal of Algorithms [27], 269-302 | Journal Article |
Calinescu, Fernandes, Finkler, Karloff
[Calinescu, Fernandes, Karloff] | 1996 | | A better approximation algorithm for finding planar subgraphs
In: 7th ACM-SIAM Symposium on Discrete Algorithms (SODA96), 16-25 | Proceedings Article |
Cameron, Johannsen, Prellberg, Schweitzer
[-] | 2008 | | Counting Defective Parking Functions
In: Electronic Journal of Combinatorics [15], R92 | Electronic Journal Article |
Canzar, El-Kebir, Pool, Elbassioni, Malde, Mark, Geerke, Stougie, Klau
(Ed: Chor)
[-] | 2012 | | Charge Group Partitioning in Biomolecular Simulation
In: Research in Computational Molecular Biology : 16th Annual International Conference, RECOMB 2012, 29-43 | Proceedings Article |
Canzar, Elbassioni, Elmasry, Raman
(Ed: Cheong, Chwa, Park)
[-] | 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 |
Canzar, Elbassioni, Klau, Mestre
(Ed: Aceto, Henzinger, Sgall)
[-] | 2011 | | On Tree-Constrained Matchings and Generalizations
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 98-109 | Proceedings Article |
Canzar, Elbassioni, Klau, Mestre
[-] | 2011 | | On Tree-Constrained Matchings and Generalizations | Unpublished/Draft |
Canzar, Elbassioni, Mestre
[-] | 2010 | | A polynomial delay algorithm for enumerating approximate solutions to the interval coloring problem
In: Workshop on Algorithm Engineering and Experiments 2010 (ALENEX10), 23-33 | Proceedings Article |
Canzar, Remy
[-] | 2006 | | Shape Distributions and Protein Similarity
In: GCB, 1-10 | Proceedings Article |
Caragiannis, Fishkin, Kaklamanis, Papaioannou
(Ed: Kratochvíl, Díaz, Fiala )
[-] | 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 |
Caragiannis, Fishkin, Kaklamanis, Papaioannou
[-] | 2007 | | A tight bound for online colouring of disk graphs
In: Theoretical Computer Science [384], 152-160 | Journal Article |
Caroli
[-] | 2007 | | Evaluation of a Generic Method for Analyzing Controlled-Perturbation Algorithms
Universität des Saarlandes | Thesis - Masters thesis |
Caroli
[-] | 2006 | | Exakte Arrangement-Berechnung gedrehter Quadratischer Kurven
Universität des Saarlandes | Thesis - Bachelor thesis |
Case, Kötzing
(Ed: Hutter, Stephan, Vovk, Zeugmann)
[-] | 2010 | | Solutions to Open Questions for Non-U-Shaped Learning with Memory Limitations
In: Algorithmic Learning Theory : 21st International Conference, ALT 2010, 285-299 | Proceedings Article |
Case, Kötzing
(Ed: Kalai, Mohri)
[-] | 2010 | | Strongly Non-U-Shaped Learning Results by General Techniques
In: COLT 2010 : The 23rd Conference on Learning Theory, 181-193 | Proceedings Article |
Case, Kötzing
(Ed: Schwentick, Dürr)
[-] | 2011 | | Measuring Learning Complexity with Criteria Epitomizers
In: 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011), 320-331 | Electronic Proceedings Article |
Case, Kötzing
[-] | 2013 | | Memory-limited non-U-shaped learning with solved open problems
In: Theoretical Computer Science [473], 100-123 | Electronic Journal Article |
Case, Kötzing
[-] | 2012 | | Computability-theoretic learning complexity
In: Philosophical Transaction of the Royal Society A [370], 3570-3596 | Journal Article |
Case, Kötzing
[-] | 2012 | | Learning secrets interactively. Dynamic modeling in inductive inference
In: Information and Computation [220-221], 60-73 | Journal Article |
Celikik, Bast
(Ed: Karlgren, Tarhio, Hyyrö)
[-] | 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 |
Celikik, Bast
(Ed: Shin)
[-] | 2009 | | Fast Error-Tolerant Search on Very Large Texts
In: The 24th Annual ACM Symposium on Applied Computing, 1724-1731 | Proceedings Article |
Celikik, Bast, Manolache
[-] | 2011 | | Efficient Index-Based Snippet Generation | Unpublished/Draft |
Chandran, Sivadasan
[-] | 2004 | | On the Hadwiger's Conjecture for Graph Products | Report |
Chang
[-] | 2007 | | Multiple pass streaming algorithms for learning mixtures of distributions in $R^d$
In: Algorithmic Learning Theory, 18th International Conference, Proceedings, 16 | Proceedings Article |
Chang, Johnson
[-] | 2008 | | Online and offline selling in limit order markets
In: 4th International Workshop on Internet and Network Economics (WINE 2008), 41-52 | Proceedings Article |
Chang, Kannan
[-] | 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 |
Chan, Dhamdhere, Gupta, Kleinberg, Slivkins
[-] | 2009 | | Metric Embeddings with Relaxed Guarantees
In: SIAM Journal on Computing [38], 2303-2329 | Journal Article |
Chan, Edmonds, Lam, Lee, Marchetti-Spaccamela, Pruhs
(Ed: Albers, Marion)
[-] | 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 |
Chan, Edmonds, Lam, Lee, Marchetti-Spaccamela, Pruhs
[-] | 2011 | | Nonclairvoyant speed scaling for flow and energy
In: Algorithmica [61], 507-517 | Journal Article |
Chan, Edmonds, Pruhs
[-] | 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 |
Chan, Elbassioni
[-] | 2011 | | A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics
In: Discrete & Computational Geometry [46], 704-723 | Journal Article |
Chan, Gupta
[-] | 2009 | | Small Hop-diameter Sparse Spanners for Doubling Metrics
In: Discrete and Computational Geometry [41], 28-44 | Journal Article |
Chan, Lam, Lee
(Ed: de Berg, Meyer)
[-] | 2010 | | Non-clairvoyant speed scaling for weighted flow time
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. I, 23-35 | Proceedings Article |
Chan, Lam, Lee
(Ed: Schwentick, Dürr)
[-] | 2011 | | Scheduling for weighted flow time and energy with rejection penalty
In: 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011), 392-403 | Electronic Proceedings Article |
Chan, Lam, Lee, Ting
(Ed: Marion, Schwentick)
[-] | 2010 | | Continuous monitoring of distributed data streams over a time-based sliding window
In: 27th International Symposium on Theoretical Aspects of Computer Science
STACS 2010, 179-190 | Electronic Proceedings Article |
Chan, Lam, Lee, Ting
[-] | 2012 | | Continuous Monitoring of Distributed Data Streams over a Time-Based Sliding Window
In: Algorithmica [62], 1088-1111 | Journal Article |
Chan, Megow, Sitters, van Stee
[-] | 2012 | | A note on sorting buffers offline
In: Theoretical Computer Science [423], 11-18 | Journal Article |
Chaudhuri
[-] | 1996 | | Sensitive functions and approximate problems
In: Information and Computation [126], 161-168 | Journal Article |
Chaudhuri, Dimopoulos, Zaroliagis
[-] | 1996 | | On the Parallel Complexity of Acyclic Logic Programs
In: Parallel Processing Letters [6], 223-230 | Journal Article |
Chaudhuri, Dubhashi
(Ed: Baeza-Yates, Goles, Poblete)
[Baeza-Yates, Dubhashi, Goles, Poblete] | 1995 | | Probabilistic Recurrence Relations Revisited
In: LATIN'95: Theoretical Informatics, Second Latin American Symposium, 207-219 | Proceedings Article |
Chaudhuri, Dubhashi
[Dubhashi] | 1997 | | Probabilistic recurrence relations revisited
In: Theoretical Computer Science [181], 45-56 | Journal Article |
Chaudhuri, Garg, Ravi
[Ravi] | 1998 | | The $p$-neighbor $k$-center problem
In: Information Processing Letters [65], 131-134 | Journal Article |
Chaudhuri, Hagerup
(Ed: Mayr, Schmidt, Tinhofer)
[Mayr, Schmidt, Tinhofer] | 1995 | | Prefix Graphs and their Applications
In: Graph-theoretic Concepts in Computer Science: 20th International Workshop (WG94), 206-218 | Proceedings Article |
Chaudhuri, Radhakrishnan
[Radhakrishnan] | 1997 | | The Complexity of Parallel Prefix Problems on Small Domains
In: Information and Computation [138], 1-22 | Journal Article |
Chaudhuri, Radhakrishnan
[Radhakrishnan] | 1996 | | Deterministic restrictions in circuit complexity
In: Theory of Computing : 28th Annual ACM Symposium (STOC-28), 30-36 | Proceedings Article |
Chaudhuri, Subrahmanyam, Wagner, Zaroliagis
(Ed: Larsen, Skyum, Winskel)
[Subrahmanyam, Wagner, Larsen, Skyum, Winskel] | 1998 | | Computing Mimicking Networks
In: Proceedings of the 25th International Colloquium on Automata, Languages and Programming (ICALP-98), 556-567 | Proceedings Article |
Chaudhuri, Subrahmanyam, Wagner, Zaroliagis
[Subrahmanyam, Wagner, Zaroliagis] | 2000 | | Computing mimicking networks
In: Algorithmica [26], 31-49 | Journal Article |
Chaudhuri, Zaroliagis
(Ed: Fülöp, Gecseg)
[Fülöp, Gecseg] | 1995 | | Shortest Path Queries in Digraphs of Small Treewidth
In: Automata, Languages, and Programming: 22nd International Colloquium (ICALP95), 244-255 | Proceedings Article |
Chaudhuri, Zaroliagis
(Ed: Spirakis)
[Spirakis] | 1995 | | Optimal Parallel Shortest Paths in Small Treewidth Digraphs
In: Algorithms - ESA'95: 3rd Annual European Symposium, 31-45 | Proceedings Article |
Chaudhuri, Zaroliagis
[-] | 2000 | | Shortest paths in digraphs of small treewidth. Part I, Sequential algorithms
In: Algorithmica [27], 212-226 | Journal Article |
Chaudhuri, Zaroliagis
[-] | 1998 | | Shortest paths in digraphs of small treewidth. Part II: Optimal parallel algorithms
In: Theoretical Computer Science [203], 205-223 | Journal Article |
Cheng, Funke, Golin, Kumar, Poon, Ramos
[-] | 2003 | | Curve Reconstruction from Noisy Samples
In: Proceedings of the 19th Annual Symposium on Computational Geometry (SCG-03), 420-429 | Proceedings Article |
Chen, Das, Smid
[Chen, Das] | 1996 | | Lower bounds for computing geometric spanners and approximate shortest paths
In: 8th Canadian Conference on Computing, 155-160 | Proceedings Article |
Chen, Doerr, Hu, Ma, van Stee, Winzen
(Ed: Goldberg)
[-] | 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 |
Chen, Epstein, Kleiman, van Stee
[-] | 2013 | | Maximizing the minimum load: The cost of selfishness
In: Theoretical Computer Science [482], 9-19 | Journal Article |
Cheriyan, Hagerup
[Cheriyan] | 1995 | | A Randomized Maximum-Flow Algorithm
In: SIAM Journal on Computing [24], 203-226 | Journal Article |
Cheriyan, Hagerup, Mehlhorn
(Ed: Paterson)
[-] | 1990 | | Can A Maximum Flow be Computed in o(nm) Time?
In: Automata, languages and programming (ICALP-90) : 17th international colloquium, 235-248 | Proceedings Article |
Cheriyan, Hagerup, Mehlhorn
[-] | 1990 | | Can a maximum flow be computed in $o(nm)$ time? | Report |
Cheriyan, Hagerup, Mehlhorn
[Cheriyan] | 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, Mehlhorn
[Cheriyan] | 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 |
Cheriyan, Mehlhorn
[Cheriyan] | 1996 | | Algorithms for Dense Graphs and Networks on the Random Access Computer
In: Algorithmica [15], 521-549 | Journal Article |
Chian, Goodrich, Grove, Tamassia, Vengroff, Vitter
[Chian, Goodrich, Tamassia, Vengroff, Vitter] | 1995 | | External-Memory Graph Algorithms
In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95), 139-149 | Proceedings Article |
Ching, Mehlhorn, Smid
[-] | 1990 | | Dynamic deferred data structuring
In: Information Processing Letters [35], 37-40 | Journal Article |
Chin, Guo, Sun
[-] | 2011 | | Minimum Manhattan Network is NP-Complete
In: Discrete & Computational Geometry [45], 701-722 | Journal Article |
Chlebus, Czumaj, Gasieniec, Kowaluk, Plandowski
(Ed: Penczek, Szalas)
[Chlebus, Czumaj, Kowaluk, Penczek, Szalas, Plandowski] | 1996 | | Parallel Alternating-Direction Access Machine
In: Mathematical Foundations of Computer Science 1996: 21st International Symposium (MFCS'96), 255-266 | Proceedings Article |
Chlebus, Czumaj, Sibeyn
(Ed: Lengauer, Griebl, Gorlatch)
[-] | 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 |
Chlebus, Kowalski
(Ed: Chaudhuri, Kutten)
[-] | 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 |
Chlebus, Kowalski
(Ed: Gabow, Fagin)
[-] | 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 |
Chlebus, Kowalski
[-] | 2004 | | Randomization helps to perform independent tasks reliably
In: Random Structures and Algorithms [24], 11-41 | Journal Article |
Chlebus, Kowalski, Shvartsman
[-] | 2004 | | Collective asynchronous reading with polylogarithmic worst-case overhead
In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC-04), 321-330 | Proceedings Article |
Chong
[-] | 1996 | | Finding minimum spanning trees on the EREW PRAM
In: International Computer Symposium, 7-14 | Proceedings Article |
Chong, Lam
[Lam] | 1998 | | Approximating Biconnectivity in Parallel
In: Algorithmica [21], 395-410 | Journal Article |
Chong, Lam
[Lam] | 1996 | | Towards more precise parallel biconnectivity approximation
In: 7th Annual International Symposium on Algorithms and Computation, 223-232 | Proceedings Article |
Chong, Ramos
(Ed: Bilardi, Italiano, Pietracaprina, Pucci)
[Bilardi, Italiano, Pietracaprina, Pucci] | 1998 | | Improved deterministic parallel padded sorting
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 405-416 | Proceedings Article |
Christodoulou
(Ed: Kao)
[-] | 2008 | | Price of Anarchy
In: Encyclopedia of Algorithms, 1-99 | Part of a Book |
Christodoulou, Chung, Ligett, Pyrga, van Stee
(Ed: Bampis, Jansen)
[-] | 2010 | | On the price of stability for undirected network design
In: Approximation and Online Algorithms : 7th International Workshop, WAOA 2009, 86-97 | Proceedings Article |
Christodoulou, Elbassioni, Fouz
(Ed: Saberi)
[-] | 2010 | | Truthful Mechanisms for Exhibitions
In: Internet and Network Economics : 6th International Workshop, WINE 2010, 170-181 | Proceedings Article |
Christodoulou, Gourves, Pascual
(Ed: Lin)
[-] | 2007 | | Scheduling Selfish Tasks: About the Performance of Truthful Algorithms
In: Computing and Combinatorics : 13th Annual International Conference, COCOON 2007, 187-197 | Proceedings Article |
Christodoulou, Koutsoupias
[-] | 2009 | | Mechanism Design for Scheduling
In: Bulletin of European Association for Theoretical Computer Science [97], 40-59 | Journal Article |
Christodoulou, Koutsoupias, Kovács
(Ed: Arge, Cachin, Jurdzi´nski, Tarlecki)
[-] | 2007 | | Mechanism design for fractional scheduling on unrelated machines
In: Automata, Languages and Programming : 34th International Colloquium, ICALP 2007, 40-52 | Proceedings Article |
Christodoulou, Koutsoupias, Kovács
[-] | 2010 | | Mechanism Design for Fractional Scheduling on Unrelated Machines
In: ACM Transactions on Algorithms [6], 38:1-38:18 | Journal Article |
Christodoulou, Koutsoupias, Nanavati
[-] | 2009 | | Coordination Mechanisms
In: Theoretical Computer Science [410], 3327-3336 | Journal Article |
Christodoulou, Koutsoupias, Vidali
(Ed: Halperin, Mehlhorn)
[-] | 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 |
Christodoulou, Koutsoupias, Vidali
[-] | 2009 | | A lower bound for scheduling mechanisms
In: Algorithmica [85], 729-740 | Journal Article |
Christodoulou, Koutsoupias, Vidali
[-] | 2007 | | A lower bound for scheduling mechanisms
In: ACM-SIAM Symposium on Discrete Algorithms (SODA), 1163-1170 | Proceedings Article |
Christodoulou, Kovács
(Ed: Charikar)
[-] | 2010 | | A deterministic truthful PTAS for scheduling related machines
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1005-1016 | Proceedings Article |
Christodoulou, Kovács, Schapira
(Ed: Aceto, Damg{\aa}rd, Goldberg, Halldórsson, Ingólfsdóttir, Walukiewicz)
[-] | 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 |
Christodoulou, Kovacs, van Stee
(Ed: Saberi)
[-] | 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 |
Christodoulou, Kovacs, van Stee
[-] | 2013 | | A truthful constant approximation for maximizing the minimum load on related machines
In: Theoretical Computer Science [489-490], 88-98 | Journal Article |
Christodoulou, Ligett, Pyrga
(Ed: Abramsky, Gavoille, Kirchner, Meyer auf der Heide, Spirakis)
[-] | 2010 | | Contention Resolution under Selfishness
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010. - Pt. II, 430-441 | Proceedings Article |
Christodoulou, Mehlhorn, Pyrga
(Ed: Demetrescu, Halldórsson)
[-] | 2011 | | Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms
In: Algorithms - ESA 2011 : 19th Annual European Symposium, 119-130 | Proceedings Article |
Christof, Jünger, Kececioglu, Mutzel, Reinelt
[Christof, Jünger, Kececioglu, Reinelt] | 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 |
Christof, Jünger, Kececioglu, Mutzel, Reinelt
[Christoph, Jünger, Kececiolgu, Reinelt] | 1997 | | A branch-and-cut approach to physical mapping with end-probes
In: Proceedings of the 1st Annual International Conference on Computational Molecular Biology (RECOMB-97), 84-92 | Proceedings Article |
Chrobak, Dürr, Jawor, Kowalik, Kurowski
[-] | 2006 | | A Note on Scheduling Equal-Length Jobs to Maximize Throughput
In: Journal of Scheduling [9], 71-73 | Journal Article |
Chrobak, Gasieniec, Kowalski
[-] | 2007 | | The wake-up problem in multihop radio networks
In: SIAM Journal on Computing [36], 1453-1471 | Journal Article |
Chrobak, Gasieniec, Kowalski
[-] | 2004 | | The Wake-Up problem in multi-hop radio networks
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 985-993 | Proceedings Article |
Cilleruelo, Hebbinghaus
[-] | 2009 | | Discrepancy in generalized arithmetic progressions
In: European Journal of Combinatorics [30], 1607-1611 | Journal Article |
Clanget
[-] | 1999 | | Plattformunabhängiges Toolkit für Grafische Benutzerschnittstellen (GUI)
Universität des Saarlandes | Thesis - Masters thesis |
Clarkson, Mehlhorn, Seidel
(Ed: Finkel, Jantzen)
[-] | 1992 | | Four Results on Randomized Incremental Constructions
In: Theoretical aspects of computer science (STACS-92) : 9th annual symposium, 463-474 | Proceedings Article |
Clarkson, Mehlhorn, Seidel
[-] | 1993 | | Four Results on Randomized Incremental Constructions
In: Computational Geometry: Theory and Applications [3], 185-212 | Journal Article |
Clementi, Crescenzi, Doerr, Fraigniaud, Isopi, Panconesi, Pasquale, Silvestri
[-] | 2013 | | Rumor Spreading in Random Evolving Graphs
In: Proc. of the 21st European Symposium on Algorithms (ESA 2013), 325-336 | Proceedings Article |
Clementi, Crescenzi, Doerr, Fraigniaud, Pasquale, Silvestri
[-] | 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 |
Cole, Farach-Colton, Hariharan, Przytycka, Thorup
[-] | 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 |
Cole, Hariharan
[Cole] | 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 |
Cole, Hariharan, Paterson, Zwick
[Cole, Paterson, Zwick] | 1995 | | Tighter Lower Bounds on the Exact Complexity of String Matching
In: SIAM Journal on Computing [24], 30-45 | Journal Article |
Cole, Kowalik
[-] | 2008 | | New Linear-Time Algorithms for Edge-Coloring Planar Graphs
In: Algorithmica [50], 351-368 | Journal Article |
Cole, Kowalik, Skrekovski
[-] | 2007 | | A Generalization of Kotzig's Theorem and Its Application
In: SIAM Journal on Discrete Mathematics [21], 93-106 | Journal Article |
Cole, Ost, Schirra
[Cole, Ost] | 2001 | | Edge-Coloring Bipartite Multigraphs in O(E log D) Time
In: Combinatorica [21], 5-12 | Journal Article |
Comes, Ziegelmann
(Ed: Vitter, Zaroliagis)
[Comes, Vitter, Zaroliagis] | 1999 | | An Easy to Use Implementation of Linear Perturbations within CGAL
In: Algorithm engineering (WAE-99) : 3rd International Workshop, WAE'99, 169-182 | Proceedings Article |
Cooley, Fountoulakis, Kühn, Osthus
[-] | 2009 | | Embeddings and Ramsey numbers of sparse k-uniform hypergraphs
In: Combinatorica [29], 263-297 | Journal Article |
Cooley, Fountoulakis, Kühn, Osthus
[-] | 2008 | | 3-Uniform hypergraphs of bounded degree have linear Ramsey numbers
In: Journal of Combinatorial Theory B [98], 484-505 | Journal Article |
Cooper, Doerr, Friedrich, Spencer
[-] | 2010 | | Deterministic Random Walks on Regular Trees
In: Random Structures and Algorithms [37], 353-366 | Journal Article |
Cooper, Doerr, Friedrich, Spencer
[-] | 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 |
Cooper, Doerr, Friedrich, Spencer
[-] | 2007 | | Deterministic Random Walks on Regular Trees
In: Electronic Notes in Discrete Mathematics [29], 509-513 | Journal Article |
Cooper, Doerr, Spencer, Tardos
(Ed: Felsner)
[-] | 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 |
Cooper, Doerr, Spencer, Tardos
(Ed: Raman, Sedgewick, Stallmann)
[-] | 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 |
Cooper, Doerr, Spencer, Tardos
[-] | 2007 | | Deterministic random walks on the integers
In: European Journal of Combinatorics [28], 2072-2090 | Journal Article |
Cooper, Doerr, Spencer, Tardos
[-] | 2006 | | Deterministic Random Walks on the Integers
In: ??? [?], 1-27 | Miscellaneous |
Cooper, Frieze, Mehlhorn, Priebe
(Ed: Rolim)
[Cooper, Frieze] | 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 |
Cooper, Frieze, Mehlhorn, Priebe
[Cooper, Frieze] | 2000 | | Average-Case Complexity of Shortest-Paths Problems in the Vertex-Potential Model
In: Random Structures & Algorithms [16], 33-46 | Journal Article |
Correa, Megow, Raman, Suchan
(Ed: Cafieri, Mucherino, Nannicini, Tarissan, Liberti)
[-] | 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 |
Crauser
[-] | 2001 | | LEDA-SM:External Memory Algorithms and Data Structures in Theory and Practice
Universität des Saarlandes | Thesis - PhD thesis |
Crauser, Ferragina
(Ed: Nesetril)
[Ferragina, Nesetril] | 1999 | | On Constructing Suffix Arrays in External Memory
In: Proceedings of the 7th Annual European Symposium on Algorithms (ESA-99), 224-235 | Proceedings Article |
Crauser, Ferragina
[-] | 2002 | | A theoretical and experimental study on the construction of suffix arrays in external memory
In: Algorithmica [32], 1-35 | Journal Article |
Crauser, Ferragina, Mehlhorn, Meyer, Ramos
(Ed: Abello, Vitter)
[Ferragina, Abello, Scott] | 1999 | | I/O-optimal computation of segment intersections
In: Proceedings of the DIMACS Workshop on External Algorithms and Visualization, 131-138 | Proceedings Article |
Crauser, Ferragina, Mehlhorn, Meyer, Ramos
[-] | 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 |
Crauser, Ferragina, Mehlhorn, Meyer, Ramos
[Ferragina] | 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 |
Crauser, Mehlhorn
(Ed: Vitter, Zaroliagis)
[Vitter, Zaroliagis] | 1999 | | LEDA-SM : Extending LEDA to Secondary Memory
In: Algorithm engineering (WAE-99) : 3rd International Workshop, WAE'99, 228-242 | Proceedings Article |
Crauser, Mehlhorn, Meyer
(Ed: Spaniol)
[-] | 1997 | | Kürzeste-Wege-Berechnung bei sehr großen Datenmengen
In: Promotion tut not: Innovationsmotor "Graduiertenkolleg", 113-132 | Proceedings Article |
Crauser, Mehlhorn, Meyer, Sanders
(Ed: Brim, Gruska, Zlatuska)
[Brim, Gruska, Zlatuska] | 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 |
Crauser, Meyer, Brengel
[Ferragina] | 2001 | | An experimental study of priority queues in external memory
In: Journal of Experimental Algorithmics [5], 24 | Unpublished/Draft |
Crochemore, Galil, Gasieniec, Park, Rytter
[Crochemore, Galil, Park, Rytter] | 1997 | | Constant-time Randomized Parallel String Matching
In: SIAM Journal on Computing [26], 950-960 | Journal Article |
Crochemore, Gasieniec, Hariharan, Muthukrishnan, Rytter
[Crochemore, Hariharan, Muthukrishnan, Rytter] | 1998 | | A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching
In: SIAM Journal on Computing [27], 668-681 | Journal Article |
Crochemore, Gasieniec, Rytter
(Ed: Carpentieri, De Santis, Vaccaro, Storer)
[Crochemore, Rytter] | 1998 | | Constant-space string-matching in sublinear average time
In: Compression and Complexity of SEQUENCES 1997, 230-239 | Proceedings Article |
Croitoru
[-] | 2013 | | Abstract Debates
In: IEEE International Conference on Tools with Artificial Intelligence (ICTAI) - 2013, | Proceedings Article |
Croitoru
[-] | 2012 | | Algorithmic aspects of abstract argumentation frameworks
Universität des Saarlandes | Thesis - Masters thesis |
Croitoru, Kötzing
(Ed: Kersting, Toussaint)
[-] | 2012 | | Deliberative Acceptability of Arguments
In: STAIRS 2012 - Proceedings of the Sixth Starting AI Researchers' Symposium, 71-82 | Proceedings Article |
Croitoru, Kötzing
[-] | 2014 | | A Normal Form for Argumentation Frameworks
In: Theory and Applications of Formal Argumentation (TAFA'13), 32-45 | Proceedings Article |
Csaba
[-] | 2007 | | On the Bollobas-Eidrigde conjecture for bipartite graphs
In: Combinatorics, Probability and Computing [16], 1-31 | Journal Article |
Csaba
[-] | 2003 | | Proof of a conjecture of Bollobas and Eldridge for graphs of maximum degree three
In: Combinatorica [23], 35-72 | Journal Article |
Csaba, Krysta, Karpinski
[-] | 2002 | | Approximability of Dense and Sparse Instances of Minimum 2-Connectivity, TSP and Path Problems
In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-02), 74-83 | Proceedings Article |
Csaba, Lodha
[-] | 2006 | | A randomized on-line algorithm for the k-server problem on the line
In: Random Structures and Algorithms [29], 82-104 | Journal Article |
Csaba, Lodha
[Lodha] | 2001 | | A randomized on-line algorithm for the k-server problem on a line | Report |
Curticapean, Künnemann
(Ed: Bodlaender, Italiano)
[-] | 2013 | | A Quantization Framework for Smoothed Analysis of Euclidean Optimization Problems
In: 21st Annual European Symposium on Algorithms (ESA 2013), 349-360 | Proceedings Article |
Cygan, Dell, Lokshtanov, Marx, Nederlof, Okamoto, Paturi, Saurabh, Wahlström
[-] | 2012 | | On Problems as Hard as CNF-SAT
In: 2012 IEEE 27th Conference on Computational Complexity (CCC 2012), 74-84 | Proceedings Article |
Cygan, Kratsch, Pilipczuk, Pilipczuk, Wahlström
(Ed: Czumaj, Mehlhorn, Pitts, Wattenhofer)
[-] | 2012 | | Clique Cover and Graph Separation: New Incompressibility Results
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 254-265 | Proceedings Article |
Cygan, Philip, Pilipczuk, Pilipczuk, Wojtaszczyk
[-] | 2011 | | Dominating set is fixed parameter tractable in claw-free graphs
In: Theoretical Computer Science [412], 6982-7000 | Journal Article |
Czumaj, Ferragina, Gasieniec, Muthukrishnan, Träff
(Ed: Italiano, Orlando)
[Muthukrishnan] | 1997 | | The Architecture of a Software Library for String Processing
In: Proceedings of the Workshop on Algorithm Engineering (WAE-97), 166-176 | Proceedings Article |
Czumaj, Krysta, Vöcking
[-] | 2002 | | Selfish Traffic Allocation for Server Farms
In: Proceedings of the 34th ACM Symposium on Theory of Computing (STOC-02), 287-296 | Proceedings Article |
Czumaj, Vöcking
[-] | 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 |
Czyzowicz, Kowalski, Markou, Pelc
(Ed: Higashino)
[-] | 2005 | | Searching for a black hole in tree networks
In: Principles of distributed systems : 8th International Conference, OPODIS 2004, 67-80 | Proceedings Article |
Czyzowicz, Kowalski, Markou, Pelc
[-] | 2006 | | Complexity of searching for a black hole | Unpublished/Draft |
Dams, Hoefer, Kesselheim
(Ed: Afek)
[-] | 2013 | | Sleeping Experts in Wireless Networks
In: 27th International Symposium on Distributed Computing (DISC-13), 344-357 | Proceedings Article |
Das, Fleischer, Gasieniec, Gunopulos, Kärkkäinen
(Ed: Apostolico, Hein)
[Das, Karkkainen] | 1997 | | Episode matching
In: Combinatorial pattern matching : 8th annual symposium (CPM-97), 12-27 | Proceedings Article |
Das, Kapoor, Smid
(Ed: Chandru, Vinay)
[Chandru, Das, Kapoor, Vinay] | 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, Smid
(Ed: Chandru, Vinay)
[Das, Kapoor] | 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 |
Datta, Lenhof, Schwarz, Smid
[Datta] | 1995 | | Static and dynamic algorithms for k-point clustering problems
In: Journal of Algorithms [19], 474-503 | Journal Article |
de Berg, Schirra
(Ed: de Berg, Schirra)
[-] | 2002 | | Guest Editors' Foreword
In: Selected papers from the 16th Annual Symposium on Computational Geometry (SoCG-00), 1-2 | Proceedings Article |
de Berg, Schirra (ed.)
(Ed: de Berg, Schirra)
[-] | 2002 | | Selected papers from the 16th Annual Symposium on Computational Geometry (SoCG-00) | Proceedings |
de Berg, van Kreveld, Schirra
[de Berg, van Kreveld] | 1998 | | Topologically correct subdivision simplification using the bandwidth criterion
In: Cartography and Geographic Information Systems [25], 243-257 | Journal Article |
De Simone, Diehl, Jünger, Mutzel, Reinelt, Rinaldi
[De Simone, Diehl, Jünger, Reinelt, Rinaldi] | 1996 | | Exact Ground States of Two-Dimensional +-J Ising Spin Glasses
In: Journal of Statistical Physics [84], 1363-1371 | Journal Article |
De Sterck
[-] | 2012 | | A Nonlinear GMRES Optimization Algorithm for Canonical Tensor Decomposition
In: SIAM Journal on Scientific Computing [34], A1351-A1379 | Journal Article |
De Sterck
[-] | 2012 | | A Self-learning Algebraic Multigrid Method for Extremal Singular Triplets and Eigenpairs
In: SIAM Journal on Scientific Computing [34], A2092-A2117 | Journal Article |
De Sterck
[-] | 2012 | | Steepest Descent Preconditioning for Nonlinear GMRES Optimization | Unpublished/Draft |
De Sterck, Henson, Sanders
[-] | 2011 | | Multilevel Aggregation Methods for Small-World Graphs with Application to Random-Walk Ranking | Unpublished/Draft |
De Sterck, Miller, Sanders, Winlaw
[-] | 2011 | | Recursively accelerated multilevel aggregation for Markov chains
In: SIAM Journal on Scientific Computing [32], 1652-1671 | Journal Article |
Dedorath, Gergov, Hagerup
(Ed: Staples, Eades, Katoh, Moffat)
[Dedorath, Staples, Eades, Katoh, Moffat] | 1995 | | More Efficient Parallel Flow Algorithms
In: Algorithms and Computation: 6th International Symposium (ISAAC95), 234-243 | Proceedings Article |
Dementiev
[-] | 2006 | | Algorithm Engineering for Large Data Sets
Universität des Saarlandes | Thesis - PhD thesis |
Dementiev, Kärkkäinen, Mehnert, Sanders
(Ed: Demetrescu, Sedgewick, Tamassia)
[-] | 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 |
Dementiev, Kettner, Mehnert, Sanders
(Ed: Arge, Italiano, Sedgewick)
[-] | 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 |
Dementiev, Kettner, Sanders
(Ed: Brodal, Leonardi)
[-] | 2005 | | STXXL: Standard Template Library for XXL Data Sets
In: Algorithms - ESA 2005 : 13th Annual European Symposium (ESA 2005), 640-651 | Proceedings Article |
Dementiev, Kettner, Sanders
[-] | 2005 | | STXXL: Standard Template Library for XXL Data Sets | Report |
Dementiev, Sanders
[-] | 2003 | | Asynchronous Parallel Disk Sorting
In: Proceedings of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA-03), 138-148 | Proceedings Article |
Dementiev, Sanders, Schultes, Sibeyn
(Ed: Lévy, Mayr, Mitchell)
[-] | 2004 | | Engineering an External Memory Minimum Spanning Tree Algorithm
In: 3rd IFIP International Conference on Theoretical Computer Science (TSC2004), 195-208 | Proceedings Article |
Deng, Mahajan
[Deng] | 1997 | | The Cost of Derandomization: Computability or Competitiveness
In: SIAM Journal on Computing [26], 786-802 | Journal Article |
Denny
(Ed: Brunet, Fellner)
[-] | 2003 | | Solving geometric optimization problems using graphics hardware
In: EUROGRAPHICS 2003 : the European Association for Computer Graphics 24th Annual Conference, 441-451 | Proceedings Article |
Denny
[-] | 1994 | | Monotones Häufen und Token Distribution auf dem Hypercube
Universität des Saarlandes | Thesis - Masters thesis |
DeSimone, Diehl, Jünger, Mutzel, Reinelt, Rinaldi
[DeSimone, Diehl, Jünger, Reinelt, Rinaldi] | 1995 | | Exact Ground States of Ising Spin Glasses: New Experimental Results With a Branch and Cut Algorithm
In: Journal of Statistical Physics [80], 487-496 | Journal Article |
Dessmark, Fraigniaud, Kowalski, Pelc
[-] | 2006 | | Deterministic rendezvous in graphs | Unpublished/Draft |
Dessmark, Fraigniaud, Kowalski, Pelc
[-] | 2006 | | Deterministic Rendezvous in Graphs
In: Algorithmica [46], 69-96 | Journal Article |
Deussen, Mehlhorn
[-] | 1977 | | Van Wijngaarden Grammars and Space Complexity Class EXSPACE
In: Acta Informatica [8], 193-199 | Journal Article |
Devillers, Golin, Kedem, Schirra
[Devillers, Golin, Kedem] | 1996 | | Queries on Voronoi Diagrams of Moving Points
In: Computational Geometry. Theory and Applications [5], 315-327 | Journal Article |
Dey, Funke, Ramos
[Dey] | 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 |
Dey, Mehlhorn, Ramos
[Dey] | 2000 | | Curve reconstruction: Connecting dots with good reason
In: Computational Geometry [15], 229-244 | Journal Article |
Dey, Mehlhorn, Ramos
[Dey] | 1999 | | Curve reconstruction: Connecting dots with good reason
In: Proceedings of the 15th Annual Symposium on Computational Geometry (SCG-99), 197-206 | Proceedings Article |
Dhiflaoui, Funke, Kwappik, Mehlhorn, Seel, Schömer, Schulte, Weber
[-] | 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 |
Dickert
[-] | 2000 | | Berechnung von Einfach-und Zweifachzusammenhangskomponenten auf einer PRAM
Universität des Saarlandes | Thesis - Masters thesis |
Diedrich, Harren, Jansen, Thöle, Thomas
(Ed: Cai, Cooper, Zhu)
[-] | 2007 | | Approximation Algorithms for 3D Orthogonal Knapsack
In: Theory and Applications of Models of Computation, 34-45 | Proceedings Article |
Diedrich, Harren, Jansen, Thöle, Thomas
[-] | 2008 | | Approximation Algorithms for 3D Orthogonal Knapsack
In: Journal of Science and Technology [23], 749-762 | Journal Article |
Diedrich, Kehden, Neumann
(Ed: Berghammer, Möller, Struth)
[-] | 2008 | | Multi-objective Problems in Terms of Relational Algebra
In: Relations and Kleene Algebra in Computer Science 2008, 84-98 | Proceedings Article |
Diedrich, Neumann
[-] | 2008 | | Using Fast Matrix Multiplication in Bio-Inspired Computation for Complex Optimization Problems
In: IEEE Congress on Evolutionary Computation 2008, 3828-3833 | Proceedings Article |
Diekert, Jez, Plandowski
(Ed: Hirsch, Kuznetsov, Pin, Vereshchagin)
[-] | 2014 | | Finding All Solutions of Equations in Free Groups and Monoids with Involution
In: 9th International Computer Science Symposium in Russia (CSR 2014), 1-15 | Proceedings Article |
Diete
[-] | 1995 | | Berechnung der Kontaktoberfläche eines Moleküls
Universität des Saarlandes | Thesis - Masters thesis |
Dietzfelbinger, Hagerup, Katajainen, Penttonen
[Dietzfelbinger, Katajainen, Penttonen] | 1997 | | A reliable randomized algorithm for the closest-pair problem
In: Journal of Algorithms [25], 19-51 | Journal Article |
Dietzfelbinger, Karlin, Mehlhorn, Meyer Auf Der Heide, Rohnert, Tarjan
[-] | 1994 | | Dynamic Perfect Hashing: Upper and Lower Bounds
In: SIAM Journal on Computing [23], 738-761 | Journal Article |
Dietzfelbinger, Karlin, Mehlhorn, Meyer Auf Der Heide, Rohnert, Tarjan
[-] | 1991 | | Dynamic Perfect Hashing: Upper and Lower Bounds | Report |
Dietzfelbinger, Karlin, Mehlhorn, Meyer auf der Heide, Rohnert, Tarjan
[-] | 1988 | | Dynamic Perfect Hashing: Upper and Lower Bounds
In: 29th Annual Symposium on Foundations of Computer Science (FOCS 1988), 524-531 | Proceedings Article |
Dietzfelbinger, Mehlhorn, Meyer auf der Heide, Rohnert
(Ed: Karlsson, Lingas)
[-] | 1988 | | Upper and Lower Bounds for the Dictionary Problem
In: Algorithm theory (SWAT-88) : 1st Scandinavian workshop, 214-215 | Proceedings Article |
Dietz, Mehlhorn, Raman, Uhrig
[-] | 1993 | | Lower Bounds for Set Intersection queries
In: Discrete algorithms (SODA-93) : 4th annual ACM-SIAM symposium, 194-201 | Proceedings Article |
Dietz, Mehlhorn, Raman, Uhrig
[Dietz, Raman] | 1995 | | Lower bounds for set intersection queries
In: Algorithmica [14], 154-168 | Journal Article |
Diks, Hagerup
[-] | 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 |
Diks, Hagerup
[Diks] | 1998 | | More general parallel tree contraction: Register allocation and broadcasting in a tree
In: Theoretical Computer Science [203], 3-29 | Journal Article |
Ding
[-] | 2003 | | Geometric Rounding without changing the Topology
Universität des Saarlandes | Thesis - Masters thesis |
Dinitz, Garg, Goemans
[Dinitz, Goemans] | 1999 | | On the single-source unsplittable flow problem
In: Combinatorica [19], 17-41 | Journal Article |
Dinitz, Nutov
[Dinitz] | 1999 | | A 3-approximation algorithm for finding optimum 4,5-vertex-connected spanning subgraphs
In: Journal of Algorithms [32], 21-30 | Journal Article |
Djidjev, Pantziou, Zaroliagis
(Ed: Mayr, Puech)
[Djidjev, Mayr, Pantziou, Puech] | 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, Zaroliagis
(Ed: Reichel)
[Djidjev, Pantziou, Reichel] | 1995 | | Fast Algorithms for Maintaining Shortest Paths
In: Fundamentals of Computation Theory: 10th International Conference (FCT95), 191-200 | Proceedings Article |
Djidjev, Pantziou, Zaroliagis
[Djidjev, Pantziou] | 2000 | | Improved algorithms for dynamic shortest paths
In: Algorithmica [28], 367-389 | Journal Article |
Dobkin, Gunopulos
(Ed: Lin, Manocha)
[Dobkin, Lin, Manocha] | 1996 | | Geometric problems in machine learning
In: Applied Computational Geometry: Towards Geometric Engineering (FCRC96 Workshop, WACG96), 121-132 | Proceedings Article |
Dobrindt, Mehlhorn, Yvinec
(Ed: Dehne, Sack, Santoro, Whitesides)
[-] | 1993 | | A Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron
In: Algorithms and data structures (WADS-93) : 3rd workshop, 314-324 | Proceedings Article |
Dobrindt, Mehlhorn, Yvinec
[-] | 1993 | | A Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron | Report |
Doerr
(Ed: Albers, Alt, Näher)
[-] | 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 |
Doerr
(Ed: Diekert, Durand)
[-] | 2005 | | Roundings Respecting Hard Constraints
In: STACS 2005 : 22nd Annual Symposium on Theoretical Aspects of Computer Science (STACS'05), 617-628 | Proceedings Article |
Doerr
(Ed: Durand, Thomas)
[-] | 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 |
Doerr
(Ed: Krasnogor, Lanzi)
[-] | 2011 | | Drift analysis
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 1311-1320 | Proceedings Article |
Doerr
(Ed: Soule, Moore)
[-] | 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 |
Doerr
(Ed: Thomas, Weil)
[-] | 2007 | | Randomly Rounding Rationals with Cardinality Constraints and Derandomizations
In: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, 441-452 | Proceedings Article |
Doerr
[-] | 2013 | | Improved approximation algorithms for the Min-Max Selecting Items problem
In: Information Processing Letters [113], 747-749 | Journal Article |
Doerr
[-] | 2007 | | Lp Linear discrepancy of totally unimodular matrices
In: Linear Algebra and Its Applications [420], 663-666 | Journal Article |
Doerr
[-] | 2007 | | Matrix approximation and Tusnády's problem
In: European Journal of Combinatorics [28], 990-995 | Journal Article |
Doerr
[-] | 2007 | | Partial Colorings of Unimodular Hypergraphs
In: Electronic Notes in Discrete Mathematics [29], 359-363 | Journal Article |
Doerr
[-] | 2007 | | Roundings respecting hard constraints
In: Theory of Computing Systems [40], 467-483 | Journal Article |
Doerr
[-] | 2006 | | Matrix Rounding With Respect to Small Submatrices
In: Random Structures & Algorithms [28], 107-112 | Journal Article |
Doerr
[-] | 2006 | | Non-independent randomized rounding and coloring
In: Discrete Applied Mathematics [154], 650-659 | Journal Article |
Doerr
[-] | 2006 | | Non-independent Randomized Rounding, Linear Discrepancy and an Application to Digital Halftoning
In: Eurocomb '03 [3], 95-99 | Journal Article |
Doerr
[-] | 2005 | | Integral Approximation
Christian-Albrechts-Universität zu Kiel | Thesis - Habilitation thesis |
Doerr
[-] | 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 |
Doerr
[-] | 2004 | | Multi-color discrepancies
In: Oberwolfach Reports [1], 683-685 | Journal Article |
Doerr
[-] | 2001 | | Vector Balancing Games with Aging
In: Electronic Notes in Discrete Mathematics [10], xx-xx | Journal Article |
Doerr, De Rainville
[-] | 2013 | | Constructing Low Star Discrepancy Point Sets with Genetic Algorithms
In: Proc. of Genetic and Evolutionary Computation Conference (GECCO 2013), 789-796 | Proceedings Article |
Doerr, Doerr, Ebel
[-] | 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 |
Doerr, Doerr, Spöhel, Thomas
[-] | 2013 | | Playing Mastermind with Many Colors
In: arXiv [abs/1207.0773], 1-22 | Electronic Journal Article |
Doerr, Eremeev, Horoba, Neumann, Theile
(Ed: Raidl, Rothlauf)
[-] | 2009 | | Evolutionary Algorithms and Dynamic Programming
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 771-777 | Proceedings Article |
Doerr, Eremeev, Neumann, Theile, Thyssen
[-] | 2011 | | Evolutionary algorithms and dynamic programming
In: Theoretical Computer Science [412], 6020-6035 | Journal Article |
Doerr, Fouz
(Ed: Aceto, Henzinger, Sgall)
[-] | 2011 | | Asymptotically Optimal Randomized Rumor Spreading
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 502-513 | Proceedings Article |
Doerr, Fouz
[-] | 2011 | | Asymptotically optimal randomized rumor spreading
In: Electronic Notes in Discrete Mathematics [38], 297-302 | Electronic Journal Article |
Doerr, Fouz
[-] | 2011 | | Quasi-random rumor spreading: Reducing randomness can be costly
In: Information Processing Letters [111], 227-230 | Journal Article |
Doerr, Fouz
[-] | 2010 | | Hereditary Discrepancies in Different Numbers of Colors II
In: SIAM Journal on Discrete Mathematics [24], 1205-1213 | Journal Article |
Doerr, Fouz
[-] | 2009 | | A Time-Randomness Tradeoff for Quasi-Random Rumour Spreading
In: Electronic Notes in Discrete Mathematics [34], 335 - 339 | Journal Article |
Doerr, Fouz
[-] | 2006 | | Hereditary Discrepancies in Different Numbers of Colors II
In: ??? [?], 1-19 | Miscellaneous |
Doerr, Fouz, Friedrich
(Ed: Even, Rawitz)
[-] | 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 |
Doerr, Fouz, Friedrich
(Ed: Fomin, Kaski)
[-] | 2012 | | Asynchronous rumor spreading in preferential attachment graphs
In: Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops, 307-315 | Proceedings Article |
Doerr, Fouz, Friedrich
(Ed: Nešetřil, Győri, Sali)
[-] | 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 |
Doerr, Fouz, Friedrich
[-] | 2012 | | Why Rumors Spread Fast in Social Networks
In: Communications of the ACM [55], 70-75 | Journal Article |
Doerr, Fouz, Friedrich
[-] | 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 |
Doerr, Fouz, Schmidt, Wahlström
(Ed: Rothlauf)
[-] | 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 |
Doerr, Fouz, Witt
(Ed: Krasnogor, Lanzi)
[-] | 2011 | | Sharp bounds by probability-generating functions and variable drift
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 2083-2090 | Proceedings Article |
Doerr, Fouz, Witt
(Ed: Pelikan, Branke)
[-] | 2010 | | Quasirandom Evolutionary Algorithms
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1457-1464 | Proceedings Article |
Doerr, Friedrich
(Ed: Asano)
[-] | 2006 | | Deterministic Random Walks on the Two-Dimensional Grid
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 474-483 | Proceedings Article |
Doerr, Friedrich
[-] | 2009 | | Deterministic Random Walks on the Two-Dimensional Grid
In: Combinatorics, Probability and Computing [18], 123-144 | Journal Article |
Doerr, Friedrich
[-] | 2006 | | Quasirandomness in Graphs
In: Electronic Notes in Discrete Mathematics [25], 61-64 | Journal Article |
Doerr, Friedrich, Klein, Osbild
(Ed: Arge, Freivalds)
[-] | 2006 | | Unbiased Matrix Rounding
In: Algorithm theory - SWAT 2006 : 10th Scandinavian Workshop on Algorithm Theory, 102-112 | Proceedings Article |
Doerr, Friedrich, Klein, Osbild
(Ed: Erlebach, Persiano)
[-] | 2005 | | Rounding of Sequences and Matrices, with Applications
In: Third Workshop on Approximation and Online Algorithms (WAOA 2005), 96-109 | Proceedings Article |
Doerr, Friedrich, Klein, Osbild
[-] | 2007 | | Unbiased Matrix Rounding
In: Electronic Notes in Discrete Mathematics [28], 41-46 | Journal Article |
Doerr, Friedrich, Künnemann, Sauerwald
(Ed: Finocchi, Hershberger)
[-] | 2009 | | Quasirandom Rumor Spreading: An Experimental Analysis
In: 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX), 145-153 | Proceedings Article |
Doerr, Friedrich, Künnemann, Sauerwald
[-] | 2011 | | Quasirandom Rumor Spreading: An Experimental Analysis
In: ACM Journal of Experimental Algorithmics [16], Article No. 3.3 | Journal Article |
Doerr, Friedrich, Sauerwald
(Ed: Albers, Marchetti-Spaccamela, Matias, Nikoletseas, 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 |
Doerr, Friedrich, Sauerwald
[-] | 2009 | | Quasirandom Rumor Spreading on Expanders
In: Electronic Notes in Discrete Mathematics [34], 243 - 247 | Journal Article |
Doerr, Friedrich, Sauerwald
[-] | 2008 | | Quasirandom Rumor Spreading
In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, 773-781 | Proceedings Article |
Doerr, Gnewuch
(Ed: Keller, Heinrich, Niederreiter)
[-] | 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 |
Doerr, Gnewuch
[-] | 2006 | | Construction of low-discrepancy point sets of small size by bracketing covers and dependent randomized rounding | Report |
Doerr, Gnewuch, Hebbinghaus
[-] | 2006 | | Discrepancy of Symmetric Products of Hypergraphs
In: The Electronic Journal of Combinatorics [13], 1-12 | Electronic Journal Article |
Doerr, Gnewuch, Hebbinghaus, Neumann
[-] | 2007 | | A Rigorous View On Neutrality
In: IEEE Congress on Evolutionary Computation 2007, 2591-2597 | Proceedings Article |
Doerr, Gnewuch, Kritzer, Pillichshammer
[-] | 2008 | | Component-by-component construction of low-discrepancy point sets of small size
In: Monte Carlo Methods and Applications [14], 129-149 | Journal Article |
Doerr, Gnewuch, Kritzer, Pillichshammer
[-] | 2008 | | Component-by-component construction of low-discrepancy point sets of small size
In: Monte Carlo Methods Applications [14], 129-150 | Journal Article |
Doerr, Gnewuch, Srivastav
[-] | 2005 | | Bounds and Constructions for the Star-Discrepancy via Delta-Covers
In: Journal of Complexity [21], 691-709 | Journal Article |
Doerr, Gnewuch, Wahlström
(Ed: Chen, Srivastav, Travaglini)
[-] | 2013 | | Calculation of Discrepancy Measures and Applications
In: A Panorama of Discrepancy Theory, 1-55 | Part of a Book |
Doerr, Gnewuch, Wahlström
(Ed: L'Ecuyer, Owen)
[-] | 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 |
Doerr, Gnewuch, Wahlström
[-] | 2010 | | Algorithmic construction of low-discrepancy point sets via dependent randomized rounding
In: Journal of Complexity [26], 490-507 | Journal Article |
Doerr, Goldberg
(Ed: Schaefer, Cotta, Kolodziej, Rudolph)
[-] | 2010 | | Adaptive Drift Analysis
In: Parallel Problem Solving from Nature -- PPSN XI. -- Pt. 1, 32-41 | Proceedings Article |
Doerr, Goldberg
(Ed: Schaefer, Cotta, Kolodziej, Rudolph)
[-] | 2010 | | Drift Analysis with Tail Bounds
In: Parallel Problem Solving from Nature – PPSN XI. - Pt. 1, 174-183 | Proceedings Article |
Doerr, Goldberg
[-] | 2013 | | Adaptive Drift Analysis
In: Algorithmica [65], 224-250 | Journal Article |
Doerr, Goldberg, Minder, Sauerwald, Scheideler
(Ed: Lynch, Shvartsman)
[-] | 2010 | | Brief Announcement: Stabilizing Consensus with the Power of Two Choices
In: Distributed Computing : 24th International Symposium, DISC 2010, 528-530 | Proceedings Article |
Doerr, Goldberg, Minder, Sauerwald, Scheideler
[-] | 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 |
Doerr, Happ
[-] | 2008 | | Directed trees: A Powerful Representation for Sorting and Ordering Problems
In: Proceedings of CEC 2008, 3606-3613 | Proceedings Article |
Doerr, Happ, Klein
(Ed: Ryan, Keijzer)
[-] | 2008 | | Crossover Can Provably be Useful in Evolutionary Computation
In: Genetic and Evolutionary Computation Conference 2008, 539-546 | Proceedings Article |
Doerr, Happ, Klein
[-] | 2012 | | Crossover can provably be useful in evolutionary computation
In: Theoretical Computer Science [425], 17-33 | Journal Article |
Doerr, Happ, Klein
[-] | 2011 | | Tight Analysis of the (1+1)-EA for the Single Source Shortest Path Problem
In: Evolutionary Computation [19], 673-691 | Journal Article |
Doerr, Happ, Klein
[-] | 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 |
Doerr, Hebbinghaus
(Ed: Felsner)
[-] | 2005 | | Discrepancy of Products of Hypergraphs
In: 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 323-328 | Proceedings Article |
Doerr, Hebbinghaus, Neumann
(Ed: Runarsson, Beyer, Burke, Merelo-Guervós, Whitley, Yao)
[-] | 2006 | | Speeding Up Evolutionary Algorithms Through Restricted Mutation Operators
In: Parallel Problem Solving from Nature - PPSN IX, 9th International Conference, 978-987 | Proceedings Article |
Doerr, Hebbinghaus, Neumann
[-] | 2007 | | Speeding up Evolutionary Algorithms Through Asymmetric Mutation Operators
In: Evolutionary Computation [15], 401-410 | Journal Article |
Doerr, Hebbinghaus, Werth
[-] | 2006 | | Improved Bounds and Schemes for the Declustering Problem
In: Theoretical Computer Science [359], 123-132 | Journal Article |
Doerr, Hota, Kötzing
(Ed: Soule, Moore)
[-] | 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 |
Doerr, Huber, Levavi
(Ed: Dong, Du, Ibarra)
[-] | 2009 | | Strong robustness of randomized rumor spreading protocols
In: Algorithms and Computation : 20th International Symposium, ISAAC 2009, 812-821 | Proceedings Article |
Doerr, Huber, Levavi
[-] | 2013 | | Strong robustness of randomized rumor spreading protocols
In: Discrete Applied Mathematics [161], 778-793 | Journal Article |
Doerr, Jansen
[-] | 2011 | | Theory of Evolutionary Computation
In: Algorithmica [59], 299-300 | Journal Article |
Doerr, Jansen, Klein
(Ed: Ryan, Keijzer)
[-] | 2008 | | Comparing local and global mutations on bit-strings.
In: Genetic and Evolutionary Computation Conference 2008, 929-936 | Proceedings Article |
Doerr, Jansen, Sudholt, Winzen, Zarges
(Ed: Schaefer, Cotta, Kolodziej, Rudolph)
[-] | 2010 | | Optimizing Monotone Functions Can Be Difficult
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 42-51 | Proceedings Article |
Doerr, Jansen, Sudholt, Winzen, Zarges
[-] | 2013 | | Mutation rate matters even when optimizing monotonic functions
In: Evolutionary Computation [21], 1-27 | Journal Article |
Doerr, Johannsen
(Ed: Pelikan, Branke)
[-] | 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 |
Doerr, Johannsen
(Ed: Thierens)
[-] | 2007 | | Adjacency List Matchings --- An Ideal Genotype for Cycle Covers
In: Genetic and Evolutionary Computation Conference (GECCO-2007), 1203-1210 | Proceedings Article |
Doerr, Johannsen
[-] | 2007 | | Refined Runtime Analysis of a Basic Ant Colony Optimization Algorithm
In: IEEE Congress on Evolutionary Computation 2007, 501-507 | Proceedings Article |
Doerr, Johannsen, Kötzing, Lehre, Wagner, Winzen
(Ed: Beyer, Langdon)
[-] | 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 |
Doerr, Johannsen, Kötzing, Neumann, Theile
(Ed: Schaefer, Cotta, Kolodziej, Rudolph)
[-] | 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 |
Doerr, Johannsen, Kötzing, Neumann, Theile
[-] | 2013 | | More effective crossover operators for the all-pairs shortest path problem
In: Theoretical Computer Science [471], 12-26 | Journal Article |
Doerr, Johannsen, Schmidt
(Ed: Beyer, Langdon)
[-] | 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 |
Doerr, Johannsen, Tang
(Ed: Günter Rudolph, Thomas Jansen, Simon M. Lucas, Carlo Poloni, Nicola Beume)
[-] | 2008 | | How Single Ant ACO Systems Optimize Pseudo-Boolean Functions
In: Parallel Problem Solving from Nature – PPSN X, 378-388 | Proceedings Article |
Doerr, Johannsen, Winzen
(Ed: Pelikan, Branke)
[-] | 2010 | | Multiplicative Drift Analysis
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1449-1456 | Proceedings Article |
Doerr, Johannsen, Winzen
[-] | 2012 | | Multiplicative Drift Analysis
In: Algorithmica [64], 673-697 | Journal Article |
Doerr, Johannsen, Winzen
[-] | 2012 | | Non-existence of linear universal drift functions
In: Theoretical Computer Science [436], 71-86 | Journal Article |
Doerr, Johannsen, Winzen
[-] | 2010 | | Drift Analysis and Linear Functions Revisited
In: Proceedings of the IEEE Congress on Evolutionary Computation (CEC 2010). - Pt. 3, 1967-1974 | Proceedings Article |
Doerr, Klein
(Ed: Arun-Kumar, Garg)
[-] | 2006 | | Unbiased Rounding of Rational Matrices
In: FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science: 26th International Conference, 200-211 | Proceedings Article |
Doerr, Klein
[-] | 2006 | | Controlled Randomized Rounding
In: Electronic Notes in Discrete Mathematics [25], 39-40 | Electronic Journal Article |
Doerr, Klein, Storch
[-] | 2007 | | Faster Evolutionary Algorithms by Superior Graph Representation
In: First IEEE Symposium on Foundations of Computational Intelligence (FOCI-2007), 245-250 | Proceedings Article |
Doerr, Kodric, Voigt
[-] | 2013 | | Lower bounds for the runtime of a global multi-objective evolutionary algorithm
In: IEEE Congress on Evolutionary Computation, 432-439 | Proceedings Article |
Doerr, Kötzing, Lengler, Winzen
[-] | 2013 | | Black-Box Complexities of Combinatorial Problems
In: Theoretical Computer Science [471], 84-106 | Journal Article |
Doerr, Kötzing, Winzen
(Ed: Krasnogor, Lanzi)
[-] | 2011 | | Too fast unbiased black-box algorithms
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 2043-2050 | Proceedings Article |
Doerr, Künnemann
(Ed: Blum)
[-] | 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 |
Doerr, Künnemann
[-] | 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 |
Doerr, Künnemann, Wahlström
(Ed: Festa)
[-] | 2010 | | Randomized Rounding for Routing and Covering Problems: Experiments and Improvements
In: Experimental Algorithms : 9th International Symposium, SEA 2010, 190-201 | Proceedings Article |
Doerr, Künnemann, Wahlström
(Ed: Müller-Hannemann, Werneck)
[-] | 2011 | | Dependent Randomized Rounding: The Bipartite Case
In: 2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX), 96-106 | Proceedings Article |
Doerr, Lengler, Kötzing, Winzen
(Ed: Krasnogor, Lanzi)
[-] | 2011 | | Black-box complexities of combinatorial problems
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 981-988 | Proceedings Article |
Doerr, Lengler, Steurer
(Ed: Asano)
[-] | 2006 | | The Interval Liar Game
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 318-327 | Proceedings Article |
Doerr, Lorenz
[-] | 2006 | | Error Propagation in Game Trees
In: Mathematical Methods of Operations Research [64], 79-93 | Journal Article |
Doerr, Moran, Moran, Winzen
[-] | 2012 | | Simple and Optimal Fault-Tolerant Rumor Spreading
In: arXiv [abs/1209.6158], 1-18 | Electronic Journal Article |
Doerr, Neumann
[-] | 2010 | | In Memoriam: Ingo Wegener
In: Algorithmica [58], 541-542 | Journal Article |
Doerr, Neumann, Sudholt, Witt
(Ed: Thierens)
[-] | 2007 | | On the Runtime Analysis of the 1-ANT ACO algorithm
In: Genetic and Evolutionary Computation Conference 2007, 33-40 | Proceedings Article |
Doerr, Neumann, Sudholt, Witt
[-] | 2011 | | Runtime analysis of the 1-ANT ant colony optimizer
In: Theoretical Computer Science [412], 1629-1644 | Journal Article |
Doerr, Neumann, Wegener
[-] | 2010 | | Editorial
In: Algorithmica [57], 119-120 | Journal Article |
Doerr, Pohl
(Ed: Soule, Moore)
[-] | 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 |
Doerr, Schmidt, Ramakrishna
[-] | 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 |
Doerr, Spöhel, Thomas, Winzen
[-] | 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 |
Doerr, Spöhel, Thomas, Winzen
[-] | 2012 | | Playing Mastermind with Many Colors
In: Proc. of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2012), | Proceedings Article |
Doerr, Srivastav
[-] | 2001 | | Multi-Color Discrepancies
In: Electronic Notes in Discrete Mathematics [7], xx-xx | Journal Article |
Doerr, Srivastav
[-] | 2001 | | Multi-Color Discrepancy of Arithmetic Progressions
In: Electronic Notes in Discrete Mathematics [8], 27-30 | Journal Article |
Doerr, Sudholt, Witt
[-] | 2013 | | When Do Evolutionary Algorithms Optimize Separable Functions in Parallel?
In: ACM/SIGEVO Foundations of Genetic Algorithms (FOGA 2013), 51-63 | Proceedings Article |
Doerr, Theile
(Ed: Raidl, Rothlauf)
[-] | 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 |
Doerr, Wahlström
(Ed: Finocchi, Hershberger)
[-] | 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 |
Doerr, Winzen
(Ed: Dürr, Wilke)
[-] | 2012 | | Playing Mastermind with Constant-Size Memory
In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 441-452 | Electronic Proceedings Article |
Doerr, Winzen
(Ed: Hao, Legrand, Collet, Monmarché, Lutton, Schoenauer)
[-] | 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 |
Doerr, Winzen
(Ed: Kulikov, Vereshchagin)
[-] | 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 |
Doerr, Winzen
(Ed: Soule, Moore)
[-] | 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 |
Doerr, Winzen
[-] | 2014 | | Ranking-Based Black-Box Complexity
In: Algorithmica [?], ? | Journal Article |
Doerr, Winzen
[-] | 2012 | | Memory-restricted black-box complexity of OneMax
In: Information Processing Letters [112], 32-34 | Journal Article |
Doerr, Winzen
[-] | 2012 | | Playing Mastermind with Constant-Size Memory
In: Theory of Computing Systems [Online First], 1-27 | Electronic Journal Article |
Doerr, Winzen
[-] | 2011 | | Memory-Restricted Black-Box Complexity
In: Electronic Colloquium on Computational Complexity [18], 7 | Electronic Journal Article |
Donato, Laura, Leonardi, Millozzi, Meyer, Sibeyn
[-] | 2006 | | Algorithms and Experiments for the Webgraph
In: Journal of Graph Algorithms and Applications [10], 219-236 | Electronic Journal Article |
Dorchain
[-] | 1996 | | An Implementation of a Convex Hull Algorithm Version 2.0
Universität des Saarlandes | Thesis - Masters thesis |
Duan
[-] | 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 |
Duan, Mehlhorn
[-] | 2012 | | A Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market
In: arXiv [abs/1212.0979v1], 1-8 | Electronic Journal Article |
Dubhashi, Pantziou, Spirakis, Zaroliagis
[Dubhashi, Pantziou, Spirakis] | 1995 | | The Fourth Moment in Luby's Distribution
In: Theoretical Computer Science [148], 133-140 | Journal Article |
Dubhashi, Ranjan
[Dubhashi, Ranjan] | 1998 | | Balls and Bins: A Study in Negative Dependence
In: Random Structures & Algorithms [13], 99-124 | Journal Article |
Dubhashi, Ranjan, Mehlhorn, Thiel
(Ed: Shyamasundar)
[-] | 1993 | | Searching, Sorting and Randomised Algorithms for Central Elements and Ideal Counting in Posets
In: Foundations of software technology and theoretical computer science (FSTTCS-93) : 13th conference, 436-443 | Proceedings Article |
Dumitriu
[-] | 2007 | | Graph-based Conservative Surface Reconstruction
Universität des Saarlandes | Thesis - Masters thesis |
Dumitriu, Funke, Kutz, Milosavljevic
(Ed: Gudmundsson)
[-] | 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 |
Dumitriu, Funke, Kutz, Milosavljevic
(Ed: Petitjean)
[-] | 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 |
Dumitriu, Funke, Kutz, Milosavljevic
[-] | 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 |
Dumitriu, Funke, Kutz, Milosavljevic
[-] | 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 |
Duncan, Goodrich, Ramos
[Duncan, Goodrich] | 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 |
Dupont, Hemmer, Petitjean, Schömer
(Ed: Arge, Hoffmann, Welzl)
[-] | 2007 | | Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics
In: 15th Annual European Symposium on Algorithms, 633-644 | Proceedings Article |
Durrett, Neumann, O'Reilly
(Ed: Beyer, Langdon)
[-] | 2011 | | Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics
In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, 69-80 | Proceedings Article |
Eades, Marks, Mutzel, North
(Ed: Whitesides)
[Eades, Marks, North, Whitesides] | 1998 | | Graph Drawing Contest Report
In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 423-435 | Proceedings Article |
Eades, Mutzel
(Ed: Atallah)
[Eades, Atallah] | 1998 | | Graph Drawing Algorithms
In: Algorithms and Theory of Computation Handbook, 9-26 | Part of a Book |
Ebert
[-] | 2005 | | Benchmark Data Sets for Conic Arrangements
Universität des Saarlandes | Thesis - Bachelor thesis |
Edelkamp, Meyer
(Ed: Baader, Brewka, Eiter)
[Edelkamp, Baader, Brewka, Eiter] | 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, Ramos
[Edelsbrunner] | 1997 | | Inclusion-exclusion complexes for pseudo-disk collections
In: Discrete and Computational Geometry [17], 287-306 | Journal Article |
Eigensatz, Giesen, Manjunath
(Ed: Morin)
[-] | 2008 | | The Solution Path of the Slab Support Vector Machine
In: The 20th Canadian Conference on Computational Geometry, 211-214 | Proceedings Article |
Eigenwillig
[-] | 2008 | | Real Root Isolation for Exact and Approximate Polynomials Using Descartes' Rule of Signs
Universität des Saarlandes | Thesis - PhD thesis |
Eigenwillig
[-] | 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 |
Eigenwillig
[-] | 2003 | | Exact Arrangement Computation for Cubic Curves
Universität des Saarlandes | Thesis - Masters thesis |
Eigenwillig, Kerber
[-] | 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 |
Eigenwillig, Kerber, Wolpert
(Ed: Brown)
[-] | 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 |
Eigenwillig, Kettner, Krandick, Mehlhorn, Schmitt, Wolpert
(Ed: Ganzha, Mayr, Vorozhtsov)
[-] | 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 |
Eigenwillig, Kettner, Schömer, Wolpert
[-] | 2006 | | Exact, Efficient and Complete Arrangement Computation for Cubic Curves
In: Computational Geometry [35], 36-73 | Journal Article |
Eigenwillig, Kettner, Schömer, Wolpert
[-] | 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 |
Eigenwillig, Kettner, Wolpert
[-] | 2007 | | Snap Rounding of Bézier Curves | Report |
Eigenwillig, Kettner, Wolpert
[-] | 2007 | | Snap rounding of Bézier curves
In: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07), 158-167 | Proceedings Article |
Eigenwillig, Schömer, Wolpert
[Schömer] | 2002 | | Sweeping Arrangements of Cubic Segments Exactly and Efficiently | Report |
Eigenwillig, Sharma, Yap
(Ed: Dumas)
[-] | 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 |
Eiglsperger, Fekete, Klau
(Ed: Kaufmann, Wagner)
[Eiglsperger, Fekete, Kaufmann, Wagner] | 2001 | | Orthogonal Graph Drawing
In: Drawing Graphs: Methods and Models, 121-171 | Part of a Book |
Eisenbarth, Ziviani, Gonnet, Mehlhorn, Wood
[-] | 1982 | | The Theory of Fringe Analysis and Its Application to 2-3 Trees and B-Trees
In: Information and Control [55], 125-174 | Journal Article |
Eisenbrand, Funke, Garg, Könemann
[Garg, Könemann] | 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 |
Eisenbrand, Funke, Karrenbauer, Matijevic
[-] | 2008 | | Energy-Aware Stage Illumination
In: International Journal of Computational Geometry and Applications [18], 107-129 | Journal Article |
Eisenbrand, Funke, Karrenbauer, Matijevic
[-] | 2005 | | Energy-Aware Stage Illumination
In: Proceedings of the 21st Annual Symposium on Computational Geometry : (SCG05), 336-346 | Proceedings Article |
Eisenbrand, Funke, Karrenbauer, Reichel, Schömer
(Ed: Spencer)
[-] | 2005 | | Packing a Trunk - now with a Twist!
In: Proceedings SPM 2005 ACM Symposium on Solid and Physical Modeling, 197-206 | Proceedings Article |
Eisenbrand, Funke, Karrenbauer, Reichel, Schömer
[-] | 2007 | | Packing a truck - Now with a twist!
In: International Journal of Computational Geometry & Applications [17], 505-527 | Journal Article |
Eisenbrand, Funke, Reichel, Schömer
(Ed: Di Battista, Zwick)
[-] | 2003 | | Packing a Trunk
In: Algorithms - ESA 2003: 11th Annual European Symposium, 618-629 | Proceedings Article |
Eisenbrand, Karrenbauer, Skutella, Xu
(Ed: Azar, Erlebach)
[-] | 2006 | | Multiline Addressing by Network Flow
In: Algorithms - ESA 2006 : 14th Annual European Symposium, 744-755 | Proceedings Article |
Eisenbrand, Karrenbauer, Skutella, Xu
[-] | 2009 | | Multiline Addressing by Network Flow
In: Algorithmica [53], 583-596 | Journal Article |
Eisenbrand, Karrenbauer, Xu
(Ed: Camil Demetrescu)
[-] | 2007 | | Algorithms for longer OLED Lifetime
In: WEA 2007, 338-351 | Proceedings Article |
El Kahoui
(Ed: Gutierrez)
[-] | 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 |
El Kahoui
[-] | 2008 | | Computing with algebraic curves in generic position | Miscellaneous |
El Kahoui
[-] | 2008 | | Polynomial parametrization of nonsingular algebraic curves | Miscellaneous |
El Kahoui
[-] | 2005 | | Birational properties of the gap subresultant varieties
In: Journal of Symbolic Computation [39], 61-71 | Journal Article |
El Kahoui
[-] | 2005 | | UFDs with commuting linearly independent locally nilpotent derivations
In: Journal of Algebra [289], 446-452 | Journal Article |
El Kahoui
[-] | 2005 | | $D$-resultant and subresultants
In: Proceedings of the Amercian Mathematical Society [133], 2193-2199 | Journal Article |
El Kahoui
[-] | 2004 | | Contants of derivations in polynomial rings over unique factorization domains
In: Proceedings of the Amercian Mathematical Society [132], 2537-2541 | Journal Article |
El Kahoui
[-] | 2004 | | Subresultants and locally nilpotent derivations
In: Linear Algebra and its Applications [380], 253-261 | Journal Article |
El Kahoui
[-] | 2003 | | An elementary approach to subresultants theory
In: Journal of Symbolic Computation [35], 281-292 | Journal Article |
El Kahoui
[-] | 2002 | | On plane polynomial vector fields and the Poincar\'e problem
In: Electronic Journal of Differential Equations [2002], 1-23 | Journal Article |
El Kahoui
[-] | 2001 | | Improved algorithms for linear complementarity problems arising from collision response
In: Mathematics and Computers in Simulation [56], 69-93 | Journal Article |
El Kahoui
[-] | 2000 | | Deciding Hopf bifurcations by quantifier elimination in a software-component architecture
In: Journal of Symbolic Computation [30], 161-179 | Journal Article |
El Kahoui
[-] | 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 |
El Kahoui, Rakrak
[-] | 2007 | | Structure of Groebner bases with respect to block orders
In: Mathematics of Computation [76], 2181-2187 | Journal Article |
Elbassioni
(Ed: Alt, Ferreira)
[-] | 2002 | | On Dualization in Products of Forests.
In: STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, 142-153 | Proceedings Article |
Elbassioni
(Ed: Azar, Erlebach)
[-] | 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 |
Elbassioni
(Ed: Correa, Hevia, Kiwi)
[-] | 2006 | | Finding All Minimal Infrequent Multi-dimensional Intervals
In: LATIN 2006: Theoretical Informatics, 7th Latin American Symposium, 423-434 | Proceedings Article |
Elbassioni
(Ed: Czumaj, Mehlhorn, Pitts, Wattenhofer)
[-] | 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 |
Elbassioni
[-] | 2009 | | Algorithms for Dualization over Products of Partially Ordered Sets
In: SIAM Journal on Discrete Mathematics [23], 487-510 | Journal Article |
Elbassioni
[-] | 2008 | | A note on systems with max-min and max-product constraints
In: Fuzzy Sets and Systems [159], 2272-2277 | Journal Article |
Elbassioni
[-] | 2008 | | On the complexity of monotone dualization and generating minimal hypergraph transversals
In: Discrete Applied Mathematics [156], 2109-2123 | Journal Article |
Elbassioni
[-] | 2006 | | Multiconsistency and Robustness with Global Constraints
In: Constraints [11], 335-352 | Journal Article |
Elbassioni
[-] | 2006 | | On the Complexity of Monotone Boolean Duality Testing | Report |
Elbassioni
[-] | 2002 | | An Algorithm for Dualization in Products of Lattices and Its Applications
In: Algorithms - ESA 2002, 10th Annual European Symposium, 424-435 | Proceedings Article |
Elbassioni, Chalermsook, Nanongkai, Sun
[-] | 2013 | | Multi-Attribute Profit-Maximizing Pricing | Unpublished/Draft |
Elbassioni, Chan
(Ed: Charikar)
[-] | 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 |
Elbassioni, Elmasry, Kamel
[-] | 2008 | | Indexing Schemes for Multi-dimensional Moving Objects
In: Encyclopedia of GIS, 523-529 | Part of a Book |
Elbassioni, Elmasry, Kamel
[-] | 2005 | | An Indexing Method for Answering Queries on Moving Objects
In: Distributed and Parallel Databases [17], 215-249 | Journal Article |
Elbassioni, Elmasry, Kamel
[-] | 2003 | | An Efficient Indexing Scheme for Multi-dimensional Moving Objects
In: Database Theory - ICDT 2003, 9th International Conference, 425-439 | Proceedings Article |
Elbassioni, Elmasry, Makino
[-] | 2011 | | Finding Simplices containing the Origin in Two and Three Dimensions
In: International Journal of Computational Geometry & Applications [21], 495-506 | Journal Article |
Elbassioni, Fishkin, Mustafa, Sitters
(Ed: Caires, Italiano, Monteiro, Palamidessi, Yung)
[-] | 2005 | | Approximation algorithms for Euclidean Group TSP
In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, 1115-1126 | Proceedings Article |
Elbassioni, Fishkin, Sitters
(Ed: Asano)
[-] | 2006 | | On Approximating the TSP with Intersecting Neighborhoods
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 213-222 | Proceedings Article |
Elbassioni, Fishkin, Sitters
[-] | 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 |
Elbassioni, Fouad, Bertino
[-] | 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 |
Elbassioni, Fouz, Swamy
(Ed: Saberi)
[-] | 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 |
Elbassioni, Garg, Gupta, Kumar, Narula, Pal
(Ed: D'Souza, Kavitha, Radhakrishnan)
[-] | 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 |
Elbassioni, Hagen, Rauf
[-] | 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 |
Elbassioni, Jeli´c, Matijevi`c
[-] | 2012 | | The relation of Connected Set Cover and Group Steiner Tree
In: Theoretical Computer Science [438], 96-101 | Journal Article |
Elbassioni, Katriel
(Ed: Barták, Milano)
[-] | 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 |
Elbassioni, Katriel, Kutz, Mahajan
(Ed: Deng, Du)
[-] | 2005 | | Simultaneous Matchings
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 106-115 | Proceedings Article |
Elbassioni, Krohn, Matijevic, Mestre, Severdija
(Ed: Albers, Marion)
[-] | 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 |
Elbassioni, Krohn, Matijevic, Mestre, Severdija
[-] | 2011 | | Improved Approximations for Guarding 1.5-Dimensional Terrains
In: Algorithmica [60], 451-463 | Journal Article |
Elbassioni, Krohn, Matijevic, Mestre, Severdija
[-] | 2009 | | Improved Approximations for Guarding 1.5-Dimensional Terrains
In: Algorithmica [Online First], 1-13 | Electronic Journal Article |
Elbassioni, Lotker, Seidel
[-] | 2006 | | Upper bound on the number of vertices of polyhedra with 0, 1-constraint matrices
In: Information Processing Letters [100], 69 - 71 | Journal Article |
Elbassioni, Makino, Mehlhorn, Ramezani
(Ed: Du, Zhang)
[-] | 2013 | | On Randomized Fictitious Play for Approximating Saddle Points over Convex Sets
In: 19th Annual International Computing and Combinatorics Conference (COCOON-13), 65-76 | Proceedings Article |
Elbassioni, Makino, Rauf
(Ed: Fiat, Sanders)
[-] | 2009 | | Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs
In: Algorithms - ESA 2009 : 17th Annual European Symposium, 143-154 | Proceedings Article |
Elbassioni, Makino, Rauf
(Ed: Ngo)
[-] | 2009 | | On the Readability of Monotone Boolean Formulae
In: Computing and Combinatorics :15th Annual International Conference, COCOON 2009, 496-505 | Proceedings Article |
Elbassioni, Makino, Rauf
[-] | 2011 | | On the readability of monotone Boolean formulae
In: Journal of Combinatorial Optimization [22], 293-304 | Journal Article |
Elbassioni, Matijevic, Severdija
(Ed: Vahrenhold)
[-] | 2010 | | Guarding 1.5-Dimensional with Demands
In: 26th European Workshop on Computational Geometry (EuroCG 2010), 133-136 | Proceedings Article |
Elbassioni, Matijevic, Severdija
[-] | 2012 | | Guarding 1.5D terrains with demands
In: International Journal of Computer Mathematics [89], 2143-2151 | Journal Article |
Elbassioni, Mustafa
(Ed: Durand, Thomas)
[-] | 2006 | | Conflict-Free Colorings of Rectangle Ranges
In: STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, 254-263 | Proceedings Article |
Elbassioni, Mustafa
[-] | 2005 | | Conflict-Free Colorings of Rectangle Ranges for Wireless Networks | Unpublished/Draft |
Elbassioni, Paluch, van Zuylen
(Ed: Dürr, Wilke)
[-] | 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 |
Elbassioni, Raman, Ray, Sitters
(Ed: Matthieu)
[-] | 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 |
Elbassioni, Raman, Ray, Sitters
(Ed: Mavronicolas, Papadopoulou)
[-] | 2009 | | On Profit-Maximizing Pricing for the Highway and Tollbooth Problems
In: Algorithmic Game Theory : Second International Symposium, SAGT 2009, 275-286
In: ArXiv.org [5814], 275-286 | Proceedings Article |
Elbassioni, Raman, Ray, Sitters
[-] | 2012 | | On the complexity of the highway problem
In: Theoretical Computer Science [460], 70-77 | Journal Article |
Elbassioni, Rauf
[-] | 2010 | | Polynomial-time dualization of r-exact hypergraphs with applications in geometry
In: Discrete Mathematics [310], 2356-2363 | Journal Article |
Elbassioni, Rauf
[-] | 2010 | | Polynomial-time Dualization of $r$-Exact Hypergraphs with Applications in Geometry | Unpublished/Draft |
Elbassioni, Rauf, Ray
(Ed: Collette)
[-] | 2011 | | Enumerating Minimal Transversals of Geometric Hypergraphs
In: 23rd Canadian Conference on Computational Geometry (CCCG 2011), 437-442 | Electronic Proceedings Article |
Elbassioni, Rauf, Ray
[-] | ?? | | On Enumerating Minimal Transversals of Geometric Hypergraphs | Unpublished/Draft |
Elbassioni, Sitters, Zhang
(Ed: Arge, Hoffmann, Welzl)
[-] | 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 |
Elbassioni, Sitters, Zhang
[-] | 2007 | | A Quasi-PTAS for Envy-free Pricing on Line Graphs | Unpublished/Draft |
Elbassioni, Tiwary
[-] | 2012 | | Complexity of Approximating the Vertex Centroid of a Polyhedron
In: Theoretical Computer Science [421], 56-61 | Journal Article |
Elbassioni, Tiwary
[-] | 2011 | | On a cone covering problem
In: Computational Geometry [44], 129-134 | Journal Article |
Elbassioni, Tiwary
[-] | 2009 | | Complexity of Approximating the Vertex Centroid of a Polyhedron
In: Algorithms and Computation, 20th International Symposium (ISAAC), 413-422 | Proceedings Article |
Elbassioni, Tiwary
[-] | 2008 | | On a Cone Covering Problem
In: Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 171-174 | Proceedings Article |
Elbassioni, Tiwary
[-] | 2008 | | On Computing the Vertex Centroid of a Polyhedron
In: CoRR [abs/0806.3456], x-x | Journal Article |
Elmasry
(Ed: Elmasry)
[-] | 2008 | | Violation Heaps: A Better Substitute for Fibonacci Heaps | Report |
Elmasry
(Ed: Matthieu)
[-] | 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 |
Elmasry
[-] | 2010 | | Pairing heaps, scrambled pairing and square-root trees
In: International Journal of Computer Mathematics [87], 3096-3110 | Journal Article |
Elmasry
[-] | 2010 | | The longest almost-increasing subsequence
In: Information Processing Letters [110], 655-658 | Journal Article |
Elmasry
[-] | 2009 | | Computing the subset partial order for dense families of sets
In: Information Processing Letters [109], 1082-1086 | Journal Article |
Elmasry, Elbassioni
[-] | 2005 | | Output-Sensitive Algorithms for Enumerating and Counting Simplices Containing a Given Point in th Plane
In: 17th Canadian Conference on Computational Geometry (CCCG'05), 248-251 | Electronic Proceedings Article |
Elmasry, Hammad
[-] | 2008 | | Inversion-Sensitive Sorting Algorithms in Practice
In: ACM Journal of Experimental Algorithmics [13], 1-18 | Journal Article |
Elmasry, Jensen, Katajainen
(Ed: Boldi, Gargano)
[-] | 2010 | | The Magic of a Number System
In: Fun with Algorithms : 5th International Conference, FUN 2010, 156-165 | Proceedings Article |
Elmasry, Jensen, Katajainen
(Ed: Kaplan)
[-] | 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 |
Elmasry, Jensen, Katajainen
[-] | 2008 | | Multipartite Priority Queues
In: ACM Transactions on Algorithms [5], 1-19 | Journal Article |
Elmasry, Jensen, Katajainen
[-] | 2008 | | Two New Methods for Constructing Double-Ended Priority Queues from Priority Queues
In: Computing [83], 193-204 | Journal Article |
Elmasry, Manjunath
(Ed: Asano)
[-] | 2009 | | Enumerating Trichromatic Triangles Containing the Origin in Linear Time
In: Japanese Conference in Computational Geometry and Graphs 2009, 101-103 | Proceedings Article |
Elmasry, Mehlhorn, Schmidt
[-] | 2013 | | Every DFS tree of a 3-connected graph contains a contractible edge
In: Journal of Graph Theory [72], 112-121 | Journal Article |
Elmasry, Mehlhorn, Schmidt
[-] | 2012 | | An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs
In: Algorithmica [62], 754-766 | Journal Article |
Elmasry, Mehlhorn, Schmidt
[-] | 2010 | | An $O(m+n)$ Certifying Triconnectivity Algorithm for Hamiltonian Graphs
In: Algorithmica [Online First], 1-13 | Electronic Journal Article |
Elsaesser, Sauerwald
[-] | 2011 | | Tight bounds for the cover time of multiple random walks
In: Theoretical Computer Science [412], 2623-2641 | Journal Article |
Emeliyanenko
(Ed: Dou, Gruber, Joller)
[-] | 2009 | | Efficient Multiplication of Polynomials on Graphics Hardware
In: Advanced Parallel Processing Technologies : 8th International Symposium, APPT 2009, 134-149 | Proceedings Article |
Emeliyanenko
(Ed: Hsu, Yang, Park, Yeo)
[-] | 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 |
Emeliyanenko
(Ed: Moreno Maza, Roch)
[-] | 2010 | | A complete modular resultant algorithm targeted for realization on graphics hardware
In: PASCO '10 : Proceedings of the 4th International Workshop on Parallel and Symbolic Computation, 35-43 | Proceedings Article |
Emeliyanenko
(Ed: Smari, McIntire)
[-] | 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 |
Emeliyanenko
[-] | 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 |
Emeliyanenko
[-] | 2012 | | Harnessing the Power of GPUs for Problems in Real Algebraic Geometry
Universität des Saarlandes | Thesis - PhD thesis |
Emeliyanenko
[-] | 2010 | | Accelerating Symbolic Computations on NVIDIA Fermi
In: Poster presentation at GTC'10 (NVIDIA research summit), - | Poster |
Emeliyanenko
[-] | 2007 | | Visualization of Points and Segments of Real Algebraic Plane Curves
Universität des Saarlandes | Thesis - Masters thesis |
Emeliyanenko, Berberich, Sagraloff
(Ed: Bebis, Boyle, Parvin, Koracin, Kuno, Wang, Pajarola, Lindstrom, Hinkenjann, Encarnação, Silva, Coming)
[-] | 2009 | | Visualizing Arcs of Implicit Algebraic Curves, Exactly and Fast
In: Advances in Visual Computing : 5th International Symposium, ISVC 2009, 608-619 | Proceedings Article |
Emeliyanenko, Kerber
(Ed: Teillaud, Welzl)
[-] | 2008 | | Visualizing and Exploring Planar Algebraic Arrangements -- a Web Application
In: Proceedings of the 24th ACM Symposium on Computational Geometry, 224-225 | Proceedings Article |
Emeliyanenko, Kerber
[-] | 2008 | | An implementation of the 2D Algebraic Kernel | Report |
Emeliyanenko, Kerber
[-] | 2008 | | Visualizing and Exploring Planar Algebraic Arrangements - a Web Application | Report |
Emeliyanenko, Sagraloff
(Ed: van der Hoeven, van Hoeij)
[-] | 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 |
Emiris, Hemmer, Karavelas, Limbach, Mourrain, Tsigaridas, Zafeirakopoulos
[-] | 2008 | | Cross-benchmarks of univariate algebraic kernels | Report |
Emiris, Hemmer, Karavelas, Mourrain, Tsigaridas, Zafeirakopoulos
[-] | 2008 | | Experimental evaluation and cross-benchmarking of univariate real solvers | Report |
Emiris, Hemmer, Tsigaridas, Tzoumas
[-] | 2008 | | Voronoi diagram of ellipses: CGAL-based implementation | Report |
Emminghaus
[-] | 1995 | | Effiziente Sortieralgorithmen für den d-dimensionalen Hypercube
Universität des Saarlandes | Thesis - Masters thesis |
Epstein, Imreh, van Stee
(Ed: Diks, Rytter)
[-] | 2002 | | More on weighted servers or FIFO is better than LRU
In: Mathematical Foundations of Computer Science 2002 : 27th International Symposium, MFCS 2002, 257-268 | Proceedings Article |
Epstein, Jez, Sgall, van Stee
(Ed: Gupta, Jansen, Rolim, Servedio)
[-] | 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 |
