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

MPI-INF D1 Publications

MPI-INF D1 Publications

Entries sorted by: 1. Author,Editor - 2. by Group - 3. by Names Including [Non Members]

Login to this database


 

Previous Page | Next Page | Expand All | Collapse All | Search (Full Text)
Show entries starting with: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

#YearTitleType
1
Hide details for Abed, Huang [Huang, Epstein, Ferragina]Abed, Huang [Huang, Epstein, Ferragina]
2012Preemptive Coordination Mechanisms for Unrelated Machines
In: Algorithms - ESA 2012 : 20th Annual European Symposium, 12-23
Proceedings Article
1
Hide details for Abo-Hasna [-]Abo-Hasna [-]
1994Verdrahtung von Kanälen mit Seitenanschlüssen
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Abraham, Cechlárová, Manlove, Mehlhorn [Abraham, Cechlárová, Manlove, Deng, Du]Abraham, Cechlárová, Manlove, Mehlhorn [Abraham, Cechlárová, Manlove, Deng, Du]
2005Pareto Optimality in House Allocation Problems
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 1163-1175
Proceedings Article
1
Hide details for Abraham, Cechlárová, Manlove, Mehlhorn [Cechlárová, Manlove, Fleischer, Trippen]Abraham, Cechlárová, Manlove, Mehlhorn [Cechlárová, Manlove, Fleischer, Trippen]
2004Attachment IconPareto-optimality in house allocation problems
In: Algorithms and Computation: 15th International Symposium, ISAAC 2004, 3-15
Proceedings Article
1
Hide details for Abraham, Irving, Kavitha, Mehlhorn [Abraham, Irving, Kavitha]Abraham, Irving, Kavitha, Mehlhorn [Abraham, Irving, Kavitha]
2007Attachment IconPopular Matchings
In: SIAM Journal on Computing [37], 1030-1045
Journal Article
1
Hide details for Abraham, Irving, Mehlhorn, Telikepalli [Irving]Abraham, Irving, Mehlhorn, Telikepalli [Irving]
2005Attachment IconPopular Matchings
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 424-432
Proceedings Article
1
Hide details for Adamaszek, Wiese [-]Adamaszek, Wiese [-]
2013Approximation 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
Hide details for Adler, Räcke, Sivadasan, Sohler, Vöcking [Adler, Räcke, Sohler, Widmayer, Triguero, Morales, Hennessy, EidenbeAdler, Räcke, Sivadasan, Sohler, Vöcking [Adler, Räcke, Sohler, Widmayer, Triguero, Morales, Hennessy, Eidenbenz, Conejo]
2002Randomized Pursuit-Evasion in Graphs
In: Automata, Languages and Programming : 29th International Colloquium, ICALP 2002, 901-912
Proceedings Article
1
Hide details for Adler, Räcke, Sivadasan, Sohler, Vöcking [Adler, Räcke, Sohler]Adler, Räcke, Sivadasan, Sohler, Vöcking [Adler, Räcke, Sohler]
2003Attachment IconRandomized Pursuit-Evasion in Graphs
In: Combinatorics, Probability and Computing [12], 225-244
Journal Article
1
Hide details for Afshani, Agrawal, Doerr, Doerr, Larsen, Mehlhorn [Afshani, Agrawal, Larsen, Brodnik, López-Ortiz, Raman, ViolaAfshani, Agrawal, Doerr, Doerr, Larsen, Mehlhorn [Afshani, Agrawal, Larsen, Brodnik, López-Ortiz, Raman, Viola]
2013The Query Complexity of Finding a Hidden Permutation
In: Space-Efficient Data Structures, Streams, and Algorithms, 1-11
Part of a Book
1
Hide details for Afshani, Agrawal, Doerr, Green Larsen, Mehlhorn, Winzen [Afshani, Agrawal, Green Larsen]Afshani, Agrawal, Doerr, Green Larsen, Mehlhorn, Winzen [Afshani, Agrawal, Green Larsen]
2012The 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
Hide details for Agarwal, Agarwal, Chopra, Feldmann, Kammenhuber, Krysta, Vöcking [Agarwal, Agarwal, Chopra, Feldmann, KammenhuAgarwal, Agarwal, Chopra, Feldmann, Kammenhuber, Krysta, Vöcking [Agarwal, Agarwal, Chopra, Feldmann, Kammenhuber, Vöcking, Kosch, Böszörményi, Hellwagner]
2003An experimental study of k-splittable scheduling for DNS-based traffic allocation
In: Euro-Par 2003 parallel processing : 9th International Euro-Par Conference ; proceedings, 230-235
Proceedings Article
1
Hide details for Agarwal, Arge, Brodal, Vitter [Agarwal, Arge, Vitter]Agarwal, Arge, Brodal, Vitter [Agarwal, Arge, Vitter]
1999I/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
Hide details for Agarwal, Hagerup, Ray, Sharir, Smid, Welzl [Agarwal, Hagerup, Sharir, Smid, Welzl, Möhring, Raman]Agarwal, Hagerup, Ray, Sharir, Smid, Welzl [Agarwal, Hagerup, Sharir, Smid, Welzl, Möhring, Raman]
2002Translating a Planar Object to Maximize Point Containment
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 42-53
Proceedings Article
1
Hide details for Agrawal, Saha, Saptharishi, Saxena [Agrawal, Saptharishi, Saxena]Agrawal, Saha, Saptharishi, Saxena [Agrawal, Saptharishi, Saxena]
2012Attachment IconJacobian 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
Hide details for Agrawal, Saha, Saxena [Agrawal, Saxena]Agrawal, Saha, Saxena [Agrawal, Saxena]
2013A Case of Depth-3 Identity Testing, Sparse Factorization and Duality
In: 45th ACM Symposium on the Theory of Computing (STOC-13), toappear
Proceedings Article
2012Attachment IconQuasi-polynomial Hitting-set for Set-depth-Delta Formulas
In: arXiv [abs/1209.2333], 1-13
Electronic Journal Article
1
Hide details for Ahuja, Baltz, Doerr, Privetivy, Srivastav [Ahuja, Baltz, Privetivy, Srivastav, Erlebach, Persiano]Ahuja, Baltz, Doerr, Privetivy, Srivastav [Ahuja, Baltz, Privetivy, Srivastav, Erlebach, Persiano]
2005Attachment IconOn the Minimum Load Coloring Problem
In: Third Workshop on Approximation and Online Algorithms (WAOA 2005), 15-26
Proceedings Article
1
Hide details for Ahuja, Baltz, Doerr, Privetivy, Srivastav [Ahuja, Baltz, Privetivy, Srivastav]Ahuja, Baltz, Doerr, Privetivy, Srivastav [Ahuja, Baltz, Privetivy, Srivastav]
2007On the Minimum Load Coloring Problem
In: Journal of Discrete Algorithms [5], 533-545
Journal Article
1
Hide details for Ahuja, Baltz, Doerr, Srivastav [Ahuja, Baltz, Srivastav]Ahuja, Baltz, Doerr, Srivastav [Ahuja, Baltz, Srivastav]
2004Coloring Graphs with Minimal Load
In: Electronic Notes in Discrete Mathematics [17], 129-133
Journal Article
2
Hide details for Ahuja, Mehlhorn, Orlin, Tarjan [-]Ahuja, Mehlhorn, Orlin, Tarjan [-]
1988Faster Algorithms for the Shortest Path ProblemReport
1988Faster Algorithms for the Shortest Path ProblemReport
1
Hide details for Ahuja, Mehlhorn, Orlin, Tarjan []Ahuja, Mehlhorn, Orlin, Tarjan []
1990Attachment IconFaster algorithms for the shortest path problem
In: Journal of the ACM [37], 213-223
Journal Article
1
Hide details for Ailon, Avigdor-Elgrabli, Liberty, van Zuylen [Ailon, Avigdor-Elgrabli, Liberty, Demetrescu, Halldórsson]Ailon, Avigdor-Elgrabli, Liberty, van Zuylen [Ailon, Avigdor-Elgrabli, Liberty, Demetrescu, Halldórsson]
2011Improved Approximation Algorithms for Bipartite Correlation Clustering
In: Algorithms - ESA 2011 : 19th Annual European Symposium, 25-36
Proceedings Article
1
Hide details for Ailon, Avigdor-Elgrabli, Liberty, van Zuylen [Ailon, Avigdor-Elgrabli, Liberty]Ailon, Avigdor-Elgrabli, Liberty, van Zuylen [Ailon, Avigdor-Elgrabli, Liberty]
2012Improved Approximation Algorithms for Bipartite Correlation Clustering
In: SIAM Journal on Computing [41], 1110-1121
Journal Article
1
Hide details for Ajwani [-]Ajwani [-]
2005Design, Implementation and Experimental Study of External Memory BFS Algorithms
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Ajwani, Dementiev, Meyer [Dementiev]Ajwani, Dementiev, Meyer [Dementiev]
2006Attachment IconA 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
Hide details for Ajwani, Elbassioni, Govindarajan, Ray [Ajwani, Govindarajan]Ajwani, Elbassioni, Govindarajan, Ray [Ajwani, Govindarajan]
2012Conflict-free coloring for rectangle ranges using O(n .382) colors
In: Discrete & Computational Geometry [48], 39-52
Journal Article
1
Hide details for Ajwani, Elbassioni, Govindarajan, Ray [Ray, Gibbons, Scheideler]Ajwani, Elbassioni, Govindarajan, Ray [Ray, Gibbons, Scheideler]
2007Conflict-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
Hide details for Ajwani, Elbassioni, Govindarajan, Ray [Ray, Scheideler]Ajwani, Elbassioni, Govindarajan, Ray [Ray, Scheideler]
2007Conflict-Free Coloring for Rectangle Ranges Using $\tildeO(n^.382+\epsilon)$ Colors
In: 19th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 07), (to-appear)
Proceedings Article
1
Hide details for Ajwani, Friedrich [-]Ajwani, Friedrich [-]
2010Average-case Analysis of Incremental Topological Ordering
In: Discrete Applied Mathematics [158], 240-250
Journal Article
1
Hide details for Ajwani, Friedrich [Tokuyama]Ajwani, Friedrich [Tokuyama]
2007Average-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
Hide details for Ajwani, Friedrich, Meyer [-]Ajwani, Friedrich, Meyer [-]
2008An $O(n^2.75)$ algorithm for incremental topological ordering
In: ACM Transactions on Algorithms [4], 1-14
Journal Article
1
Hide details for Ajwani, Friedrich, Meyer [Arge, Freivalds]Ajwani, Friedrich, Meyer [Arge, Freivalds]
2006Attachment IconAn $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
Hide details for Ajwani, Malinger, Meyer, Toledo [Malinger, Meyer, Toledo, McGeoch]Ajwani, Malinger, Meyer, Toledo [Malinger, Meyer, Toledo, McGeoch]
2008Characterizing 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
Hide details for Ajwani, Meyer, Osipov [Applegate, Brodal]Ajwani, Meyer, Osipov [Applegate, Brodal]
2007Improved external memory BFS implementations
In: 9th Workshop on Algorithm Engineering and Experiments (ALENEX), 3-12
Proceedings Article
1
Hide details for Ajwani, Meyer, Osipov [Meyer, Osipov, Demetrescu, Goldberg, Johnson]Ajwani, Meyer, Osipov [Meyer, Osipov, Demetrescu, Goldberg, Johnson]
2009Breadth first search on massive graphs
In: The shortest path problem : ninth DIMACS implemenation challenge, 291-307
Part of a Book
1
Hide details for Ajwani, Ray, Seidel, Tiwary [Ray, Seidel, Tiwary, Dehne, Sack, Zeh]Ajwani, Ray, Seidel, Tiwary [Ray, Seidel, Tiwary, Dehne, Sack, Zeh]
2007On 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
Hide details for Akbari, Berenbrink, Sauerwald [Akbari, Berenbrink, Kowalski, Panconesi]Akbari, Berenbrink, Sauerwald [Akbari, Berenbrink, Kowalski, Panconesi]
2012A 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
Hide details for Albers [-]Albers [-]
1999Better bounds for online scheduling
In: SIAM Journal on Computing [29], 459-473
Journal Article
1999Online-Algorithmen
Universität des Saarlandes
Thesis - Habilitation thesis
1998A competitive analysis of the list update problem with lookahead
In: Theoretical Computer Science [197], 95-109
Journal Article
1998Improved randomized on-line algorithms for the list update problem
In: SIAM Journal on Computing [27], 682-693
Journal Article
1997Better Bounds for Online Scheduling
In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC-97), 130-139
Proceedings Article
1997On the Influence of Lookahead in Competitive Paging Algorithms
In: Algorithmica [18], 283-305
Journal Article
1995Improved randomized on-line algorithms for the list update problem
In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95), 412-419
Proceedings Article
1
Hide details for Albers, Arora, Khanna [Arora, Khanna]Albers, Arora, Khanna [Arora, Khanna]
1999Page replacement for general caching problems
In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), 31-40
Proceedings Article
1
Hide details for Albers, Charikar, Mitzenmacher [Charikar, Mitzenmacher]Albers, Charikar, Mitzenmacher [Charikar, Mitzenmacher]
1998On 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
Hide details for Albers, Garg, Leonardi [-]Albers, Garg, Leonardi [-]
2000Minimizing stall time in single and parallel disk systems
In: Journal of the ACM [47], 969-986
Journal Article
1
Hide details for Albers, Garg, Leonardi [Garg, Leonardi]Albers, Garg, Leonardi [Garg, Leonardi]
1998Minimizing 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
Hide details for Albers, Hagerup [-]Albers, Hagerup [-]
1997Improved Parallel Integer Sorting without Concurrent Writing
In: Information and Computation [136], 25-51
Journal Article
1
Hide details for Albers, Henzinger [Henzinger]Albers, Henzinger [Henzinger]
1997Exploring Unknown Environments
In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC-97), 416-425
Proceedings Article
1
Hide details for Albers, Koga [Koga, Akl, Dehne, Sack, Santoro]Albers, Koga [Koga, Akl, Dehne, Sack, Santoro]
1995Page migration with limited local memory capacity
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 412-158
Proceedings Article
1
Hide details for Albers, Koga [Koga]Albers, Koga [Koga]
1998New on-line algorithms for the page replication problem
In: Journal of Algorithms [27], 75-96
Journal Article
1
Hide details for Albers, Kursawe [-]Albers, Kursawe [-]
1999Exploring unknown environments with obstacles
In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), 842-843
Proceedings Article
1
Hide details for Albers, Kursawe, Schuierer [Albers, Schuierer]Albers, Kursawe, Schuierer [Albers, Schuierer]
2002Exploring unkown environments with obstacles
In: Algorithmica [32], 123-143
Journal Article
5
Hide details for Albers, Mitzenmacher [Mitzenmacher]Albers, Mitzenmacher [Mitzenmacher]
2000Average-Case Analyses of First Fit and Random Fit Bin Packing
In: Random Structures & Algorithms [16], 240 - 259
Journal Article
1998Average 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
1998Average case analyses of list update algorithms, with applications to data compression
In: Algorithmica [21], 312-329
Journal Article
1997Revisiting the COUNTER algorithms for list update
In: Information Processing Letters [64], 155-160
Journal Article
1996Average 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
Hide details for Albers, von Stengel, Wechner [von Stengel, Wechner]Albers, von Stengel, Wechner [von Stengel, Wechner]
1995A combined BIT and TIMESTAMP algorithm for the list update problem
In: Information Processing Letters [56], 135-139
Journal Article
1
Hide details for Albers, Westbrook [Westbrook, Fiat, Woeginger]Albers, Westbrook [Westbrook, Fiat, Woeginger]
1998Self-organizing data structures
In: Online Algorithms: The State of the Art, 13-51
Part of a Book
1
Hide details for Alberts, Cattaneo, Italiano, Nanni, Zaroliagis [Alberts, Cattaneo, Italiano, Nanni, Battiti, Bertosi]Alberts, Cattaneo, Italiano, Nanni, Zaroliagis [Alberts, Cattaneo, Italiano, Nanni, Battiti, Bertosi]
1998A Software Library of Dynamic Graph Algorithms
In: Proceedings of Workshop on Algorithms and Experiments (ALEX-98), 129-136
Proceedings Article
1
Hide details for Alberts, Gutwenger, Mutzel, Näher [Italiano, Orlando, Alberts, Näher]Alberts, Gutwenger, Mutzel, Näher [Italiano, Orlando, Alberts, Näher]
1997AGD-Library: A Library of Algorithms for Graph Drawing
In: Proceedings of the Workshop on Algorithm Engineering (WAE-97), 112-123
Proceedings Article
2
Hide details for Albrecht, Jung, Mehlhorn (ed.) [-]Albrecht, Jung, Mehlhorn (ed.) [-]
1987Parallel algorithms and architectures (WPAA-87) : international workshopProceedings
1987Parallel algorithms and architectures : International WorkshopProceedings
1
Hide details for Albrecht, Karrenbauer, Xu [Albrecht, Xu]Albrecht, Karrenbauer, Xu [Albrecht, Xu]
2008A 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
Hide details for Alcaraz, Friedrich, Kötzing, Krohmer, Müller, Pauling, Baumbach [Krohmer]Alcaraz, Friedrich, Kötzing, Krohmer, Müller, Pauling, Baumbach [Krohmer]
2012Efficient key pathway mining: combining networks and OMICS data
In: Integrative Biology [4], 756-764
Journal Article
1
Hide details for Alefragis, Goumopoulos, Sanders, Takkula, Wedelin [Alefragis, Goumopoulos, Takkula, Pritchard, Reeve, Wedelin]Alefragis, Goumopoulos, Sanders, Takkula, Wedelin [Alefragis, Goumopoulos, Takkula, Pritchard, Reeve, Wedelin]
1998Parallel Crew Scheduling in PAROS
In: Proceedings of the 4th International Euro-Par Conference (Euro-Par-98), 1104-1113
Proceedings Article
1
Hide details for Alkassar, Böhme, Mehlhorn, Rizkallah [Alkassar, Böhme, Gopalakrishnan, Qadeer]Alkassar, Böhme, Mehlhorn, Rizkallah [Alkassar, Böhme, Gopalakrishnan, Qadeer]
2011Verification of Certifying Computations
In: Computer Aided Verification : 23rd International Conference, CAV 2011, 67-82
Proceedings Article
1
Hide details for Alkassar, Böhme, Mehlhorn, Rizkallah [Alkassar, Böhme]Alkassar, Böhme, Mehlhorn, Rizkallah [Alkassar, Böhme]
2013A Framework for the Verification of Certifying ComputationsUnpublished/Draft
1
Hide details for Alon, Bradford, Fleischer [Alon]Alon, Bradford, Fleischer [Alon]
1996Matching nuts and bolts faster
In: Information Processing Letters [59], 123-127
Journal Article
4
Hide details for Altenkamp, Mehlhorn [-]Altenkamp, Mehlhorn [-]
1980Attachment IconCodes: Unequal Probabilities, Unequal Letter Cost
In: Journal of the ACM [27], 412-427
Journal Article
1978Codes: Unequal Probabilities, Unequal Letter CostReport
1978Codes: Unequal Probabilities, Unequal Letter Cost
In: Automata, languages and programming (ICALP-78): 5th international colloquium, 15-25
Proceedings Article
2
Hide details for Althaus [-]Althaus [-]
2001Curve Reconstruction and the Traveling Salesman Problem
Universität des Saarlandes
Thesis - PhD thesis
1998Attachment IconBerechnung optimaler Steinerbäume in der Ebene
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Althaus, Altmeyer, Naujoks [Althaus, Altmeyer, Becker, Damm, Fränzle, Olderog, Podelski, Wilhelm]Althaus, Altmeyer, Naujoks [Althaus, Altmeyer, Becker, Damm, Fränzle, Olderog, Podelski, Wilhelm]
2010A New Combinatorial Approach to Parametric Path AnalysisReport
1
Hide details for Althaus, Baumann, Schömer, Werth [Baumann, Schömer, Werth]Althaus, Baumann, Schömer, Werth [Baumann, Schömer, Werth]
2007Trunk Packing Revisited
In: Experimental Algorithms, 6th International Workshop, 420-432
Proceedings Article
1
Hide details for Althaus, Bockmayr, Elf, Kasper, Jünger, Mehlhorn [Bockmayr, Elf, Kasper, Jünger, Möhring, Raman]Althaus, Bockmayr, Elf, Kasper, Jünger, Mehlhorn [Bockmayr, Elf, Kasper, Jünger, Möhring, Raman]
2002Attachment IconSCIL - Symbolic Constraints in Integer Linear Programming.
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 75-87
Proceedings Article
3
Hide details for Althaus, Calinescu, Mandoiu, Prasad, Tchervenski, Zelikovsly [Calinescu, Mandoiu, Prasad, Tchervenski, ZelikovAlthaus, Calinescu, Mandoiu, Prasad, Tchervenski, Zelikovsly [Calinescu, Mandoiu, Prasad, Tchervenski, Zelikovsly]
2006Power efficient range assignment for symmetric connectivity in static ad-hoc wireless networks
In: Wireless Networks [12], 287-299
Journal Article
2003Power Efficient Range Assignment in Ad-hoc Wireless
In: Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC-03), 1889-1894
Proceedings Article
2
Hide details for Althaus, Canzar [-]Althaus, Canzar [-]
2008A Lagrangian relaxation approach for the multiple sequence alignment problem
In: Journal of Combinatorial Optimization [16], 127-154
Journal Article
2008LASA: A tool for non-heuristic alignment of multiple sequences
In: Bioinformatics Research and Development (BIRD’08), 489-498
Proceedings Article
1
Hide details for Althaus, Canzar [Canzar, Dress, Xu, Zhu]Althaus, Canzar [Canzar, Dress, Xu, Zhu]
2007A Lagrangian relaxation approach for the multiple sequence alignment problem
In: Combinatorial Optimization and Applications : First International Conference, COCOA 2007, 267-278
Proceedings Article
1
Hide details for Althaus, Canzar, Elbassioni, Karrenbauer, Mestre [-]Althaus, Canzar, Elbassioni, Karrenbauer, Mestre [-]
2008Approximating the Interval Constrained Coloring Problem
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), 210-221
Proceedings Article
1
Hide details for Althaus, Canzar, Elbassioni, Karrenbauer, Mestre [Althaus, Canzar, Karrenbauer, Mestre]Althaus, Canzar, Elbassioni, Karrenbauer, Mestre [Althaus, Canzar, Karrenbauer, Mestre]
2011Approximation Algorithms for the Interval Constrained Coloring Problem
In: Algorithmica [61], 342-361
Journal Article
1
Hide details for Althaus, Canzar, Emmett, Karrenbauer, Marshall, Meyer-Bäse, Zhang [Emmett, Marshall, Meyer-Bäse, Zhang]Althaus, Canzar, Emmett, Karrenbauer, Marshall, Meyer-Bäse, Zhang [Emmett, Marshall, Meyer-Bäse, Zhang]
2008Computing 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
Hide details for Althaus, Caprara, Lenhof, Reinert [Caprara, Lenhof, Reinert, Lenhof]Althaus, Caprara, Lenhof, Reinert [Caprara, Lenhof, Reinert, Lenhof]
2002Multiple 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
Hide details for Althaus, Caprara, Lenhof, Reinert [Caprara, Lenhof, Reinert]Althaus, Caprara, Lenhof, Reinert [Caprara, Lenhof, Reinert]
2006Aligning multiple sequences by cutting planes
In: Mathematical Programming [2006], 387-425
Journal Article
2
Hide details for Althaus, Duchier, Koller, Mehlhorn, Niehren, Thiel [Duchier, Koller, Niehren]Althaus, Duchier, Koller, Mehlhorn, Niehren, Thiel [Duchier, Koller, Niehren]
2003Attachment IconAn Efficient Algorithm for the Configuration Problem of Dominance Graphs
In: Journal of Algorithms [48], 194-219
Journal Article
2001An 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
Hide details for Althaus, Dumitriu [Althaus, Dumitriu, Vahrenhold]Althaus, Dumitriu [Althaus, Dumitriu, Vahrenhold]
2009Fast and Accurate Bounds on Linear Programs
In: Experimental Algorithms : 8th International Symposium on Experimental Algorithms (SEA 2009), 40-50
Proceedings Article
1
Hide details for Althaus, Eisenbrand, Funke, Mehlhorn [-]Althaus, Eisenbrand, Funke, Mehlhorn [-]
2004Attachment IconPoint 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
Hide details for Althaus, Fink [Cook, Schulz]Althaus, Fink [Cook, Schulz]
2002A 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
Hide details for Althaus, Funke, Har-Peled, Könemann, Ramos, Skutella [Har-Peled, Könemann, Ramos]Althaus, Funke, Har-Peled, Könemann, Ramos, Skutella [Har-Peled, Könemann, Ramos]
2005Approximating k-Hop Minimum-Spanning Trees
In: Operations Research Letters [33], 115-120
Journal Article
1
Hide details for Althaus, Karamanis, Koller [Karamanis, Koller]Althaus, Karamanis, Koller [Karamanis, Koller]
2004Computing Locally Coherent Discourses.
In: Proceedings of the conference and workshops, 42nd annual meeting of the Association for Computational Linguistics, 399-406
Proceedings Article
1
Hide details for Althaus, Kohlbacher, Lenhof, Müller [-]Althaus, Kohlbacher, Lenhof, Müller [-]
2000A 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
Hide details for Althaus, Kohlbacher, Lenhof, Müller [Lenhof, Kohlbacher]Althaus, Kohlbacher, Lenhof, Müller [Lenhof, Kohlbacher]
2002A combinatorial approach to protein docking with flexible side chains
In: Journal of Computational Biology [9], 597-612
Journal Article
1
Hide details for Althaus, Kupilas, Naujoks [Althaus, Ogihara, Tarui]Althaus, Kupilas, Naujoks [Althaus, Ogihara, Tarui]
2011On 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
Hide details for Althaus, Mehlhorn [-]Althaus, Mehlhorn [-]
2001Attachment IconTraveling Salesman-Based Curve Reconstruction in Polynomial Time
In: SIAM Journal on Computing [31], 27-66
Journal Article
2000TSP-Based Curve Reconstruction in Polynomial Time
In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00), 686-695
Proceedings Article
1998Attachment IconMaximum Network Flow with Floating Point Arithmetic
In: Information Processing Letters [66], 109-113
Journal Article
1
Hide details for Althaus, Mehlhorn, Näher, Schirra [Naeher]Althaus, Mehlhorn, Näher, Schirra [Naeher]
2000Attachment IconExperiments on curve reconstruction
In: Proceedings of 2nd Workshop on Algorithm Engineering and Experiments (ALENEX-00), 103-114
Electronic Proceedings Article
1
Hide details for Althaus, Naujoks [-]Althaus, Naujoks [-]
2006Attachment IconComputing 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
Hide details for Althaus, Naujoks [McGeoch]Althaus, Naujoks [McGeoch]
2008Reconstructing Phylogenetic Networks with One Recombination
In: Experimental Algorithms, 7th International Workshop, WEA 2008, 275-288
Proceedings Article
1
Hide details for Althaus, Polzin, Vahdati Daneshmand [Jansen, Margraf, Mastrolli, Rolim, Vahdati Daneshmand]Althaus, Polzin, Vahdati Daneshmand [Jansen, Margraf, Mastrolli, Rolim, Vahdati Daneshmand]
2003Improving Linear Programming Approaches for the Steiner Tree Problem
In: Experimental and efficient algorithms : Second International Workshop, WEA 2003, 1-14
Proceedings Article
1
Hide details for Alt, Blum, Mehlhorn, Paul []Alt, Blum, Mehlhorn, Paul []
1991Attachment IconComputing 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
Hide details for Alt, Fleischer, Kaufmann, Mehlhorn, Näher, Schirra, Uhrig []Alt, Fleischer, Kaufmann, Mehlhorn, Näher, Schirra, Uhrig []
1992Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
In: Algorithmica [8], 391-408
Journal Article
1990Approximate 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
Hide details for Alt, Geffert, Mehlhorn []Alt, Geffert, Mehlhorn []
1992Attachment IconA lower bound for the nondeterministic space complexity of context-free recognition
In: Information Processing Letters [42], 25-27
Journal Article
1
Hide details for Alt, Guibas, Mehlhorn, Karp, Wigderson [-]Alt, Guibas, Mehlhorn, Karp, Wigderson [-]
1991Attachment IconA Method for Obtaining Randomized Algorithms with Small Tail ProbabilitiesReport
1
Hide details for Alt, Guibas, Mehlhorn, Karp, Wigderson [Alt, Guibas, Karp, Wigderson]Alt, Guibas, Mehlhorn, Karp, Wigderson [Alt, Guibas, Karp, Wigderson]
1996Attachment IconA Method for Obtaining Randomized Algorithms with Small Tail Probabilities
In: Algorithmica [16], 543-547
Journal Article
4
Hide details for Alt, Hagerup, Mehlhorn, Preparata [-]Alt, Hagerup, Mehlhorn, Preparata [-]
1987Attachment IconDeterministic Simulation of Idealized Parallel Computers on more Realistic Ones
In: Parallel Algorithms and Architectures : International Workshop, 11-15
Proceedings Article
1987Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
In: SIAM Journal on Computing [16], 808-835
Journal Article
1986Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
In: Mathematical Foundations of Computer Science, 12th Symposium (MFCS 1986), 199-208
Proceedings Article
1985Deterministic simulation of idealized parallel computers on more realistic onesReport
6
Hide details for Alt, Mehlhorn [-]Alt, Mehlhorn [-]
1985Attachment IconSearching Semisorted Tables
In: SIAM Journal on Computing [14], 840-848
Journal Article
1979Attachment IconComplexity 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
1978Complexity Arguments in Algebraic Language TheoryReport
1976Attachment IconLower Bounds for the Space Complexity of Context-Free Recognition
In: Third International Colloquium on Automata, Languages and Programming, 338-354
Proceedings Article
1975Attachment IconA Language over a One Symbol Alphabet Requiring only O(log log n) Space
In: SIGACT News [7], 31-33
Journal Article
1975Untere Schranken für den Platzbedarf bei der kontext-freien AnalyseReport
3
Hide details for Alt, Mehlhorn, Munro [-]Alt, Mehlhorn, Munro [-]
1984On the complexity of partial match retrieval
In: Information Processing Letters [19], 61-65
Journal Article
1984Attachment IconPartial match retrieval in implicit data structures
In: Information Processing Letters [19], 61-65
Journal Article
1981Partial Match Retrieval in Implicit Data Structures
In: Mathematical foundations of computer science (MFCS-81) : 10th symposium, ,, 156-161
Proceedings Article
1
Hide details for Alt, Mehlhorn, Wagener, Welzl [-]Alt, Mehlhorn, Wagener, Welzl [-]
1987Convergence, Similarity and Symmetries of Geometric Objects
In: Computational geometry (SCG-87) : 3rd symposium, 308-315
Proceedings Article
1
Hide details for Alt, Mehlhorn, Wagener, Welzl [Alt, Wagener, Welzl]Alt, Mehlhorn, Wagener, Welzl [Alt, Wagener, Welzl]
1987Attachment IconCongruence, similarity and symmetries of geometric objectsReport
1
Hide details for Alt, Mehlhorn, Wagener, Welzl []Alt, Mehlhorn, Wagener, Welzl []
1988Attachment IconCongruence, Similarity, and Symmetries of Geometric Objects
In: Discrete and Computational Geometry [3], 237-256
Journal Article
1
Hide details for Alvarez, Bringmann, Curticapean, Ray [Alvarez, Curticapean, Dey, Whitesides]Alvarez, Bringmann, Curticapean, Ray [Alvarez, Curticapean, Dey, Whitesides]
2012Attachment IconCounting Crossing Free Structures
In: Proceedings of the Twenty-Eight Annual Symposium on Computational Geometry (SCG'12), 61-68
Proceedings Article
1
Hide details for Alvarez, Bringmann, Ray, Seidel [Alvarez, Ray, Seidel]Alvarez, Bringmann, Ray, Seidel [Alvarez, Ray, Seidel]
2013Counting Triangulations Approximately
In: 25th Canadian Conference on Computational Geometry (CCCG-13), 85-89
Proceedings Article
2
Hide details for Amaldi, Iuliano, Jurkiewicz, Mehlhorn, Rizzi [Amaldi, Iuliano, Rizzi, Fiat, Sanders]Amaldi, Iuliano, Jurkiewicz, Mehlhorn, Rizzi [Amaldi, Iuliano, Rizzi, Fiat, Sanders]
2009Breaking the $O(m^2n)$ Barrier for Minimum Cycle Bases
In: Algorithms - ESA 2009 : 17th Annual European Symposium, 301-312
Proceedings Article
2009Breaking 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
Hide details for Amato, Goodrich, Ramos [Amato, Goodrich]Amato, Goodrich, Ramos [Amato, Goodrich]
2000Linear-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
Hide details for Ambalath, Balasundaram, H., Koppula, Misra, Philip, Ramanujan [Ambalath, Balasundaram, H., Koppula, Misra, RamAmbalath, Balasundaram, H., Koppula, Misra, Philip, Ramanujan [Ambalath, Balasundaram, H., Koppula, Misra, Ramanujan, Raman, Saurabh]
2010Attachment IconOn the Kernelization Complexity of Colorful Motifs
In: Parameterized and Exact Computation - 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings, 14-25
Proceedings Article
1
Hide details for Amini, Manjunath [Amini]Amini, Manjunath [Amini]
2010Riemann-Roch for sublattices of the root lattice $A\_n$
In: Electronic Journal of Combinatorics [17], R124,1-R124,50
Electronic Journal Article
1
Hide details for Amini, Peleg, Pérennes, Sau, Saurabh [Peleg, Pérennes, Sau, Saurabh, Bampis, Skutella]Amini, Peleg, Pérennes, Sau, Saurabh [Peleg, Pérennes, Sau, Saurabh, Bampis, Skutella]
2009Degree-Constrained Subgraph Problems: Hardness and Approximation Results
In: Approximation and Online Algorithms : 6th International Workshop, WAOA 2008, 29-42
Proceedings Article
1
Hide details for Amini, Pérennes, Sau [Pérennes, Sau]Amini, Pérennes, Sau [Pérennes, Sau]
2009Hardness and approximation of traffic grooming
In: Theoretical Computer Science [410], 3751-3760
Journal Article
1
Hide details for Anagnostopoulos, Grandoni, Leonardi, Wiese [Anagnostopoulos, Grandoni, Leonardi]Anagnostopoulos, Grandoni, Leonardi, Wiese [Anagnostopoulos, Grandoni, Leonardi]
2013Constant 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
Hide details for Anand, Bringmann, Friedrich, Garg, Kumar [Friedrich, Garg, Kumar, Fomin, Freivalds, Kwiatkowska, Peleg]Anand, Bringmann, Friedrich, Garg, Kumar [Friedrich, Garg, Kumar, Fomin, Freivalds, Kwiatkowska, Peleg]
2013Minimizing maximum (weighted) flow-time on related and unrelated machines
In: Automata, Languages, and Programming - 40th International Colloquium (ICALP-13), 13-24
Proceedings Article
1
Hide details for Anand, Garg, Megow [Anand, Garg, Aceto, Henzinger, Sgall]Anand, Garg, Megow [Anand, Garg, Aceto, Henzinger, Sgall]
2011Meeting deadlines: How much speed suffices?
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011. - Pt. I, 232-243
Proceedings Article
1
Hide details for Andersson, Hagerup, Hastad, Petersson [Andersson, Hastad, Petersson]Andersson, Hagerup, Hastad, Petersson [Andersson, Hastad, Petersson]
2000Tight bounds for searching a sorted array of strings
In: SIAM Journal on Computing [30], 1552-1578
Journal Article
1
Hide details for Andersson, Hagerup, Nilsson, Raman [Andersson, Nilsson, Raman]Andersson, Hagerup, Nilsson, Raman [Andersson, Nilsson, Raman]
1995Sorting in Linear Time?
In: 27th Annual ACM Symposium on Theory of Computing (STOC95), 427-436
Proceedings Article
1
Hide details for Andreou, Fotakis, Nikoletseas, Papadopoulou, Spirakis [Andreou, Nikoletseas, Papadopoulou, Spirakis, Diks, RytAndreou, Fotakis, Nikoletseas, Papadopoulou, Spirakis [Andreou, Nikoletseas, Papadopoulou, Spirakis, Diks, Rytter]
2002Attachment IconOn 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
Hide details for Angelopoulos [-]Angelopoulos [-]
2008A 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
2007Improved 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
Hide details for Angelopoulos [Bampis, Jansen]Angelopoulos [Bampis, Jansen]
2010On 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
Hide details for Angelopoulos [Dehne, Gavrilova, Sack, Tóth]Angelopoulos [Dehne, Gavrilova, Sack, Tóth]
2009Online Priority Steiner Tree Problems
In: Algorithms and Data Structures : 11th International Symposium, WADS 2009, 37-48
Proceedings Article
1
Hide details for Angelopoulos, Borodin [Borodin]Angelopoulos, Borodin [Borodin]
2010Randomized Priority Algorithms
In: Theoretical Computer Science [411], 2542-2558
Journal Article
1
Hide details for Angelopoulos, Doerr, Huber, Panagiotou [-]Angelopoulos, Doerr, Huber, Panagiotou [-]
2009Tight bounds for quasirandom rumor spreading
In: The Electronic Journal of Combinatorics [16], R102,1-R102,19
Electronic Journal Article
2
Hide details for Angelopoulos, Dorrigiv, Lopez-Ortiz [Dorrigiv, Lopez-Ortiz]Angelopoulos, Dorrigiv, Lopez-Ortiz [Dorrigiv, Lopez-Ortiz]
2008List Update with Locality of Reference
In: 8th Latin American Symposium on Theoretical Informatics (LATIN 2008), 399-410
Proceedings Article
2007On 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
Hide details for Angelopoulos, Lopez-Ortiz [Lopez-Ortiz]Angelopoulos, Lopez-Ortiz [Lopez-Ortiz]
2009Intertruptible Algorithms for Multi Problem Solving
In: Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI 09), 380-386
Proceedings Article
1
Hide details for Angelopoulos, Lopez-Ortiz, Hamel [Lopez-Ortiz, Hamel]Angelopoulos, Lopez-Ortiz, Hamel [Lopez-Ortiz, Hamel]
2008Optimal Scheduling of Contract Algorithms with Soft Deadlines
In: 23rd National Conference on Artificial Intelligence (AAAI 2008), 868-873
Proceedings Article
1
Hide details for Angelopoulos, Schweitzer [Mathieu]Angelopoulos, Schweitzer [Mathieu]
2009Paging 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
Hide details for Anshelevich, Bhardwaj, Hoefer [Anshelevich, Bhardwaj, Bodlaender, Italiano]Anshelevich, Bhardwaj, Hoefer [Anshelevich, Bhardwaj, Bodlaender, Italiano]
2013Friendship and Stable Matching.
In: 21st European Symposium on Algorithms (ESA-13), 49-60
Proceedings Article
1
Hide details for Antoniadis, Huang, Ott, Verschae [Antoniadis, Huang, Verschae, Chatterjee, Sgall]Antoniadis, Huang, Ott, Verschae [Antoniadis, Huang, Verschae, Chatterjee, Sgall]
2013How 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
Hide details for Aranov, Asano, Katoh, Mehlhorn, Tokuyama [Aranov, Asano, Katoh, Tokuyama, Fleischer, Trippen]Aranov, Asano, Katoh, Mehlhorn, Tokuyama [Aranov, Asano, Katoh, Tokuyama, Fleischer, Trippen]
2004Attachment IconPolyline Fitting of Planar Points Under Min-sum Criteria
In: Algorithms and Computation: 15th International Symposium, ISAAC 2004, 77-88
Proceedings Article
1
Hide details for Arge, Meyer, Toma [Arge, Toma, Diaz, Karhumäki, Lepistö, Sannella]Arge, Meyer, Toma [Arge, Toma, Diaz, Karhumäki, Lepistö, Sannella]
2004External 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
Hide details for Arge, Meyer, Toma, Zeh [Arge, Toma, Zeh, Dehne, Sack, Tamassia]Arge, Meyer, Toma, Zeh [Arge, Toma, Zeh, Dehne, Sack, Tamassia]
2001On 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
Hide details for Arge, Meyer, Toma, Zeh [Arge, Toma, Zeh]Arge, Meyer, Toma, Zeh [Arge, Toma, Zeh]
2003On external-memory planar depth first search
In: Journal of Graph Algorithms and Applications [7], 105-129
Journal Article
1
Hide details for Arikati, Chaudhuri, Zaroliagis [-]Arikati, Chaudhuri, Zaroliagis [-]
1998All-Pairs Min-Cut in Sparse Networks
In: Journal of Algorithms [29], 82-110
Journal Article
1
Hide details for Arikati, Chaudhuri, Zaroliagis [Thiagarajan]Arikati, Chaudhuri, Zaroliagis [Thiagarajan]
1995All-Pairs Min-Cut in Sparse Networks
In: Foundations of software technology and theoretical computer science (FSTTCS-95) : 15th conference, 363-376
Proceedings Article
1
Hide details for Arikati, Chen, Chew, Das, Smid, Zaroliagis [Arikati, Chen, Chew, Das, Diaz, Serna, Smid]Arikati, Chen, Chew, Das, Smid, Zaroliagis [Arikati, Chen, Chew, Das, Diaz, Serna, Smid]
1996Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane
In: Algorithms - ESA '96: 4th Annual European Symposium, 514-528
Proceedings Article
1
Hide details for Arikati, Dessmark, Lingas, Marathe [Dessmark, Lingas, Marathe, Hirschberg, Myers, Dessmark, Hirschberg, LingasArikati, Dessmark, Lingas, Marathe [Dessmark, Lingas, Marathe, Hirschberg, Myers, Dessmark, Hirschberg, Lingas, Marathe, Myers]
1996Approximation algorithms for maximum two-dimensional pattern matching
In: Combinatorial Pattern Matching: 7th Annual Symposium, CPM96, 348-360
Proceedings Article
1
Hide details for Arikati, Dessmark, Lingas, Marathe [Dessmark, Lingas, Marathe]Arikati, Dessmark, Lingas, Marathe [Dessmark, Lingas, Marathe]
2001Approximation algorithms for maximum two-dimensional pattern matching
In: Theoretical Computer Science [255], 51-62
Journal Article
1
Hide details for Arikati, Maheshwari [Maheshwari]Arikati, Maheshwari [Maheshwari]
1996Realizing degree sequences in parallel
In: SIAM Journal of Computing [9], 317-338
Journal Article
1
Hide details for Arikati, Maheshwari, Zaroliagis [-]Arikati, Maheshwari, Zaroliagis [-]
1997Efficient Computation of implicit representations of sparse graphs
In: Discrete Applied Mathematics [78], 1-16
Journal Article
1
Hide details for Arikati, Mehlhorn [Arikati]Arikati, Mehlhorn [Arikati]
1999Attachment IconA correctness certificate for the Stoer-Wagner min-cut algorithm
In: Information Processing Letters [70], 251-254
Journal Article
1
Hide details for Aronov, Asano, Funke [Aronov, Asano, Tokuyama]Aronov, Asano, Funke [Aronov, Asano, Tokuyama]
2007Optimal 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
Hide details for Aronov, Asano, Katoh, Mehlhorn, Tokuyama [Aronov, Asano, Katoh, Tokuyama]Aronov, Asano, Katoh, Mehlhorn, Tokuyama [Aronov, Asano, Katoh, Tokuyama]
2006Polyline Fitting of Planar Points under Min-sum Criteria
In: International Journal of Computational Geometry and Applications [16], 97-116
Journal Article
1
Hide details for Arumugam, Chandrasekar, Misra, Philip, Saurabh [Arumugam, Chandrasekar, Misra, Saurabh, Iliopoulos, Smyth]Arumugam, Chandrasekar, Misra, Philip, Saurabh [Arumugam, Chandrasekar, Misra, Saurabh, Iliopoulos, Smyth]
2011Attachment IconAlgorithmic Aspects of Dominator Colorings in Graphs
In: Combinatorial Algorithms - 22nd International Workshop, IWOCA 2011, Victoria, BC, Canada, July 20-22, 2011, Revised Selected Papers, 19-30
Proceedings Article
1
Hide details for Arya, Das, Mount, Salowe, Smid [Das, Mount, Salowe]Arya, Das, Mount, Salowe, Smid [Das, Mount, Salowe]
1995Euclidean spanners: short, thin, and lanky
In: 27th Annual ACM Symposium on Theory of Computing (STOC95), 489-498
Proceedings Article
1
Hide details for Arya, Golin, Mehlhorn []Arya, Golin, Mehlhorn []
1999On the Expected Depth of Random Circuits
In: Combinatorics, Probability and Computing [8], 209-228
Journal Article
1
Hide details for Arya, Malamatos, Mount [Arya, Mount, Amenta, Cheong]Arya, Malamatos, Mount [Arya, Mount, Amenta, Cheong]
2006The 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
Hide details for Arya, Malamatos, Mount [Arya, Mount]Arya, Malamatos, Mount [Arya, Mount]
2007A simple entropy-based algorithm for planar point location
In: ACM Transactions on Algorithms [3], 17
Journal Article
2006On the Importance of Idempotence
In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, STOC'06, 564-573
Proceedings Article
2005Space-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
Hide details for Arya, Malamatos, Mount, Wong [Arya, Mount, Wong]Arya, Malamatos, Mount, Wong [Arya, Mount, Wong]
2007Optimal expected-case planar point location
In: SIAM Journal on Computing [37], 584-610
Journal Article
2
Hide details for Arya, Mount [Mount]Arya, Mount [Mount]
2000Approximate range searching
In: Computational Geometry [17], 135-152
Journal Article
1995Approximate range searching
In: 11th Annual ACM Symposium on Computational Geometry (SCG95), 172-181
Proceedings Article
2
Hide details for Arya, Mount, Narayan [Mount, Narayan]Arya, Mount, Narayan [Mount, Narayan]
1996Accounting for boundary effects in nearest neighbor searching
In: Discrete & Computational Geometry [16], 155-176
Journal Article
1995Accounting for boundary effects in nearest neighbor searching
In: 11th Annual ACM Symposium on Computational Geometry (SCG95), 336-344
Proceedings Article
1
Hide details for Arya, Smid [-]Arya, Smid [-]
1997Efficient construction of a bounded degree spanner with low weight
In: Algorithmica [17], 33-54
Journal Article
1
Hide details for Asano, Doerr [Asano]Asano, Doerr [Asano]
2011Memory-constrained algorithms for shortest path problem
In: 23rd Annual Canadian Conference on Computational Geometry (CCCG 2011), 315-319
Proceedings Article
1
Hide details for Ashoff [-]Ashoff [-]
2000Agorithmen der modularen Arithmetik
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Auger, Doerr (ed.) [Auger]Auger, Doerr (ed.) [Auger]
2011Theory of Randomized Search HeuristicsBook
1
Hide details for Auletta, Dinitz, Nutov, Parente [Auletta, Dinitz, Parente]Auletta, Dinitz, Nutov, Parente [Auletta, Dinitz, Parente]
1999A 2-approximation algorithm for finding an optimum 3-vertex-connected spanning subgraph
In: Journal of Algorithms [32], 21-30
Journal Article
1
Hide details for Awerbuch, Azar, Grove, Kao, Krishnan, Vitter [Awerbuch, Azar, Kao, Krishnan, Vitter]Awerbuch, Azar, Grove, Kao, Krishnan, Vitter [Awerbuch, Azar, Kao, Krishnan, Vitter]
1995Load Balancing in the Euclidean Norm
In: 36th Annual Symposium on Foundations of Computer Science, 383-391
Proceedings Article
1
Hide details for Babenko, Gawrychowski, Kociumaka, Starikovskaya [Babenko, Gawrychowski, Kociumaka, Starikovskaya, Kulikov, KuzBabenko, Gawrychowski, Kociumaka, Starikovskaya [Babenko, Gawrychowski, Kociumaka, Starikovskaya, Kulikov, Kuznetsov, Pevzner]
2014Computing 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
Hide details for Bachrach, El-Yaniv, Reinstädtler [Bachrach, El-Yaniv]Bachrach, El-Yaniv, Reinstädtler [Bachrach, El-Yaniv]
2002On the competitive theory and practice of online list accessing algorithms
In: Algorithmica [32], 201-246
Journal Article
1
Hide details for Bacik, Mahajan [Bacik, Du, Li]Bacik, Mahajan [Bacik, Du, Li]
1995Semidefinite programming and its applications to NP problems
In: Computing and Combinatorics: 1st Annual International Conference (COCOON95), 566-575
Proceedings Article
1
Hide details for Backes [-]Backes [-]
1998Berechnung kürzester Gittervektoren
Univesität des Saarlandes
Thesis - Masters thesis
1
Hide details for Bader, Moret, Sanders [Bader, Moret, Fleischer, Moret, Meineche Schmidt]Bader, Moret, Sanders [Bader, Moret, Fleischer, Moret, Meineche Schmidt]
2002Algorithm Engineering for Parallel Computation
In: Experimental Algorithmics, 1-23
Part of a Book
2
Hide details for Banderier [-]Banderier [-]
2001Combinatoire Analytique des chemins et des cartes
Université de Paris 6
Thesis - PhD thesis
2000A Generalized Cover Time for Random Walks on Graphs
In: Proceedings of FPSAC'00, 113-124
Proceedings Article
1
Hide details for Banderier [Bousquet-Mélou, Denise, Flajolet, Gardy, Gouyou-Beauchamps]Banderier [Bousquet-Mélou, Denise, Flajolet, Gardy, Gouyou-Beauchamps]
1999On Generating Functions of Generating Trees
In: Proceedings of FPSAC'99, 40-52
Proceedings Article
2
Hide details for Banderier [Flajolet, Schaeffer, Soria]Banderier [Flajolet, Schaeffer, Soria]
2001Random Maps, Coalescing Saddles, Singularity Analysis, and Airy Phenomena
In: Random Structures & Algorithms [19], 194-246
Journal Article
2000Planar Maps and Airy Phenomena,
In: Proceedings of ICALP'00, 388-402
Proceedings Article
1
Hide details for Banderier [Vardi]Banderier [Vardi]
1999An Introduction to Analytic Number TheoryMiscellaneous
1
Hide details for Banderier, Beier, Mehlhorn [Rovan, Vojtas]Banderier, Beier, Mehlhorn [Rovan, Vojtas]
2003Attachment IconSmoothed Analysis of Three Combinatorial Problems
In: Mathematical foundations of computer science 2003 : 28th International Symposium, MFCS 2003, 198-207
Proceedings Article
1
Hide details for Banderier, Bousquet-Mélou, Denise, Flajolet, Gardy, Gouyou-Beauchamps [Bousquet-Mélou, Denise, Flajolet, GardyBanderier, Bousquet-Mélou, Denise, Flajolet, Gardy, Gouyou-Beauchamps [Bousquet-Mélou, Denise, Flajolet, Gardy, Gouyou-Beauchamps]
2002Generating Functions for Generating Trees
In: Discrete Mathematics [246], 29-55
Journal Article
1
Hide details for Banderier, Flajolet [Flajolet]Banderier, Flajolet [Flajolet]
2002Basic analytic combinatorics of directed lattice paths
In: Theoretical Computer Science [281], 37-80
Journal Article
1
Hide details for Bannai, Gawrychowski, Inenaga, Takeda [Bannai, Inenaga, Takeda, Fischer, Sanders]Bannai, Gawrychowski, Inenaga, Takeda [Bannai, Inenaga, Takeda, Fischer, Sanders]
2013Converting SLP to LZ78 in almost Linear Time
In: Combinatorial Pattern Matching, 24th Annual Symposium (CPM 2013), 38-49
Proceedings Article
1
Hide details for Bansal, Chan [Bansal, Mathieu]Bansal, Chan [Bansal, Mathieu]
2009Weighted 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
Hide details for Bansal, Chan, Pruhs [Bansal, Pruhs, Mathieu]Bansal, Chan, Pruhs [Bansal, Pruhs, Mathieu]
2009Speed 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
Hide details for Bansal, Chan, Pruhs [Bansal, Pruhs]Bansal, Chan, Pruhs [Bansal, Pruhs]
2011Competitive Algorithms for Due Date Schedulin
In: Algorithmica [59], 569-582
Journal Article
1
Hide details for Bansal, Gupta, Li, Mestre, Nagarajan, Rudra [Bansal, Gupta, Li, Nagarajan, Rudra, de Berg, Meyer]Bansal, Gupta, Li, Mestre, Nagarajan, Rudra [Bansal, Gupta, Li, Nagarajan, Rudra, de Berg, Meyer]
2010When 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
Hide details for Bar-Yehuda, Flysher, Mestre, Rawitz [Bar-Yehuda, Flysher, Rawitz, Arge, Hoffmann, Welzl]Bar-Yehuda, Flysher, Mestre, Rawitz [Bar-Yehuda, Flysher, Rawitz, Arge, Hoffmann, Welzl]
2007Approximation of Partial Capacitated Vertex Cover
In: 15th Annual European Symposium on Algorithms, 335-346
Proceedings Article
1
Hide details for Bar-Yehuda, Hermelin, Rawitz [Bar-Yehuda, Rawitz, de Berg, Meyer]Bar-Yehuda, Hermelin, Rawitz [Bar-Yehuda, Rawitz, de Berg, Meyer]
2010Minimum Vertex Cover in Rectangle Graphs
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. I, 255-266
Proceedings Article
1
Hide details for Bar-Yehuda, Hermelin, Rawitz [Bar-Yehuda, Rawitz]Bar-Yehuda, Hermelin, Rawitz [Bar-Yehuda, Rawitz]
2011Minimum vertex cover in rectangle graphs
In: Computational Geometry [44], 356-364
Journal Article
1
Hide details for Bárány, Doerr [Bárány]Bárány, Doerr [Bárány]
2006Attachment IconBalanced partitions of vector sequences
In: Linear Algebra and Its Applications [414], 464-469
Journal Article
1
Hide details for Baraque [-]Baraque [-]
2002Effiziente Multiplikationsverfahren: ein numerischer Vergleich
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Barnes, Edmonds [Edmonds]Barnes, Edmonds [Edmonds]
1998Time-Space Lower Bounds for Directed st-Connectivity on Graph Automata Models
In: SIAM Journal on Computing [27], 1190-1202
Journal Article
1
Hide details for Bartal, Leonardi, Shallom, Sitters [Bartal, Leonardi, Shallom, Diaz, Jansen, Rolim, Zwick]Bartal, Leonardi, Shallom, Sitters [Bartal, Leonardi, Shallom, Diaz, Jansen, Rolim, Zwick]
2006On the value of preemption in scheduling
In: 9th Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX, 39-48
Proceedings Article
1
Hide details for Baruah, Bonifaci, D'Angelo, Li, Marchetti-Spaccamela, Megow, Stougie [Baruah, Bonifaci, D'Angelo, Li, MarchettBaruah, Bonifaci, D'Angelo, Li, Marchetti-Spaccamela, Megow, Stougie [Baruah, Bonifaci, D'Angelo, Li, Marchetti-Spaccamela, Stougie]
2012Scheduling Real-Time Mixed-Criticality Jobs
In: IEEE Transactions on Computers [61], 1140-1152
Journal Article
1
Hide details for Baruah, Bonifaci, D'Angelo, Li, Marchetti-Spaccamela, Megow, Stougie [Baruah, D'Angelo, Li, Marchetti-SpaccameBaruah, Bonifaci, D'Angelo, Li, Marchetti-Spaccamela, Megow, Stougie [Baruah, D'Angelo, Li, Marchetti-Spaccamela, Stougie, Hlinen{
1
Hide details for 'y}, Kucera]'y}, Kucera]
2010Attachment IconScheduling Real-Time Mixed-Criticality Jobs
In: Mathematical Foundations of Computer Science 2010 : 35th International Symposium, MFCS 2010, 90-101
Proceedings Article
1
Hide details for Baruah, Bonifaci, D'Angelo, Marchetti-Spaccamela, van der Ster, Stougie [Baruah, D'Angelo, Marchetti-SpaccamelBaruah, Bonifaci, D'Angelo, Marchetti-Spaccamela, van der Ster, Stougie [Baruah, D'Angelo, Marchetti-Spaccamela, van der Ster, Stougie, Demetrescu, Halldórsson]
2011Attachment IconMixed-criticality scheduling of sporadic task systems
In: Algorithms - ESA 2011 : 19th Annual European Symposium, 555-566
Proceedings Article
1
Hide details for Baruah, Bonifaci, Marchetti-Spaccamela, Stiller [Baruah, Marchetti-Spaccamela, Stiller]Baruah, Bonifaci, Marchetti-Spaccamela, Stiller [Baruah, Marchetti-Spaccamela, Stiller]
2010Attachment IconImproved Multiprocessor Global Schedulability Analysis
In: Real-Time Systems [46], 3-24
Journal Article
1
Hide details for Barve, Grove, Vitter [Barve, Vitter]Barve, Grove, Vitter [Barve, Vitter]
1995An Application-Controlled Paging Algorithm for a Shared Cache
In: 36th Annual Symposium on Foundations of Computer Science, 204-213
Proceedings Article
1
Hide details for Basit, Mustafa, Ray, Raza [Basit, Mustafa, Raza]Basit, Mustafa, Ray, Raza [Basit, Mustafa, Raza]
2010Centerpoints and Tverberg's technique
In: Computational Geometry [43], 593-600
Journal Article
1
Hide details for Bäsken, Brönnimann, Frank, Devillers, Ester, Fabri, Flato, Gärtner, Giezeman, Halperin, Hanniel, Har-Peled, HeBä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]
2001CGAL Reference and User ManualsUnknown Form: eBookForm
7
Hide details for Bast [-]Bast [-]
2009Car 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
2006Intelligente Suche mit garantiert schnellen Antwortzeiten
In: MPG Jahrbuch [?],
Electronic Journal Article
2005Attachment IconPräzisionssuche im homöopathischen Netz
In: Homöopathie-Zeitschrift [I/05], 119-122
Journal Article
2000On Scheduling Parallel Tasks at Twilight
In: Theory of Computing Systems [33], 489-563
Journal Article
2000Attachment IconProvably Optimal Scheduling of Similar Tasks
Universität des Saarlandes
Thesis - PhD thesis
1998Dynamic Scheduling with Incomplete Information
In: Proceedings of the 10th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-98), 182-191
Proceedings Article
1994Fast Parallel Space Allocation, Estimation and Integer Sorting
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Bast [Babaogl, Jelasity, Montresor, van Steen, van Moorsel, Fetzer, Leonardi]Bast [Babaogl, Jelasity, Montresor, van Steen, van Moorsel, Fetzer, Leonardi]
2004Dimension 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
Hide details for Bast [Ferreira, Alt]Bast [Ferreira, Alt]
2002Scheduling at Twilight the Easy Way
In: STACS 2002 : 19th Annual Symposium on Theoretical Aspects of Computer Science, 166-178
Proceedings Article
1
Hide details for Bast, Chitea, Suchanek, Weber [Clarke, Fuhr, Kando]Bast, Chitea, Suchanek, Weber [Clarke, Fuhr, Kando]
2007ESTER: 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
Hide details for Bast, Dietzfelbinger, Hagerup [Dietzfelbinger]Bast, Dietzfelbinger, Hagerup [Dietzfelbinger]
1992A Perfect Parallel Dictionary
In: 17th International Symposium on Mathematical Foundations of Computer Science (MFCS'92), 133-141
Proceedings Article
1
Hide details for Bast, Dupret, Majumdar, Piwowarski [Dupret, Piwowarski, Ackermann, Berendt, Grobelnik, Hotho, Mladenic, SemeraBast, Dupret, Majumdar, Piwowarski [Dupret, Piwowarski, Ackermann, Berendt, Grobelnik, Hotho, Mladenic, Semeraro, Spiliopoulou, Stumme, Svatek, van Someren]
2006Discovering 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
Hide details for Bast, Funke, Matijevic [Demetrescu, Goldberg, Johnson]Bast, Funke, Matijevic [Demetrescu, Goldberg, Johnson]
2009Ultrafast shortest-path queries via transit nodes
In: The shortest path problem : ninth DIMACS implemenation challenge, 175-192
Part of a Book
2006TRANSIT: Ultrafast Shortest-Path Queries with Linear-Time Preprocessing
In: 9th DIMACS Implementation Challenge --- Shortest Path,
Electronic Proceedings Article
1
Hide details for Bast, Funke, Matijevic, Sanders, Schultes [Sanders, Schultes, Applegate, Brodal]Bast, Funke, Matijevic, Sanders, Schultes [Sanders, Schultes, Applegate, Brodal]
2007In 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
Hide details for Bast, Funke, Sanders, Schultes [Sanders, Schultes]Bast, Funke, Sanders, Schultes [Sanders, Schultes]
2007Fast Routing in Road Networks using Transit Nodes
In: Science [316], 566
Journal Article
2
Hide details for Bast, Hagerup [-]Bast, Hagerup [-]
1995Fast Parallel Space Allocation, Estimation, and Integer Sorting
In: Information and Computation [123], 72-110
Journal Article
1991Fast and Reliable Parallel Hashing
In: 3rd Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'91), 50-61
Proceedings Article
1
Hide details for Bast, Hert [-]Bast, Hert [-]
2000The Area Partitioning Problem
In: Proceedings of the 12th Annual Canadian Conference on Computational Geometry (CCCG-00), 163-171
Proceedings Article
1
Hide details for Bast, Majumdar [Marchionini, Moffat, Tait, Baeza-Yates, Ziviani]Bast, Majumdar [Marchionini, Moffat, Tait, Baeza-Yates, Ziviani]
2005Attachment IconWhy Spectral Retrieval Works
In: 28th Annual International Conference on Research and Development in Information Retrieval (SIGIR'05), 11-18
Proceedings Article
1
Hide details for Bast, Majumdar, Schenkel, Theobald, Weikum [-]Bast, Majumdar, Schenkel, Theobald, Weikum [-]
2006Attachment IconIO-Top-k: Index-Access Optimized Top-k Query ProcessingReport
1
Hide details for Bast, Majumdar, Schenkel, Theobald, Weikum [Dayal, Whang, Lomet, Alonso, Lohman, Kersten, Cha, Kim]Bast, Majumdar, Schenkel, Theobald, Weikum [Dayal, Whang, Lomet, Alonso, Lohman, Kersten, Cha, Kim]
2006Attachment IconIO-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
Hide details for Bast, Majumdar, Schenkel, Theobald, Weikum [Voorhees, Buckland]Bast, Majumdar, Schenkel, Theobald, Weikum [Voorhees, Buckland]
2006IO-Top-k at TREC 2006: Terabyte Track
In: The Fifteenth Text Retrieval Conference Proceedings, TREC 2006, 1-5
Electronic Proceedings Article
1
Hide details for Bast, Majumdar, Weber [Majumdar, , , , , , , ]Bast, Majumdar, Weber [Majumdar, , , , , , , ]
2007Efficient interactive query expansion with CompleteSearch
In: 16th Conference on Information and Knowledge Management (CIKM'07), 857-860
Proceedings Article
1
Hide details for Bast, Mehlhorn, Schäfer, Tamaki [-]Bast, Mehlhorn, Schäfer, Tamaki [-]
2003Attachment IconA Heuristic for Dijkstra's Algorithm With Many Targets and its Use in Weighted Matching Algorithms
In: Algorithmica [36], 75-88
Journal Article
1
Hide details for Bast, Mehlhorn, Schäfer, Tamaki [Tamaki, Diekert, Habib]Bast, Mehlhorn, Schäfer, Tamaki [Tamaki, Diekert, Habib]
2004Attachment IconMatching Algorithms Are Fast in Sparse Random Graphs
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 81-92
Proceedings Article
1
Hide details for Bast, Mehlhorn, Schäfer, Tamaki [Tamaki]Bast, Mehlhorn, Schäfer, Tamaki [Tamaki]
2006Attachment IconMatching Algorithms are Fast in Sparse Random Graphs
In: Theory of Computing Systems [39], 3-14
Journal Article
1
Hide details for Bast, Mortensen, Weber [Mortensen, Crestani, Ferragina, Sanderson]Bast, Mortensen, Weber [Mortensen, Crestani, Ferragina, Sanderson]
2006Attachment IconOutput-Sensitive Autocompletion Search
In: String Processing and Information Retrieval : 13th International Conference, SPIRE 2006, 150-162
Proceedings Article
2
Hide details for Bast, Weber [-]Bast, Weber [-]
2007Attachment IconThe 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
2005Don't Compare Averages
In: 4th International Workshop on Efficient and Experimental Algorithms (WEA'05), 67-76
Proceedings Article
1
Hide details for Bast, Weber [Adachi, Shan, Vakali]Bast, Weber [Adachi, Shan, Vakali]
2005Insights from Viewing Ranked Retrieval as Rank Aggregation
In: Workshop on Challenges in Web Information Retrieval and Integration (WIRI'05), 243-248
Proceedings Article
1
Hide details for Bast, Weber [Broder, Maarek]Bast, Weber [Broder, Maarek]
2006When You're Lost For Words: Faceted Search With Autocompletion
In: SIGIR'06 Workshop on Faceted Search, 31-35
Proceedings Article
1
Hide details for Bast, Weber [Efthimiadis, Dumais, Hawking, Järvellin]Bast, Weber [Efthimiadis, Dumais, Hawking, Järvellin]
2006Attachment IconType Less, Find More: Fast Autocompletion Search with a Succinct Index
In: SIGIR 2006: Proceedings of the 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 364-371
Proceedings Article
1
Hide details for Bast, Weber [Gronau]Bast, Weber [Gronau]
2007Managing Helpdesk Tasks with CompleteSearch: A Case Study
In: 4th Conference on Professional Knowledge Management (WM'07), 101-108
Proceedings Article
1
Hide details for Baswana, Biswas, Doerr, Friedrich, Kurur, Neumann [Baswana, Biswas, Friedrich, Kurur, Jansen, Garibay, WiegandBaswana, Biswas, Doerr, Friedrich, Kurur, Neumann [Baswana, Biswas, Friedrich, Kurur, Jansen, Garibay, Wiegand, Wu]
2009Computing 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
Hide details for Baswana, Goyal, Sen [Goyal, Sen, Diekert, Durand]Baswana, Goyal, Sen [Goyal, Sen, Diekert, Durand]
2005Attachment IconAll-pairs nearly 2-approximate shortest paths in $O(n^2 \mathrm polylog n)$ time
In: STACS 2005 : 22nd Annual Symposium on Theoretical Aspects of Computer Science, 666-679
Proceedings Article
1
Hide details for Baswana, Kavitha, Mehlhorn, Pettie [Baswana, Kavitha, Pettie]Baswana, Kavitha, Mehlhorn, Pettie [Baswana, Kavitha, Pettie]
2011Additive Spanners and (α, β)-Spanners
In: ACM Transactions on Algorithms [7], 5:1-5:26
Journal Article
1
Hide details for Baswana, Sen [Sen, Sahni, Mehta]Baswana, Sen [Sen, Sahni, Mehta]
2004Randomized graph data-structures for approximate shortest path problem
In: Handbook of Data Structures and Applications, 38.1-38.19
Part of a Book
2
Hide details for Baswana, Sen [Sen]Baswana, Sen [Sen]
2007A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
In: Random Structures & Algorithms [30], 532-563
Journal Article
2004Attachment IconApproximate 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
Hide details for Baswana, Telikepalli, Mehlhorn, Pettie [-]Baswana, Telikepalli, Mehlhorn, Pettie [-]
2005Attachment IconNew 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
Hide details for Batra, Sharma [Batra]Batra, Sharma [Batra]
2010Bounds on absolute positiveness of multivariate polynomials
In: Journal of Symbolic Computation [45], 617-628
Journal Article
1
Hide details for Baumann, Köhler [Köhler, Fiala, Koubek, Kratochvil]Baumann, Köhler [Köhler, Fiala, Koubek, Kratochvil]
2004Approximating 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
Hide details for Baumbach, Friedrich, Kötzing, Krohmer, Müller, Pauling [Krohmer]Baumbach, Friedrich, Kötzing, Krohmer, Müller, Pauling [Krohmer]
2012Efficient 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
Hide details for Baumgarten, Jung, Mehlhorn [, ]Baumgarten, Jung, Mehlhorn [, ]
1992Dynamic Point Location in General Subdivisions
In: Discrete algorithms (SODA-92) : 3rd annual ACM-SIAM symposium, 250-258
Proceedings Article
1
Hide details for Baumgarten, Jung, Mehlhorn []Baumgarten, Jung, Mehlhorn []
1994Attachment IconDynamic point location in general subdivisions
In: Journal of Algorithms [3], 342-380
Journal Article
2
Hide details for Baus [-]Baus [-]
2005Symbolic Constraints in Linear Integer Programming
Universität des Saarlandes
Thesis - Masters thesis
2004Symbolic Constraints in Linear Integer Programming
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Becchetti, Leonardi, Marchetti-Spaccamela, Schäfer [Becchetti, Leonardi, Marchetti-Spaccamela]Becchetti, Leonardi, Marchetti-Spaccamela, Schäfer [Becchetti, Leonardi, Marchetti-Spaccamela]
2003Scheduling to minimize flow time metrics
In: International Parallel and Distributed Processing Symposium (IPDPS-03), 223b-CDROM
Proceedings Article
1
Hide details for Becchetti, Leonardi, Marchetti-Spaccamela, Schäfer, Vredeveld [Becchetti, Leonardi, Marchetti-Spaccamela, VredBecchetti, Leonardi, Marchetti-Spaccamela, Schäfer, Vredeveld [Becchetti, Leonardi, Marchetti-Spaccamela, Vredeveld]
2003Average 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
Hide details for Becker [-]Becker [-]
2012The Bolzano Method to Isolate the Roots of a Bitstream Polynomial
Universität des Saarlandes
Thesis - Bachelor thesis
1996Allgemeine approximative Kongruenz zweier Punktmengen im R³
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Becker, Degenhardt, Doenhardt, Hertel, Kaninke, Kerber, Mehlhorn, Näher, Rohnert, Winter [-]Becker, Degenhardt, Doenhardt, Hertel, Kaninke, Kerber, Mehlhorn, Näher, Rohnert, Winter [-]
1982Attachment IconA Probabilistic Algorithm for Vertex Connectivity of Graphs
In: Information Processing Letters [15], 135-136
Journal Article
2
Hide details for Becker, Mehlhorn [-]Becker, Mehlhorn [-]
1986Attachment IconAlgorithms for Routing in Planar Graphs
In: Acta Informatica [23], 163-176
Journal Article
1984Attachment IconAlgorithms for routing in planar graphsReport
1
Hide details for Behle [Dress, Xu, Zhu]Behle [Dress, Xu, Zhu]
2007Attachment IconOn threshold BDDs and the optimal variable ordering problem
In: Combinatorial Optimization and Applications : First International Conference, COCOA 2007, 124-135
Proceedings Article
1
Hide details for Behle, Jünger, Liers [Jünger, Liers, Demetrescu]Behle, Jünger, Liers [Jünger, Liers, Demetrescu]
2007Attachment IconA 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
Hide details for Behrens [-]Behrens [-]
2000Solid Modeling durch Boolesche Operationen
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Bei [Chen, Zhang, Halldórsson, Iwama, Kobayashi, Speckmann]Bei [Chen, Zhang, Halldórsson, Iwama, Kobayashi, Speckmann]
2015Solving 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
Hide details for Beier [-]Beier [-]
2004Probabilistic Analysis of Discrete Optimization Problems
Universität des Saarlandes
Thesis - PhD thesis
2000Eine Heuristik für das Gossiping-Problem
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Beier, Czumaj, Krysta, Vöcking [Czumaj, Krysta, Vöcking]Beier, Czumaj, Krysta, Vöcking [Czumaj, Krysta, Vöcking]
2006Attachment IconComputing Equilibria for a Service Provider Game with (Im)perfect Information
In: ACM Transactions on Algorithms [2], 679-706
Journal Article
1
Hide details for Beier, Funke, Matijevic, Sanders [Sanders]Beier, Funke, Matijevic, Sanders [Sanders]
2011Energy-Efficient Paths in Radio Networks
In: Algorithmica [61], 298-319
Journal Article
1
Hide details for Beier, Krysta, Czumaj, Vöcking [Krysta, Czumaj, Vöcking]Beier, Krysta, Czumaj, Vöcking [Krysta, Czumaj, Vöcking]
2004Computing 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
Hide details for Beier, Röglin, Vöcking [Röglin, Vöcking, Fischettim, Williamson]Beier, Röglin, Vöcking [Röglin, Vöcking, Fischettim, Williamson]
2007Attachment IconThe 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
Hide details for Beier, Sanders, Sivadasan [Widmayer, Triguero, Morales, Hennessy, Eidenbenz, Conejo]Beier, Sanders, Sivadasan [Widmayer, Triguero, Morales, Hennessy, Eidenbenz, Conejo]
2002Energy Optimal Routing in Radio Networks Using Geometric Data Structures
In: Automata, Languages and Programming : 29th International Colloquium, ICALP 2002, 366-376
Proceedings Article
1
Hide details for Beier, Sibeyn [Flammini, Nardelli, Proietti, Spirakis]Beier, Sibeyn [Flammini, Nardelli, Proietti, Spirakis]
2000A 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
Hide details for Beier, Vöcking [-]Beier, Vöcking [-]
2003Random Knapsack in Expected Polynomial Time
In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC-03), 232-241
Proceedings Article
1
Hide details for Beier, Vöcking [Berthold]Beier, Vöcking [Berthold]
2004Probabilistic Analysis of Knapsack Core Algorithms
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 461-470
Proceedings Article
2
Hide details for Beier, Vöcking [Vöcking]Beier, Vöcking [Vöcking]
2006Attachment IconAn Experimental Study of Random Knapsack Problems
In: Algorithmica [45], 121-136
Journal Article
2006Attachment IconTypical Properties of Winners and Losers in Discrete Optimization
In: SIAM Journal on Computing [35], 855-881
Journal Article
2
Hide details for Beier, Vöcking []Beier, Vöcking []
2004Random knapsack in expected polynomial time
In: Journal of Computer and System Sciences [69], 306-329
Journal Article
2004Typical 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
Hide details for Bein, Fleischer, Larmore [Bein, Larmore]Bein, Fleischer, Larmore [Bein, Larmore]
2000Limited bookmark randomized online algorithms for the paging problem
In: Information Processing Letters [76], 155-162
Journal Article
2
Hide details for Beldiceanu, Carlsson, Thiel [Beldiceanu, Carlsson]Beldiceanu, Carlsson, Thiel [Beldiceanu, Carlsson]
2003Sweep 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
2002Cost-Filtering Algorithms for the two Sides of the Sum of Weights of Distinct Values ConstraintReport
1
Hide details for Beldiceanu, Guo, Thiel [Beldiceanu, Guo, Walsh, Beldiceanu, Guo, Walsh]Beldiceanu, Guo, Thiel [Beldiceanu, Guo, Walsh, Beldiceanu, Guo, Walsh]
2001Non-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
Hide details for Beldiceanu, Katriel, Thiel [-]Beldiceanu, Katriel, Thiel [-]
2004Attachment IconFiltering algorithms for the Same and UsedBy constraintsReport
1
Hide details for Beldiceanu, Katriel, Thiel [Beldiceanu, Faltings, Petcu, Fages, Rossi]Beldiceanu, Katriel, Thiel [Beldiceanu, Faltings, Petcu, Fages, Rossi]
2005GCC-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
Hide details for Beldiceanu, Katriel, Thiel [Beldiceanu, Régin, Rueher]Beldiceanu, Katriel, Thiel [Beldiceanu, Régin, Rueher]
2004Filtering 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
Hide details for Beldiceanu, Katriel, Thiel [Beldiceanu]Beldiceanu, Katriel, Thiel [Beldiceanu]
2007Filtering Algorithms for the Same and UsedBy Constraints
In: Archives of Control Sciences [to appear], to appear
Journal Article
1
Hide details for Belfrage, Mütze, Spöhel [Belfrage, Mütze]Belfrage, Mütze, Spöhel [Belfrage, Mütze]
2012Probabilistic one-player Ramsey games via deterministic two-player games
In: SIAM Journal on Discrete Mathematics [26], 1031-1049
Journal Article
1
Hide details for Ben-Asher, Schuster, Sibeyn [Ben-Asher, Schuster]Ben-Asher, Schuster, Sibeyn [Ben-Asher, Schuster]
1995Load 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
Hide details for Ben-Zwi, Hermelin, Lokshtanov, Newman [Ben-Zwi, Lokshtanov, Newman]Ben-Zwi, Hermelin, Lokshtanov, Newman [Ben-Zwi, Lokshtanov, Newman]
2011Treewidth governs the complexity of target set selection
In: Discrete Optimization [8], 87-96
Journal Article
2
Hide details for Berberich [-]Berberich [-]
2008Robust and Efficient Software for Problems in 2.5-Dimensional Non-Linear Geometry - Algorithms and Implementations
Universität des Saarlandes
Thesis - PhD thesis
2004Exact Arrangements of Quadric Intersection Curves
Universität des Saarlandes
Thesis - Masters thesis
2
Hide details for Berberich, Caroli, Wolpert [Wolpert]Berberich, Caroli, Wolpert [Wolpert]
2007Exact Computation of Arrangements of Rotated ConicsReport
2007Attachment IconExact Computation of Arrangements of Rotated Conics
In: Proceedings of 23rd European Workshop on Computational Geometry, 231-234
Proceedings Article
1
Hide details for Berberich, Ebert, Fogel, Kettner [Fogel]Berberich, Ebert, Fogel, Kettner [Fogel]
2006Web-site with benchmark instances for planar curve arrangementsReport
1
Hide details for Berberich, Ebert, Kettner [-]Berberich, Ebert, Kettner [-]
2006Definition of file format for benchmark instances for arrangements of QuadricsReport
1
Hide details for Berberich, Eigenwillig, Emiris, Fogel, Hemmer, Halperin, Kakargias, Kettner, Mehlhorn, Pion, Schömer, TeillaudBerberich, Eigenwillig, Emiris, Fogel, Hemmer, Halperin, Kakargias, Kettner, Mehlhorn, Pion, Schömer, Teillaud, Wein, Wolpert [Emiris, Fogel, Hemmer, Halperin, Kakargias, Pion, Schömer, Teillaud, Wein]
2004Attachment IconAn Empirical Comparison of Software for Constructing Arrangements of Curved ArcsReport
1
Hide details for Berberich, Eigenwillig, Fogel, Halperin, Hert, Kettner, Teillaud, Wein [Fogel, Halperin, Teillaud, Wein]Berberich, Eigenwillig, Fogel, Halperin, Hert, Kettner, Teillaud, Wein [Fogel, Halperin, Teillaud, Wein]
2003Specification of the traits classes for CGAL arrangements of curvesReport
1
Hide details for Berberich, Eigenwillig, Hemmer, Hert, Kettner, Mehlhorn, Reichel, Schmitt, Schömer, Weber, Wolpert [Hemmer, HeBerberich, Eigenwillig, Hemmer, Hert, Kettner, Mehlhorn, Reichel, Schmitt, Schömer, Weber, Wolpert [Hemmer, Hert, Schömer]
2004EXACUS: Efficient and Exact Algorithms for Curves and SurfacesReport
1
Hide details for Berberich, Eigenwillig, Hemmer, Hert, Kettner, Mehlhorn, Reichel, Schmitt, Schömer, Wolpert [Hemmer, Hert, SchBerberich, Eigenwillig, Hemmer, Hert, Kettner, Mehlhorn, Reichel, Schmitt, Schömer, Wolpert [Hemmer, Hert, Schömer, Brodal, Leonardi]
2005Attachment IconEXACUS: Efficient and exact algorithms for curves and surfaces
In: 13th Annual European Symposium on Algorithms (ESA 2005), 155-166
Proceedings Article
1
Hide details for Berberich, Eigenwillig, Hemmer, Hert, Mehlhorn, Schömer [Möhring, Raman]Berberich, Eigenwillig, Hemmer, Hert, Mehlhorn, Schömer [Möhring, Raman]
2002Attachment IconA Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 174-186
Proceedings Article
1
Hide details for Berberich, Emeliyanenko [-]Berberich, Emeliyanenko [-]
2008CGAL's Curved Kernel via AnalysisReport
3
Hide details for Berberich, Emeliyanenko, Kobel, Sagraloff [-]Berberich, Emeliyanenko, Kobel, Sagraloff [-]
2013Exact symbolic–numeric computation of planar algebraic curves
In: Theoretical Computer Science [491], 1-32
Journal Article
2012Exact Symbolic-Numeric Computation of Planar Algebraic Curves
In: arXiv [abs/1201.1548v1], 1-46
Electronic Journal Article
2011Arrangement Computation for Planar Algebraic Curves
In: arXiv [abs/1103.4697],
Electronic Journal Article
1
Hide details for Berberich, Emeliyanenko, Kobel, Sagraloff [Moreno Maza]Berberich, Emeliyanenko, Kobel, Sagraloff [Moreno Maza]
2011Arrangement Computation for Planar Algebraic Curves
In: Proceedings of the 4th Internal Workshop on Symbolic-Numeric Computation, 88-98
Proceedings Article
1
Hide details for Berberich, Emeliyanenko, Sagraloff [-]Berberich, Emeliyanenko, Sagraloff [-]
2010An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks
In: CoRR [abs/1010.1386], 1-16
Electronic Journal Article
1
Hide details for Berberich, Emeliyanenko, Sagraloff [Müller-Hannemann, Werneck]Berberich, Emeliyanenko, Sagraloff [Müller-Hannemann, Werneck]
2011An 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
Hide details for Berberich, Fogel, Halperin, Kerber, Setter [Fogel, Halperin, Kerber, Setter]Berberich, Fogel, Halperin, Kerber, Setter [Fogel, Halperin, Kerber, Setter]
2010Arrangements on Parametric Surfaces II: Concretizations and Applications
In: Mathematics in Computer Science [4], 67-91
Journal Article
1
Hide details for Berberich, Fogel, Halperin, Mehlhorn, Wein [Fogel, Halperin, Wein, Arge, Hoffmann, Welzl]Berberich, Fogel, Halperin, Mehlhorn, Wein [Fogel, Halperin, Wein, Arge, Hoffmann, Welzl]
2007Attachment IconSweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step
In: Algorithms - ESA 2007, 15th Annual European Symposium, 645-656
Proceedings Article
2
Hide details for Berberich, Fogel, Halperin, Mehlhorn, Wein [Fogel, Halperin, Wein]Berberich, Fogel, Halperin, Mehlhorn, Wein [Fogel, Halperin, Wein]
2010Arrangements on Parametric Surfaces I: General Framework and Infrastructure
In: Mathematics in Computer Science [4], 45-66
Journal Article
2007Sweeping and Maintaining Two-Dimensional Arrangements on QuadricsReport
1
Hide details for Berberich, Fogel, Halperin, Wein [Fogel, Halperin, Wein]Berberich, Fogel, Halperin, Wein [Fogel, Halperin, Wein]
2007Attachment IconSweeping and Maintaining Two-Dimensional Arrangements on Surfaces
In: Proceedings of 23rd European Workshop on Computational Geometry, 223-226
Proceedings Article
1
Hide details for Berberich, Fogel, Meyer [Fogel]Berberich, Fogel, Meyer [Fogel]
2007Updated Website to include Benchmark Instances for Arrangements of Quadrics and Planar Algebraic CurvesReport
1
Hide details for Berberich, Hagen, Hiller, Moser [Hagen, Hiller, Moser, Müller-Hannemann, Schirra]Berberich, Hagen, Hiller, Moser [Hagen, Hiller, Moser, Müller-Hannemann, Schirra]
2010Experiments
In: Algorithm Engineering : Bridging the Gap between Algorithm Theory and Practice, 325-388
Part of a Book
1
Hide details for Berberich, Halperin, Kerber, Pogalnikova [Halperin, Kerber, Pogalnikova, Hurtado, van Krefeld]Berberich, Halperin, Kerber, Pogalnikova [Halperin, Kerber, Pogalnikova, Hurtado, van Krefeld]
2011Deconstructing Approximate Offsets
In: Proceedings of the 27th Annual Symposium on Computational Geometry (SCG'11), 187-196
Proceedings Article
1
Hide details for Berberich, Halperin, Kerber, Pogalnikova [Halperin, Kerber, Pogalnikova, Vahrenhold]Berberich, Halperin, Kerber, Pogalnikova [Halperin, Kerber, Pogalnikova, Vahrenhold]
2010Polygonal Reconstruction from Approximate Offsets
In: 26th European Workshop on Computational Geometry : Workshop Proceedings, 65-68
Electronic Proceedings Article
2
Hide details for Berberich, Halperin, Kerber, Pogalnikova [Halperin, Kerber, Pogalnikova]Berberich, Halperin, Kerber, Pogalnikova [Halperin, Kerber, Pogalnikova]
2012Deconstructing Approximate Offsets
In: Discrete & Computational Geometry [48], 964-989
Journal Article
2011Deconstructing Approximate Offsets
In: arXiv [abs/1109.2158],
Electronic Journal Article
1
Hide details for Berberich, Hemmer [Hemmer]Berberich, Hemmer [Hemmer]
2007Definition of the 3D Quadrical Kernel ContentReport
1
Hide details for Berberich, Hemmer [Karavelas, Pion, Teillaud, Tsigaridas]Berberich, Hemmer [Karavelas, Pion, Teillaud, Tsigaridas]
2006Prototype implementation of the algebraic kernelReport
2
Hide details for Berberich, Hemmer, Karavelas, Pion, Teillaud, Tsigaridas [Karavelas, Pion, Teillaud, Tsigaridas]Berberich, Hemmer, Karavelas, Pion, Teillaud, Tsigaridas [Karavelas, Pion, Teillaud, Tsigaridas]
2008Prototype implementation of the algebraic kernelReport
2006Interface specification of algebraic kernelReport
1
Hide details for Berberich, Hemmer, Karavelas, Teillaud [Karavelas, Teillaud]Berberich, Hemmer, Karavelas, Teillaud [Karavelas, Teillaud]
2007Revision of interface specification of algebraic kernelReport
1
Hide details for Berberich, Hemmer, Kerber [Hemmer, Kerber, Hurtado, van Krefeld]Berberich, Hemmer, Kerber [Hemmer, Kerber, Hurtado, van Krefeld]
2011A 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
Hide details for Berberich, Hemmer, Kerber [Hemmer, Kerber]Berberich, Hemmer, Kerber [Hemmer, Kerber]
2010A Generic Algebraic Kernel for Non-linear Geometric ApplicationsReport
1
Hide details for Berberich, Hemmer, Kettner, Schömer, Wolpert [Hemmer, Schömer, Mitchell, Rote]Berberich, Hemmer, Kettner, Schömer, Wolpert [Hemmer, Schömer, Mitchell, Rote]
2005An 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
Hide details for Berberich, Kerber [Haines, McGuire]Berberich, Kerber [Haines, McGuire]
2008Attachment IconExact Arrangements on Tori and Dupin Cyclides
In: Proceedings of the 2008 ACM Symposium on Solid and Physical Modeling, 59-66
Proceedings Article
1
Hide details for Berberich, Kerber [Petitjean]Berberich, Kerber [Petitjean]
2008Attachment IconArrangements on Surfaces of Genus One: Tori and Dupin Cyclides
In: 24th European Workshop on Computational Geometry - Collection of Abstracts, 209-212
Proceedings Article
1
Hide details for Berberich, Kerber, Sagraloff [-]Berberich, Kerber, Sagraloff [-]
2010An efficient algorithm for the stratification and triangulation of an algebraic surface
In: Computational Geometry: Theory and Applications (CGTA) [43], 257-278
Journal Article
1
Hide details for Berberich, Kerber, Sagraloff [Petitjean]Berberich, Kerber, Sagraloff [Petitjean]
2008Attachment IconGeometric Analysis of Algebraic Surfaces Based on Planar Arrangements
In: 24th European Workshop on Computational Geometry - Collection of Abstracts, 29-32
Proceedings Article
1
Hide details for Berberich, Kerber, Sagraloff [Teillaud, Welzl]Berberich, Kerber, Sagraloff [Teillaud, Welzl]
2008Attachment IconExact Geometric-Topological Analysis of Algebraic Surfaces
In: Proceedings of the 24th ACM Symposium on Computational Geometry, 164-173
Proceedings Article
1
Hide details for Berberich, Kettner [-]Berberich, Kettner [-]
2007Linear-Time Reordering in a Sweep-line Algorithm for Algebraic Curves Intersecting in a Common PointReport
2
Hide details for Berberich, Meyerovitch [Meyerovitch]Berberich, Meyerovitch [Meyerovitch]
2007Computing Envelopes of QuadricsReport
2007Attachment IconComputing Envelopes of Quadrics
In: Proceedings of 23rd European Workshop on Computational Geometry, 235-238
Proceedings Article
1
Hide details for Berberich, Sagraloff [-]Berberich, Sagraloff [-]
2009A 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
Hide details for Berberich, Sagraloff [Haines, McGuire]Berberich, Sagraloff [Haines, McGuire]
2008Attachment IconA Generic and Flexible Framework for the Geometrical and Topological Analysis of (Algebraic) Surfaces
In: Proceedings of the 2008 ACM Symposium on Solid and Physical Modeling, 171-182
Proceedings Article
1
Hide details for Berenbrink, Cooper, Friedetzky, Friedrich, Sauerwald [Berenbrink, Cooper, Friedetzky, Randall]Berenbrink, Cooper, Friedetzky, Friedrich, Sauerwald [Berenbrink, Cooper, Friedetzky, Randall]
2011Randomized Diffusion for Indivisible Loads
In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 429-439
Proceedings Article
1
Hide details for Berenbrink, Friedetzky, Elsaesser, Nagel, Sauerwald [Berenbrink, Friedetzky, Elsaesser, Nagel, Murlak, SankowsBerenbrink, Friedetzky, Elsaesser, Nagel, Sauerwald [Berenbrink, Friedetzky, Elsaesser, Nagel, Murlak, Sankowski]
2011Faster 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
Hide details for Berenbrink, Hoefer, Sauerwald [Berenbrink, Hoefer, Randall]Berenbrink, Hoefer, Sauerwald [Berenbrink, Hoefer, Randall]
2011Distributed Selfish Load Balancing on Networks
In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 1487-1497
Proceedings Article
1
Hide details for Berghammer, Friedrich, Neumann [Berghammer, Pelikan, Branke]Berghammer, Friedrich, Neumann [Berghammer, Pelikan, Branke]
2010Set-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
Hide details for Berg, Kreveld, Schirra [Berg, Kreveld]Berg, Kreveld, Schirra [Berg, Kreveld]
1995A new approach to subdivision simplification
In: ACSM/ASPRS Annual Convention & Exposition Technical Papers, 79-88
Proceedings Article
1
Hide details for Berman, Krysta [-]Berman, Krysta [-]
2003Optimizing Misdirection
In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 192-201
Proceedings Article
1
Hide details for Berthomé, Duboux, Hagerup, Newman, Schuster [Berthomé, Duboux, Newman, Schuster, Spirakis]Berthomé, Duboux, Hagerup, Newman, Schuster [Berthomé, Duboux, Newman, Schuster, Spirakis]
1995Self-Simulation for the Passive Optical Star Model
In: Algorithms-ESA'95: 3rd Annual European Symposium, 268-380
Proceedings Article
1
Hide details for Bhaskar, Fleischer, Hoy, Huang [Bhaskar, Fleischer, Hoy, Mathieu]Bhaskar, Fleischer, Hoy, Huang [Bhaskar, Fleischer, Hoy, Mathieu]
2009Attachment IconEquilibria of Atomic Flow Games are not Unique
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 748-757
Proceedings Article
1
Hide details for Biedl, Kaufmann, Mutzel [Biedl, Kaufmann, Hromkovic, Sykora]Biedl, Kaufmann, Mutzel [Biedl, Kaufmann, Hromkovic, Sykora]
1998Drawing Planar Partitions II: HH-Drawings
In: Proceedings of the 24th Workshop on Graph-Theoretic Concepts in Computer Science (WG-98), 124-136
Proceedings Article
1
Hide details for Bifet, Castillo, Chirita, Weber [Bifet, Castillo, Chirita, Davison]Bifet, Castillo, Chirita, Weber [Bifet, Castillo, Chirita, Davison]
2005An 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
Hide details for Bilardi, Chaudhuri, Dubhashi, Mehlhorn []Bilardi, Chaudhuri, Dubhashi, Mehlhorn []
1994Attachment IconA lower bound for area-universal graphs
In: Information Processing Letters [51], 101-105
Journal Article
1
Hide details for Birk [-]Birk [-]
1997Lösung von Varianten des Post-Office-Problems mit Hilfe von Skip List Range Trees
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Blanchebarbe [-]Blanchebarbe [-]
1996Untersuchung 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
Hide details for Blelloch, Farzan [Blelloch, Amir, Parida]Blelloch, Farzan [Blelloch, Amir, Parida]
2010Succinct Representations of Separable Graphs
In: Combinatorial Pattern Matching : 21st Annual Symposium, CPM 2010, 138-150
Proceedings Article
3
Hide details for Blum, Mehlhorn [-]Blum, Mehlhorn [-]
1980Attachment IconOn the Average Number of Rebalancing Operations in Weight-Balanced Trees
In: Theoretical Computer Science [11], 303-320
Journal Article
1979Attachment IconMittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten Bäumen
In: Theoretical Computer Science, 4th GI-Conference, 67-78
Proceedings Article
1978On the Average Number of Rebalancing Operations in Weight-Balanced TreesReport
1
Hide details for Böcker, Hüffner, Truss, Wahlström [Böcker, Hüffner, Truss, Chen, Fomin]Böcker, Hüffner, Truss, Wahlström [Böcker, Hüffner, Truss, Chen, Fomin]
2009A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams
In: Parameterized and Exact Computation : 4th International Workshop, IWPEC 2009, 38-49
Proceedings Article
1
Hide details for Bodirsky, Gröpl, Johannsen, Kang [Bodirsky, Gröpl, Kang]Bodirsky, Gröpl, Johannsen, Kang [Bodirsky, Gröpl, Kang]
2007Attachment IconA Direct Decomposition of 3-connected Planar Graphs
In: Séminaire Lotharingien de Combinatoire [B54Ak], 15
Journal Article
1
Hide details for Bodirsky, Kutz [Bodirsky]Bodirsky, Kutz [Bodirsky]
2007Determining the consistency of partial tree descriptions
In: Artificial Intelligence [171], 185-196
Journal Article
1
Hide details for Bodlaender, Deogun, Jansen, Kloks, Kratsch, Müller, Tuza [Bodlaender, Deogun, , Kloks, Kratsch, Müller, Tuza]Bodlaender, Deogun, Jansen, Kloks, Kratsch, Müller, Tuza [Bodlaender, Deogun, , Kloks, Kratsch, Müller, Tuza]
1998Ranking of Graphs
In: SIAM Journal on Discrete Mathematics [11], 168-181
Journal Article
1
Hide details for Bodlaender, Feremans, Grigoriev, Penninkx, Sitters, Wolle [Bodlaender, Feremans, Grigoriev, Penninkx, Wolle, EBodlaender, Feremans, Grigoriev, Penninkx, Sitters, Wolle [Bodlaender, Feremans, Grigoriev, Penninkx, Wolle, Erlebach, Kaklamanis]
2006On the minimum corridor connection and other generalized geometric problems
In: 4th Workshop on Approximation and Online Algorithms, WAOA, 69-82
Proceedings Article
1
Hide details for Bodlaender, Hagerup [Bodlaender, Fülöp, Gecseg]Bodlaender, Hagerup [Bodlaender, Fülöp, Gecseg]
1995Parallel Algorithms with Optimal Speedup for Bounded Treewidth
In: Automata, Languages, and Programming: 22nd International Colloquium (ICALP95), 268-279
Proceedings Article
1
Hide details for Bodlaender, Hagerup [Bodlaender]Bodlaender, Hagerup [Bodlaender]
1998Parallel Algorithms with Optimal Speedup for Bounded Treewidth
In: SIAM Journal on Computing [27], 1725-1746
Journal Article
1
Hide details for Bogdan, Sauerwald, Stauffer, Sun [Bogdan, Stauffer, ]Bogdan, Sauerwald, Stauffer, Sun [Bogdan, Stauffer, ]
2013Balls into Bins via Local Search
In: 24th ACM-SIAM Symposium on Discrete Algorithms (SODA-13), 16-34
Electronic Proceedings Article
1
Hide details for Boghossian, Kohlbacher, Lenhof [Vitter, Zaroliagis]Boghossian, Kohlbacher, Lenhof [Vitter, Zaroliagis]
1999BALL: Biochemical Algorithms Library
In: Algorithm engineering (WAE-99) : 3rd International Workshop, WAE'99, 330-344
Proceedings Article
1
Hide details for Bonifaci, Chan, Marchetti-Spaccamela, Megow [Bonifaci, Chan, Marchetti-Spaccamela]Bonifaci, Chan, Marchetti-Spaccamela, Megow [Bonifaci, Chan, Marchetti-Spaccamela]
2012Algorithms and Complexity for Periodic Real-Time Scheduling
In: ACM Transactions on Algorithms [9], 601-619
Journal Article
1
Hide details for Bonifaci, Chan, Marchetti-Spaccamela, Megow [Marchetti-Spaccamela, Charikar]Bonifaci, Chan, Marchetti-Spaccamela, Megow [Marchetti-Spaccamela, Charikar]
2010Attachment IconAlgorithms and Complexity for Periodic Real-Time Scheduling
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1350-1359
Proceedings Article
1
Hide details for Bonifaci, Harks, Schäfer [Harks, Schäfer]Bonifaci, Harks, Schäfer [Harks, Schäfer]
2010Attachment IconStackelberg Routing in Arbitrary Networks
In: Mathematics of Operations Research [35], 330 - 346
Journal Article
2
Hide details for Bonifaci, Korteweg, Marchetti-Spaccamela, Stougie [Korteweg, Marchetti-Spaccamela, Stougie]Bonifaci, Korteweg, Marchetti-Spaccamela, Stougie [Korteweg, Marchetti-Spaccamela, Stougie]
2011Attachment IconMinimizing Flow Time in the Wireless Gathering Problem
In: ACM Transactions on Algorithms [7], 33:1-33:20
Journal Article
2011Attachment IconThe Distributed Wireless Gathering Problem
In: Theoretical Computer Science [412], 633-641
Journal Article
1
Hide details for Bonifaci, Marchetti-Spaccamela [Marchetti-Spaccamela, de Berg, Meyer]Bonifaci, Marchetti-Spaccamela [Marchetti-Spaccamela, de Berg, Meyer]
2010Attachment IconFeasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. II, 230-241
Proceedings Article
1
Hide details for Bonifaci, Marchetti-Spaccamela [Marchetti-Spaccamela]Bonifaci, Marchetti-Spaccamela [Marchetti-Spaccamela]
2012Attachment IconFeasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems
In: Algorithmica [63], 763-780
Journal Article
1
Hide details for Bonifaci, Marchetti-Spaccamela, Megow, Wiese [Bonifaci, Marchetti-Spaccamela]Bonifaci, Marchetti-Spaccamela, Megow, Wiese [Bonifaci, Marchetti-Spaccamela]
2013Polynomial-Time Exact Schedulability Tests for Harmonic Real-Time Tasks
In: Proceedings of the 34th IEEE Real-Time Systems Symposium (RTSS 2013),
Proceedings Article
1
Hide details for Bonifaci, Marchetti-Spaccamela, Stiller [Marchetti-Spaccamela, Stiller]Bonifaci, Marchetti-Spaccamela, Stiller [Marchetti-Spaccamela, Stiller]
2012Attachment IconA Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
In: Algorithmica [62], 1034-1049
Journal Article
1
Hide details for Bonifaci, Marchetti-Spaccamela, Stiller, Wiese [Bonifaci, Marchetti-Spaccamela, Stiller]Bonifaci, Marchetti-Spaccamela, Stiller, Wiese [Bonifaci, Marchetti-Spaccamela, Stiller]
2013Feasibility Analysis in the Sporadic DAG Task Model
In: Proceedings of the 25th Euromicro Conference on Real-Time Systems (ECRTS 2013),
Proceedings Article
1
Hide details for Bonifaci, Mehlhorn, Varma [Varma, Ravani]Bonifaci, Mehlhorn, Varma [Varma, Ravani]
2012Physarum Can Compute Shortest Paths
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 233-240
Proceedings Article
1
Hide details for Bonifaci, Mehlhorn, Varma [Varma]Bonifaci, Mehlhorn, Varma [Varma]
2012Physarum Can Compute Shortest Paths
In: Journal of Theoretical Biology [309], 121-133
Journal Article
1
Hide details for Boros, Borys, Elbassioni, Gurvich, Makino, Rudolf [Boros, Borys, Gurvich, Makino, Rudolf, Lin]Boros, Borys, Elbassioni, Gurvich, Makino, Rudolf [Boros, Borys, Gurvich, Makino, Rudolf, Lin]
2007Generating Minimal k-Vertex Connected Spanning Subgraphs
In: Computing and Combinatorics, 13th Annual International Conference, COCOON 2007, Proceedings, 222-231
Proceedings Article
1
Hide details for Boros, Elbassioni, Fouz, Gurvich, Makino, Manthey [Boros, Fouz, Gurvich, Makino, Manthey, Aceto, Henzinger, SgBoros, Elbassioni, Fouz, Gurvich, Makino, Manthey [Boros, Fouz, Gurvich, Makino, Manthey, Aceto, Henzinger, Sgall]
2011Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 147-158
Proceedings Article
1
Hide details for Boros, Elbassioni, Gurvich [Boros, Gurvich, Albers, Radzik]Boros, Elbassioni, Gurvich [Boros, Gurvich, Albers, Radzik]
2004Attachment IconAlgorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems
In: Algorithms – ESA 2004: 12th Annual European Symposium, 122-133
Proceedings Article
1
Hide details for Boros, Elbassioni, Gurvich, Khachiyan [Boros, Gurvich, Khachiyan, Farach-Colton]Boros, Elbassioni, Gurvich, Khachiyan [Boros, Gurvich, Khachiyan, Farach-Colton]
2004Attachment IconGenerating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections
In: LATIN 2004: Theoretical Informatics, 6th Latin American Symposium, 488-498
Proceedings Article
1
Hide details for Boros, Elbassioni, Gurvich, Khachiyan [Boros, Gurvich, Khachiyan, George L. Nemhauser, ]Boros, Elbassioni, Gurvich, Khachiyan [Boros, Gurvich, Khachiyan, George L. Nemhauser, ]
2004Attachment IconEnumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems
In: Integer programming and combinatorial optimization : 10th International IPCO Conference, 152-162
Proceedings Article
1
Hide details for Boros, Elbassioni, Gurvich, Khachiyan [Boros, Gurvich, Khachiyan, Ribeiro, Martins]Boros, Elbassioni, Gurvich, Khachiyan [Boros, Gurvich, Khachiyan, Ribeiro, Martins]
2004Attachment IconAn Efficient Implementation of a Joint Generation Algorithm
In: Experimental and efficient algorithms : Third International Workshop, WEA 2004, 114-128
Proceedings Article
1
Hide details for Boros, Elbassioni, Gurvich, Khachiyan [Boros, Gurvich, Khachiyan, Toshihide Ibaraki, Naoki Katoh, ]Boros, Elbassioni, Gurvich, Khachiyan [Boros, Gurvich, Khachiyan, Toshihide Ibaraki, Naoki Katoh, ]
2003Attachment IconAlgorithms for Enumerating Circuits in Matroids.
In: Algorithms and Computation, 14th International Symposium, ISAAC 2003, 485-494
Proceedings Article
1
Hide details for Boros, Elbassioni, Gurvich, Khachiyan, Makino [Boros, Gurvich, Khachiyan, Makino, Fiala, Koubek, Kratochvíl]Boros, Elbassioni, Gurvich, Khachiyan, Makino [Boros, Gurvich, Khachiyan, Makino, Fiala, Koubek, Kratochvíl]
2004Attachment IconGenerating Paths and Cuts in Multi-pole (Di)graphs
In: Mathematical foundations of computer science 2004 : 29th International Symposium, MFCS 2004, 298-309
Proceedings Article
1
Hide details for Boros, Elbassioni, Gurvich, Khachiyan, Makino [Boros, Gurvich, Khachiyan, Makino]Boros, Elbassioni, Gurvich, Khachiyan, Makino [Boros, Gurvich, Khachiyan, Makino]
2003Attachment IconAn Intersection Inequality for Discrete Distributions and Related Generation Problems
In: Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, 543-555
Proceedings Article
1
Hide details for Boros, Elbassioni, Gurvich, Makino [Boros, Gurvich, Makino, Eisenbrand, Shepherd]Boros, Elbassioni, Gurvich, Makino [Boros, Gurvich, Makino, Eisenbrand, Shepherd]
2010A 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
Hide details for Boros, Elbassioni, Gurvich, Makino [Boros, Gurvich, Makino]Boros, Elbassioni, Gurvich, Makino [Boros, Gurvich, Makino]
2012Every Stochastic Game with Perfect Information Admits a Canonical Form
In: 2nd International ICST Conference on Game Theory for Networks (GameNets 2011),
Unpublished/Draft
2012On 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
2011A lower bound for discounting algorithms solving two-person zero-sum limit average payoff stochastic gamesUnpublished/Draft
2010On effectivity functions of game forms
In: Games and Economic Behavior [68], 512-531
Journal Article
2010On Nash Equilibria and Improvement Cycles in Pure Positional Strategies for Chess-like and Backgammon-like $n$-person GamesUnpublished/Draft
2007Generating Vertices of Polyhedra and Related Monotone Generation ProblemsUnpublished/Draft
1
Hide details for Boros, Elbassioni, Gurvich, Makino, Oudalov [Boros, Gurvich, Makino, Oudalov]Boros, Elbassioni, Gurvich, Makino, Oudalov [Boros, Gurvich, Makino, Oudalov]
2008A 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
Hide details for Boros, Elbassioni, Gurvich, Tiwary [Boros, Gurvich, Tiwary]Boros, Elbassioni, Gurvich, Tiwary [Boros, Gurvich, Tiwary]
2011The negative cycles polyhedron and hardness of checking some polyhedral properties
In: Annals of Operations Research [188], 63-76
Journal Article
2008Characterization 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
Hide details for Boros, Elbassioni, Khachiyan, Gurvich [Boros, Gurvich, Khachiyan, Krzysztof Diks, ]Boros, Elbassioni, Khachiyan, Gurvich [Boros, Gurvich, Khachiyan, Krzysztof Diks, ]
2002Attachment IconMatroid Intersections, Polymatroid Inequalities, and Related Problems
In: Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, 143-154
Proceedings Article
5
Hide details for Boros, Elbassioni, Khachiyan, Gurvich [Boros, Gurvich, Khachiyan]Boros, Elbassioni, Khachiyan, Gurvich [Boros, Gurvich, Khachiyan]
2003Attachment IconAn Inequality for Polymatroid Functions and its Applications
In: Discrete Applied mathematics [131], 27
Journal Article
2003Attachment IconExtending the Balas-Yu Bounds on the Number of Maximal Independent Sets in Graphs to Hypergraphs and Lattices
In: Mathematical Programming, Ser. B [98], 14
Journal Article
2002Attachment IconGenerating Dual-Bounded Hypergraphs
In: Optimization Methods and Software [17], 33
Electronic Journal Article
2000Attachment IconAn Efficient Incremental Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension
In: Parallel Processing Letters [10], 14
Journal Article
1
Hide details for Boros, Elbassioni, Khachiyan, Gurvich [Boros, Khachiyan, Gurvich, Giuseppe Di Battista, ]Boros, Elbassioni, Khachiyan, Gurvich [Boros, Khachiyan, Gurvich, Giuseppe Di Battista, ]
2003Attachment IconAn Efficient Implementation of a Quasi-polynomial Algorithm for Generating Hypergraph Transversals
In: Algorithms - ESA 2003, 11th Annual European Symposium, 556-567
Proceedings Article
1
Hide details for Boros, Elbassioni, Khachiyan, Gurvich, Makino [Boros, Gurvich, Khachiyan, Makino, Fernando Orejas, Paul G. SpiBoros, Elbassioni, Khachiyan, Gurvich, Makino [Boros, Gurvich, Khachiyan, Makino, Fernando Orejas, Paul G. Spirakis, ]
2001Attachment IconOn Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities
In: Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, 92-103
Proceedings Article
1
Hide details for Boros, Elbassioni, Khachiyan, Gurvich, Makino [Boros, Gurvich, Khachiyan, Makino]Boros, Elbassioni, Khachiyan, Gurvich, Makino [Boros, Gurvich, Khachiyan, Makino]
2002Attachment IconDual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities
In: SIAM Journal on Computing [31], 20
Journal Article
2
Hide details for Boros, Elbassioni, Makino [Boros, Makino]Boros, Elbassioni, Makino [Boros, Makino]
2010Left-to-right multiplication for monotone Boolean dualization
In: SIAM Journal on Computing [39], 3424-3439
Journal Article
2008On Berge Multiplication for Monotone Boolean Dualization
In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, 48-59
Proceedings Article
1
Hide details for Böttcher, Doerr, Neumann [Böttcher, Schaefer, Cotta, Kolodziej, Rudolph]Böttcher, Doerr, Neumann [Böttcher, Schaefer, Cotta, Kolodziej, Rudolph]
2010Optimal fixed and adaptive mutation rates for the LeadingOnes problem
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 1-10
Proceedings Article
1
Hide details for Boullay [-]Boullay [-]
1996Eine parallelisierbare Heuristik für das Min-Cost-Flow Problem
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Bouziane, El Kahoui [Bouziane]Bouziane, El Kahoui [Bouziane]
2002Attachment IconComputation of the dual of a plane projective curve
In: Journal of Symbolic Computation [34], 105-117
Journal Article
1
Hide details for Bradford, Capoyleas [-]Bradford, Capoyleas [-]
1997Weak epsilon-Nets for Points on a Hypersphere
In: Discrete & Computational Geometry [18], 83-91
Journal Article
1
Hide details for Bradford, Choppela, Rawlins [Baeza-Yates, Choppela, Goles, Poblete, Rawlins]Bradford, Choppela, Rawlins [Baeza-Yates, Choppela, Goles, Poblete, Rawlins]
1995Lower Bounds for the Matrix Chain Ordering Problem
In: LATIN'95: Theoretical Informatics, 2nd Latin American Symposium, 112-130
Proceedings Article
1
Hide details for Bradford, Fleischer [Staples, Eades, Katoh, Moffat]Bradford, Fleischer [Staples, Eades, Katoh, Moffat]
1995Matching nuts and bolts faster
In: Algorithms and Computation: 6th International Symposium (ISAAC'95), 402-408
Proceedings Article
1
Hide details for Bradford, Fleischer, Smid [-]Bradford, Fleischer, Smid [-]
1997More efficient parallel totally monotone matrix searching
In: Journal of Algorithms [23], 386-400
Journal Article
1
Hide details for Bradford, Golin, Larmore [Golin, Larmore]Bradford, Golin, Larmore [Golin, Larmore]
2002Optimal prefix-free codes for unequal letter costs: Dynamic programming with the Monge property
In: Journal of Algorithms [42], 277-303
Journal Article
1
Hide details for Bradford, Golin, Larmore, Rytter [Golin, Larmore, Rytter, Bilardi, Italiano, Pietracaprina]Bradford, Golin, Larmore, Rytter [Golin, Larmore, Rytter, Bilardi, Italiano, Pietracaprina]
1998Optimal 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
Hide details for Bradford, Rawlins, Shannon [Rawlins, Shannon]Bradford, Rawlins, Shannon [Rawlins, Shannon]
1998Efficient Matrix Chain Ordering in Polylog Time
In: SIAM Journal on Computing [27], 466-490
Journal Article
1
Hide details for Bradford, Reinert [Meyer auf der Heide, Monien]Bradford, Reinert [Meyer auf der Heide, Monien]
1996Lower Bounds for Row Minima Searching
In: Automata Languages and Programming: 23rd International Colloquium (ICALP'96), 454-465
Proceedings Article
1
Hide details for Bradonjić, Elsässer, Friedrich, Sauerwald, Stauffer [Bradonjić, Elsässer, Sauerwald, Stauffer, Charikar]Bradonjić, Elsässer, Friedrich, Sauerwald, Stauffer [Bradonjić, Elsässer, Sauerwald, Stauffer, Charikar]
2010Efficient 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
Hide details for Bramer [-]Bramer [-]
2003Zwei Algorithmen zur Bestimmung kostenminimaler Flüsse in Netzwerken
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Brandenburg, Jünger, Mutzel [Brandenburg, Jünger]Brandenburg, Jünger, Mutzel [Brandenburg, Jünger]
1997Algorithmen zum automatischen Zeichnen von Graphen
In: Informatik Spektrum [20], 199-207
Journal Article
1
Hide details for Brandenburg, Jünger, Mutzel, Lengauer [Brandenburg, Jünger, Lengauer]Brandenburg, Jünger, Mutzel, Lengauer [Brandenburg, Jünger, Lengauer]
1997SPP 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
Hide details for Brandenburg, Schreiber, Jünger, Marks, Mutzel [Brandenburg, Schreiber, Jünger, Marks, Kratochvil]Brandenburg, Schreiber, Jünger, Marks, Mutzel [Brandenburg, Schreiber, Jünger, Marks, Kratochvil]
1999Graph Drawing Contest Report
In: Proceedings of the 7th International Symposium on Graph Drawing (GD-99), 400-409
Proceedings Article
1
Hide details for Braun [-]Braun [-]
2000Entwicklung und Test von für statische Graphen optimierte Datentypen
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Bredereck, Nichterlein, Niedermeier, Philip [Bredereck, Nichterlein, Niedermeier, Murlak, Sankowski]Bredereck, Nichterlein, Niedermeier, Philip [Bredereck, Nichterlein, Niedermeier, Murlak, Sankowski]
2011Attachment IconPattern-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
Hide details for Bredereck, Nichterlein, Niedermeier, Philip [Bredereck, Nichterlein, Niedermeier, Owe, Steffen, Telle]Bredereck, Nichterlein, Niedermeier, Philip [Bredereck, Nichterlein, Niedermeier, Owe, Steffen, Telle]
2011Attachment IconThe 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
Hide details for Bremer [-]Bremer [-]
1995Analyse und Simulation eines Maximum-Flow Algorithmus für das Gitter
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Brengel [-]Brengel [-]
2000Externe Prioritätswarteschlangen
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Brengel, Crauser, Meyer, Ferragina [Ferragina, Vitter, Zaroliagis]Brengel, Crauser, Meyer, Ferragina [Ferragina, Vitter, Zaroliagis]
1999An Experimental Study of Priority Queues in External Memory
In: Algorithm engineering (WAE-99) : 3rd International Workshop, WAE'99, 345-359
Proceedings Article
1
Hide details for Breslauer, Jiang, Jiang [Jiang, Jiang]Breslauer, Jiang, Jiang [Jiang, Jiang]
1997Rotations of periodic strings and short superstrings
In: Journal of Algorithms [24], 340-353
Journal Article
1
Hide details for Breslauer, Ramesh []Breslauer, Ramesh []
1996Optimal Parallel Construction of Minimal Suffix and Factor Automata
In: Parallel Processing Letters [6], 35-44
Journal Article
1
Hide details for Brightwell, Panagiotou, Steger [Brightwell, Steger]Brightwell, Panagiotou, Steger [Brightwell, Steger]
2012Extremal subgraphs of random graphs
In: Random Structures & Algorithms [41], 147-178
Journal Article
1
Hide details for Bringmann [-]Bringmann [-]
2012Attachment IconAn improved algorithm for Klee's measure problem on fat boxes
In: Computational Geometry: Theory and Applications [45], 225-233
Journal Article
1
Hide details for Bringmann [Chatterjee, Sgall]Bringmann [Chatterjee, Sgall]
2013Bringing 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
Hide details for Bringmann, Doerr, Neumann, Sliacan [Sliacan, Fomin, Freivalds, Kwiatkowska, Peleg]Bringmann, Doerr, Neumann, Sliacan [Sliacan, Fomin, Freivalds, Kwiatkowska, Peleg]
2013Online Checkpointing with Improved Worst-Case Guarantees
In: Automata, Languages, and Programming - 40th International Colloquium (ICALP 2013), 255-266
Proceedings Article
1
Hide details for Bringmann, Engels, Manthey, Raghavendra Rao [Engels, Manthey, Raghavendra Rao, Chatterjee, Sgall]Bringmann, Engels, Manthey, Raghavendra Rao [Engels, Manthey, Raghavendra Rao, Chatterjee, Sgall]
2013Random 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
Hide details for Bringmann, Friedrich [-]Bringmann, Friedrich [-]
2012Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
In: Theoretical Computer Science [425], 104-116
Journal Article
2012Attachment IconConvergence 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
2010Approximating the volume of unions and intersections of high-dimensional geometric objects
In: Computational Geometry [43], 601-610
Journal Article
1
Hide details for Bringmann, Friedrich [Bringmann, Friedrich, Ehrgott, Fonseca, Gandibleux, Hao, Sevaux]Bringmann, Friedrich [Bringmann, Friedrich, Ehrgott, Fonseca, Gandibleux, Hao, Sevaux]
2009Approximating 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
Hide details for Bringmann, Friedrich [Bringmann, Friedrich, Jansen, Garibay, Paul, Wu]Bringmann, Friedrich [Bringmann, Friedrich, Jansen, Garibay, Paul, Wu]
2009Don'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
Hide details for Bringmann, Friedrich [Bringmann, Schaefer, Cotta, Kolodziej, Rudolph]Bringmann, Friedrich [Bringmann, Schaefer, Cotta, Kolodziej, Rudolph]
2010Tight Bounds for the Approximation Ratio of the Hypervolume Indicator
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 607-616
Proceedings Article
2
Hide details for Bringmann, Friedrich [Bringmann]Bringmann, Friedrich [Bringmann]
2010An Efficient Algorithm for Computing Hypervolume Contributions
In: Evolutionary Computation [18], 383-402
Journal Article
2010The Maximum Hypervolume Set Yields Near-optimal Approximation
In: 12th annual conference on Genetic and evolutionary computation (GECCO 2010), 511-518
Proceedings Article
1
Hide details for Bringmann, Friedrich [Friedrich, Fomin, Freivalds, Kwiatkowska, Peleg]Bringmann, Friedrich [Friedrich, Fomin, Freivalds, Kwiatkowska, Peleg]
2013Exact 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
Hide details for Bringmann, Friedrich [Friedrich]Bringmann, Friedrich [Friedrich]
2013Approximation Quality of the Hypervolume Indicator
In: Artificial Intelligence [195], 265–290
Journal Article
2013Parameterized Average-Case Complexity of the Hypervolume Indicator
In: 15th Annual Conference on Genetic and Evolutionary Computation (GECCO-13), 575-582
Proceedings Article
1
Hide details for Bringmann, Friedrich [Hong, Nagamochi, Fukunaga]Bringmann, Friedrich [Hong, Nagamochi, Fukunaga]
2008Approximating 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
Hide details for Bringmann, Friedrich [Krasnogor, Lanzim]Bringmann, Friedrich [Krasnogor, Lanzim]
2011Convergence of Hypervolume-Based Archiving Algorithms I: Effectiveness
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 745-752
Proceedings Article
1
Hide details for Bringmann, Friedrich, Igel, Voß [Friedrich, Igel, Voß]Bringmann, Friedrich, Igel, Voß [Friedrich, Igel, Voß]
2013Speeding Up Many-Objective Optimization by Monte Carlo Approximations
In: Artificial Intelligence [204], 22–29
Journal Article
1
Hide details for Bringmann, Friedrich, Neumann, Wagner [Neumann, Wagner, Walsh]Bringmann, Friedrich, Neumann, Wagner [Neumann, Wagner, Walsh]
2011Approximation-guided evolutionary multi-objective optimization
In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI 2011), 1198-1203
Proceedings Article
1
Hide details for Bringmann, Green Larsen [Green Larsen]Bringmann, Green Larsen [Green Larsen]
2013Succinct Sampling from Discrete Distributions
In: 45th ACM Symposium on Theory of Computing (STOC-13), 775-782
Proceedings Article
1
Hide details for Bringmann, Mehlhorn, Neumann [-]Bringmann, Mehlhorn, Neumann [-]
2012Attachment IconRemarks on Category-Based Routing in Social NetworksUnpublished/Draft
1
Hide details for Bringmann, Panagiotou [Panagiotou, Czumaj, Pitts, Wattenhofer]Bringmann, Panagiotou [Panagiotou, Czumaj, Pitts, Wattenhofer]
2012Attachment IconEfficient Sampling Methods for Discrete Distributions
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 133-144
Proceedings Article
1
Hide details for Bringmann, Sauerwald, Stauffer, Sun [Sauerwald, Stauffer]Bringmann, Sauerwald, Stauffer, Sun [Sauerwald, Stauffer]
2014Balls 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
Hide details for Brockenauer [-]Brockenauer [-]
1997Separierung von Kuratowski-Ungleichungen für das größte planare Untergraphenproblem
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Brockhoff, Friedrich, Hebbinghaus, Klein, Neumann, Zitzler [Brockhoff, Friedrich, Zitzler]Brockhoff, Friedrich, Hebbinghaus, Klein, Neumann, Zitzler [Brockhoff, Friedrich, Zitzler]
2009On the Effects of Adding Objectives to Plateau Functions
In: IEEE Transactions on Evolutionary Computation [13], 591-603
Journal Article
1
Hide details for Brockhoff, Friedrich, Hebbinghaus, Klein, Neumann, Zitzler [Brockhoff, Zitzler, ]Brockhoff, Friedrich, Hebbinghaus, Klein, Neumann, Zitzler [Brockhoff, Zitzler, ]
2007Do Additional Objectives Make a Problem Harder?
In: Genetic and Evolutionary Computation Conference 2007, 765-772
Proceedings Article
1
Hide details for Brockhoff, Friedrich, Neumann [Brockhoff, Rudolph, Jansen, Lucas, Poloni, Beume]Brockhoff, Friedrich, Neumann [Brockhoff, Rudolph, Jansen, Lucas, Poloni, Beume]
2008Analyzing Hypervolume Indicator Based Algorithms
In: Parallel Problem Solving from Nature (PPSN X), 651-660
Proceedings Article
3
Hide details for Brodal [-]Brodal [-]
1998Finger Search Trees with Constant Update Time
In: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-98), 540-549
Proceedings Article
1997Predecessor Queries in Dynamic Integer Sets
In: Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science (STACS-97), 21-32
Proceedings Article
1996Priority queues on parallel machines
In: 5th Scandinavian Workshop on Algorithm Theory (SWAT96), 416-427
Proceedings Article
1
Hide details for Brodal, Chaudhuri, Radhakrishnan [Radhakrishnan, Karlsson, Lingas]Brodal, Chaudhuri, Radhakrishnan [Radhakrishnan, Karlsson, Lingas]
1996The randomized complexity of maintaining the minimum
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 4-15
Proceedings Article
1
Hide details for Brodal, Chaudhuri, Radhakrishnan [Radhakrishnan]Brodal, Chaudhuri, Radhakrishnan [Radhakrishnan]
1996The randomized complexity of maintaining the minimum
In: Nordic Journal of Computing [3], 337-351
Journal Article
1
Hide details for Brodal, Fagerberg, Meyer, Zeh [Brodal, Fagerberg, Zeh, Hagerup, Katajainen]Brodal, Fagerberg, Meyer, Zeh [Brodal, Fagerberg, Zeh, Hagerup, Katajainen]
2004Cache-oblivious data structures and algorithms for undirected breadth-first search and shortest paths
In: Algorithm theory, SWAT 2004 : 9th Scandinavian Workshop on Algorithm Theory ; Humlebæk, Denmark, July 8-10, 2004 ; proceedings, 480-492
Proceedings Article
1
Hide details for Brodal, Gasieniec [Brodal, Hirschberg, Myers]Brodal, Gasieniec [Brodal, Hirschberg, Myers]
1996Approximate Dictionary Queries
In: Combinatorial Pattern Matching: 7th Annual Symposium (CPM'96), 65-74
Proceedings Article
1
Hide details for Brodal, Kaligosi, Katriel, Kutz [Brodal, Katriel, Moshe, Gabriel]Brodal, Kaligosi, Katriel, Kutz [Brodal, Katriel, Moshe, Gabriel]
2006Faster Algorithms for Computing Longest Common Increasing Subsequences
In: Combinatorial Pattern Matching, 17th Annual Symposium, CPM 2006, 330-341
Proceedings Article
1
Hide details for Brodal, Katajainen [Katajainen, Arnborg, Ivansson]Brodal, Katajainen [Katajainen, Arnborg, Ivansson]
1998Worst-Case Efficient External-Memory Priority Queues
In: Proceedings of the 6th Scandinavian Workshop on Algorithm Theory (SWAT-98), 107-118
Proceedings Article
1
Hide details for Brodal, Pinotti [Pinotti, Arnborg, Ivansson]Brodal, Pinotti [Pinotti, Arnborg, Ivansson]
1998Comparator Networks for Binary Heap Construction
In: Proceedings of the 6th Scandinavian Workshop on Algorithm Theory (SWAT-98), 158-168
Proceedings Article
2
Hide details for Brodal, Träff, Zaroliagis [-]Brodal, Träff, Zaroliagis [-]
1998A 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
1997A parallel priority data structure with applications
In: 11th Internatinal Parallel Processing Symposium (IPPS-97), 689-693
Proceedings Article
2
Hide details for Brönnimann, Burnikel, Pion [Brönnimann, Pion]Brönnimann, Burnikel, Pion [Brönnimann, Pion]
2001Interval arithmetic yields efficient dynamic filters for computational geometry
In: Discrete Applied Mathematics [109], 25-47
Journal Article
1998Interval 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
Hide details for Brönnimann, Kettner, Pocchiola, Snoeyink [Brönnimann, Pocchiola, Snoeyink, Demetrescu, Tamassia, Sedgewick]Brönnimann, Kettner, Pocchiola, Snoeyink [Brönnimann, Pocchiola, Snoeyink, Demetrescu, Tamassia, Sedgewick]
2005Counting 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
Hide details for Brönnimann, Kettner, Pocchiola, Snoeyink [Brönnimann, Pocchiola, Snoeyink]Brönnimann, Kettner, Pocchiola, Snoeyink [Brönnimann, Pocchiola, Snoeyink]
2006Attachment IconCounting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm
In: SIAM Journal on Computing [36], 721-739
Journal Article
1
Hide details for Brönnimann, Kettner, Schirra, Veltkamp [Brönnimann, Kettner, Veltkamp, Jazayeri, Loos, Musser]Brönnimann, Kettner, Schirra, Veltkamp [Brönnimann, Kettner, Veltkamp, Jazayeri, Loos, Musser]
2000Applications 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
Hide details for Brown, El Kahoui, Novotni, Weber [Brown, Novotni, Weber]Brown, El Kahoui, Novotni, Weber [Brown, Novotni, Weber]
2006Attachment IconAlgorithmic methods for investigating equilibria in epidemic modeling
In: Journal of Symbolic Computation [41], 1157-1173
Journal Article
1
Hide details for Buchberger, Mehlhorn, Näher, Nievergelt (ed.) []Buchberger, Mehlhorn, Näher, Nievergelt (ed.) []
1994Special issue on “algorithms: implementation, libraries and use”Book
1
Hide details for Buchheit [-]Buchheit [-]
1999Oberflächenrekonstruktion mithilfe von Voronoi-Diagrammen
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Bundy, Hebbinghaus, Stellmacher [Bundy, Stellmacher]Bundy, Hebbinghaus, Stellmacher [Bundy, Stellmacher]
2006Attachment IconThe Local C(G,T) Theorem
In: Journal of Algebra [300], 741-789
Journal Article
1
Hide details for Burkhardt [-]Burkhardt [-]
2002Filter Algorithms for Approximate String Matching
Universität des Saarlandes
Thesis - PhD thesis
1
Hide details for Burkhardt, Crauser, Ferragina, Lenhof, Rivals, Vingron [Ferragina, Rivals, Vingron, Istrail, Pevzner, WatermanBurkhardt, Crauser, Ferragina, Lenhof, Rivals, Vingron [Ferragina, Rivals, Vingron, Istrail, Pevzner, Waterman]
1999q-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
Hide details for Burkhardt, Kärkkäinen [-]Burkhardt, Kärkkäinen [-]
2003Better Filtering with Gapped q-Grams
In: Fundamenta Informaticae [56], 51-70
Journal Article
1
Hide details for Burkhardt, Kärkkäinen [Amir, Landau]Burkhardt, Kärkkäinen [Amir, Landau]
2001Better Filtering with Gapped q-Grams
In: Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching, 73-85
Proceedings Article
1
Hide details for Burkhardt, Kärkkäinen [R. Baeza-Yates]Burkhardt, Kärkkäinen [R. Baeza-Yates]
2003Attachment IconFast Lightweight Suffix Array Construction and Checking
In: Combinatorial Pattern Matching: 14th Annual Symposium, CPM 2003, 55-69
Proceedings Article
1
Hide details for Burkhardt, Kärkkäinen [Takeda]Burkhardt, Kärkkäinen [Takeda]
2002One-Gapped q-Gram Filters for Levenshtein Distance
In: Combinatorial Pattern Matching : 13th Annual Symposium, CPM 2002, 225-234
Proceedings Article
1
Hide details for Burnikel [-]Burnikel [-]
1996Exact Computation of Voronoi Diagrams and Line Segment Intersections
Universität des Saarlandes
Thesis - PhD thesis
2
Hide details for Burnikel, Fleischer, Mehlhorn, Schirra [-]Burnikel, Fleischer, Mehlhorn, Schirra [-]
2000Attachment IconA strong and easily computable separation bound for arithmetic expressions involving radicals
In: Algorithmica [27], 87-99
Journal Article
1999Attachment IconEfficient exact geometric computation made easy
In: Proceedings of the 15th Annual Symposium on Computational Geometry (SCG-99), 341-350
Proceedings Article
1
Hide details for Burnikel, Funke, Mehlhorn, Schirra, Schmitt [Burnikel, Funke, Schirra]Burnikel, Funke, Mehlhorn, Schirra, Schmitt [Burnikel, Funke, Schirra]
2009A Separation Bound for Real Algebraic Expressions
In: Algorithmica [55], 14-28
Journal Article
1
Hide details for Burnikel, Funke, Mehlhorn, Schirra, Schmitt [Meyer auf der Heide, Burnikel, Schirra]Burnikel, Funke, Mehlhorn, Schirra, Schmitt [Meyer auf der Heide, Burnikel, Schirra]
2001Attachment IconA Separation Bound for Real Algebraic Expressions
In: Proceedings of the 9th Annual European Symposium on Algorithms (ESA-01), 254-265
Proceedings Article
2
Hide details for Burnikel, Funke, Seel [-]Burnikel, Funke, Seel [-]
2001Exact geometric computation using Cascading
In: International Journal of Computational Geometry & Applications [11], 245-266
Journal Article
1998Exact Geometric Predicates using Cascaded Computation
In: Proceedings of the 14th International Annual ACM Symposium on Computational Geometry (SCG-98), 175-183
Proceedings Article
1
Hide details for Burnikel, Könemann, Mehlhorn, Näher, Schirra, Uhrig [Näher]Burnikel, Könemann, Mehlhorn, Näher, Schirra, Uhrig [Näher]
1995Attachment IconExact Geometric Computation in LEDA
In: 11th ACM Symposium on Computational Geometry (SCG95), C18-C19
Proceedings Article
1
Hide details for Burnikel, Mehlhorn, Schirra [-]Burnikel, Mehlhorn, Schirra [-]
1994Attachment IconOn degeneracy in geometric computations
In: Discrete algorithms (SODA-94) : 5th annual ACM-SIAM symposium, 16-23
Proceedings Article
1
Hide details for Burnikel, Mehlhorn, Schirra []Burnikel, Mehlhorn, Schirra []
1994Attachment IconHow 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
Hide details for Busch [-]Busch [-]
2011Analysis of the KIT email graph, with an application of randomized rumour spreading protocols
Universität des Saarlandes
Thesis - Bachelor thesis
1
Hide details for Butman, Hermelin, Lewenstein, Rawitz [Butman, Lewenstein, Rawitz]Butman, Hermelin, Lewenstein, Rawitz [Butman, Lewenstein, Rawitz]
2010Optimization problems in multiple-interval graphs
In: ACM Transactions on Algorithms [6], 40,1-40,18
Journal Article
1
Hide details for Butz [-]Butz [-]
1997Robuste Implementierung eines Algorithmus zur Berechnung eines Voronoi-Diagramms für Polygone
Universitaet des Saarlandes
Thesis - Masters thesis
1
Hide details for Cai, Lu, Xia [Cai, Lu]Cai, Lu, Xia [Cai, Lu]
2013Dichotomy 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
Hide details for Calinescu, Fernandes, Finkler, Karloff [Calinescu, Fernandes, Karloff]Calinescu, Fernandes, Finkler, Karloff [Calinescu, Fernandes, Karloff]
1998A Better Approximation Algorithm for Finding Planar Subgraphs
In: Journal of Algorithms [27], 269-302
Journal Article
1996A better approximation algorithm for finding planar subgraphs
In: 7th ACM-SIAM Symposium on Discrete Algorithms (SODA96), 16-25
Proceedings Article
1
Hide details for Cameron, Johannsen, Prellberg, Schweitzer [Cameron, Prellberg]Cameron, Johannsen, Prellberg, Schweitzer [Cameron, Prellberg]
2008Attachment IconCounting Defective Parking Functions
In: Electronic Journal of Combinatorics [15], R92
Electronic Journal Article
1
Hide details for Canzar, El-Kebir, Pool, Elbassioni, Malde, Mark, Geerke, Stougie, Klau [Canzar, El-Kebir, Pool, Malde, Mark, GCanzar, El-Kebir, Pool, Elbassioni, Malde, Mark, Geerke, Stougie, Klau [Canzar, El-Kebir, Pool, Malde, Mark, Geerke, Stougie, Klau, Chor]
2012Charge Group Partitioning in Biomolecular Simulation
In: Research in Computational Molecular Biology : 16th Annual International Conference, RECOMB 2012, 29-43
Proceedings Article
1
Hide details for Canzar, Elbassioni, Elmasry, Raman [Canzar, Elmasry, Raman, Cheong, Chwa, Park]Canzar, Elbassioni, Elmasry, Raman [Canzar, Elmasry, Raman, Cheong, Chwa, Park]
2010On 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
Hide details for Canzar, Elbassioni, Klau, Mestre [Canzar, Klau, Mestre, Aceto, Henzinger, Sgall]Canzar, Elbassioni, Klau, Mestre [Canzar, Klau, Mestre, Aceto, Henzinger, Sgall]
2011On Tree-Constrained Matchings and Generalizations
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 98-109
Proceedings Article
1
Hide details for Canzar, Elbassioni, Klau, Mestre [Canzar, Klau, Mestre]Canzar, Elbassioni, Klau, Mestre [Canzar, Klau, Mestre]
2011On Tree-Constrained Matchings and GeneralizationsUnpublished/Draft
1
Hide details for Canzar, Elbassioni, Mestre [Canzar]Canzar, Elbassioni, Mestre [Canzar]
2010A 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
Hide details for Canzar, Remy [Remy]Canzar, Remy [Remy]
2006Shape Distributions and Protein Similarity
In: GCB, 1-10
Proceedings Article
1
Hide details for Caragiannis, Fishkin, Kaklamanis, Papaioannou [Caragiannis, Kaklamanis, Papaioannou, Kratochvíl, Díaz, Fiala ]Caragiannis, Fishkin, Kaklamanis, Papaioannou [Caragiannis, Kaklamanis, Papaioannou, Kratochvíl, Díaz, Fiala ]
2007Randomized 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
Hide details for Caragiannis, Fishkin, Kaklamanis, Papaioannou [Caragiannis, Kaklamanis, Papaioannou]Caragiannis, Fishkin, Kaklamanis, Papaioannou [Caragiannis, Kaklamanis, Papaioannou]
2007A tight bound for online colouring of disk graphs
In: Theoretical Computer Science [384], 152-160
Journal Article
2
Hide details for Caroli [-]Caroli [-]
2007Evaluation of a Generic Method for Analyzing Controlled-Perturbation Algorithms
Universität des Saarlandes
Thesis - Masters thesis
2006Exakte Arrangement-Berechnung gedrehter Quadratischer Kurven
Universität des Saarlandes
Thesis - Bachelor thesis
1
Hide details for Case, Kötzing [Case, Hutter, Stephan, Vovk, Zeugmann]Case, Kötzing [Case, Hutter, Stephan, Vovk, Zeugmann]
2010Solutions to Open Questions for Non-U-Shaped Learning with Memory Limitations
In: Algorithmic Learning Theory : 21st International Conference, ALT 2010, 285-299
Proceedings Article
1
Hide details for Case, Kötzing [Case, Kalai, Mohri]Case, Kötzing [Case, Kalai, Mohri]
2010Strongly Non-U-Shaped Learning Results by General Techniques
In: COLT 2010 : The 23rd Conference on Learning Theory, 181-193
Proceedings Article
1
Hide details for Case, Kötzing [Case, Schwentick, Dürr]Case, Kötzing [Case, Schwentick, Dürr]
2011Measuring Learning Complexity with Criteria Epitomizers
In: 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011), 320-331
Electronic Proceedings Article
3
Hide details for Case, Kötzing [Case]Case, Kötzing [Case]
2013Memory-limited non-U-shaped learning with solved open problems
In: Theoretical Computer Science [473], 100-123
Electronic Journal Article
2012Computability-theoretic learning complexity
In: Philosophical Transaction of the Royal Society A [370], 3570-3596
Journal Article
2012Learning secrets interactively. Dynamic modeling in inductive inference
In: Information and Computation [220-221], 60-73
Journal Article
1
Hide details for Celikik, Bast [Karlgren, Tarhio, Hyyrö]Celikik, Bast [Karlgren, Tarhio, Hyyrö]
2009Fast Single-Pass Construction of a Half-Inverted Index
In: String processing and information retrieval : 16th International Symposium, SPIRE 2009, 194-205
Proceedings Article
1
Hide details for Celikik, Bast [Shin]Celikik, Bast [Shin]
2009Attachment IconFast Error-Tolerant Search on Very Large Texts
In: The 24th Annual ACM Symposium on Applied Computing, 1724-1731
Proceedings Article
1
Hide details for Celikik, Bast, Manolache [-]Celikik, Bast, Manolache [-]
2011Attachment IconEfficient Index-Based Snippet GenerationUnpublished/Draft
1
Hide details for Chandran, Sivadasan [-]Chandran, Sivadasan [-]
2004Attachment IconOn the Hadwiger's Conjecture for Graph ProductsReport
1
Hide details for Chang [-]Chang [-]
2007Attachment IconMultiple pass streaming algorithms for learning mixtures of distributions in $R^d$
In: Algorithmic Learning Theory, 18th International Conference, Proceedings, 16
Proceedings Article
1
Hide details for Chang, Johnson [Johnson]Chang, Johnson [Johnson]
2008Attachment IconOnline and offline selling in limit order markets
In: 4th International Workshop on Internet and Network Economics (WINE 2008), 41-52
Proceedings Article
1
Hide details for Chang, Kannan [Kannan]Chang, Kannan [Kannan]
2006Attachment IconThe 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
Hide details for Chan, Dhamdhere, Gupta, Kleinberg, Slivkins [Dhamdhere, Gupta, Kleinberg, Slivkins]Chan, Dhamdhere, Gupta, Kleinberg, Slivkins [Dhamdhere, Gupta, Kleinberg, Slivkins]
2009Metric Embeddings with Relaxed Guarantees
In: SIAM Journal on Computing [38], 2303-2329
Journal Article
1
Hide details for Chan, Edmonds, Lam, Lee, Marchetti-Spaccamela, Pruhs [Chan, Edmonds, Lam, Marchetti-Spaccamela, Pruhs]Chan, Edmonds, Lam, Lee, Marchetti-Spaccamela, Pruhs [Chan, Edmonds, Lam, Marchetti-Spaccamela, Pruhs]
2011Nonclairvoyant speed scaling for flow and energy
In: Algorithmica [61], 507-517
Journal Article
1
Hide details for Chan, Edmonds, Lam, Lee, Marchetti-Spaccamela, Pruhs [Edmonds, Lam, Lee, Marchetti-Spaccamela, Pruhs, Albers, Chan, Edmonds, Lam, Lee, Marchetti-Spaccamela, Pruhs [Edmonds, Lam, Lee, Marchetti-Spaccamela, Pruhs, Albers, Marion]
2009Nonclairvoyant 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
Hide details for Chan, Edmonds, Pruhs [Edmonds, Pruhs]Chan, Edmonds, Pruhs [Edmonds, Pruhs]
2009Speed 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
Show details for Chan, Elbassioni [-]Chan, Elbassioni [-]

Previous Page | Next Page | Expand All | Collapse All | Search (Full Text)