| # |  | Year | | Title | Type | |
|---|
| 1 |
![Hide details for Abed, Huang [Huang, Epstein, Ferragina]](/intranet/ag1/ag1publ.nsf/$PlusMinus?OpenImageResource&ImgIndex=1) | Abed, Huang [Huang, Epstein, Ferragina] |
| |
| | 2012 | | Preemptive Coordination Mechanisms for Unrelated Machines
In: Algorithms - ESA 2012 : 20th Annual European Symposium, 12-23 | Proceedings Article | |
| 1 |
| Abo-Hasna [-] |
| |
| | 1994 | | Verdrahtung von Kanälen mit Seitenanschlüssen
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Abraham, Cechlárová, Manlove, Mehlhorn [Abraham, Cechlárová, Manlove, Deng, Du] |
| |
| | 2005 | | Pareto Optimality in House Allocation Problems
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 1163-1175 | Proceedings Article | |
| 1 |
| Abraham, Cechlárová, Manlove, Mehlhorn [Cechlárová, Manlove, Fleischer, Trippen] |
| |
| | 2004 |  | Pareto-optimality in house allocation problems
In: Algorithms and Computation: 15th International Symposium, ISAAC 2004, 3-15 | Proceedings Article | |
| 1 |
| Abraham, Irving, Kavitha, Mehlhorn [Abraham, Irving, Kavitha] |
| |
| | 2007 | | Popular Matchings
In: SIAM Journal on Computing [37], 1030-1045 | Journal Article | |
| 1 |
| Abraham, Irving, Mehlhorn, Telikepalli [Irving] |
| |
| | 2005 | | Popular Matchings
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 424-432 | Proceedings Article | |
| 1 |
| 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 | |
| 1 |
| Adler, Räcke, Sivadasan, Sohler, Vöcking [Adler, Räcke, Sohler, 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 | |
| 1 |
| Adler, Räcke, Sivadasan, Sohler, Vöcking [Adler, Räcke, Sohler] |
| |
| | 2003 | | Randomized Pursuit-Evasion in Graphs
In: Combinatorics, Probability and Computing [12], 225-244 | Journal Article | |
| 1 |
| Afshani, Agrawal, Doerr, Doerr, Larsen, Mehlhorn [Afshani, Agrawal, Larsen, 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 | |
| 1 |
| Afshani, Agrawal, Doerr, Green Larsen, Mehlhorn, Winzen [Afshani, Agrawal, Green Larsen] |
| |
| | 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 | |
| 1 |
| Agarwal, Agarwal, Chopra, Feldmann, Kammenhuber, Krysta, Vöcking [Agarwal, Agarwal, Chopra, Feldmann, Kammenhuber, Vöcking, 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 | |
| 1 |
| 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 | |
| 1 |
| Agarwal, Hagerup, Ray, Sharir, Smid, Welzl [Agarwal, Hagerup, Sharir, Smid, Welzl, Möhring, Raman] |
| |
| | 2002 | | Translating a Planar Object to Maximize Point Containment
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 42-53 | Proceedings Article | |
| 1 |
| Agrawal, Saha, Saptharishi, Saxena [Agrawal, 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 | |
| 2 |
| Agrawal, Saha, Saxena [Agrawal, 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 | |
| | 2012 | | Quasi-polynomial Hitting-set for Set-depth-Delta Formulas
In: arXiv [abs/1209.2333], 1-13 | Electronic Journal Article | |
| 1 |
| Ahuja, Baltz, Doerr, Privetivy, Srivastav [Ahuja, Baltz, Privetivy, Srivastav, Erlebach, Persiano] |
| |
| | 2005 | | On the Minimum Load Coloring Problem
In: Third Workshop on Approximation and Online Algorithms (WAOA 2005), 15-26 | Proceedings Article | |
| 1 |
| Ahuja, Baltz, Doerr, Privetivy, Srivastav [Ahuja, Baltz, Privetivy, Srivastav] |
| |
| | 2007 | | On the Minimum Load Coloring Problem
In: Journal of Discrete Algorithms [5], 533-545 | Journal Article | |
| 1 |
| Ahuja, Baltz, Doerr, Srivastav [Ahuja, Baltz, Srivastav] |
| |
| | 2004 | | Coloring Graphs with Minimal Load
In: Electronic Notes in Discrete Mathematics [17], 129-133 | Journal Article | |
| 2 |
| Ahuja, Mehlhorn, Orlin, Tarjan [-] |
| |
| | 1988 | | Faster Algorithms for the Shortest Path Problem | Report | |
| | 1988 | | Faster Algorithms for the Shortest Path Problem | Report | |
| 1 |
| Ahuja, Mehlhorn, Orlin, Tarjan [] |
| |
| | 1990 | | Faster algorithms for the shortest path problem
In: Journal of the ACM [37], 213-223 | Journal Article | |
| 1 |
| Ailon, Avigdor-Elgrabli, Liberty, van Zuylen [Ailon, Avigdor-Elgrabli, Liberty, Demetrescu, Halldórsson] |
| |
| | 2011 | | Improved Approximation Algorithms for Bipartite Correlation Clustering
In: Algorithms - ESA 2011 : 19th Annual European Symposium, 25-36 | Proceedings Article | |
| 1 |
| Ailon, Avigdor-Elgrabli, Liberty, van Zuylen [Ailon, Avigdor-Elgrabli, Liberty] |
| |
| | 2012 | | Improved Approximation Algorithms for Bipartite Correlation Clustering
In: SIAM Journal on Computing [41], 1110-1121 | Journal Article | |
| 1 |
| Ajwani [-] |
| |
| | 2005 | | Design, Implementation and Experimental Study of External Memory BFS Algorithms
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Ajwani, Dementiev, Meyer [Dementiev] |
| |
| | 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 | |
| 1 |
| Ajwani, Elbassioni, Govindarajan, Ray [Ajwani, Govindarajan] |
| |
| | 2012 | | Conflict-free coloring for rectangle ranges using O(n .382) colors
In: Discrete & Computational Geometry [48], 39-52 | Journal Article | |
| 1 |
| Ajwani, Elbassioni, Govindarajan, Ray [Ray, 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 | |
| 1 |
| Ajwani, Elbassioni, Govindarajan, Ray [Ray, Scheideler] |
| |
| | 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 | |
| 1 |
| Ajwani, Friedrich [-] |
| |
| | 2010 | | Average-case Analysis of Incremental Topological Ordering
In: Discrete Applied Mathematics [158], 240-250 | Journal Article | |
| 1 |
| Ajwani, Friedrich [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 | |
| 1 |
| Ajwani, Friedrich, Meyer [-] |
| |
| | 2008 | | An $O(n^2.75)$ algorithm for incremental topological ordering
In: ACM Transactions on Algorithms [4], 1-14 | Journal Article | |
| 1 |
| Ajwani, Friedrich, Meyer [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 | |
| 1 |
| Ajwani, Malinger, Meyer, Toledo [Malinger, Meyer, Toledo, 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 | |
| 1 |
| Ajwani, Meyer, Osipov [Applegate, Brodal] |
| |
| | 2007 | | Improved external memory BFS implementations
In: 9th Workshop on Algorithm Engineering and Experiments (ALENEX), 3-12 | Proceedings Article | |
| 1 |
| Ajwani, Meyer, Osipov [Meyer, Osipov, 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 | |
| 1 |
| Ajwani, Ray, Seidel, Tiwary [Ray, Seidel, Tiwary, 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 | |
| 1 |
| Akbari, Berenbrink, Sauerwald [Akbari, Berenbrink, 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 | |
| 7 |
| Albers [-] |
| |
| | 1999 | | Better bounds for online scheduling
In: SIAM Journal on Computing [29], 459-473 | Journal Article | |
| | 1999 | | Online-Algorithmen
Universität des Saarlandes | Thesis - Habilitation thesis | |
| | 1998 | | A competitive analysis of the list update problem with lookahead
In: Theoretical Computer Science [197], 95-109 | Journal Article | |
| | 1998 | | Improved randomized on-line algorithms for the list update problem
In: SIAM Journal on Computing [27], 682-693 | Journal Article | |
| | 1997 | | Better Bounds for Online Scheduling
In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC-97), 130-139 | Proceedings Article | |
| | 1997 | | On the Influence of Lookahead in Competitive Paging Algorithms
In: Algorithmica [18], 283-305 | Journal Article | |
| | 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 | |
| 1 |
| 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 | |
| 1 |
| 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 | |
| 1 |
| Albers, Garg, Leonardi [-] |
| |
| | 2000 | | Minimizing stall time in single and parallel disk systems
In: Journal of the ACM [47], 969-986 | Journal Article | |
| 1 |
| 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 | |
| 1 |
| Albers, Hagerup [-] |
| |
| | 1997 | | Improved Parallel Integer Sorting without Concurrent Writing
In: Information and Computation [136], 25-51 | Journal Article | |
| 1 |
| 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 | |
| 1 |
| Albers, Koga [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 | |
| 1 |
| Albers, Koga [Koga] |
| |
| | 1998 | | New on-line algorithms for the page replication problem
In: Journal of Algorithms [27], 75-96 | Journal Article | |
| 1 |
| 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 | |
| 1 |
| Albers, Kursawe, Schuierer [Albers, Schuierer] |
| |
| | 2002 | | Exploring unkown environments with obstacles
In: Algorithmica [32], 123-143 | Journal Article | |
| 5 |
| Albers, Mitzenmacher [Mitzenmacher] |
| |
| | 2000 | | Average-Case Analyses of First Fit and Random Fit Bin Packing
In: Random Structures & Algorithms [16], 240 - 259 | Journal Article | |
| | 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 | |
| | 1998 | | Average case analyses of list update algorithms, with applications to data compression
In: Algorithmica [21], 312-329 | Journal Article | |
| | 1997 | | Revisiting the COUNTER algorithms for list update
In: Information Processing Letters [64], 155-160 | Journal Article | |
| | 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 | |
| 1 |
| 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 | |
| 1 |
| Albers, Westbrook [Westbrook, Fiat, Woeginger] |
| |
| | 1998 | | Self-organizing data structures
In: Online Algorithms: The State of the Art, 13-51 | Part of a Book | |
| 1 |
| Alberts, Cattaneo, Italiano, Nanni, Zaroliagis [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 | |
| 1 |
| Alberts, Gutwenger, Mutzel, Näher [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 | |
| 2 |
| Albrecht, Jung, Mehlhorn (ed.) [-] |
| |
| | 1987 | | Parallel algorithms and architectures (WPAA-87) : international workshop | Proceedings | |
| | 1987 | | Parallel algorithms and architectures : International Workshop | Proceedings | |
| 1 |
| Albrecht, Karrenbauer, Xu [Albrecht, 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 | |
| 1 |
| Alcaraz, Friedrich, Kötzing, Krohmer, Müller, Pauling, Baumbach [Krohmer] |
| |
| | 2012 | | Efficient key pathway mining: combining networks and OMICS data
In: Integrative Biology [4], 756-764 | Journal Article | |
| 1 |
| Alefragis, Goumopoulos, Sanders, Takkula, Wedelin [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 | |
| 1 |
| Alkassar, Böhme, Mehlhorn, Rizkallah [Alkassar, Böhme, Gopalakrishnan, Qadeer] |
| |
| | 2011 | | Verification of Certifying Computations
In: Computer Aided Verification : 23rd International Conference, CAV 2011, 67-82 | Proceedings Article | |
| 1 |
| Alkassar, Böhme, Mehlhorn, Rizkallah [Alkassar, Böhme] |
| |
| | 2013 | | A Framework for the Verification of Certifying Computations | Unpublished/Draft | |
| 1 |
| Alon, Bradford, Fleischer [Alon] |
| |
| | 1996 | | Matching nuts and bolts faster
In: Information Processing Letters [59], 123-127 | Journal Article | |
| 4 |
| |
| | 1980 | | Codes: Unequal Probabilities, Unequal Letter Cost
In: Journal of the ACM [27], 412-427 | Journal Article | |
| | 1978 | | Codes: Unequal Probabilities, Unequal Letter Cost | Report | |
| | | | | | |
| | 1978 | | Codes: Unequal Probabilities, Unequal Letter Cost
In: Automata, languages and programming (ICALP-78): 5th international colloquium, 15-25 | Proceedings Article | |
| 2 |
| Althaus [-] |
| |
| | 2001 | | Curve Reconstruction and the Traveling Salesman Problem
Universität des Saarlandes | Thesis - PhD thesis | |
| | 1998 | | Berechnung optimaler Steinerbäume in der Ebene
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Althaus, Altmeyer, Naujoks [Althaus, Altmeyer, Becker, Damm, Fränzle, Olderog, Podelski, Wilhelm] |
| |
| | 2010 | | A New Combinatorial Approach to Parametric Path Analysis | Report | |
| 1 |
| Althaus, Baumann, Schömer, Werth [Baumann, Schömer, Werth] |
| |
| | 2007 | | Trunk Packing Revisited
In: Experimental Algorithms, 6th International Workshop, 420-432 | Proceedings Article | |
| 1 |
| Althaus, Bockmayr, Elf, Kasper, Jünger, Mehlhorn [Bockmayr, Elf, Kasper, Jünger, Möhring, Raman] |
| |
| | 2002 | | SCIL - Symbolic Constraints in Integer Linear Programming.
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 75-87 | Proceedings Article | |
| 3 |
| Althaus, Calinescu, Mandoiu, Prasad, Tchervenski, Zelikovsly [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 | |
| | | | | | |
| | 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 | |
| 2 |
| |
| | 2008 | | A Lagrangian relaxation approach for the multiple sequence alignment problem
In: Journal of Combinatorial Optimization [16], 127-154 | Journal Article | |
| | 2008 | | LASA: A tool for non-heuristic alignment of multiple sequences
In: Bioinformatics Research and Development (BIRD’08), 489-498 | Proceedings Article | |
| 1 |
| Althaus, Canzar [Canzar, 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 | |
| 1 |
| Althaus, Canzar, Elbassioni, Karrenbauer, Mestre [-] |
| |
| | 2008 | | Approximating the Interval Constrained Coloring Problem
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), 210-221 | Proceedings Article | |
| 1 |
| Althaus, Canzar, Elbassioni, Karrenbauer, Mestre [Althaus, Canzar, Karrenbauer, Mestre] |
| |
| | 2011 | | Approximation Algorithms for the Interval Constrained Coloring Problem
In: Algorithmica [61], 342-361 | Journal Article | |
| 1 |
| Althaus, Canzar, Emmett, Karrenbauer, Marshall, Meyer-Bäse, Zhang [Emmett, 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 | |
| 1 |
| Althaus, Caprara, Lenhof, Reinert [Caprara, Lenhof, Reinert, Lenhof] |
| |
| | 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 | |
| 1 |
| Althaus, Caprara, Lenhof, Reinert [Caprara, Lenhof, Reinert] |
| |
| | 2006 | | Aligning multiple sequences by cutting planes
In: Mathematical Programming [2006], 387-425 | Journal Article | |
| 2 |
| Althaus, Duchier, Koller, Mehlhorn, Niehren, Thiel [Duchier, Koller, Niehren] |
| |
| | 2003 | | An Efficient Algorithm for the Configuration Problem of Dominance Graphs
In: Journal of Algorithms [48], 194-219 | Journal Article | |
| | 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 | |
| 1 |
| Althaus, Dumitriu [Althaus, Dumitriu, Vahrenhold] |
| |
| | 2009 | | Fast and Accurate Bounds on Linear Programs
In: Experimental Algorithms : 8th International Symposium on Experimental Algorithms (SEA 2009), 40-50 | Proceedings Article | |
| 1 |
| 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 | |
| 1 |
| Althaus, Fink [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 | |
| 1 |
| Althaus, Funke, Har-Peled, Könemann, Ramos, Skutella [Har-Peled, Könemann, Ramos] |
| |
| | 2005 | | Approximating k-Hop Minimum-Spanning Trees
In: Operations Research Letters [33], 115-120 | Journal Article | |
| 1 |
| Althaus, Karamanis, Koller [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 | |
| 1 |
| Althaus, Kohlbacher, Lenhof, Müller [-] |
| |
| | 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 | |
| 1 |
| Althaus, Kohlbacher, Lenhof, Müller [Lenhof, Kohlbacher] |
| |
| | 2002 | | A combinatorial approach to protein docking with flexible side chains
In: Journal of Computational Biology [9], 597-612 | Journal Article | |
| 1 |
| Althaus, Kupilas, Naujoks [Althaus, 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 | |
| 3 |
| |
| | 2001 | | Traveling Salesman-Based Curve Reconstruction in Polynomial Time
In: SIAM Journal on Computing [31], 27-66 | Journal Article | |
| | 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 | |
| | 1998 | | Maximum Network Flow with Floating Point Arithmetic
In: Information Processing Letters [66], 109-113 | Journal Article | |
| 1 |
| 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 | |
| 1 |
| |
| | 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 | |
| 1 |
| Althaus, Naujoks [McGeoch] |
| |
| | 2008 | | Reconstructing Phylogenetic Networks with One Recombination
In: Experimental Algorithms, 7th International Workshop, WEA 2008, 275-288 | Proceedings Article | |
| 1 |
| Althaus, Polzin, Vahdati Daneshmand [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 | |
| 1 |
| 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 | |
| 2 |
| 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 | |
| | 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 | |
| 1 |
| 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 | |
| 1 |
| Alt, Guibas, Mehlhorn, Karp, Wigderson [-] |
| |
| | 1991 | | A Method for Obtaining Randomized Algorithms with Small Tail Probabilities | Report | |
| 1 |
| Alt, Guibas, Mehlhorn, Karp, Wigderson [Alt, Guibas, Karp, Wigderson] |
| |
| | 1996 | | A Method for Obtaining Randomized Algorithms with Small Tail Probabilities
In: Algorithmica [16], 543-547 | Journal Article | |
| 4 |
| Alt, Hagerup, Mehlhorn, Preparata [-] |
| |
| | 1987 | | Deterministic Simulation of Idealized Parallel Computers on more Realistic Ones
In: Parallel Algorithms and Architectures : International Workshop, 11-15 | Proceedings Article | |
| | 1987 | | Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
In: SIAM Journal on Computing [16], 808-835 | Journal Article | |
| | 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 | |
| | 1985 | | Deterministic simulation of idealized parallel computers on more realistic ones | Report | |
| 6 |
| |
| | 1985 | | Searching Semisorted Tables
In: SIAM Journal on Computing [14], 840-848 | Journal Article | |
| | 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 | |
| | 1978 | | Complexity Arguments in Algebraic Language Theory | Report | |
| | 1976 | | Lower Bounds for the Space Complexity of Context-Free Recognition
In: Third International Colloquium on Automata, Languages and Programming, 338-354 | Proceedings Article | |
| | 1975 | | A Language over a One Symbol Alphabet Requiring only O(log log n) Space
In: SIGACT News [7], 31-33 | Journal Article | |
| | 1975 | | Untere Schranken für den Platzbedarf bei der kontext-freien Analyse | Report | |
| 3 |
| Alt, Mehlhorn, Munro [-] |
| |
| | 1984 | | On the complexity of partial match retrieval
In: Information Processing Letters [19], 61-65 | Journal Article | |
| | 1984 | | Partial match retrieval in implicit data structures
In: Information Processing Letters [19], 61-65 | Journal Article | |
| | 1981 | | Partial Match Retrieval in Implicit Data Structures
In: Mathematical foundations of computer science (MFCS-81) : 10th symposium, ,, 156-161 | Proceedings Article | |
| 1 |
| Alt, Mehlhorn, Wagener, Welzl [-] |
| |
| | 1987 | | Convergence, Similarity and Symmetries of Geometric Objects
In: Computational geometry (SCG-87) : 3rd symposium, 308-315 | Proceedings Article | |
| 1 |
| Alt, Mehlhorn, Wagener, Welzl [Alt, Wagener, Welzl] |
| |
| | 1987 | | Congruence, similarity and symmetries of geometric objects | Report | |
| 1 |
| Alt, Mehlhorn, Wagener, Welzl [] |
| |
| | 1988 | | Congruence, Similarity, and Symmetries of Geometric Objects
In: Discrete and Computational Geometry [3], 237-256 | Journal Article | |
| 1 |
| Alvarez, Bringmann, Curticapean, Ray [Alvarez, Curticapean, Dey, Whitesides] |
| |
| | 2012 | | Counting Crossing Free Structures
In: Proceedings of the Twenty-Eight Annual Symposium on Computational Geometry (SCG'12), 61-68 | Proceedings Article | |
| 1 |
| Alvarez, Bringmann, Ray, Seidel [Alvarez, Ray, Seidel] |
| |
| | 2013 | | Counting Triangulations Approximately
In: 25th Canadian Conference on Computational Geometry (CCCG-13), 85-89 | Proceedings Article | |
| 2 |
| Amaldi, Iuliano, Jurkiewicz, Mehlhorn, Rizzi [Amaldi, Iuliano, Rizzi, 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 | |
| | 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 | |
| 1 |
| 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 | |
| 1 |
| Ambalath, Balasundaram, H., Koppula, Misra, Philip, Ramanujan [Ambalath, Balasundaram, H., Koppula, Misra, Ramanujan, 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 | |
| 1 |
| |
| | 2010 | | Riemann-Roch for sublattices of the root lattice $A\_n$
In: Electronic Journal of Combinatorics [17], R124,1-R124,50 | Electronic Journal Article | |
| 1 |
| Amini, Peleg, Pérennes, Sau, Saurabh [Peleg, Pérennes, Sau, Saurabh, 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 | |
| 1 |
| Amini, Pérennes, Sau [Pérennes, Sau] |
| |
| | 2009 | | Hardness and approximation of traffic grooming
In: Theoretical Computer Science [410], 3751-3760 | Journal Article | |
| 1 |
| Anagnostopoulos, Grandoni, Leonardi, Wiese [Anagnostopoulos, Grandoni, Leonardi] |
| |
| | 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 | |
| 1 |
| Anand, Bringmann, Friedrich, Garg, Kumar [Friedrich, Garg, Kumar, 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 | |
| 1 |
| Anand, Garg, Megow [Anand, Garg, 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 | |
| 1 |
| Andersson, Hagerup, Hastad, Petersson [Andersson, Hastad, Petersson] |
| |
| | 2000 | | Tight bounds for searching a sorted array of strings
In: SIAM Journal on Computing [30], 1552-1578 | Journal Article | |
| 1 |
| 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 | |
| 1 |
| Andreou, Fotakis, Nikoletseas, Papadopoulou, Spirakis [Andreou, Nikoletseas, Papadopoulou, Spirakis, 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 | |
| 2 |
| |
| | 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 | |
| | 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 | |
| 1 |
| Angelopoulos [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 | |
| 1 |
| Angelopoulos [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 | |
| 1 |
| Angelopoulos, Borodin [Borodin] |
| |
| | 2010 | | Randomized Priority Algorithms
In: Theoretical Computer Science [411], 2542-2558 | Journal Article | |
| 1 |
| 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 | |
| 2 |
| Angelopoulos, Dorrigiv, Lopez-Ortiz [Dorrigiv, Lopez-Ortiz] |
| |
| | 2008 | | List Update with Locality of Reference
In: 8th Latin American Symposium on Theoretical Informatics (LATIN 2008), 399-410 | Proceedings Article | |
| | 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 | |
| 1 |
| Angelopoulos, Lopez-Ortiz [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 | |
| 1 |
| Angelopoulos, Lopez-Ortiz, Hamel [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 | |
| 1 |
| Angelopoulos, Schweitzer [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 | |
| 1 |
| Anshelevich, Bhardwaj, Hoefer [Anshelevich, Bhardwaj, Bodlaender, Italiano] |
| |
| | 2013 | | Friendship and Stable Matching.
In: 21st European Symposium on Algorithms (ESA-13), 49-60 | Proceedings Article | |
| 1 |
| Antoniadis, Huang, Ott, Verschae [Antoniadis, Huang, Verschae, 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 | |
| 1 |
| Aranov, Asano, Katoh, Mehlhorn, Tokuyama [Aranov, Asano, Katoh, Tokuyama, 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 | |
| 1 |
| Arge, Meyer, Toma [Arge, Toma, 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 | |
| 1 |
| Arge, Meyer, Toma, Zeh [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 | |
| 1 |
| Arge, Meyer, Toma, Zeh [Arge, Toma, Zeh] |
| |
| | 2003 | | On external-memory planar depth first search
In: Journal of Graph Algorithms and Applications [7], 105-129 | Journal Article | |
| 1 |
| Arikati, Chaudhuri, Zaroliagis [-] |
| |
| | 1998 | | All-Pairs Min-Cut in Sparse Networks
In: Journal of Algorithms [29], 82-110 | Journal Article | |
| 1 |
| Arikati, Chaudhuri, Zaroliagis [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 | |
| 1 |
| Arikati, Chen, Chew, Das, Smid, Zaroliagis [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 | |
| 1 |
| Arikati, Dessmark, Lingas, Marathe [Dessmark, Lingas, Marathe, 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 | |
| 1 |
| Arikati, Dessmark, Lingas, Marathe [Dessmark, Lingas, Marathe] |
| |
| | 2001 | | Approximation algorithms for maximum two-dimensional pattern matching
In: Theoretical Computer Science [255], 51-62 | Journal Article | |
| 1 |
| Arikati, Maheshwari [Maheshwari] |
| |
| | 1996 | | Realizing degree sequences in parallel
In: SIAM Journal of Computing [9], 317-338 | Journal Article | |
| 1 |
| Arikati, Maheshwari, Zaroliagis [-] |
| |
| | 1997 | | Efficient Computation of implicit representations of sparse graphs
In: Discrete Applied Mathematics [78], 1-16 | Journal Article | |
| 1 |
| Arikati, Mehlhorn [Arikati] |
| |
| | 1999 | | A correctness certificate for the Stoer-Wagner min-cut algorithm
In: Information Processing Letters [70], 251-254 | Journal Article | |
| 1 |
| Aronov, Asano, Funke [Aronov, Asano, 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 | |
| 1 |
| Aronov, Asano, Katoh, Mehlhorn, Tokuyama [Aronov, Asano, Katoh, Tokuyama] |
| |
| | 2006 | | Polyline Fitting of Planar Points under Min-sum Criteria
In: International Journal of Computational Geometry and Applications [16], 97-116 | Journal Article | |
| 1 |
| Arumugam, Chandrasekar, Misra, Philip, Saurabh [Arumugam, Chandrasekar, Misra, Saurabh, 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 | |
| 1 |
| 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 | |
| 1 |
| |
| | 1999 | | On the Expected Depth of Random Circuits
In: Combinatorics, Probability and Computing [8], 209-228 | Journal Article | |
| 1 |
| Arya, Malamatos, Mount [Arya, Mount, 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 | |
| 3 |
| Arya, Malamatos, Mount [Arya, Mount] |
| |
| | 2007 | | A simple entropy-based algorithm for planar point location
In: ACM Transactions on Algorithms [3], 17 | Journal Article | |
| | 2006 | | On the Importance of Idempotence
In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, STOC'06, 564-573 | Proceedings Article | |
| | 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 | |
| 1 |
| Arya, Malamatos, Mount, Wong [Arya, Mount, Wong] |
| |
| | 2007 | | Optimal expected-case planar point location
In: SIAM Journal on Computing [37], 584-610 | Journal Article | |
| 2 |
| |
| | 2000 | | Approximate range searching
In: Computational Geometry [17], 135-152 | Journal Article | |
| | 1995 | | Approximate range searching
In: 11th Annual ACM Symposium on Computational Geometry (SCG95), 172-181 | Proceedings Article | |
| 2 |
| Arya, Mount, Narayan [Mount, Narayan] |
| |
| | 1996 | | Accounting for boundary effects in nearest neighbor searching
In: Discrete & Computational Geometry [16], 155-176 | Journal Article | |
| | 1995 | | Accounting for boundary effects in nearest neighbor searching
In: 11th Annual ACM Symposium on Computational Geometry (SCG95), 336-344 | Proceedings Article | |
| 1 |
| |
| | 1997 | | Efficient construction of a bounded degree spanner with low weight
In: Algorithmica [17], 33-54 | Journal Article | |
| 1 |
| |
| | 2011 | | Memory-constrained algorithms for shortest path problem
In: 23rd Annual Canadian Conference on Computational Geometry (CCCG 2011), 315-319 | Proceedings Article | |
| 1 |
| |
| | 2000 | | Agorithmen der modularen Arithmetik
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Auger, Doerr (ed.) [Auger] |
| |
| | 2011 | | Theory of Randomized Search Heuristics | Book | |
| 1 |
| 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 | |
| 1 |
| 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 | |
| 1 |
| Babenko, Gawrychowski, Kociumaka, Starikovskaya [Babenko, Gawrychowski, Kociumaka, Starikovskaya, 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 | |
| 1 |
| Bachrach, El-Yaniv, Reinstädtler [Bachrach, El-Yaniv] |
| |
| | 2002 | | On the competitive theory and practice of online list accessing algorithms
In: Algorithmica [32], 201-246 | Journal Article | |
| 1 |
| Bacik, Mahajan [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 | |
| 1 |
| |
| | 1998 | | Berechnung kürzester Gittervektoren
Univesität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Bader, Moret, Sanders [Bader, Moret, Fleischer, Moret, Meineche Schmidt] |
| |
| | 2002 | | Algorithm Engineering for Parallel Computation
In: Experimental Algorithmics, 1-23 | Part of a Book | |
| 2 |
| |
| | 2001 | | Combinatoire Analytique des chemins et des cartes
Université de Paris 6 | Thesis - PhD thesis | |
| | 2000 | | A Generalized Cover Time for Random Walks on Graphs
In: Proceedings of FPSAC'00, 113-124 | Proceedings Article | |
| 1 |
| 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 | |
| 2 |
| Banderier [Flajolet, Schaeffer, Soria] |
| |
| | 2001 | | Random Maps, Coalescing Saddles, Singularity Analysis, and Airy Phenomena
In: Random Structures & Algorithms [19], 194-246 | Journal Article | |
| | 2000 | | Planar Maps and Airy Phenomena,
In: Proceedings of ICALP'00, 388-402 | Proceedings Article | |
| 1 |
| |
| | 1999 | | An Introduction to Analytic Number Theory | Miscellaneous | |
| 1 |
| Banderier, Beier, Mehlhorn [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 | |
| 1 |
| Banderier, Bousquet-Mélou, Denise, Flajolet, Gardy, Gouyou-Beauchamps [Bousquet-Mélou, Denise, Flajolet, Gardy, Gouyou-Beauchamps] |
| |
| | 2002 | | Generating Functions for Generating Trees
In: Discrete Mathematics [246], 29-55 | Journal Article | |
| 1 |
| Banderier, Flajolet [Flajolet] |
| |
| | 2002 | | Basic analytic combinatorics of directed lattice paths
In: Theoretical Computer Science [281], 37-80 | Journal Article | |
| 1 |
| Bannai, Gawrychowski, Inenaga, Takeda [Bannai, Inenaga, Takeda, Fischer, Sanders] |
| |
| | 2013 | | Converting SLP to LZ78 in almost Linear Time
In: Combinatorial Pattern Matching, 24th Annual Symposium (CPM 2013), 38-49 | Proceedings Article | |
| 1 |
| Bansal, Chan [Bansal, 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 | |
| 1 |
| Bansal, Chan, Pruhs [Bansal, Pruhs, 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 | |
| 1 |
| Bansal, Chan, Pruhs [Bansal, Pruhs] |
| |
| | 2011 | | Competitive Algorithms for Due Date Schedulin
In: Algorithmica [59], 569-582 | Journal Article | |
| 1 |
| Bansal, Gupta, Li, Mestre, Nagarajan, Rudra [Bansal, Gupta, Li, Nagarajan, Rudra, 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 | |
| 1 |
| Bar-Yehuda, Flysher, Mestre, Rawitz [Bar-Yehuda, Flysher, Rawitz, Arge, Hoffmann, Welzl] |
| |
| | 2007 | | Approximation of Partial Capacitated Vertex Cover
In: 15th Annual European Symposium on Algorithms, 335-346 | Proceedings Article | |
| 1 |
| Bar-Yehuda, Hermelin, Rawitz [Bar-Yehuda, Rawitz, de Berg, Meyer] |
| |
| | 2010 | | Minimum Vertex Cover in Rectangle Graphs
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. I, 255-266 | Proceedings Article | |
| 1 |
| Bar-Yehuda, Hermelin, Rawitz [Bar-Yehuda, Rawitz] |
| |
| | 2011 | | Minimum vertex cover in rectangle graphs
In: Computational Geometry [44], 356-364 | Journal Article | |
| 1 |
| |
| | 2006 | | Balanced partitions of vector sequences
In: Linear Algebra and Its Applications [414], 464-469 | Journal Article | |
| 1 |
| |
| | 2002 | | Effiziente Multiplikationsverfahren: ein numerischer Vergleich
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| 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 | |
| 1 |
| Bartal, Leonardi, Shallom, Sitters [Bartal, Leonardi, Shallom, 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 | |
| 1 |
| Baruah, Bonifaci, D'Angelo, Li, Marchetti-Spaccamela, Megow, Stougie [Baruah, Bonifaci, D'Angelo, Li, Marchetti-Spaccamela, Stougie] |
| |
| | 2012 | | Scheduling Real-Time Mixed-Criticality Jobs
In: IEEE Transactions on Computers [61], 1140-1152 | Journal Article | |
| 1 |
| Baruah, Bonifaci, D'Angelo, Li, Marchetti-Spaccamela, Megow, Stougie [Baruah, D'Angelo, Li, Marchetti-Spaccamela, Stougie, Hlinen{ |
| |
| 1 |
| '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 | |
| 1 |
| Baruah, Bonifaci, D'Angelo, Marchetti-Spaccamela, van der Ster, Stougie [Baruah, D'Angelo, Marchetti-Spaccamela, van der Ster, Stougie, Demetrescu, Halldórsson] |
| |
| | 2011 | | Mixed-criticality scheduling of sporadic task systems
In: Algorithms - ESA 2011 : 19th Annual European Symposium, 555-566 | Proceedings Article | |
| 1 |
| Baruah, Bonifaci, Marchetti-Spaccamela, Stiller [Baruah, Marchetti-Spaccamela, Stiller] |
| |
| | 2010 | | Improved Multiprocessor Global Schedulability Analysis
In: Real-Time Systems [46], 3-24 | Journal Article | |
| 1 |
| 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 | |
| 1 |
| Basit, Mustafa, Ray, Raza [Basit, Mustafa, Raza] |
| |
| | 2010 | | Centerpoints and Tverberg's technique
In: Computational Geometry [43], 593-600 | Journal Article | |
| 1 |
| 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, 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 | |
| 7 |
| Bast [-] |
| |
| | 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 | |
| | 2006 | | Intelligente Suche mit garantiert schnellen Antwortzeiten
In: MPG Jahrbuch [?], | Electronic Journal Article | |
| | 2005 | | Präzisionssuche im homöopathischen Netz
In: Homöopathie-Zeitschrift [I/05], 119-122 | Journal Article | |
| | 2000 | | On Scheduling Parallel Tasks at Twilight
In: Theory of Computing Systems [33], 489-563 | Journal Article | |
| | 2000 | | Provably Optimal Scheduling of Similar Tasks
Universität des Saarlandes | Thesis - PhD thesis | |
| | 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 | |
| | 1994 | | Fast Parallel Space Allocation, Estimation and Integer Sorting
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Bast [Babaogl, 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 | |
| 1 |
| Bast [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 | |
| 1 |
| Bast, Chitea, Suchanek, Weber [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 | |
| 1 |
| Bast, Dietzfelbinger, Hagerup [Dietzfelbinger] |
| |
| | 1992 | | A Perfect Parallel Dictionary
In: 17th International Symposium on Mathematical Foundations of Computer Science (MFCS'92), 133-141 | Proceedings Article | |
| 1 |
| Bast, Dupret, Majumdar, Piwowarski [Dupret, Piwowarski, 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 | |
| 2 |
| Bast, Funke, Matijevic [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 | |
| | 2006 | | TRANSIT: Ultrafast Shortest-Path Queries with Linear-Time Preprocessing
In: 9th DIMACS Implementation Challenge --- Shortest Path, | Electronic Proceedings Article | |
| 1 |
| Bast, Funke, Matijevic, Sanders, Schultes [Sanders, Schultes, 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 | |
| 1 |
| Bast, Funke, Sanders, Schultes [Sanders, Schultes] |
| |
| | 2007 | | Fast Routing in Road Networks using Transit Nodes
In: Science [316], 566 | Journal Article | |
| 2 |
| |
| | 1995 | | Fast Parallel Space Allocation, Estimation, and Integer Sorting
In: Information and Computation [123], 72-110 | Journal Article | |
| | 1991 | | Fast and Reliable Parallel Hashing
In: 3rd Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'91), 50-61 | Proceedings Article | |
| 1 |
| Bast, Hert [-] |
| |
| | 2000 | | The Area Partitioning Problem
In: Proceedings of the 12th Annual Canadian Conference on Computational Geometry (CCCG-00), 163-171 | Proceedings Article | |
| 1 |
| Bast, Majumdar [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 | |
| 1 |
| Bast, Majumdar, Schenkel, Theobald, Weikum [-] |
| |
| | 2006 | | IO-Top-k: Index-Access Optimized Top-k Query Processing | Report | |
| 1 |
| Bast, Majumdar, Schenkel, Theobald, Weikum [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 | |
| 1 |
| Bast, Majumdar, Schenkel, Theobald, Weikum [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 | |
| 1 |
| Bast, Majumdar, Weber [Majumdar, , , , , , , ] |
| |
| | 2007 | | Efficient interactive query expansion with CompleteSearch
In: 16th Conference on Information and Knowledge Management (CIKM'07), 857-860 | Proceedings Article | |
| 1 |
| 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 | |
| 1 |
| Bast, Mehlhorn, Schäfer, Tamaki [Tamaki, 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 | |
| 1 |
| Bast, Mehlhorn, Schäfer, Tamaki [Tamaki] |
| |
| | 2006 | | Matching Algorithms are Fast in Sparse Random Graphs
In: Theory of Computing Systems [39], 3-14 | Journal Article | |
| 1 |
| Bast, Mortensen, Weber [Mortensen, Crestani, Ferragina, Sanderson] |
| |
| | 2006 | | Output-Sensitive Autocompletion Search
In: String Processing and Information Retrieval : 13th International Conference, SPIRE 2006, 150-162 | Proceedings Article | |
| 2 |
| Bast, Weber [-] |
| |
| | 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 | |
| | 2005 | | Don't Compare Averages
In: 4th International Workshop on Efficient and Experimental Algorithms (WEA'05), 67-76 | Proceedings Article | |
| 1 |
| Bast, Weber [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 | |
| 1 |
| Bast, Weber [Broder, Maarek] |
| |
| | 2006 | | When You're Lost For Words: Faceted Search With Autocompletion
In: SIGIR'06 Workshop on Faceted Search, 31-35 | Proceedings Article | |
| 1 |
| Bast, Weber [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 | |
| 1 |
| |
| | 2007 | | Managing Helpdesk Tasks with CompleteSearch: A Case Study
In: 4th Conference on Professional Knowledge Management (WM'07), 101-108 | Proceedings Article | |
| 1 |
| Baswana, Biswas, Doerr, Friedrich, Kurur, Neumann [Baswana, Biswas, Friedrich, Kurur, 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 | |
| 1 |
| Baswana, Goyal, Sen [Goyal, Sen, 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 | |
| 1 |
| Baswana, Kavitha, Mehlhorn, Pettie [Baswana, Kavitha, Pettie] |
| |
| | 2011 | | Additive Spanners and (α, β)-Spanners
In: ACM Transactions on Algorithms [7], 5:1-5:26 | Journal Article | |
| 1 |
| Baswana, Sen [Sen, 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 | |
| 2 |
| |
| | 2007 | | A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
In: Random Structures & Algorithms [30], 532-563 | Journal Article | |
| | 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 | |
| 1 |
| 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 | |
| 1 |
| Batra, Sharma [Batra] |
| |
| | 2010 | | Bounds on absolute positiveness of multivariate polynomials
In: Journal of Symbolic Computation [45], 617-628 | Journal Article | |
| 1 |
| Baumann, Köhler [Köhler, 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 | |
| 1 |
| Baumbach, Friedrich, Kötzing, Krohmer, Müller, Pauling [Krohmer] |
| |
| | 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 | |
| 1 |
| Baumgarten, Jung, Mehlhorn [, ] |
| |
| | 1992 | | Dynamic Point Location in General Subdivisions
In: Discrete algorithms (SODA-92) : 3rd annual ACM-SIAM symposium, 250-258 | Proceedings Article | |
| 1 |
| Baumgarten, Jung, Mehlhorn [] |
| |
| | 1994 | | Dynamic point location in general subdivisions
In: Journal of Algorithms [3], 342-380 | Journal Article | |
| 2 |
| Baus [-] |
| |
| | 2005 | | Symbolic Constraints in Linear Integer Programming
Universität des Saarlandes | Thesis - Masters thesis | |
| | 2004 | | Symbolic Constraints in Linear Integer Programming
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Becchetti, Leonardi, Marchetti-Spaccamela, Schäfer [Becchetti, Leonardi, Marchetti-Spaccamela] |
| |
| | 2003 | | Scheduling to minimize flow time metrics
In: International Parallel and Distributed Processing Symposium (IPDPS-03), 223b-CDROM | Proceedings Article | |
| 1 |
| Becchetti, Leonardi, Marchetti-Spaccamela, Schäfer, Vredeveld [Becchetti, Leonardi, Marchetti-Spaccamela, 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 | |
| 2 |
| |
| | 2012 | | The Bolzano Method to Isolate the Roots of a Bitstream Polynomial
Universität des Saarlandes | Thesis - Bachelor thesis | |
| | 1996 | | Allgemeine approximative Kongruenz zweier Punktmengen im R³
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| 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 | |
| 2 |
| Becker, Mehlhorn [-] |
| |
| | 1986 | | Algorithms for Routing in Planar Graphs
In: Acta Informatica [23], 163-176 | Journal Article | |
| | 1984 | | Algorithms for routing in planar graphs | Report | |
| 1 |
| |
| | 2007 | | On threshold BDDs and the optimal variable ordering problem
In: Combinatorial Optimization and Applications : First International Conference, COCOA 2007, 124-135 | Proceedings Article | |
| 1 |
| Behle, Jünger, Liers [Jünger, Liers, 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 | |
| 1 |
| |
| | 2000 | | Solid Modeling durch Boolesche Operationen
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Bei [Chen, Zhang, 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 | |
| 2 |
| |
| | 2004 | | Probabilistic Analysis of Discrete Optimization Problems
Universität des Saarlandes | Thesis - PhD thesis | |
| | 2000 | | Eine Heuristik für das Gossiping-Problem
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Beier, Czumaj, Krysta, Vöcking [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 | |
| 1 |
| Beier, Funke, Matijevic, Sanders [Sanders] |
| |
| | 2011 | | Energy-Efficient Paths in Radio Networks
In: Algorithmica [61], 298-319 | Journal Article | |
| 1 |
| Beier, Krysta, Czumaj, Vöcking [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 | |
| 1 |
| Beier, Röglin, Vöcking [Röglin, Vöcking, 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 | |
| 1 |
| Beier, Sanders, Sivadasan [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 | |
| 1 |
| Beier, Sibeyn [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 | |
| 1 |
| 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 | |
| 1 |
| Beier, Vöcking [Berthold] |
| |
| | 2004 | | Probabilistic Analysis of Knapsack Core Algorithms
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 461-470 | Proceedings Article | |
| 2 |
| Beier, Vöcking [Vöcking] |
| |
| | 2006 | | An Experimental Study of Random Knapsack Problems
In: Algorithmica [45], 121-136 | Journal Article | |
| | 2006 | | Typical Properties of Winners and Losers in Discrete Optimization
In: SIAM Journal on Computing [35], 855-881 | Journal Article | |
| 2 |
| |
| | 2004 | | Random knapsack in expected polynomial time
In: Journal of Computer and System Sciences [69], 306-329 | Journal Article | |
| | 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 | |
| 1 |
| Bein, Fleischer, Larmore [Bein, Larmore] |
| |
| | 2000 | | Limited bookmark randomized online algorithms for the paging problem
In: Information Processing Letters [76], 155-162 | Journal Article | |
| 2 |
| Beldiceanu, Carlsson, Thiel [Beldiceanu, Carlsson] |
| |
| | 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 | |
| | 2002 | | Cost-Filtering Algorithms for the two Sides of the Sum of Weights of Distinct Values Constraint | Report | |
| 1 |
| Beldiceanu, Guo, Thiel [Beldiceanu, Guo, 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 | |
| 1 |
| Beldiceanu, Katriel, Thiel [-] |
| |
| | 2004 | | Filtering algorithms for the Same and UsedBy constraints | Report | |
| 1 |
| Beldiceanu, Katriel, Thiel [Beldiceanu, 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 | |
| 1 |
| Beldiceanu, Katriel, Thiel [Beldiceanu, 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 | |
| 1 |
| Beldiceanu, Katriel, Thiel [Beldiceanu] |
| |
| | 2007 | | Filtering Algorithms for the Same and UsedBy Constraints
In: Archives of Control Sciences [to appear], to appear | Journal Article | |
| 1 |
| Belfrage, Mütze, Spöhel [Belfrage, Mütze] |
| |
| | 2012 | | Probabilistic one-player Ramsey games via deterministic two-player games
In: SIAM Journal on Discrete Mathematics [26], 1031-1049 | Journal Article | |
| 1 |
| 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 | |
| 1 |
| Ben-Zwi, Hermelin, Lokshtanov, Newman [Ben-Zwi, Lokshtanov, Newman] |
| |
| | 2011 | | Treewidth governs the complexity of target set selection
In: Discrete Optimization [8], 87-96 | Journal Article | |
| 2 |
| |
| | 2008 | | Robust and Efficient Software for Problems in 2.5-Dimensional Non-Linear Geometry - Algorithms and Implementations
Universität des Saarlandes | Thesis - PhD thesis | |
| | 2004 | | Exact Arrangements of Quadric Intersection Curves
Universität des Saarlandes | Thesis - Masters thesis | |
| 2 |
| Berberich, Caroli, Wolpert [Wolpert] |
| |
| | 2007 | | Exact Computation of Arrangements of Rotated Conics | Report | |
| | 2007 | | Exact Computation of Arrangements of Rotated Conics
In: Proceedings of 23rd European Workshop on Computational Geometry, 231-234 | Proceedings Article | |
| 1 |
| Berberich, Ebert, Fogel, Kettner [Fogel] |
| |
| | 2006 | | Web-site with benchmark instances for planar curve arrangements | Report | |
| 1 |
| Berberich, Ebert, Kettner [-] |
| |
| | 2006 | | Definition of file format for benchmark instances for arrangements of Quadrics | Report | |
| 1 |
| Berberich, Eigenwillig, Emiris, Fogel, Hemmer, Halperin, Kakargias, Kettner, Mehlhorn, Pion, Schömer, Teillaud, Wein, Wolpert [Emiris, Fogel, Hemmer, Halperin, Kakargias, Pion, Schömer, Teillaud, Wein] |
| |
| | 2004 | | An Empirical Comparison of Software for Constructing Arrangements of Curved Arcs | Report | |
| 1 |
| Berberich, Eigenwillig, Fogel, Halperin, Hert, Kettner, Teillaud, Wein [Fogel, Halperin, Teillaud, Wein] |
| |
| | 2003 | | Specification of the traits classes for CGAL arrangements of curves | Report | |
| 1 |
| Berberich, Eigenwillig, Hemmer, Hert, Kettner, Mehlhorn, Reichel, Schmitt, Schömer, Weber, Wolpert [Hemmer, Hert, Schömer] |
| |
| | 2004 | | EXACUS: Efficient and Exact Algorithms for Curves and Surfaces | Report | |
| 1 |
| Berberich, Eigenwillig, Hemmer, Hert, Kettner, Mehlhorn, Reichel, Schmitt, Schömer, Wolpert [Hemmer, Hert, Schömer, 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 | |
| 1 |
| Berberich, Eigenwillig, Hemmer, Hert, Mehlhorn, Schömer [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 | |
| 1 |
| Berberich, Emeliyanenko [-] |
| |
| | 2008 | | CGAL's Curved Kernel via Analysis | Report | |
| 3 |
| Berberich, Emeliyanenko, Kobel, Sagraloff [-] |
| |
| | 2013 | | Exact symbolic–numeric computation of planar algebraic curves
In: Theoretical Computer Science [491], 1-32 | Journal Article | |
| | 2012 | | Exact Symbolic-Numeric Computation of Planar Algebraic Curves
In: arXiv [abs/1201.1548v1], 1-46 | Electronic Journal Article | |
| | 2011 | | Arrangement Computation for Planar Algebraic Curves
In: arXiv [abs/1103.4697], | Electronic Journal Article | |
| 1 |
| Berberich, Emeliyanenko, Kobel, Sagraloff [Moreno Maza] |
| |
| | 2011 | | Arrangement Computation for Planar Algebraic Curves
In: Proceedings of the 4th Internal Workshop on Symbolic-Numeric Computation, 88-98 | Proceedings Article | |
| 1 |
| 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 | |
| 1 |
| Berberich, Emeliyanenko, Sagraloff [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 | |
| 1 |
| Berberich, Fogel, Halperin, Kerber, Setter [Fogel, Halperin, Kerber, Setter] |
| |
| | 2010 | | Arrangements on Parametric Surfaces II: Concretizations and Applications
In: Mathematics in Computer Science [4], 67-91 | Journal Article | |
| 1 |
| Berberich, Fogel, Halperin, Mehlhorn, Wein [Fogel, Halperin, Wein, 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 | |
| 2 |
| Berberich, Fogel, Halperin, Mehlhorn, Wein [Fogel, Halperin, Wein] |
| |
| | 2010 | | Arrangements on Parametric Surfaces I: General Framework and Infrastructure
In: Mathematics in Computer Science [4], 45-66 | Journal Article | |
| | 2007 | | Sweeping and Maintaining Two-Dimensional Arrangements on Quadrics | Report | |
| 1 |
| Berberich, Fogel, Halperin, Wein [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 | |
| 1 |
| Berberich, Fogel, Meyer [Fogel] |
| |
| | 2007 | | Updated Website to include Benchmark Instances for Arrangements of Quadrics and Planar Algebraic Curves | Report | |
| 1 |
| Berberich, Hagen, Hiller, Moser [Hagen, Hiller, Moser, Müller-Hannemann, Schirra] |
| |
| | 2010 | | Experiments
In: Algorithm Engineering : Bridging the Gap between Algorithm Theory and Practice, 325-388 | Part of a Book | |
| 1 |
| Berberich, Halperin, Kerber, Pogalnikova [Halperin, Kerber, Pogalnikova, Hurtado, van Krefeld] |
| |
| | 2011 | | Deconstructing Approximate Offsets
In: Proceedings of the 27th Annual Symposium on Computational Geometry (SCG'11), 187-196 | Proceedings Article | |
| 1 |
| Berberich, Halperin, Kerber, Pogalnikova [Halperin, Kerber, Pogalnikova, Vahrenhold] |
| |
| | 2010 | | Polygonal Reconstruction from Approximate Offsets
In: 26th European Workshop on Computational Geometry : Workshop Proceedings, 65-68 | Electronic Proceedings Article | |
| 2 |
| Berberich, Halperin, Kerber, Pogalnikova [Halperin, Kerber, Pogalnikova] |
| |
| | 2012 | | Deconstructing Approximate Offsets
In: Discrete & Computational Geometry [48], 964-989 | Journal Article | |
| | 2011 | | Deconstructing Approximate Offsets
In: arXiv [abs/1109.2158], | Electronic Journal Article | |
| 1 |
| Berberich, Hemmer [Hemmer] |
| |
| | 2007 | | Definition of the 3D Quadrical Kernel Content | Report | |
| 1 |
| Berberich, Hemmer [Karavelas, Pion, Teillaud, Tsigaridas] |
| |
| | 2006 | | Prototype implementation of the algebraic kernel | Report | |
| 2 |
| Berberich, Hemmer, Karavelas, Pion, Teillaud, Tsigaridas [Karavelas, Pion, Teillaud, Tsigaridas] |
| |
| | 2008 | | Prototype implementation of the algebraic kernel | Report | |
| | 2006 | | Interface specification of algebraic kernel | Report | |
| 1 |
| Berberich, Hemmer, Karavelas, Teillaud [Karavelas, Teillaud] |
| |
| | 2007 | | Revision of interface specification of algebraic kernel | Report | |
| 1 |
| Berberich, Hemmer, Kerber [Hemmer, Kerber, 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 | |
| 1 |
| Berberich, Hemmer, Kerber [Hemmer, Kerber] |
| |
| | 2010 | | A Generic Algebraic Kernel for Non-linear Geometric Applications | Report | |
| 1 |
| Berberich, Hemmer, Kettner, Schömer, Wolpert [Hemmer, Schömer, Mitchell, Rote] |
| |
| | 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 | |
| 1 |
| Berberich, Kerber [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 | |
| 1 |
| Berberich, Kerber [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 | |
| 1 |
| 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 | |
| 1 |
| Berberich, Kerber, Sagraloff [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 | |
| 1 |
| Berberich, Kerber, Sagraloff [Teillaud, Welzl] |
| |
| | 2008 | | Exact Geometric-Topological Analysis of Algebraic Surfaces
In: Proceedings of the 24th ACM Symposium on Computational Geometry, 164-173 | Proceedings Article | |
| 1 |
| Berberich, Kettner [-] |
| |
| | 2007 | | Linear-Time Reordering in a Sweep-line Algorithm for Algebraic Curves Intersecting in a Common Point | Report | |
| 2 |
| Berberich, Meyerovitch [Meyerovitch] |
| |
| | 2007 | | Computing Envelopes of Quadrics | Report | |
| | 2007 | | Computing Envelopes of Quadrics
In: Proceedings of 23rd European Workshop on Computational Geometry, 235-238 | Proceedings Article | |
| 1 |
| |
| | 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 | |
| 1 |
| Berberich, Sagraloff [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 | |
| 1 |
| Berenbrink, Cooper, Friedetzky, Friedrich, Sauerwald [Berenbrink, Cooper, Friedetzky, Randall] |
| |
| | 2011 | | Randomized Diffusion for Indivisible Loads
In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 429-439 | Proceedings Article | |
| 1 |
| Berenbrink, Friedetzky, Elsaesser, Nagel, Sauerwald [Berenbrink, Friedetzky, Elsaesser, Nagel, 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 | |
| 1 |
| Berenbrink, Hoefer, Sauerwald [Berenbrink, Hoefer, Randall] |
| |
| | 2011 | | Distributed Selfish Load Balancing on Networks
In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 1487-1497 | Proceedings Article | |
| 1 |
| Berghammer, Friedrich, Neumann [Berghammer, 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 | |
| 1 |
| Berg, Kreveld, Schirra [Berg, Kreveld] |
| |
| | 1995 | | A new approach to subdivision simplification
In: ACSM/ASPRS Annual Convention & Exposition Technical Papers, 79-88 | Proceedings Article | |
| 1 |
| |
| | 2003 | | Optimizing Misdirection
In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 192-201 | Proceedings Article | |
| 1 |
| Berthomé, Duboux, Hagerup, Newman, Schuster [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 | |
| 1 |
| Bhaskar, Fleischer, Hoy, Huang [Bhaskar, Fleischer, Hoy, 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 | |
| 1 |
| Biedl, Kaufmann, Mutzel [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 | |
| 1 |
| Bifet, Castillo, Chirita, Weber [Bifet, Castillo, Chirita, 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 | |
| 1 |
| Bilardi, Chaudhuri, Dubhashi, Mehlhorn [] |
| |
| | 1994 | | A lower bound for area-universal graphs
In: Information Processing Letters [51], 101-105 | Journal Article | |
| 1 |
| |
| | 1997 | | Lösung von Varianten des Post-Office-Problems mit Hilfe von Skip List Range Trees
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| |
| | 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 | |
| 1 |
| Blelloch, Farzan [Blelloch, Amir, Parida] |
| |
| | 2010 | | Succinct Representations of Separable Graphs
In: Combinatorial Pattern Matching : 21st Annual Symposium, CPM 2010, 138-150 | Proceedings Article | |
| 3 |
| |
| | 1980 | | On the Average Number of Rebalancing Operations in Weight-Balanced Trees
In: Theoretical Computer Science [11], 303-320 | Journal Article | |
| | 1979 | | Mittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten Bäumen
In: Theoretical Computer Science, 4th GI-Conference, 67-78 | Proceedings Article | |
| | 1978 | | On the Average Number of Rebalancing Operations in Weight-Balanced Trees | Report | |
| 1 |
| Böcker, Hüffner, Truss, Wahlström [Böcker, Hüffner, Truss, 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 | |
| 1 |
| Bodirsky, Gröpl, Johannsen, Kang [Bodirsky, Gröpl, Kang] |
| |
| | 2007 | | A Direct Decomposition of 3-connected Planar Graphs
In: Séminaire Lotharingien de Combinatoire [B54Ak], 15 | Journal Article | |
| 1 |
| Bodirsky, Kutz [Bodirsky] |
| |
| | 2007 | | Determining the consistency of partial tree descriptions
In: Artificial Intelligence [171], 185-196 | Journal Article | |
| 1 |
| 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 | |
| 1 |
| Bodlaender, Feremans, Grigoriev, Penninkx, Sitters, Wolle [Bodlaender, Feremans, Grigoriev, Penninkx, Wolle, 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 | |
| 1 |
| Bodlaender, Hagerup [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 | |
| 1 |
| Bodlaender, Hagerup [Bodlaender] |
| |
| | 1998 | | Parallel Algorithms with Optimal Speedup for Bounded Treewidth
In: SIAM Journal on Computing [27], 1725-1746 | Journal Article | |
| 1 |
| Bogdan, Sauerwald, Stauffer, Sun [Bogdan, Stauffer, ] |
| |
| | 2013 | | Balls into Bins via Local Search
In: 24th ACM-SIAM Symposium on Discrete Algorithms (SODA-13), 16-34 | Electronic Proceedings Article | |
| 1 |
| Boghossian, Kohlbacher, Lenhof [Vitter, Zaroliagis] |
| |
| | 1999 | | BALL: Biochemical Algorithms Library
In: Algorithm engineering (WAE-99) : 3rd International Workshop, WAE'99, 330-344 | Proceedings Article | |
| 1 |
| Bonifaci, Chan, Marchetti-Spaccamela, Megow [Bonifaci, Chan, Marchetti-Spaccamela] |
| |
| | 2012 | | Algorithms and Complexity for Periodic Real-Time Scheduling
In: ACM Transactions on Algorithms [9], 601-619 | Journal Article | |
| 1 |
| Bonifaci, Chan, Marchetti-Spaccamela, Megow [Marchetti-Spaccamela, 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 | |
| 1 |
| Bonifaci, Harks, Schäfer [Harks, Schäfer] |
| |
| | 2010 | | Stackelberg Routing in Arbitrary Networks
In: Mathematics of Operations Research [35], 330 - 346 | Journal Article | |
| 2 |
| Bonifaci, Korteweg, Marchetti-Spaccamela, Stougie [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 | |
| | 2011 | | The Distributed Wireless Gathering Problem
In: Theoretical Computer Science [412], 633-641 | Journal Article | |
| 1 |
| Bonifaci, Marchetti-Spaccamela [Marchetti-Spaccamela, 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 | |
| 1 |
| Bonifaci, Marchetti-Spaccamela [Marchetti-Spaccamela] |
| |
| | 2012 | | Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems
In: Algorithmica [63], 763-780 | Journal Article | |
| 1 |
| Bonifaci, Marchetti-Spaccamela, Megow, Wiese [Bonifaci, Marchetti-Spaccamela] |
| |
| | 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 | |
| 1 |
| Bonifaci, Marchetti-Spaccamela, Stiller [Marchetti-Spaccamela, Stiller] |
| |
| | 2012 | | A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
In: Algorithmica [62], 1034-1049 | Journal Article | |
| 1 |
| Bonifaci, Marchetti-Spaccamela, Stiller, Wiese [Bonifaci, Marchetti-Spaccamela, Stiller] |
| |
| | 2013 | | Feasibility Analysis in the Sporadic DAG Task Model
In: Proceedings of the 25th Euromicro Conference on Real-Time Systems (ECRTS 2013), | Proceedings Article | |
| 1 |
| Bonifaci, Mehlhorn, Varma [Varma, 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 | |
| 1 |
| Bonifaci, Mehlhorn, Varma [Varma] |
| |
| | 2012 | | Physarum Can Compute Shortest Paths
In: Journal of Theoretical Biology [309], 121-133 | Journal Article | |
| 1 |
| Boros, Borys, Elbassioni, Gurvich, Makino, Rudolf [Boros, Borys, Gurvich, Makino, Rudolf, Lin] |
| |
| | 2007 | | Generating Minimal k-Vertex Connected Spanning Subgraphs
In: Computing and Combinatorics, 13th Annual International Conference, COCOON 2007, Proceedings, 222-231 | Proceedings Article | |
| 1 |
| Boros, Elbassioni, Fouz, Gurvich, Makino, Manthey [Boros, Fouz, Gurvich, Makino, Manthey, 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 | |
| 1 |
| Boros, Elbassioni, Gurvich [Boros, Gurvich, 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 | |
| 1 |
| Boros, Elbassioni, Gurvich, Khachiyan [Boros, Gurvich, Khachiyan, 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 | |
| 1 |
| Boros, Elbassioni, Gurvich, Khachiyan [Boros, Gurvich, Khachiyan, George L. 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 | |
| 1 |
| Boros, Elbassioni, Gurvich, Khachiyan [Boros, Gurvich, Khachiyan, 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 | |
| 1 |
| Boros, Elbassioni, Gurvich, Khachiyan [Boros, Gurvich, Khachiyan, Toshihide Ibaraki, Naoki Katoh, ] |
| |
| | 2003 | | Algorithms for Enumerating Circuits in Matroids.
In: Algorithms and Computation, 14th International Symposium, ISAAC 2003, 485-494 | Proceedings Article | |
| 1 |
| Boros, Elbassioni, Gurvich, Khachiyan, Makino [Boros, Gurvich, Khachiyan, Makino, 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 | |
| 1 |
| Boros, Elbassioni, Gurvich, Khachiyan, Makino [Boros, 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 | |
| 1 |
| Boros, Elbassioni, Gurvich, Makino [Boros, Gurvich, Makino, 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 | |
| 6 |
| Boros, Elbassioni, Gurvich, Makino [Boros, 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 | |
| | 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 | |
| | 2011 | | A lower bound for discounting algorithms solving two-person zero-sum limit average payoff stochastic games | Unpublished/Draft | |
| | 2010 | | On effectivity functions of game forms
In: Games and Economic Behavior [68], 512-531 | Journal Article | |
| | 2010 | | On Nash Equilibria and Improvement Cycles in Pure Positional Strategies for Chess-like and Backgammon-like $n$-person Games | Unpublished/Draft | |
| | 2007 | | Generating Vertices of Polyhedra and Related Monotone Generation Problems | Unpublished/Draft | |
| 1 |
| Boros, Elbassioni, Gurvich, Makino, Oudalov [Boros, 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 | |
| 2 |
| Boros, Elbassioni, Gurvich, Tiwary [Boros, Gurvich, Tiwary] |
| |
| | 2011 | | The negative cycles polyhedron and hardness of checking some polyhedral properties
In: Annals of Operations Research [188], 63-76 | Journal Article | |
| | 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 | |
| 1 |
| Boros, Elbassioni, Khachiyan, Gurvich [Boros, Gurvich, Khachiyan, Krzysztof Diks, ] |
| |
| | 2002 | | Matroid Intersections, Polymatroid Inequalities, and Related Problems
In: Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, 143-154 | Proceedings Article | |
| 5 |
| Boros, Elbassioni, Khachiyan, Gurvich [Boros, Gurvich, Khachiyan] |
| |
| | 2003 | | An Inequality for Polymatroid Functions and its Applications
In: Discrete Applied mathematics [131], 27 | Journal Article | |
| | 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 | |
| | 2002 | | Generating Dual-Bounded Hypergraphs
In: Optimization Methods and Software [17], 33 | Electronic Journal Article | |
| | | | | | |
| | 2000 | | An Efficient Incremental Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension
In: Parallel Processing Letters [10], 14 | Journal Article | |
| 1 |
| Boros, Elbassioni, Khachiyan, Gurvich [Boros, Khachiyan, Gurvich, Giuseppe Di Battista, ] |
| |
| | 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 | |
| 1 |
| Boros, Elbassioni, Khachiyan, Gurvich, Makino [Boros, Gurvich, Khachiyan, Makino, Fernando Orejas, Paul G. Spirakis, ] |
| |
| | 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 | |
| 1 |
| Boros, Elbassioni, Khachiyan, Gurvich, Makino [Boros, Gurvich, Khachiyan, 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 | |
| 2 |
| Boros, Elbassioni, Makino [Boros, Makino] |
| |
| | 2010 | | Left-to-right multiplication for monotone Boolean dualization
In: SIAM Journal on Computing [39], 3424-3439 | Journal Article | |
| | 2008 | | On Berge Multiplication for Monotone Boolean Dualization
In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, 48-59 | Proceedings Article | |
| 1 |
| Böttcher, Doerr, Neumann [Böttcher, 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 | |
| 1 |
| |
| | 1996 | | Eine parallelisierbare Heuristik für das Min-Cost-Flow Problem
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Bouziane, El Kahoui [Bouziane] |
| |
| | 2002 | | Computation of the dual of a plane projective curve
In: Journal of Symbolic Computation [34], 105-117 | Journal Article | |
| 1 |
| |
| | 1997 | | Weak epsilon-Nets for Points on a Hypersphere
In: Discrete & Computational Geometry [18], 83-91 | Journal Article | |
| 1 |
| Bradford, Choppela, Rawlins [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 | |
| 1 |
| Bradford, Fleischer [Staples, Eades, Katoh, Moffat] |
| |
| | 1995 | | Matching nuts and bolts faster
In: Algorithms and Computation: 6th International Symposium (ISAAC'95), 402-408 | Proceedings Article | |
| 1 |
| Bradford, Fleischer, Smid [-] |
| |
| | 1997 | | More efficient parallel totally monotone matrix searching
In: Journal of Algorithms [23], 386-400 | Journal Article | |
| 1 |
| Bradford, Golin, Larmore [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 | |
| 1 |
| Bradford, Golin, Larmore, Rytter [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 | |
| 1 |
| Bradford, Rawlins, Shannon [Rawlins, Shannon] |
| |
| | 1998 | | Efficient Matrix Chain Ordering in Polylog Time
In: SIAM Journal on Computing [27], 466-490 | Journal Article | |
| 1 |
| Bradford, Reinert [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 | |
| 1 |
| Bradonjić, Elsässer, Friedrich, Sauerwald, Stauffer [Bradonjić, Elsässer, Sauerwald, Stauffer, 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 | |
| 1 |
| |
| | 2003 | | Zwei Algorithmen zur Bestimmung kostenminimaler Flüsse in Netzwerken
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Brandenburg, Jünger, Mutzel [Brandenburg, Jünger] |
| |
| | 1997 | | Algorithmen zum automatischen Zeichnen von Graphen
In: Informatik Spektrum [20], 199-207 | Journal Article | |
| 1 |
| Brandenburg, Jünger, Mutzel, Lengauer [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 | |
| 1 |
| Brandenburg, Schreiber, Jünger, Marks, Mutzel [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 | |
| 1 |
| |
| | 2000 | | Entwicklung und Test von für statische Graphen optimierte Datentypen
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Bredereck, Nichterlein, Niedermeier, Philip [Bredereck, Nichterlein, Niedermeier, 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 | |
| 1 |
| Bredereck, Nichterlein, Niedermeier, Philip [Bredereck, Nichterlein, Niedermeier, 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 | |
| 1 |
| |
| | 1995 | | Analyse und Simulation eines Maximum-Flow Algorithmus für das Gitter
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| |
| | 2000 | | Externe Prioritätswarteschlangen
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Brengel, Crauser, Meyer, Ferragina [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 | |
| 1 |
| Breslauer, Jiang, Jiang [Jiang, Jiang] |
| |
| | 1997 | | Rotations of periodic strings and short superstrings
In: Journal of Algorithms [24], 340-353 | Journal Article | |
| 1 |
| |
| | 1996 | | Optimal Parallel Construction of Minimal Suffix and Factor Automata
In: Parallel Processing Letters [6], 35-44 | Journal Article | |
| 1 |
| Brightwell, Panagiotou, Steger [Brightwell, Steger] |
| |
| | 2012 | | Extremal subgraphs of random graphs
In: Random Structures & Algorithms [41], 147-178 | Journal Article | |
| 1 |
| |
| | 2012 | | An improved algorithm for Klee's measure problem on fat boxes
In: Computational Geometry: Theory and Applications [45], 225-233 | Journal Article | |
| 1 |
| Bringmann [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 | |
| 1 |
| Bringmann, Doerr, Neumann, Sliacan [Sliacan, 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 | |
| 1 |
| Bringmann, Engels, Manthey, Raghavendra Rao [Engels, Manthey, Raghavendra Rao, 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 | |
| 3 |
| |
| | 2012 | | Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
In: Theoretical Computer Science [425], 104-116 | Journal Article | |
| | 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 | |
| | 2010 | | Approximating the volume of unions and intersections of high-dimensional geometric objects
In: Computational Geometry [43], 601-610 | Journal Article | |
| 1 |
| Bringmann, Friedrich [Bringmann, Friedrich, 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 | |
| 1 |
| Bringmann, Friedrich [Bringmann, Friedrich, 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 | |
| 1 |
| Bringmann, Friedrich [Bringmann, 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 | |
| 2 |
| Bringmann, Friedrich [Bringmann] |
| |
| | 2010 | | An Efficient Algorithm for Computing Hypervolume Contributions
In: Evolutionary Computation [18], 383-402 | Journal Article | |
| | 2010 | | The Maximum Hypervolume Set Yields Near-optimal Approximation
In: 12th annual conference on Genetic and evolutionary computation (GECCO 2010), 511-518 | Proceedings Article | |
| 1 |
| Bringmann, Friedrich [Friedrich, 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 | |
| 2 |
| Bringmann, Friedrich [Friedrich] |
| |
| | 2013 | | Approximation Quality of the Hypervolume Indicator
In: Artificial Intelligence [195], 265–290 | Journal Article | |
| | 2013 | | Parameterized Average-Case Complexity of the Hypervolume Indicator
In: 15th Annual Conference on Genetic and Evolutionary Computation (GECCO-13), 575-582 | Proceedings Article | |
| 1 |
| Bringmann, Friedrich [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 | |
| 1 |
| Bringmann, Friedrich [Krasnogor, Lanzim] |
| |
| | 2011 | | Convergence of Hypervolume-Based Archiving Algorithms I: Effectiveness
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 745-752 | Proceedings Article | |
| 1 |
| Bringmann, Friedrich, Igel, Voß [Friedrich, Igel, Voß] |
| |
| | 2013 | | Speeding Up Many-Objective Optimization by Monte Carlo Approximations
In: Artificial Intelligence [204], 22–29 | Journal Article | |
| 1 |
| Bringmann, Friedrich, Neumann, Wagner [Neumann, Wagner, 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 | |
| 1 |
| Bringmann, Green Larsen [Green Larsen] |
| |
| | 2013 | | Succinct Sampling from Discrete Distributions
In: 45th ACM Symposium on Theory of Computing (STOC-13), 775-782 | Proceedings Article | |
| 1 |
| Bringmann, Mehlhorn, Neumann [-] |
| |
| | 2012 | | Remarks on Category-Based Routing in Social Networks | Unpublished/Draft | |
| 1 |
| Bringmann, Panagiotou [Panagiotou, Czumaj, Pitts, Wattenhofer] |
| |
| | 2012 | | Efficient Sampling Methods for Discrete Distributions
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 133-144 | Proceedings Article | |
| 1 |
| Bringmann, Sauerwald, Stauffer, Sun [Sauerwald, Stauffer] |
| |
| | 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 | |
| 1 |
| |
| | 1997 | | Separierung von Kuratowski-Ungleichungen für das größte planare Untergraphenproblem
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Brockhoff, Friedrich, Hebbinghaus, Klein, Neumann, Zitzler [Brockhoff, Friedrich, Zitzler] |
| |
| | 2009 | | On the Effects of Adding Objectives to Plateau Functions
In: IEEE Transactions on Evolutionary Computation [13], 591-603 | Journal Article | |
| 1 |
| Brockhoff, Friedrich, Hebbinghaus, Klein, Neumann, Zitzler [Brockhoff, Zitzler, ] |
| |
| | 2007 | | Do Additional Objectives Make a Problem Harder?
In: Genetic and Evolutionary Computation Conference 2007, 765-772 | Proceedings Article | |
| 1 |
| Brockhoff, Friedrich, Neumann [Brockhoff, Rudolph, Jansen, Lucas, Poloni, Beume] |
| |
| | 2008 | | Analyzing Hypervolume Indicator Based Algorithms
In: Parallel Problem Solving from Nature (PPSN X), 651-660 | Proceedings Article | |
| 3 |
| |
| | 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 | |
| | 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 | |
| | 1996 | | Priority queues on parallel machines
In: 5th Scandinavian Workshop on Algorithm Theory (SWAT96), 416-427 | Proceedings Article | |
| 1 |
| Brodal, Chaudhuri, Radhakrishnan [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 | |
| 1 |
| Brodal, Chaudhuri, Radhakrishnan [Radhakrishnan] |
| |
| | 1996 | | The randomized complexity of maintaining the minimum
In: Nordic Journal of Computing [3], 337-351 | Journal Article | |
| 1 |
| Brodal, Fagerberg, Meyer, Zeh [Brodal, Fagerberg, Zeh, 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 | |
| 1 |
| Brodal, Gasieniec [Brodal, Hirschberg, Myers] |
| |
| | 1996 | | Approximate Dictionary Queries
In: Combinatorial Pattern Matching: 7th Annual Symposium (CPM'96), 65-74 | Proceedings Article | |
| 1 |
| Brodal, Kaligosi, Katriel, Kutz [Brodal, Katriel, Moshe, Gabriel] |
| |
| | 2006 | | Faster Algorithms for Computing Longest Common Increasing Subsequences
In: Combinatorial Pattern Matching, 17th Annual Symposium, CPM 2006, 330-341 | Proceedings Article | |
| 1 |
| Brodal, Katajainen [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 | |
| 1 |
| Brodal, Pinotti [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 | |
| 2 |
| 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 | |
| | 1997 | | A parallel priority data structure with applications
In: 11th Internatinal Parallel Processing Symposium (IPPS-97), 689-693 | Proceedings Article | |
| 2 |
| 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 | |
| | 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 | |
| 1 |
| Brönnimann, Kettner, Pocchiola, Snoeyink [Brönnimann, Pocchiola, Snoeyink, 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 | |
| 1 |
| Brönnimann, Kettner, Pocchiola, Snoeyink [Brönnimann, Pocchiola, Snoeyink] |
| |
| | 2006 | | Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm
In: SIAM Journal on Computing [36], 721-739 | Journal Article | |
| 1 |
| Brönnimann, Kettner, Schirra, Veltkamp [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 | |
| 1 |
| Brown, El Kahoui, Novotni, Weber [Brown, Novotni, Weber] |
| |
| | 2006 | | Algorithmic methods for investigating equilibria in epidemic modeling
In: Journal of Symbolic Computation [41], 1157-1173 | Journal Article | |
| 1 |
| Buchberger, Mehlhorn, Näher, Nievergelt (ed.) [] |
| |
| | 1994 | | Special issue on “algorithms: implementation, libraries and use” | Book | |
| 1 |
| |
| | 1999 | | Oberflächenrekonstruktion mithilfe von Voronoi-Diagrammen
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Bundy, Hebbinghaus, Stellmacher [Bundy, Stellmacher] |
| |
| | 2006 | | The Local C(G,T) Theorem
In: Journal of Algebra [300], 741-789 | Journal Article | |
| 1 |
| |
| | 2002 | | Filter Algorithms for Approximate String Matching
Universität des Saarlandes | Thesis - PhD thesis | |
| 1 |
| Burkhardt, Crauser, Ferragina, Lenhof, Rivals, Vingron [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 | |
| 1 |
| Burkhardt, Kärkkäinen [-] |
| |
| | 2003 | | Better Filtering with Gapped q-Grams
In: Fundamenta Informaticae [56], 51-70 | Journal Article | |
| 1 |
| Burkhardt, Kärkkäinen [Amir, Landau] |
| |
| | 2001 | | Better Filtering with Gapped q-Grams
In: Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching, 73-85 | Proceedings Article | |
| 1 |
| Burkhardt, Kärkkäinen [R. Baeza-Yates] |
| |
| | 2003 | | Fast Lightweight Suffix Array Construction and Checking
In: Combinatorial Pattern Matching: 14th Annual Symposium, CPM 2003, 55-69 | Proceedings Article | |
| 1 |
| Burkhardt, Kärkkäinen [Takeda] |
| |
| | 2002 | | One-Gapped q-Gram Filters for Levenshtein Distance
In: Combinatorial Pattern Matching : 13th Annual Symposium, CPM 2002, 225-234 | Proceedings Article | |
| 1 |
| |
| | 1996 | | Exact Computation of Voronoi Diagrams and Line Segment Intersections
Universität des Saarlandes | Thesis - PhD thesis | |
| 2 |
| Burnikel, Fleischer, Mehlhorn, Schirra [-] |
| |
| | 2000 | | A strong and easily computable separation bound for arithmetic expressions involving radicals
In: Algorithmica [27], 87-99 | Journal Article | |
| | 1999 | | Efficient exact geometric computation made easy
In: Proceedings of the 15th Annual Symposium on Computational Geometry (SCG-99), 341-350 | Proceedings Article | |
| 1 |
| Burnikel, Funke, Mehlhorn, Schirra, Schmitt [Burnikel, Funke, Schirra] |
| |
| | 2009 | | A Separation Bound for Real Algebraic Expressions
In: Algorithmica [55], 14-28 | Journal Article | |
| 1 |
| Burnikel, Funke, Mehlhorn, Schirra, Schmitt [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 | |
| 2 |
| Burnikel, Funke, Seel [-] |
| |
| | 2001 | | Exact geometric computation using Cascading
In: International Journal of Computational Geometry & Applications [11], 245-266 | Journal Article | |
| | 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 | |
| 1 |
| 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 | |
| 1 |
| Burnikel, Mehlhorn, Schirra [-] |
| |
| | 1994 | | On degeneracy in geometric computations
In: Discrete algorithms (SODA-94) : 5th annual ACM-SIAM symposium, 16-23 | Proceedings Article | |
| 1 |
| Burnikel, Mehlhorn, Schirra [] |
| |
| | 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 | |
| 1 |
| |
| | 2011 | | Analysis of the KIT email graph, with an application of randomized rumour spreading protocols
Universität des Saarlandes | Thesis - Bachelor thesis | |
| 1 |
| Butman, Hermelin, Lewenstein, Rawitz [Butman, Lewenstein, Rawitz] |
| |
| | 2010 | | Optimization problems in multiple-interval graphs
In: ACM Transactions on Algorithms [6], 40,1-40,18 | Journal Article | |
| 1 |
| |
| | 1997 | | Robuste Implementierung eines Algorithmus zur Berechnung eines Voronoi-Diagramms für Polygone
Universitaet des Saarlandes | Thesis - Masters thesis | |
| 1 |
| |
| | 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 | |
| 2 |
| 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 | |
| | 1996 | | A better approximation algorithm for finding planar subgraphs
In: 7th ACM-SIAM Symposium on Discrete Algorithms (SODA96), 16-25 | Proceedings Article | |
| 1 |
| Cameron, Johannsen, Prellberg, Schweitzer [Cameron, Prellberg] |
| |
| | 2008 | | Counting Defective Parking Functions
In: Electronic Journal of Combinatorics [15], R92 | Electronic Journal Article | |
| 1 |
| Canzar, El-Kebir, Pool, Elbassioni, Malde, Mark, Geerke, Stougie, Klau [Canzar, El-Kebir, Pool, Malde, Mark, Geerke, Stougie, Klau, Chor] |
| |
| | 2012 | | Charge Group Partitioning in Biomolecular Simulation
In: Research in Computational Molecular Biology : 16th Annual International Conference, RECOMB 2012, 29-43 | Proceedings Article | |
| 1 |
| Canzar, Elbassioni, Elmasry, Raman [Canzar, Elmasry, Raman, 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 | |
| 1 |
| Canzar, Elbassioni, Klau, Mestre [Canzar, Klau, Mestre, Aceto, Henzinger, Sgall] |
| |
| | 2011 | | On Tree-Constrained Matchings and Generalizations
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 98-109 | Proceedings Article | |
| 1 |
| Canzar, Elbassioni, Klau, Mestre [Canzar, Klau, Mestre] |
| |
| | 2011 | | On Tree-Constrained Matchings and Generalizations | Unpublished/Draft | |
| 1 |
| Canzar, Elbassioni, Mestre [Canzar] |
| |
| | 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 | |
| 1 |
| Canzar, Remy [Remy] |
| |
| | 2006 | | Shape Distributions and Protein Similarity
In: GCB, 1-10 | Proceedings Article | |
| 1 |
| Caragiannis, Fishkin, Kaklamanis, Papaioannou [Caragiannis, Kaklamanis, Papaioannou, 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 | |
| 1 |
| Caragiannis, Fishkin, Kaklamanis, Papaioannou [Caragiannis, Kaklamanis, Papaioannou] |
| |
| | 2007 | | A tight bound for online colouring of disk graphs
In: Theoretical Computer Science [384], 152-160 | Journal Article | |
| 2 |
| Caroli [-] |
| |
| | 2007 | | Evaluation of a Generic Method for Analyzing Controlled-Perturbation Algorithms
Universität des Saarlandes | Thesis - Masters thesis | |
| | 2006 | | Exakte Arrangement-Berechnung gedrehter Quadratischer Kurven
Universität des Saarlandes | Thesis - Bachelor thesis | |
| 1 |
| Case, Kötzing [Case, 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 | |
| 1 |
| Case, Kötzing [Case, 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 | |
| 1 |
| Case, Kötzing [Case, 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 | |
| 3 |
| |
| | 2013 | | Memory-limited non-U-shaped learning with solved open problems
In: Theoretical Computer Science [473], 100-123 | Electronic Journal Article | |
| | 2012 | | Computability-theoretic learning complexity
In: Philosophical Transaction of the Royal Society A [370], 3570-3596 | Journal Article | |
| | 2012 | | Learning secrets interactively. Dynamic modeling in inductive inference
In: Information and Computation [220-221], 60-73 | Journal Article | |
| 1 |
| Celikik, Bast [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 | |
| 1 |
| |
| | 2009 | | Fast Error-Tolerant Search on Very Large Texts
In: The 24th Annual ACM Symposium on Applied Computing, 1724-1731 | Proceedings Article | |
| 1 |
| Celikik, Bast, Manolache [-] |
| |
| | 2011 | | Efficient Index-Based Snippet Generation | Unpublished/Draft | |
| 1 |
| |
| | 2004 | | On the Hadwiger's Conjecture for Graph Products | Report | |
| 1 |
| |
| | 2007 | | Multiple pass streaming algorithms for learning mixtures of distributions in $R^d$
In: Algorithmic Learning Theory, 18th International Conference, Proceedings, 16 | Proceedings Article | |
| 1 |
| |
| | 2008 | | Online and offline selling in limit order markets
In: 4th International Workshop on Internet and Network Economics (WINE 2008), 41-52 | Proceedings Article | |
| 1 |
| |
| | 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 | |
| 1 |
| Chan, Dhamdhere, Gupta, Kleinberg, Slivkins [Dhamdhere, Gupta, Kleinberg, Slivkins] |
| |
| | 2009 | | Metric Embeddings with Relaxed Guarantees
In: SIAM Journal on Computing [38], 2303-2329 | Journal Article | |
| 1 |
| Chan, Edmonds, Lam, Lee, Marchetti-Spaccamela, Pruhs [Chan, Edmonds, Lam, Marchetti-Spaccamela, Pruhs] |
| |
| | 2011 | | Nonclairvoyant speed scaling for flow and energy
In: Algorithmica [61], 507-517 | Journal Article | |
| 1 |
| Chan, Edmonds, Lam, Lee, Marchetti-Spaccamela, Pruhs [Edmonds, Lam, Lee, Marchetti-Spaccamela, Pruhs, 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 | |
| 1 |
| Chan, Edmonds, Pruhs [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 | |
| 1 |
| |
