| # |  | Year | Author(s) [non member] | | Title | Type | |
|---|
| 1 |
 | Abdelzaher, Tarek F. (ed.) |
| |
| | 2006 | Funke, Stefan
[Guibas, Leonidas]
[Nguyen, An]
[Wang, Yusu] | | Distance-Sensitive Information Brokerage in Sensor Networks
In: Distributed Computing in Sensor Systems, Second IEEE International Conference, DCOSS 2006, 234-251 | Proceedings Article | |
| 1 |
| Abed, Fidaa |
| |
| | 2012 | Abed, Fidaa
[Huang, Chien-Chung] | | Preemptive Coordination Mechanisms for Unrelated Machines
In: Algorithms - ESA 2012 : 20th Annual European Symposium, 12-23 | Proceedings Article | |
| 1 |
| Abello, James |
| |
| | 2002 | [Sibeyn, Jop F.]
[Abello, James]
Meyer, Ulrich | | Heuristics for Semi-External Depth First Search on Directed Graphs
In: SPAA 2002 : Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 282-292 | Proceedings Article | |
| 1 |
| Abello, James M. (ed.) |
| |
| | 1999 | Crauser, Andreas
[Ferragina, Paolo]
Mehlhorn, Kurt
Meyer, Ulrich
Ramos, Edgar A. | | I/O-optimal computation of segment intersections
In: Proceedings of the DIMACS Workshop on External Algorithms and Visualization, 131-138 | Proceedings Article | |
| 1 |
| Abo-Hasna, Ziad |
| |
| | 1994 | Abo-Hasna, Ziad | | Verdrahtung von Kanälen mit Seitenanschlüssen
Universität des Saarlandes | Thesis - Masters thesis | |
| 2 |
| Abraham, David |
| |
| | 2005 | Abraham, David
[Irving, Robert W.]
Mehlhorn, Kurt
Telikepalli, Kavitha |  | Popular Matchings
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 424-432 | Proceedings Article | |
| | 2004 | Abraham, David
[Cechlárová, Katarina]
[Manlove, David F.]
Mehlhorn, Kurt | | Pareto-optimality in house allocation problems
In: Algorithms and Computation: 15th International Symposium, ISAAC 2004, 3-15 | Proceedings Article | |
| 2 |
| |
| | 2007 | [Abraham, David J.]
[Irving, Robert W.]
[Kavitha, Telikepalli]
Mehlhorn, Kurt | | Popular Matchings
In: SIAM Journal on Computing [37], 1030-1045 | Journal Article | |
| | 2005 | [Abraham, David J.]
[Cechlárová, Katarína]
[Manlove, David]
Mehlhorn, Kurt | | Pareto Optimality in House Allocation Problems
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 1163-1175 | Proceedings Article | |
| 4 |
| Abramsky, Samson (ed.) |
| |
| | 2010 | [Christodoulou, Giorgos]
[Ligett, Katrina]
Pyrga, Evangelia | | Contention Resolution under Selfishness
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010. - Pt. II, 430-441 | Proceedings Article | |
| | 2010 | [Epstein, Leah]
[Levin, Asaf]
van Stee, Rob | | Max-min online allocations with a reordering buffer
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010, 336-347 | Proceedings Article | |
| | 2010 | Fountoulakis, Nikolaos
Panagiotou, Konstantinos | | Orientability of random hypergraphs and the power of multiple choices
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010. - Pt. 1, 348-359 | Proceedings Article | |
| | 2010 | Kratsch, Stefan
Wahlström, Magnus | | Preprocessing of Min Ones Problems: A Dichotomy
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010, 653-665 | Proceedings Article | |
| 8 |
| |
| | 2011 | Doerr, Benjamin
[Fouz, Mahmoud] | | Asymptotically Optimal Randomized Rumor Spreading
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 502-513 | Proceedings Article | |
| | 2011 | Hermelin, Danny
[Levy, Avivit]
[Weimann, Oren]
[Yuster, Raphael] | | Distance Oracles for Vertex-Labeled Graphs
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 490-501 | Proceedings Article | |
| | 2011 | Hermelin, Danny
[Mnich, Matthias]
[van Leeuwen, Erik Jan]
[Woeginger, Gerhard J.] | | Domination When the Stars Are Out
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 462-473 | Proceedings Article | |
| | 2011 | [Anand, S.]
[Garg, Naveen]
Megow, Nicole | | Meeting deadlines: How much speed suffices?
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011. - Pt. I, 232-243 | Proceedings Article | |
| | 2011 | [Canzar,Stefan]
Elbassioni, Khaled
[Klau, Gunnar W.]
[Mestre, Julian] | | On Tree-Constrained Matchings and Generalizations
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 98-109 | Proceedings Article | |
| | 2011 | Megow, Nicole
Mehlhorn, Kurt
Schweitzer, Pascal | | Online Graph Exploration: New Results on Old and New Algorithms
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 478-489 | Proceedings Article | |
| | 2011 | [Boros, Endre]
Elbassioni, Khaled
[Fouz, Mahmoud]
[Gurvich, Vladimir]
[Makino, Kazuhisa]
[Manthey, Bodo] | | Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 147-158 | Proceedings Article | |
| | 2008 | Christodoulou, George
[Kovács, Annamária]
[Schapira, Michael] | | Bayesian Combinatorial Auctions
In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I, 820-832 | Proceedings Article | |
| 1 |
| Ackermann, Markus (ed.) |
| |
| | 2006 | Bast, Holger
[Dupret, Georges]
Majumdar, Debapriyo
[Piwowarski, Benjamin] | | Discovering a Term Taxonomy from Term Similarities Using Principal Component Analysis
In: Semantics, web and mining : Joint International Workshops, EWMF 2005 and KDO 2005, 103-120 | Proceedings Article | |
| 1 |
| Adacher, Ludovica (ed.) |
| |
| | 2011 | van Zuylen, Anke
[Schalekamp, Frans]
[Williamson, David P.] | | Popular Ranking
In: 10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2011, 267-270 | Electronic Proceedings Article | |
| 1 |
| Adachi, Jun (ed.) |
| |
| | 2005 | Bast, Holger
Weber, Ingmar | | Insights from Viewing Ranked Retrieval as Rank Aggregation
In: Workshop on Challenges in Web Information Retrieval and Integration (WIRI'05), 243-248 | Proceedings Article | |
| 1 |
| Adamaszek, Anna |
| |
| | 2013 | Adamaszek, Anna
Wiese, Andreas | | Approximation Schemes for Maximum Weight Independent Set of Rectangles
In: Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2013), | Proceedings Article | |
| 2 |
| Adler, Micah |
| |
| | 2003 | [Adler, Micah]
[Räcke, Harald]
Sivadasan, Naveen
[Sohler, Christian]
Vöcking, Berthold | | Randomized Pursuit-Evasion in Graphs
In: Combinatorics, Probability and Computing [12], 225-244 | Journal Article | |
| | 2002 | [Adler, Micah]
[Räcke, Harald]
Sivadasan, Naveen
[Sohler, Christian]
Vöcking, Berthold | | Randomized Pursuit-Evasion in Graphs
In: Automata, Languages and Programming : 29th International Colloquium, ICALP 2002, 901-912 | Proceedings Article | |
| 1 |
| |
| | 2013 | [Dams, Johannes]
Hoefer, Martin
[Kesselheim, Thomas] | | Sleeping Experts in Wireless Networks
In: 27th International Symposium on Distributed Computing (DISC-13), 344-357 | Proceedings Article | |
| 1 |
| |
| | 1997 | Gunopulos, Dimitrios
Mannila, Heikki
Saluja, Sanjeev | | Discovering all most specific sentences by randomized algorithms
In: Proceedings of the 6th International Conference on Database Theory (ICDT-97), 215-229 | Proceedings Article | |
| 2 |
| |
| | 2013 | [Afshani, Peyman]
[Agrawal, Manindra]
Doerr, Benjamin
Doerr, Carola
[Larsen, Kasper Green]
Mehlhorn, Kurt | | The Query Complexity of Finding a Hidden Permutation
In: Space-Efficient Data Structures, Streams, and Algorithms, 1-11 | Part of a Book | |
| | 2012 | [Afshani, Peyman]
[Agrawal, Manindra]
Doerr, Benjamin
[Green Larsen, Kasper]
Mehlhorn, Kurt
Winzen, Carola | | The Query Complexity of Finding a Hidden Permutation
In: Electronic Colloquium on Computational Complexity (ECCC): Report Series [87 (Revision 1)], 1-36 | Electronic Journal Article | |
| 1 |
| Agarwal, Amit |
| |
| | 2003 | [Agarwal, Amit]
[Agarwal, Tarun]
[Chopra, Sumit]
[Feldmann, Anja]
[Kammenhuber, Nils]
Krysta, Piotr
[Vöcking, Berthold] | | An experimental study of k-splittable scheduling for DNS-based traffic allocation
In: Euro-Par 2003 parallel processing : 9th International Euro-Par Conference ; proceedings, 230-235 | Proceedings Article | |
| 2 |
| Agarwal, Pankaj |
| |
| | 2002 | [Agarwal, Pankaj]
[Hagerup, Torben]
Ray, Rahul
[Sharir, Micha]
[Smid, Michiel]
[Welzl, Emo] | | Translating a Planar Object to Maximize Point Containment
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 42-53 | Proceedings Article | |
| | 1999 | [Agarwal, Pankaj]
[Arge, Lars]
Brodal, Gerth Stølting
[Vitter, Jeffrey Scott] | | I/O-Efficient Dynamic Point Location in Monotone Subdivisions
In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), 11-20 | Proceedings Article | |
| 1 |
| Agarwal, Pankaj Kumar (ed.) |
| |
| | 2009 | [Giesen, Joachim]
Manjunath, Madhusudan | | Minimizing Absolute Gaussian Curvature over Meshes
In: Computational Geometry, 1-16 | Electronic Proceedings Article | |
| 1 |
| |
| | 2008 | Govindarajan, Sathish
[Dietze, Michael C.]
[Agarwal, Pankaj K.]
[Clark, James S.] | | A scalable algorithm for dispersing population
In: Journal of Intellingent Information Systems [29], 39-61 | Journal Article | |
| 1 |
| |
| | 2003 | [Agarwal, Amit]
[Agarwal, Tarun]
[Chopra, Sumit]
[Feldmann, Anja]
[Kammenhuber, Nils]
Krysta, Piotr
[Vöcking, Berthold] | | An experimental study of k-splittable scheduling for DNS-based traffic allocation
In: Euro-Par 2003 parallel processing : 9th International Euro-Par Conference ; proceedings, 230-235 | Proceedings Article | |
| 2 |
| |
| | 1999 | Sanders, Peter | | Asynchronous Random Polling Dynamic Load Balancing
In: Algorithms and computation : 10th International Symposium, ISAAC'99, 37-48 | Proceedings Article | |
| | 1999 | Mehlhorn, Kurt | | The Engineering of Some Bipartite Matching Programs
In: Algorithms and computation : 10th International Symposium, ISAAC'99, 1-3 | Proceedings Article | |
| 5 |
| Agrawal, Manindra |
| |
| | 2013 | [Agrawal, Manindra]
Saha, Chandan
[Saxena, Nitin] | | A Case of Depth-3 Identity Testing, Sparse Factorization and Duality
In: 45th ACM Symposium on the Theory of Computing (STOC-13), toappear | Proceedings Article | |
| | 2013 | [Afshani, Peyman]
[Agrawal, Manindra]
Doerr, Benjamin
Doerr, Carola
[Larsen, Kasper Green]
Mehlhorn, Kurt | | The Query Complexity of Finding a Hidden Permutation
In: Space-Efficient Data Structures, Streams, and Algorithms, 1-11 | Part of a Book | |
| | 2012 | [Agrawal, Manindra]
Saha, Chandan
[Saptharishi, Ramprasad]
[Saxena, Nitin] | | Jacobian hits circuits: hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits
In: STOC'12 : Proceedings of the 2012 ACM Symposium on Theory of Computing, 599-614 | Proceedings Article | |
| | 2012 | [Agrawal, Manindra]
Saha, Chandan
[Saxena, Nitin] | | Quasi-polynomial Hitting-set for Set-depth-Delta Formulas
In: arXiv [abs/1209.2333], 1-13 | Electronic Journal Article | |
| | 2012 | [Afshani, Peyman]
[Agrawal, Manindra]
Doerr, Benjamin
[Green Larsen, Kasper]
Mehlhorn, Kurt
Winzen, Carola | | The Query Complexity of Finding a Hidden Permutation
In: Electronic Colloquium on Computational Complexity (ECCC): Report Series [87 (Revision 1)], 1-36 | Electronic Journal Article | |
| 3 |
| Ahuja, Nitin |
| |
| | 2007 | [Ahuja, Nitin]
[Baltz, Andreas]
Doerr, Benjamin
[Privetivy, Ales]
[Srivastav, Anand] | | On the Minimum Load Coloring Problem
In: Journal of Discrete Algorithms [5], 533-545 | Journal Article | |
| | 2005 | [Ahuja, Nitin]
[Baltz, Andreas]
Doerr, Benjamin
[Privetivy, Ales]
[Srivastav, Anand] | | On the Minimum Load Coloring Problem
In: Third Workshop on Approximation and Online Algorithms (WAOA 2005), 15-26 | Proceedings Article | |
| | 2004 | [Ahuja, Nitin]
[Baltz, Andreas]
Doerr, Benjamin
[Srivastav, Anand] | | Coloring Graphs with Minimal Load
In: Electronic Notes in Discrete Mathematics [17], 129-133 | Journal Article | |
| 3 |
| Ahuja, Ravindra K. |
| |
| | 1990 | Ahuja, Ravindra K.
Mehlhorn, Kurt
Orlin, James B.
Tarjan, Robert E. | | Faster algorithms for the shortest path problem
In: Journal of the ACM [37], 213-223 | Journal Article | |
| | 1988 | Ahuja, Ravindra K.
Mehlhorn, Kurt
Orlin, James B.
Tarjan, Robert E. | | Faster Algorithms for the Shortest Path Problem | Report | |
| | 1988 | Ahuja, Ravindra K.
Mehlhorn, Kurt
Orlin, James B.
Tarjan, Robert E. | | Faster Algorithms for the Shortest Path Problem | Report | |
| 2 |
| Ailon, Nir |
| |
| | 2012 | [Ailon, Nir]
[Avigdor-Elgrabli, Noa]
[Liberty, Edo]
van Zuylen, Anke | | Improved Approximation Algorithms for Bipartite Correlation Clustering
In: SIAM Journal on Computing [41], 1110-1121 | Journal Article | |
| | 2011 | [Ailon, Nir]
[Avigdor-Elgrabli, Noa]
[Liberty, Noa]
van Zuylen, Anke | | Improved Approximation Algorithms for Bipartite Correlation Clustering
In: Algorithms - ESA 2011 : 19th Annual European Symposium, 25-36 | Proceedings Article | |
| 13 |
| |
| | 2012 | [Ajwani, Deepak]
Elbassioni, Khaled
[Govindarajan, Sathish]
Ray, Saurabh | | Conflict-free coloring for rectangle ranges using O(n .382) colors
In: Discrete & Computational Geometry [48], 39-52 | Journal Article | |
| | 2010 | Ajwani, Deepak
Friedrich, Tobias | | Average-case Analysis of Incremental Topological Ordering
In: Discrete Applied Mathematics [158], 240-250 | Journal Article | |
| | 2009 | Ajwani, Deepak
[Meyer, Ulrich]
[Osipov, Vitaly] | | Breadth first search on massive graphs
In: The shortest path problem : ninth DIMACS implemenation challenge, 291-307 | Part of a Book | |
| | 2008 | Ajwani, Deepak
Friedrich, Tobias
Meyer, Ulrich | | An $O(n^2.75)$ algorithm for incremental topological ordering
In: ACM Transactions on Algorithms [4], 1-14 | Journal Article | |
| | 2008 | Ajwani, Deepak
[Malinger, Itay]
[Meyer, Ulrich]
[Toledo, Sivan] | | Characterizing the Performance of Flash Memory Storage Devices and Its Impact on Algorithm Design
In: Proc. 7th Intern. Workshop on Experimental Algorithms (WEA), 208-219 | Proceedings Article | |
| | 2007 | Ajwani, Deepak
Friedrich, Tobias | | Average-Case Analysis of Online Topological Ordering
In: Algorithms and Computation : 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007. Proceedings, 464-475 | Proceedings Article | |
| | 2007 | Ajwani, Deepak
Elbassioni, Khaled
Govindarajan, Sathish
[Ray, Saurabh] | | Conflict-free coloring for rectangle ranges using $n^.382$ colors
In: SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallel Algorithms and Architectures, 181-187 | Proceedings Article | |
| | 2007 | Ajwani, Deepak
Elbassioni, Khaled M.
Govindarajan, Sathish
[Ray, Saurabh] | | Conflict-Free Coloring for Rectangle Ranges Using $\tildeO(n^.382+\epsilon)$ Colors
In: 19th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 07), (to-appear) | Proceedings Article | |
| | 2007 | Ajwani, Deepak
Meyer, Ulrich
Osipov, Vitaly | | Improved external memory BFS implementations
In: 9th Workshop on Algorithm Engineering and Experiments (ALENEX), 3-12 | Proceedings Article | |
| | 2007 | Ajwani, Deepak
[Ray, Saurabh]
[Seidel, Raimund]
[Tiwary, Hans Raj] | | On Computing the Centroid of the Vertices of an Arrangement and Related Problems
In: 10th Workshop on Algorithms and Data Structures (WADS), 519-528 | Proceedings Article | |
| | 2006 | Ajwani, Deepak
[Dementiev, Roman]
Meyer, Ulrich | | A computational study of external memory BFS algorithms
In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06, 601-610 | Proceedings Article | |
| | 2006 | Ajwani, Deepak
Friedrich, Tobias
Meyer, Ulrich | | An $O(n^2.75)$ algorithm for online topological ordering
In: Algorithm theory - SWAT 2006 : 10th Scandinavian Workshop on Algorithm Theory, 53-64 | Proceedings Article | |
| | 2005 | Ajwani, Deepak | | Design, Implementation and Experimental Study of External Memory BFS Algorithms
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| |
| | 2012 | [Akbari, Hoda]
[Berenbrink, Petra]
Sauerwald, Thomas | | A simple approach for adapting continuous load balancing processes to discrete settings
In: PODC'12 : Proceedings of the 2012 ACM Symposium on Principles of Distributed Computing, 271-280 | Proceedings Article | |
| 4 |
| |
| | 1995 | Mehlhorn, Kurt | | Experiences with the implementation of geometric algorithms
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 518-518 | Proceedings Article | |
| | 1995 | [Kagaris, Dimitrios]
[Pantziou, Grammati E.]
[Tragoudas, Spyros]
Zaroliagis, Christos | | On the Computation of Fast Data Transmissions in Networks
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 291-302 | Proceedings Article | |
| | 1995 | Grove, Edward
[Kao, Ming-Yang]
[Krishnan, P.]
[Vitter, Jeffrey Scott] | | Online Perfect Matching and Mobile Computing
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 194-205 | Proceedings Article | |
| | 1995 | Albers, Susanne
[Koga, Hisashi] | | Page migration with limited local memory capacity
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 412-158 | Proceedings Article | |
| 1 |
| Alba, Enrique (ed.) |
| |
| | 2009 | | | GECCO 2009: Proceedings of the 11th Annual conference on Genetic and evolutionary computation. | Proceedings | |
| 24 |
| Albers, Susanne |
| |
| | 2002 | [Albers, Susanne]
Kursawe, Klaus
[Schuierer, Sven] | | Exploring unkown environments with obstacles
In: Algorithmica [32], 123-143 | Journal Article | |
| | 2000 | Albers, Susanne
[Mitzenmacher, Michael] | | Average-Case Analyses of First Fit and Random Fit Bin Packing
In: Random Structures & Algorithms [16], 240 - 259 | Journal Article | |
| | 2000 | Albers, Susanne
Garg, Naveen
Leonardi, Stefano | | Minimizing stall time in single and parallel disk systems
In: Journal of the ACM [47], 969-986 | Journal Article | |
| | 1999 | Albers, Susanne | | Better bounds for online scheduling
In: SIAM Journal on Computing [29], 459-473 | Journal Article | |
| | 1999 | Albers, Susanne
Kursawe, Klaus | | Exploring unknown environments with obstacles
In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), 842-843 | Proceedings Article | |
| | 1999 | Albers, Susanne | | Online-Algorithmen
Universität des Saarlandes | Thesis - Habilitation thesis | |
| | 1999 | Albers, Susanne
[Arora, Sanjeev]
[Khanna, Sanjeev] | | Page replacement for general caching problems
In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), 31-40 | Proceedings Article | |
| | 1998 | Albers, Susanne | | A competitive analysis of the list update problem with lookahead
In: Theoretical Computer Science [197], 95-109 | Journal Article | |
| | 1998 | Albers, Susanne
[Mitzenmacher, Michael] | | Average case analyses of First-Fit and Random-Fit bin packing
In: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-98), 290-299 | Proceedings Article | |
| | 1998 | Albers, Susanne
[Mitzenmacher, Michael] | | Average case analyses of list update algorithms, with applications to data compression
In: Algorithmica [21], 312-329 | Journal Article | |
| | 1998 | Albers, Susanne | | Improved randomized on-line algorithms for the list update problem
In: SIAM Journal on Computing [27], 682-693 | Journal Article | |
| | 1998 | Albers, Susanne
[Garg, Naveen]
[Leonardi, Stefano] | | Minimizing stall time in single and parallel disk systems
In: Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC-98), 454-462 | Proceedings Article | |
| | 1998 | Albers, Susanne
[Koga, Hisashi] | | New on-line algorithms for the page replication problem
In: Journal of Algorithms [27], 75-96 | Journal Article | |
| | 1998 | Albers, Susanne
[Charikar, Moses]
[Mitzenmacher, Michael] | | On delayed information and action in on-line algorithms
In: Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science (FOCS-98), 71-80 | Proceedings Article | |
| | 1998 | Albers, Susanne
[Westbrook, Jeffery] | | Self-organizing data structures
In: Online Algorithms: The State of the Art, 13-51 | Part of a Book | |
| | 1997 | Albers, Susanne | | Better Bounds for Online Scheduling
In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC-97), 130-139 | Proceedings Article | |
| | 1997 | Albers, Susanne
[Henzinger, Monika R.] | | Exploring Unknown Environments
In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC-97), 416-425 | Proceedings Article | |
| | 1997 | Albers, Susanne
Hagerup, Torben | | Improved Parallel Integer Sorting without Concurrent Writing
In: Information and Computation [136], 25-51 | Journal Article | |
| | 1997 | Albers, Susanne | | On the Influence of Lookahead in Competitive Paging Algorithms
In: Algorithmica [18], 283-305 | Journal Article | |
| | 1997 | Albers, Susanne
[Mitzenmacher, Michael] | | Revisiting the COUNTER algorithms for list update
In: Information Processing Letters [64], 155-160 | Journal Article | |
| | 1996 | Albers, Susanne
[Mitzenmacher, Michael] | | Average Case Analysis of List Update Algorithms, with Applications to Data Compression
In: Automata, Languages and Programming: 23rd International Colloquium (ICALP'96), 514-525 | Proceedings Article | |
| | 1995 | Albers, Susanne
[von Stengel, Bernhard]
[Wechner, Ralph] | | A combined BIT and TIMESTAMP algorithm for the list update problem
In: Information Processing Letters [56], 135-139 | Journal Article | |
| | 1995 | Albers, Susanne | | Improved randomized on-line algorithms for the list update problem
In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95), 412-419 | Proceedings Article | |
| | 1995 | Albers, Susanne
[Koga, Hisashi] | | Page migration with limited local memory capacity
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 412-158 | Proceedings Article | |
| 14 |
| |
| | 2009 | Bast, Hannah | | Car or Public Transport -- Two Worlds
In: Efficient Algorithms : Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday, 355-367 | Part of a Book | |
| | 2009 | Elbassioni, Khaled
[Krohn, Erik]
[Matijevic, Domagoj]
Mestre, Julián
[Severdija, Domagoj] | | Improved Approximation Algorithms for 1.5D Terrain Guarding
In: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS), 361-371 | Electronic Proceedings Article | |
| | 2009 | Doerr, Benjamin | | Introducing Quasirandomness to Computer Science
In: Efficient Algorithms : Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday, 99-111
In: Lecture Notes in Computer Science [5760], 99-111 | Part of a Book | |
| | 2009 | Chan, Ho-Leung
[Edmonds, Jeff]
[Lam, Tak-Wah]
[Lee, Lap-Kei]
[Marchetti-Spaccamela, Alberto]
[Pruhs, Kirk] | | Nonclairvoyant Speed Scaling for Flow and Energy
In: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS), 255-264 | Electronic Proceedings Article | |
| | 2009 | Kratsch, Stefan | | Polynomial Kernelizations For MIN F+Pi1 And MAX NP
In: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS), 601-612 | Electronic Proceedings Article | |
| | 2009 | [Kavitha, T.]
Mestre, Julián
[Nasre, M.] | | Popular Mixed Matchings
In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, 574-584 | Proceedings Article | |
| | 2009 | Doerr, Benjamin
Friedrich, Tobias
[Sauerwald, Thomas] | | Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, 366-377 | Proceedings Article | |
| | 2009 | Friedrich, Tobias
[Sauerwald, Thomas]
[Vilenchik, Dan] | | Smoothed Analysis of Balancing Networks
In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, 472-483 | Proceedings Article | |
| | 2008 | [Meyer, Ulrich] | | On Dynamic Breadth-First Search in External-Memory
In: Proc. 25th Annual Symposium on Theoretical Aspects (STACS), 551-560 | Proceedings Article | |
| | 2004 | [Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir] | | Algorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems
In: Algorithms – ESA 2004: 12th Annual European Symposium, 122-133 | Proceedings Article | |
| | 2004 | Kettner, Lutz
Mehlhorn, Kurt
[Pion, Sylvain]
[Schirra, Stefan]
[Yap, Chee] | | Classroom Examples of Robustness Problems in Geometric Computations
In: ESA 2004: 12th Annual European Symposium on Algorithms, 702-713 | Proceedings Article | |
| | 2004 | Martens, Maren
Skutella, Martin | | Flows on Few Paths: Algorithms and Lower Bounds
In: Algorithms – ESA 2004: 12th Annual European Symposium, 520-531 | Proceedings Article | |
| | 2004 | Fotakis, Dimitris | | Incremental Algorithms for Facility Location and k-Median
In: Algorithms – ESA 2004: 12th Annual European Symposium, 347-358 | Proceedings Article | |
| | 2004 | Sanders, Peter | | Super Scalar Sample Sort
In: Algorithms – ESA 2004: 12th Annual European Symposium, 784-796 | Proceedings Article | |
| 1 |
| Alberto H. F. Laender (ed.) |
| |
| | 2007 | Bast, Holger
[Majumdar, Debapriyo]
Weber, Ingmar | | Efficient interactive query expansion with CompleteSearch
In: 16th Conference on Information and Knowledge Management (CIKM'07), 857-860 | Proceedings Article | |
| 3 |
| Alberts, David |
| |
| | 1998 | [Alberts, David]
[Cattaneo, G]
[Italiano, Giuseppe]
[Nanni, Umberto]
Zaroliagis, Christos | | A Software Library of Dynamic Graph Algorithms
In: Proceedings of Workshop on Algorithms and Experiments (ALEX-98), 129-136 | Proceedings Article | |
| | 1998 | Mutzel, Petra
Gutwenger, Carsten
Brockenauer, Ralf
Fialko, Sergej
Klau, Gunnar W.
Krüger, Michael
Ziegler, Thomas
[Näher, Stefan]
[Alberts, David]
[Ambras, Dirk]
[Koch, Gunter]
[Jünger, Michael]
[Buchheim, Christoph]
[Leipert, Sebastian] | | AGD: A Library of Algorithms for Graph Drawing
In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 456-457 | Proceedings Article | |
| | 1997 | [Alberts, David]
Gutwenger, Carsten
Mutzel, Petra
[Näher, Stefan] | | AGD-Library: A Library of Algorithms for Graph Drawing
In: Proceedings of the Workshop on Algorithm Engineering (WAE-97), 112-123 | Proceedings Article | |
| 3 |
| Albrecht, Andreas (ed.) |
| |
| | 1987 | Alt, Helmut
Hagerup,Torben
Mehlhorn, Kurt
Preparata, Franco P. | | Deterministic Simulation of Idealized Parallel Computers on more Realistic Ones
In: Parallel Algorithms and Architectures : International Workshop, 11-15 | Proceedings Article | |
| | 1987 | | | Parallel algorithms and architectures (WPAA-87) : international workshop | Proceedings | |
| | 1987 | | | Parallel algorithms and architectures : International Workshop | Proceedings | |
| 1 |
| Albrecht, Marc |
| |
| | 2008 | [Albrecht, Marc]
Karrenbauer, Andreas
[Xu, Chihao] | | A clipper-free Algorithm for efficient HW-Implementation of local dimming LED-Backlight
In: Proceedings of the 28th International Display Research Conference (IDRC), 286-289 | Proceedings Article | |
| 1 |
| Alcaraz, Nicolas |
| |
| | 2012 | Alcaraz, Nicolas
Friedrich, Tobias
Kötzing, Timo
[Krohmer, Anton]
Müller, Joachim
Pauling, Josch
Baumbach, Jan | | Efficient key pathway mining: combining networks and OMICS data
In: Integrative Biology [4], 756-764 | Journal Article | |
| 1 |
| Alefeld, Götz (ed.) |
| |
| | 2001 | Mehlhorn, Kurt
Schirra, Stefan | | Exact computation with leda_real - Theory and geometric applications
In: Symbolic Algebraic Methods and Verification Methods, 163-172 | Part of a Book | |
| 1 |
| Alefragis, Panayiotis |
| |
| | 1998 | [Alefragis, Panayiotis]
[Goumopoulos, Christos]
Sanders, Peter
[Takkula, Tuomo]
[Wedelin, Dag] | | Parallel Crew Scheduling in PAROS
In: Proceedings of the 4th International Euro-Par Conference (Euro-Par-98), 1104-1113 | Proceedings Article | |
| 1 |
| Alexandrov, Vassil (ed.) |
| |
| | 1998 | Sanders, Peter
[Reussner, Ralf]
[Prechelt, Lutz]
[Müller, Matthias] | | SKaMPI: A Detailed, Accurate MPI Benchmark
In: Proceedings of the 5th European PVM/MPI Users' Group Meeting, 52-59 | Proceedings Article | |
| 2 |
| Alkassar, Eyad |
| |
| | 2013 | [Alkassar, Eyad]
[Böhme, Sascha]
Mehlhorn, Kurt
Rizkallah, Christine | | A Framework for the Verification of Certifying Computations | Unpublished/Draft | |
| | 2011 | [Alkassar, Eyad]
[Böhme, Sascha]
Mehlhorn, Kurt
Rizkallah, Christine | | Verification of Certifying Computations
In: Computer Aided Verification : 23rd International Conference, CAV 2011, 67-82 | Proceedings Article | |
| 1 |
| |
| | 2006 | Bast, Holger
Majumdar, Debapriyo
Schenkel, Ralf
Theobald, Martin
Weikum, Gerhard | | IO-Top-k: Index-Access Optimized Top-k Query Processing
In: Proceedings of the 32nd International Conference on Very Large Data Bases, VLDB 2006, 475-486 | Proceedings Article | |
| 1 |
| |
| | 1996 | [Alon, Noga]
Bradford, Phillip Gnassi
Fleischer, Rudolf | | Matching nuts and bolts faster
In: Information Processing Letters [59], 123-127 | Journal Article | |
| 1 |
| |
| | 2010 | [Iacono, G.]
Ramezani, Fahimeh
[Soranzo, N.]
[Altafani, C.] | | Determining the distance to monotonicity of a biological network: a graph-theoretical approach
In: IET Systems Biology [4], 223-235 | Journal Article | |
| 1 |
| |
| | 2012 | [Soranzo, Nicola]
Ramezani, Fahimeh
[Iacono, Giovanni]
[Altafini, Claudio] | | Decompositions of large-scale biological systems based on dynamical properties
In: Bioinformatics [28], 76-83 | Journal Article | |
| 4 |
| |
| | 1980 | Altenkamp, Doris
Mehlhorn, Kurt | | Codes: Unequal Probabilities, Unequal Letter Cost
In: Journal of the ACM [27], 412-427 | Journal Article | |
| | 1978 | Altenkamp, Doris
Mehlhorn, Kurt | | Codes: Unequal Probabilities, Unequal Letter Cost | Report | |
| | | | | | | |
| | 1978 | Altenkamp, Doris
Mehlhorn, Kurt | | Codes: Unequal Probabilities, Unequal Letter Cost
In: Automata, languages and programming (ICALP-78): 5th international colloquium, 15-25 | Proceedings Article | |
| 33 |
| Althaus, Ernst |
| |
| | 2011 | [Althaus, Ernst]
[Canzar, Stefan]
Elbassioni, Khaled
[Karrenbauer, Andreas]
[Mestre, Julian] | | Approximation Algorithms for the Interval Constrained Coloring Problem
In: Algorithmica [61], 342-361 | Journal Article | |
| | 2011 | [Althaus, Ernst]
Kupilas, Joschka
Naujoks, Rouven | | On the Low-Dimensional Steiner Minimum Tree Problem in Hamming Metric
In: Theory and Applications of Models of Computation : 8th Annual Conference, TAMC 2011, 308-319 | Proceedings Article | |
| | 2010 | [Althaus, Ernst]
[Altmeyer, Sebastian]
Naujoks, Rouven | | A New Combinatorial Approach to Parametric Path Analysis | Report | |
| | 2009 | [Althaus, Ernst]
[Dumitriu, Daniel] | | Fast and Accurate Bounds on Linear Programs
In: Experimental Algorithms : 8th International Symposium on Experimental Algorithms (SEA 2009), 40-50 | Proceedings Article | |
| | 2008 | Althaus, Ernst
Canzar, Stefan | | A Lagrangian relaxation approach for the multiple sequence alignment problem
In: Journal of Combinatorial Optimization [16], 127-154 | Journal Article | |
| | 2008 | Althaus, Ernst
Canzar, Stefan
Elbassioni, Khaled
Karrenbauer, Andreas
Mestre, Julián | | Approximating the Interval Constrained Coloring Problem
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), 210-221 | Proceedings Article | |
| | 2008 | Althaus, Ernst
Canzar, Stefan
[Emmett, Mark]
Karrenbauer, Andreas
[Marshall, Alan]
[Meyer-Bäse, Anke]
[Zhang, Huimin] | | Computing H/D-exchange speeds of single residues from data of peptic fragments
In: 23rd Annual ACM Symposium on Applied Computing (SAC), 1273-1277 | Proceedings Article | |
| | 2008 | Althaus, Ernst
Canzar, Stefan | | LASA: A tool for non-heuristic alignment of multiple sequences
In: Bioinformatics Research and Development (BIRD’08), 489-498 | Proceedings Article | |
| | 2008 | Althaus, Ernst
Naujoks, Rouven | | Reconstructing Phylogenetic Networks with One Recombination
In: Experimental Algorithms, 7th International Workshop, WEA 2008, 275-288 | Proceedings Article | |
| | 2007 | Althaus, Ernst
[Canzar, Stefan] | | A Lagrangian relaxation approach for the multiple sequence alignment problem
In: Combinatorial Optimization and Applications : First International Conference, COCOA 2007, 267-278 | Proceedings Article | |
| | 2007 | Althaus, Ernst
[Baumann, Tobias]
[Schömer, Elmar]
[Werth, Kai] | | Trunk Packing Revisited
In: Experimental Algorithms, 6th International Workshop, 420-432 | Proceedings Article | |
| | 2006 | Althaus, Ernst
[Caprara, Alberto]
[Lenhof, Hans-Peter]
[Reinert, Knut] | | Aligning multiple sequences by cutting planes
In: Mathematical Programming [2006], 387-425 | Journal Article | |
| | 2006 | Althaus, Ernst
Naujoks, Rouven | | Computing Steiner Minimal Trees in Hamming Metric
In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06, 172-181 | Proceedings Article | |
| | 2006 | Althaus, Ernst
[Calinescu, Gruia]
[Mandoiu, Ion]
[Prasad, Sushil]
[Tchervenski, Nickolay]
[Zelikovsly, Alexander] | | Power efficient range assignment for symmetric connectivity in static ad-hoc wireless networks
In: Wireless Networks [12], 287-299 | Journal Article | |
| | | | | | | |
| | 2005 | Althaus, Ernst
Funke, Stefan
[Har-Peled, Sariel]
[Könemann, Jochen]
[Ramos, Edgar A.]
Skutella, Martin | | Approximating k-Hop Minimum-Spanning Trees
In: Operations Research Letters [33], 115-120 | Journal Article | |
| | 2004 | Althaus, Ernst
[Karamanis, Nikiforos]
[Koller, Alexander] | | Computing Locally Coherent Discourses.
In: Proceedings of the conference and workshops, 42nd annual meeting of the Association for Computational Linguistics, 399-406 | Proceedings Article | |
| | 2004 | Althaus, Ernst
Eisenbrand, Friedrich
Funke, Stefan
Mehlhorn, Kurt | | Point Containment in the Integer Hull of a Polyhedron
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 929-933 | Proceedings Article | |
| | 2003 | Althaus, Ernst
[Duchier, Denys]
[Koller, Alexander]
Mehlhorn, Kurt
[Niehren, Joachim]
Thiel, Sven | | An Efficient Algorithm for the Configuration Problem of Dominance Graphs
In: Journal of Algorithms [48], 194-219 | Journal Article | |
| | 2003 | Althaus, Ernst
Polzin, Tobias
[Vahdati Daneshmand, Siavash] | | Improving Linear Programming Approaches for the Steiner Tree Problem
In: Experimental and efficient algorithms : Second International Workshop, WEA 2003, 1-14 | Proceedings Article | |
| | 2003 | Althaus, Ernst
[Calinescu, Gruia]
[Mandoiu, Ion]
[Prasad, Sushil]
[Tchervenski, Nickolay]
[Zelikovsly, Alexander] | | Power Efficient Range Assignment in Ad-hoc Wireless
In: Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC-03), 1889-1894 | Proceedings Article | |
| | 2002 | Althaus, Ernst
[Kohlbacher, Oliver]
[Lenhof, Hans-Peter]
Müller, Peter | | A combinatorial approach to protein docking with flexible side chains
In: Journal of Computational Biology [9], 597-612 | Journal Article | |
| | 2002 | Althaus, Ernst
Fink, Christian | | A Polyhedral Approach to Surface Reconstruction from Planar Contours.
In: Proceedings of the 9th International Conference on Integer Programming and Combinatorial Optimization, 258-272 | Proceedings Article | |
| | 2002 | Althaus, Ernst
[Caprara, Alberto]
[Lenhof, Hans-Peter]
[Reinert, Knut] | | Multiple sequence alignment with arbitrary gap costs: Computing an optimal solution using polyhedral combinatorics
In: Proceedings of the European Conference on Computational Biology (ECCB 2002), S4-S16 | Proceedings Article | |
| | 2002 | Althaus, Ernst
[Bockmayr, Alexander]
[Elf, Matthias]
[Kasper, Thomas]
[Jünger, Michael]
Mehlhorn, Kurt | | SCIL - Symbolic Constraints in Integer Linear Programming.
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 75-87 | Proceedings Article | |
| | 2001 | Althaus, Ernst
[Duchier, Denys]
[Koller, Alexander]
Mehlhorn, Kurt
[Niehren, Joachim]
Thiel, Sven | | An Efficient Algorithm for the Configuration Problem of Dominance Graphs
In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), 815-824 | Proceedings Article | |
| | 2001 | Althaus, Ernst | | Curve Reconstruction and the Traveling Salesman Problem
Universität des Saarlandes | Thesis - PhD thesis | |
| | 2001 | Althaus, Ernst
Mehlhorn, Kurt | | Traveling Salesman-Based Curve Reconstruction in Polynomial Time
In: SIAM Journal on Computing [31], 27-66 | Journal Article | |
| | 2000 | Althaus, Ernst
Kohlbacher, Oliver
Lenhof, Hans-Peter
Müller, Peter | | A Combinatorial Approach to Protein Docking with Flexible Side-Chains
In: Proceedings of the 4th Annual International Conference on Computational Molecular Biology (RECOMB-00), 15-24 | Proceedings Article | |
| | 2000 | Althaus, Ernst
Mehlhorn, Kurt
Näher, Stefan
Schirra, Stefan | | Experiments on curve reconstruction
In: Proceedings of 2nd Workshop on Algorithm Engineering and Experiments (ALENEX-00), 103-114 | Electronic Proceedings Article | |
| | 2000 | Althaus, Ernst
Mehlhorn, Kurt | | TSP-Based Curve Reconstruction in Polynomial Time
In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00), 686-695 | Proceedings Article | |
| | 1998 | Althaus, Ernst | | Berechnung optimaler Steinerbäume in der Ebene
Universität des Saarlandes | Thesis - Masters thesis | |
| | 1998 | Althaus, Ernst
Mehlhorn, Kurt | | Maximum Network Flow with Floating Point Arithmetic
In: Information Processing Letters [66], 109-113 | Journal Article | |
| 1 |
| Altmeyer, Sebastian |
| |
| | 2010 | [Althaus, Ernst]
[Altmeyer, Sebastian]
Naujoks, Rouven | | A New Combinatorial Approach to Parametric Path Analysis | Report | |
| 25 |
| Alt, Helmut |
| |
| | 1996 | [Alt, Helmut]
[Guibas, L.]
Mehlhorn, Kurt
[Karp, Richard M.]
[Wigderson, A.] | | A Method for Obtaining Randomized Algorithms with Small Tail Probabilities
In: Algorithmica [16], 543-547 | Journal Article | |
| | 1992 | Alt, Helmut
Geffert, Viliam
Mehlhorn, Kurt | | A lower bound for the nondeterministic space complexity of context-free recognition
In: Information Processing Letters [42], 25-27 | Journal Article | |
| | 1992 | Alt, Helmut
Fleischer, Rudolf
Kaufmann, Michael
Mehlhorn, Kurt
Näher, Stefan
Schirra, Stefan
Uhrig, Christian | | Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
In: Algorithmica [8], 391-408 | Journal Article | |
| | 1991 | Alt, Helmut
Guibas, L.
Mehlhorn, Kurt
Karp, Richard M.
Wigderson, A. | | A Method for Obtaining Randomized Algorithms with Small Tail Probabilities | Report | |
| | 1991 | Alt, Helmut
Blum, Norbert
Mehlhorn, Kurt
Paul, Markus | | Computing a maximum cardinality matching in a bipartite graph in time $O(n^1.5 \sqrtm/\log n)$
In: Information Processing Letters [37], 237-240 | Journal Article | |
| | 1990 | Alt, Helmut
Fleischer, Rudolf
Kaufmann, Michael
Mehlhorn, Kurt
Näher, Stefan
Schirra, Stefan
Uhrig, Christian | | Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures
In: Computational geometry (SCG-90) : 6th annual symposium, 281-289 | Proceedings Article | |
| | 1988 | Mehlhorn, Kurt
Näher, Stefan
Alt, Helmut | | A Lower Bound on the Complexity of the Union-Split-Find Problem
In: SIAM Journal on Computing [17], 1093-1102 | Journal Article | |
| | 1988 | Alt, Helmut
Mehlhorn, Kurt
Wagener, Hubert
Welzl, Emo | | Congruence, Similarity, and Symmetries of Geometric Objects
In: Discrete and Computational Geometry [3], 237-256 | Journal Article | |
| | 1987 | Mehlhorn, Kurt
Näher, Stefan
Alt, Helmut | | A Lower Bound for the Complexity of the Union-Split-Find Problem
In: Automata, Languages and Programming (ICALP-87) : 14th International Colloquium, 479-488 | Proceedings Article | |
| | 1987 | [Alt, Helmut]
Mehlhorn, Kurt
[Wagener, Hubert]
[Welzl, Emo] | | Congruence, similarity and symmetries of geometric objects | Report | |
| | 1987 | Alt, Helmut
Mehlhorn, Kurt
Wagener, Hubert
Welzl, Emo | | Convergence, Similarity and Symmetries of Geometric Objects
In: Computational geometry (SCG-87) : 3rd symposium, 308-315 | Proceedings Article | |
| | 1987 | Alt, Helmut
Hagerup,Torben
Mehlhorn, Kurt
Preparata, Franco P. | | Deterministic Simulation of Idealized Parallel Computers on more Realistic Ones
In: Parallel Algorithms and Architectures : International Workshop, 11-15 | Proceedings Article | |
| | 1987 | Alt, Helmut
Hagerup, Torben
Mehlhorn, Kurt
Preparata, Franco P. | | Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
In: SIAM Journal on Computing [16], 808-835 | Journal Article | |
| | 1986 | Mehlhorn, Kurt
Näher, Stefan
Alt, Helmut | | A Lower Bound for the Complexity of the Union-Split-Find Problem | Report | |
| | 1986 | Alt, Helmut
Hagerup, Torben
Mehlhorn, Kurt
Preparata, Franco P. | | Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
In: Mathematical Foundations of Computer Science, 12th Symposium (MFCS 1986), 199-208 | Proceedings Article | |
| | 1985 | Alt, Helmut
Hagerup, Torben
Mehlhorn, Kurt
Preparata, Franco P. | | Deterministic simulation of idealized parallel computers on more realistic ones | Report | |
| | 1985 | Alt, Helmut
Mehlhorn, Kurt | | Searching Semisorted Tables
In: SIAM Journal on Computing [14], 840-848 | Journal Article | |
| | 1984 | Alt, Helmut
Mehlhorn, Kurt
Munro, J. | | On the complexity of partial match retrieval
In: Information Processing Letters [19], 61-65 | Journal Article | |
| | 1984 | Alt, Helmut
Mehlhorn, Kurt
Munro, J. Ian | | Partial match retrieval in implicit data structures
In: Information Processing Letters [19], 61-65 | Journal Article | |
| | 1981 | Alt, Helmut
Mehlhorn, Kurt
Munro, J. Ian | | Partial Match Retrieval in Implicit Data Structures
In: Mathematical foundations of computer science (MFCS-81) : 10th symposium, ,, 156-161 | Proceedings Article | |
| | 1979 | Alt, Helmut
Mehlhorn, Kurt | | Complexity arguments in algebraic language theory
In: Revue française d'automatique, d'informatique et de recherche opérationnelle : RAIRO / Association Française pour la Cybernétique Economique et Technique [13], 217-225 | Journal Article | |
| | 1978 | Alt, Helmut
Mehlhorn, Kurt | | Complexity Arguments in Algebraic Language Theory | Report | |
| | 1976 | Alt, Helmut
Mehlhorn, Kurt | | Lower Bounds for the Space Complexity of Context-Free Recognition
In: Third International Colloquium on Automata, Languages and Programming, 338-354 | Proceedings Article | |
| | 1975 | Alt, Helmut
Mehlhorn, Kurt | | A Language over a One Symbol Alphabet Requiring only O(log log n) Space
In: SIGACT News [7], 31-33 | Journal Article | |
| | 1975 | Alt, Helmut
Mehlhorn, Kurt | | Untere Schranken für den Platzbedarf bei der kontext-freien Analyse | Report | |
| 6 |
| Alt, Helmut (ed.) |
| |
| | 2009 | Bast, Hannah | | Car or Public Transport -- Two Worlds
In: Efficient Algorithms : Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday, 355-367 | Part of a Book | |
| | 2009 | Doerr, Benjamin | | Introducing Quasirandomness to Computer Science
In: Efficient Algorithms : Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday, 99-111
In: Lecture Notes in Computer Science [5760], 99-111 | Part of a Book | |
| | 2009 | [Giesen, Joachim]
Manjunath, Madhusudan | | Minimizing Absolute Gaussian Curvature over Meshes
In: Computational Geometry, 1-16 | Electronic Proceedings Article | |
| | 2003 | Fotakis, Dimitris
[Pagh, Rasmus]
Sanders, Peter
[Spirakis, Paul G.] | | Space Efficient Hash Tables with Worst Case Constant Access Time
In: Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2003), 271-282 | Proceedings Article | |
| | 2002 | Elbassioni, Khaled M. | | On Dualization in Products of Forests.
In: STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, 142-153 | Proceedings Article | |
| | 2002 | Bast, Hannah | | Scheduling at Twilight the Easy Way
In: STACS 2002 : 19th Annual Symposium on Theoretical Aspects of Computer Science, 166-178 | Proceedings Article | |
| 1 |
| |
| | 2006 | Maue, Jens
[Sanders, Peter]
Matijevic, Domagoj | | Goal Directed Shortest Path Queries Using Precomputed Cluster Distances
In: Experimental Algorithms, 5th International Workshop, WEA 2006, 316-327 | Proceedings Article | |
| 2 |
| |
| | 2013 | [Alvarez, Victor]
Bringmann, Karl
[Ray, Saurabh]
[Seidel, Raimund] | | Counting Triangulations Approximately
In: 25th Canadian Conference on Computational Geometry (CCCG-13), 85-89 | Proceedings Article | |
| | 2012 | [Alvarez, Victor]
Bringmann, Karl
[Curticapean, Radu]
Ray, Saurabh | | Counting Crossing Free Structures
In: Proceedings of the Twenty-Eight Annual Symposium on Computational Geometry (SCG'12), 61-68 | Proceedings Article | |
| 2 |
| Amaldi, Edoardo |
| |
| | 2009 | [Amaldi, Edoardo]
[Iuliano, Claudio]
Jurkiewicz, Tomasz
Mehlhorn, Kurt
[Rizzi, Romeo] | | Breaking the $O(m^2n)$ Barrier for Minimum Cycle Bases
In: Algorithms - ESA 2009 : 17th Annual European Symposium, 301-312 | Proceedings Article | |
| | 2009 | [Amaldi, Edoardo]
[Iuliano, Claudio]
Jurkiewicz, Tomasz
Mehlhorn, Kurt
[Rizzi, Romeo] | | Breaking the $O(m^2n)$ Barrier for Minimum Cycle Bases
In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, 301-312 | Proceedings Article | |
| 3 |
| |
| | 2001 | Ramos, Edgar A.
[Amato, Nancy M.]
[Goodrich, Michael T.] | | A Randomized Algorithm for Triangulating a Simple Polygon in Linear Time
In: Discrete and Computational Geometry [26], 246-265 | Journal Article | |
| | 2000 | Ramos, Edgar A.
[Amato, Nancy M.]
[Goodrich, Michael T.] | | Computing the arrangement of curve segments: Divide-and-conquer algorithms via sampling
In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00), 705-706 | Proceedings Article | |
| | 2000 | [Amato, Nancy M.]
[Goodrich, Michael T.]
Ramos, Edgar A. | | Linear-Time Triangulation of a Simple Polygon Made Easier Via Randomization
In: Proceedings of the 16th Annual Symposium on Computational Geometry (SCG-00), 201-212 | Proceedings Article | |
| 1 |
| |
| | 2000 | Ramos, Edgar A.
[Amato, Nancy M.]
[Goodrich, Michael T.] | | Computing the arrangement of curve segments: Divide-and-conquer algorithms via sampling
In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00), 705-706 | Proceedings Article | |
| 1 |
| |
| | 2010 | [Ambalath, Abhimanyu M.]
[Balasundaram, Radheshyam]
[H., Chintan Rao]
[Koppula, Venkata]
[Misra, Neeldhara]
Philip, Geevarghese
[Ramanujan, M. S.] | | On the Kernelization Complexity of Colorful Motifs
In: Parameterized and Exact Computation - 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings, 14-25 | Proceedings Article | |
| 1 |
| |
| | 2009 | Gärtner, Tobias
[Hotz, Günter] | | Computability of Analytic Functions with Analytic Machines
In: Mathematical Theory and Computational Practice : 5th Conference on Computability in Europe, CiE 2009, 250-259 | Proceedings Article | |
| 1 |
| |
| | 1998 | Mutzel, Petra
Gutwenger, Carsten
Brockenauer, Ralf
Fialko, Sergej
Klau, Gunnar W.
Krüger, Michael
Ziegler, Thomas
[Näher, Stefan]
[Alberts, David]
[Ambras, Dirk]
[Koch, Gunter]
[Jünger, Michael]
[Buchheim, Christoph]
[Leipert, Sebastian] | | AGD: A Library of Algorithms for Graph Drawing
In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 456-457 | Proceedings Article | |
| 3 |
| |
| | 2006 | Kutz, Martin | | Computing Shortest Non-Trivial Cycles on Orientable Surfaces of Bounded Genus in Almost Linear Time.
In: Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06, 430-437 | Proceedings Article | |
| | 2006 | Funke, Stefan
Klein, Christian | | Hole Detection or: "How Much Geometry Hides in Connectivity?"
In: Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06, 377-385 | Proceedings Article | |
| | 2006 | [Arya, Sunil]
Malamatos, Theocharis
[Mount, David M.] | | The Effect of Corners on the Complexity of Approximate Range Searching
In: Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06, 11-20 | Proceedings Article | |
| 3 |
| |
| | 2010 | [Amini, Omid]
Manjunath, Madhusudan | | Riemann-Roch for sublattices of the root lattice $A\_n$
In: Electronic Journal of Combinatorics [17], R124,1-R124,50 | Electronic Journal Article | |
| | 2009 | Amini, Omid
[Peleg, David]
[Pérennes, Stéphane]
[Sau, Ignasi]
[Saurabh, Saket] | | Degree-Constrained Subgraph Problems: Hardness and Approximation Results
In: Approximation and Online Algorithms : 6th International Workshop, WAOA 2008, 29-42 | Proceedings Article | |
| | 2009 | Amini, Omid
[Pérennes, Stéphane]
[Sau, Ignasi] | | Hardness and approximation of traffic grooming
In: Theoretical Computer Science [410], 3751-3760 | Journal Article | |
| 3 |
| |
| | 2010 | [Nor, Igor]
Hermelin, Danny
[Charlat, Sylvain]
[Engelstadter, Jan]
[Reuter, Max]
[Duron, Olivier Sagot, Marie-France] | | Mod/Resc Parsimony Inference
In: Combinatorial Pattern Matching : 21st Annual Symposium, CPM 2010, 202-213 | Proceedings Article | |
| | 2010 | [Blelloch, Guy E.]
Farzan, Arash | | Succinct Representations of Separable Graphs
In: Combinatorial Pattern Matching : 21st Annual Symposium, CPM 2010, 138-150 | Proceedings Article | |
| | 2001 | Burkhardt, Stefan
Kärkkäinen, Juha | | Better Filtering with Gapped q-Grams
In: Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching, 73-85 | Proceedings Article | |
| 1 |
| |
| | 2013 | [Anagnostopoulos, Aris]
[Grandoni, Fabrizio]
[Leonardi, Stefano]
Wiese, Andreas | | Constant Integrality Gap LP formulations of Unsplittable Flow on a Path
In: Proceedings of the 16th Conference on Integer Programming and Combinatorial Optimization (IPCO 2013), | Proceedings Article | |
| 1 |
| |
| | 2009 | Sagraloff, Michael
Kerber, Michael
Hemmer, Michael | | Certified Complex Root Isolation via Adaptive Root Separation Bounds
In: The Joint Conference of ASCM 2009 and MACIS 2009, 151-166 | Proceedings Article | |
| 1 |
| |
| | 2013 | Anand, S
Bringmann, Karl
[Friedrich, Tobias]
[Garg, Naveen]
[Kumar, Amit] | | Minimizing maximum (weighted) flow-time on related and unrelated machines
In: Automata, Languages, and Programming - 40th International Colloquium (ICALP-13), 13-24 | Proceedings Article | |
| 1 |
| |
| | 2011 | [Anand, S.]
[Garg, Naveen]
Megow, Nicole | | Meeting deadlines: How much speed suffices?
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011. - Pt. I, 232-243 | Proceedings Article | |
| 2 |
| |
| | 2000 | [Andersson, Arne]
Hagerup, Torben
[Hastad, Johan]
[Petersson, Ola] | | Tight bounds for searching a sorted array of strings
In: SIAM Journal on Computing [30], 1552-1578 | Journal Article | |
| | 1995 | [Andersson, Arne]
Hagerup, Torben
[Nilsson, Stefan]
[Raman, Rajeev] | | Sorting in Linear Time?
In: 27th Annual ACM Symposium on Theory of Computing (STOC95), 427-436 | Proceedings Article | |
| 1 |
| André O. Falc{ |
| |
| 1 |
| |
| | 2007 | Bast, Holger
[Majumdar, Debapriyo]
Weber, Ingmar | | Efficient interactive query expansion with CompleteSearch
In: 16th Conference on Information and Knowledge Management (CIKM'07), 857-860 | Proceedings Article | |
| 1 |
| |
| | 2002 | [Andreou, Maria]
Fotakis, Dimitris
[Nikoletseas, Sotiris]
[Papadopoulou, Vicky]
[Spirakis, Paul G.] | | On Radiocoloring Hierarchically Specified Planar Graphs: PSPACE-Completeness and Approximations
In: Mathematical Foundations of Computer Science 2002 : 27th International Symposium, MFCS 2002, 81-92 | Proceedings Article | |
| 11 |
| |
| | 2010 | Angelopoulos, Spyros | | On the Competitiveness of the Online Asymmetric and Euclidean Steiner Tree Problems
In: Approximation and Online Algorithms : 7th International Workshop, WAOA 2009, 1-12 | Proceedings Article | |
| | 2010 | Angelopoulos, Spyros
[Borodin, Allan] | | Randomized Priority Algorithms
In: Theoretical Computer Science [411], 2542-2558 | Journal Article | |
| | 2009 | Angelopoulos, Spyros
[Lopez-Ortiz, Alejandro] | | Intertruptible Algorithms for Multi Problem Solving
In: Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI 09), 380-386 | Proceedings Article | |
| | 2009 | Angelopoulos, Spyros | | Online Priority Steiner Tree Problems
In: Algorithms and Data Structures : 11th International Symposium, WADS 2009, 37-48 | Proceedings Article | |
| | 2009 | Angelopoulos, Spyros
Schweitzer, Pascal | | Paging and List Update under Bijective Analysis
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 1136-1145 | Proceedings Article | |
| | 2009 | Angelopoulos, Spyros
Doerr, Benjamin
Huber, Anna
Panagiotou, Konstantinos | | Tight bounds for quasirandom rumor spreading
In: The Electronic Journal of Combinatorics [16], R102,1-R102,19 | Electronic Journal Article | |
| | 2008 | Angelopoulos, Spyros | | A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry
In: 16th Annual European Symposium on Algorithms (ESA 2008), 76-87 | Proceedings Article | |
| | 2008 | Angelopoulos, Spyros
[Dorrigiv, Reza]
[Lopez-Ortiz, Alejandro] | | List Update with Locality of Reference
In: 8th Latin American Symposium on Theoretical Informatics (LATIN 2008), 399-410 | Proceedings Article | |
| | 2008 | Angelopoulos, Spyros
[Lopez-Ortiz, Alejandro]
[Hamel,Angele] | | Optimal Scheduling of Contract Algorithms with Soft Deadlines
In: 23rd National Conference on Artificial Intelligence (AAAI 2008), 868-873 | Proceedings Article | |
| | 2007 | Angelopoulos, Spyros | | Improved bounds for the online steiner tree problem in graphs of bounded edge-asymmetry
In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, 248-257 | Proceedings Article | |
| | 2007 | Angelopoulos, Spyros
[Dorrigiv, Reza]
[López-Ortiz, Alejandro] | | On the separation and equivalence of paging strategies
In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, 229-237 | Proceedings Article | |
| 1 |
| |
| | 2013 | [Anshelevich, Elliot]
[Bhardwaj, Onkar]
Hoefer, Martin | | Friendship and Stable Matching.
In: 21st European Symposium on Algorithms (ESA-13), 49-60 | Proceedings Article | |
| 1 |
| |
| | 2013 | [Antoniadis, Antonios]
[Huang, Chien-Chung]
Ott, Sebastian
[Verschae, José] | | How to Pack Your Items When You Have to Buy Your Knapsack
In: Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, 62-73 | Proceedings Article | |
| 1 |
| |
| | 2008 | | | GECCO 2008: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation | Proceedings | |
| 3 |
| Apostolico, Alberto (ed.) |
| |
| | 2002 | Burkhardt, Stefan
Kärkkäinen, Juha | | One-Gapped q-Gram Filters for Levenshtein Distance
In: Combinatorial Pattern Matching : 13th Annual Symposium, CPM 2002, 225-234 | Proceedings Article | |
| | 1997 | [Das, Gautam]
Fleischer, Rudolf
Gasieniec, Leszek
Gunopulos, Dimitrios
Kärkkäinen, Juha | | Episode matching
In: Combinatorial pattern matching : 8th annual symposium (CPM-97), 12-27 | Proceedings Article | |
| | 1997 | Gasieniec, Leszek
Indyk, Piotr
Krysta, Piotr | | External inverse pattern matching
In: Proceedings of the 8th Symposium on Combinatorial Pattern Matching (CPM-97), 90-101 | Proceedings Article | |
| 3 |
| |
| | 2007 | Ajwani, Deepak
Meyer, Ulrich
Osipov, Vitaly | | Improved external memory BFS implementations
In: 9th Workshop on Algorithm Engineering and Experiments (ALENEX), 3-12 | Proceedings Article | |
| | 2007 | Bast, Holger
Funke, Stefan
Matijevic, Domagoj
[Sanders, Peter]
[Schultes, Dominik] | | In Transit to Constant Time Shortest-Path Queries in Road Networks
In: 9th Workshop on Algorithm Enginneering and Experiments (ALENEX'07), 46-59 | Proceedings Article | |
| | 2007 | Kutz, Martin
Schweitzer, Pascal | | ScrewBox: a Randomized Certifying Graph Non-Isomorphism Algorithm
In: 9th Workshop on Algorithm Engineering and Experiments (ALENEX'07), 150-157 | Proceedings Article | |
| 1 |
| |
| | 2004 | [Aranov, Boris]
[Asano, Tetsuo]
[Katoh, Naoki]
Mehlhorn, Kurt
[Tokuyama, Takeshi] | | Polyline Fitting of Planar Points Under Min-sum Criteria
In: Algorithms and Computation: 15th International Symposium, ISAAC 2004, 77-88 | Proceedings Article | |
| 1 |
| |
| | 2004 | [Mokbel, Mohamed F.]
[Aref, Walid G.]
Elbassioni, Khaled M.
[Kamel, Ibrahim] | | Scalable Multimedia Disk Scheduling
In: 20th International Conference on Data Engineering, ICDE 2004, 498-509 | Proceedings Article | |
| 4 |
| |
| | 2004 | [Arge, Lars]
Meyer, Ulrich
[Toma, Laura] | | External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs
In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, 146-157 | Proceedings Article | |
| | 2003 | [Arge, Lars]
Meyer, Ulrich
[Toma, Laura]
[Zeh, Norbert] | | On external-memory planar depth first search
In: Journal of Graph Algorithms and Applications [7], 105-129 | Journal Article | |
| | 2001 | [Arge, Lars]
Meyer, Ulrich
[Toma, Laura]
[Zeh, Norbert] | | On External-Memory Planar Depth First Search
In: Proceedings of the 7th International Workshop on Algorithms and Data Structures (WADS-01), 471-482 | Proceedings Article | |
| | 1999 | [Agarwal, Pankaj]
[Arge, Lars]
Brodal, Gerth Stølting
[Vitter, Jeffrey Scott] | | I/O-Efficient Dynamic Point Location in Monotone Subdivisions
In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), 11-20 | Proceedings Article | |
| 9 |
| Arge, Lars (ed.) |
| |
| | 2007 | Elbassioni, Khaled
[Sitters, Rene]
[Zhang, Yan] | | A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs
In: Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings, 451-462 | Proceedings Article | |
| | 2007 | [Bar-Yehuda, Reuven]
[Flysher, Guy]
Mestre, Julián
[Rawitz, Dror] | | Approximation of Partial Capacitated Vertex Cover
In: 15th Annual European Symposium on Algorithms, 335-346 | Proceedings Article | |
| | 2007 | [Dupont, Laurent]
Hemmer, Michael
[Petitjean, Sylvain]
[Schömer, Elmar] | | Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics
In: 15th Annual European Symposium on Algorithms, 633-644 | Proceedings Article | |
| | 2007 | Christodoulou, George
[Koutsoupias, Elias]
Kovács, Annamária | | Mechanism design for fractional scheduling on unrelated machines
In: Automata, Languages and Programming : 34th International Colloquium, ICALP 2007, 40-52 | Proceedings Article | |
| | 2007 | Berberich, Eric
[Fogel, Efi]
[Halperin, Dan]
Mehlhorn, Kurt
[Wein, Ron] | | Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step
In: Algorithms - ESA 2007, 15th Annual European Symposium, 645-656 | Proceedings Article | |
| | 2007 | [Khuller, Samir]
[Malekian, Azarakhsh]
Mestre, Julián | | To Fill or Not to Fill: The Gas Station Problem
In: 15th Annual European Symposium on Algorithms, 534-545 | Proceedings Article | |
| | 2006 | Ajwani, Deepak
Friedrich, Tobias
Meyer, Ulrich | | An $O(n^2.75)$ algorithm for online topological ordering
In: Algorithm theory - SWAT 2006 : 10th Scandinavian Workshop on Algorithm Theory, 53-64 | Proceedings Article | |
| | 2006 | Doerr, Benjamin
Friedrich, Tobias
Klein, Christian
Osbild, Ralf | | Unbiased Matrix Rounding
In: Algorithm theory - SWAT 2006 : 10th Scandinavian Workshop on Algorithm Theory, 102-112 | Proceedings Article | |
| | 2004 | Dementiev, Roman
Kettner, Lutz
Mehnert, Jens
Sanders, Peter | | Engineering a Sorted List Data Structure for 32 Bit Key
In: Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics (ALENEX-04), 142-151 | Proceedings Article | |
| 8 |
| Arikati, Srinivasa Rao |
| |
| | 2001 | Arikati, Srinivasa Rao
[Dessmark, Anders]
[Lingas, Andrzej]
[Marathe, Madhav V.] | | Approximation algorithms for maximum two-dimensional pattern matching
In: Theoretical Computer Science [255], 51-62 | Journal Article | |
| | 1999 | [Arikati, Srinivasa Rao]
Mehlhorn, Kurt | | A correctness certificate for the Stoer-Wagner min-cut algorithm
In: Information Processing Letters [70], 251-254 | Journal Article | |
| | 1998 | Arikati, Srinivasa Rao
Chaudhuri, Shiva
Zaroliagis, Christos | | All-Pairs Min-Cut in Sparse Networks
In: Journal of Algorithms [29], 82-110 | Journal Article | |
| | 1997 | Arikati, Srinivasa Rao
Maheshwari, Anil
Zaroliagis, Christos | | Efficient Computation of implicit representations of sparse graphs
In: Discrete Applied Mathematics [78], 1-16 | Journal Article | |
| | 1996 | Arikati, Srinivasa Rao
[Dessmark, Anders]
[Lingas, Andrzej]
[Marathe, Madhav V.] | | Approximation algorithms for maximum two-dimensional pattern matching
In: Combinatorial Pattern Matching: 7th Annual Symposium, CPM96, 348-360 | Proceedings Article | |
| | 1996 | Arikati, Srinivasa Rao
[Chen, Danny Z.]
[Chew, L. Paul]
[Das, Gautam]
[Smid, Michiel]
Zaroliagis, Christos | | Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane
In: Algorithms - ESA '96: 4th Annual European Symposium, 514-528 | Proceedings Article | |
| | 1996 | Arikati, Srinivasa Rao
Maheshwari, Anil | | Realizing degree sequences in parallel
In: SIAM Journal of Computing [9], 317-338 | Journal Article | |
| | 1995 | Arikati, Srinivasa Rao
Chaudhuri, Shiva
Zaroliagis, Christos | | All-Pairs Min-Cut in Sparse Networks
In: Foundations of software technology and theoretical computer science (FSTTCS-95) : 15th conference, 363-376 | Proceedings Article | |
| 3 |
| |
| | 1998 | Brodal, Gerth Stølting
[Pinotti, M. Cristina] | | Comparator Networks for Binary Heap Construction
In: Proceedings of the 6th Scandinavian Workshop on Algorithm Theory (SWAT-98), 158-168 | Proceedings Article | |
| | 1998 | Sibeyn, Jop F. | | Solving Fundamental Problems on Sparse-Meshes
In: Proceedings of the 6th Scandinavian Workshop on Algorithm Theory (SWAT-98), 288-299 | Proceedings Article | |
| | 1998 | Brodal, Gerth Stølting
Katajainen, Jyrki | | Worst-Case Efficient External-Memory Priority Queues
In: Proceedings of the 6th Scandinavian Workshop on Algorithm Theory (SWAT-98), 107-118 | Proceedings Article | |
| 2 |
| |
| | 2007 | [Aronov, Boris]
[Asano, Tetsuo]
Funke, Stefan | | Optimal Triangulation with Steiner Points
In: Algorithms and Computation : 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007. Proceedings, 681-691 | Proceedings Article | |
| | 2006 | [Aronov, Boris]
[Asano, Tetsuo]
[Katoh, Naoki]
Mehlhorn, Kurt
[Tokuyama, Takeshi] | | Polyline Fitting of Planar Points under Min-sum Criteria
In: International Journal of Computational Geometry and Applications [16], 97-116 | Journal Article | |
| 1 |
| Arora, Anish (ed.) |
| |
| | 2007 | Funke, Stefan
Laue, Sören
Naujoks, Rouven | | Minimum Energy Broadcast with Few Senders
In: Distributed Computing in Sensor Systems : Third IEEE International Conference, DCOSS 2007, 404-416 | Proceedings Article | |
| 1 |
| Arora, Sanjeev |
| |
| | 1999 | Albers, Susanne
[Arora, Sanjeev]
[Khanna, Sanjeev] | | Page replacement for general caching problems
In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), 31-40 | Proceedings Article | |
| 1 |
| Arora, Sanjeev (ed.) |
| |
| | 2003 | [Hall, Alex]
[Langkau, Katharina]
Skutella, Martin | | An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, 71-82 | Proceedings Article | |
| 1 |
| Arumugam, S. |
| |
| | 2011 | [Arumugam, S.]
[Chandrasekar, K. Raja]
[Misra, Neeldhara]
Philip, Geevarghese
[Saurabh, Saket] | | Algorithmic Aspects of Dominator Colorings in Graphs
In: Combinatorial Algorithms - 22nd International Workshop, IWOCA 2011, Victoria, BC, Canada, July 20-22, 2011, Revised Selected Papers, 19-30 | Proceedings Article | |
| 1 |
| Arun-Kumar, S. (ed.) |
| |
| | 2006 | Doerr, Benjamin
Klein, Christian | | Unbiased Rounding of Rational Matrices
In: FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science: 26th International Conference, 200-211 | Proceedings Article | |
| 13 |
| Arya, Sunil |
| |
| | 2007 | [Arya, Sunil]
Malamatos, Theocharis
[Mount, David M.] | | A simple entropy-based algorithm for planar point location
In: ACM Transactions on Algorithms [3], 17 | Journal Article | |
| | 2007 | [Arya, Sunil]
Malamatos, Theocharis
[Mount, David M.]
[Wong, Ka Chun] | | Optimal expected-case planar point location
In: SIAM Journal on Computing [37], 584-610 | Journal Article | |
| | 2006 | [Arya, Sunil]
Malamatos, Theocharis
[Mount, David M.] | | On the Importance of Idempotence
In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, STOC'06, 564-573 | Proceedings Article | |
| | 2006 | [Arya, Sunil]
Malamatos, Theocharis
[Mount, David M.] | | The Effect of Corners on the Complexity of Approximate Range Searching
In: Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06, 11-20 | Proceedings Article | |
| | 2005 | [Arya, Sunil]
Malamatos, Theocharis
Mount, David M. | | Space-Time Tradeoffs for Approximate Spherical Range Counting
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 535-544 | Proceedings Article | |
| | 2000 | Arya, Sunil
[Mount, David M.] | | Approximate range searching
In: Computational Geometry [17], 135-152 | Journal Article | |
| | 2000 | Kumar, V. S. Anil
[Arya, Sunil]
[Ramesh, Hariharan] | | Hardness of Set Cover with Intersection 1
In: Automata, Languages and Programming, Proceedings of the 27th International Colloquium (ICALP-00), 624-635 | Proceedings Article | |
| | 1999 | Arya, Sunil
Golin, Mordecai J.
Mehlhorn, Kurt | | On the Expected Depth of Random Circuits
In: Combinatorics, Probability and Computing [8], 209-228 | Journal Article | |
| | 1997 | Arya, Sunil
Smid, Michiel | | Efficient construction of a bounded degree spanner with low weight
In: Algorithmica [17], 33-54 | Journal Article | |
| | 1996 | Arya, Sunil
Mount, David M.
[Narayan, Oruttom] | | Accounting for boundary effects in nearest neighbor searching
In: Discrete & Computational Geometry [16], 155-176 | Journal Article | |
| | 1995 | Arya, Sunil
[Mount, David M.]
[Narayan, Oruttom] | | Accounting for boundary effects in nearest neighbor searching
In: 11th Annual ACM Symposium on Computational Geometry (SCG95), 336-344 | Proceedings Article | |
| | 1995 | Arya, Sunil
[Mount, David M.] | | Approximate range searching
In: 11th Annual ACM Symposium on Computational Geometry (SCG95), 172-181 | Proceedings Article | |
| | 1995 | Arya, Sunil
[Das, Gautam]
[Mount, David M.]
[Salowe, Jeffrey S.]
Smid, Michiel | | Euclidean spanners: short, thin, and lanky
In: 27th Annual ACM Symposium on Theory of Computing (STOC95), 489-498 | Proceedings Article | |
| 1 |
| Asano, Takao (ed.) |
| |
| | 2011 | Friedrich, Tobias
Sauerwald, Thomas
[Stauffer, Alexandre] | | Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions
In: 22nd International Symposium on Algorithms and Computation (ISAAC-11), 190-199 | Proceedings Article | |
| 5 |
| Asano, Tetsuo |
| |
| | 2011 | [Asano, Tetsuo]
Doerr, Benjamin | | Memory-constrained algorithms for shortest path problem
In: 23rd Annual Canadian Conference on Computational Geometry (CCCG 2011), 315-319 | Proceedings Article | |
| | 2007 | [Aronov, Boris]
[Asano, Tetsuo]
Funke, Stefan | | Optimal Triangulation with Steiner Points
In: Algorithms and Computation : 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007. Proceedings, 681-691 | Proceedings Article | |
| | 2006 | [Teramoto, Sachio]
[Asano, Tetsuo]
[Katoh, Naoki]
Doerr, Benjamin | | Inserting Points Uniformly at Every Instance
In: IEICE - Transactions on Information and Systems [E89-D], 2348-2356 | Journal Article | |
| | 2006 | [Aronov, Boris]
[Asano, Tetsuo]
[Katoh, Naoki]
Mehlhorn, Kurt
[Tokuyama, Takeshi] | | Polyline Fitting of Planar Points under Min-sum Criteria
In: International Journal of Computational Geometry and Applications [16], 97-116 | Journal Article | |
| | 2004 | [Aranov, Boris]
[Asano, Tetsuo]
[Katoh, Naoki]
Mehlhorn, Kurt
[Tokuyama, Takeshi] | | Polyline Fitting of Planar Points Under Min-sum Criteria
In: Algorithms and Computation: 15th International Symposium, ISAAC 2004, 77-88 | Proceedings Article | |
| 7 |
| Asano, Tetsuo (ed.) |
| |
| | 2009 | Elmasry, Amr
Manjunath, Madhusudan | | Enumerating Trichromatic Triangles Containing the Origin in Linear Time
In: Japanese Conference in Computational Geometry and Graphs 2009, 101-103 | Proceedings Article | |
| | 2006 | Paluch, Katarzyna | | A New Approximation Algorithm for Multidimensional Rectangle Tiling
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 712-721 | Proceedings Article | |
| | 2006 | Kowalik, Lukasz | | Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 557-566 | Proceedings Article | |
| | 2006 | Doerr, Benjamin
Friedrich, Tobias | | Deterministic Random Walks on the Two-Dimensional Grid
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 474-483 | Proceedings Article | |
| | 2006 | Elbassioni, Khaled M.
[Fishkin, Aleksei V.]
Sitters, Rene | | On Approximating the TSP with Intersecting Neighborhoods
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 213-222 | Proceedings Article | |
| | 2006 | Doerr, Benjamin
[Lengler, Johannes]
[Steurer, Daniel] | | The Interval Liar Game
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 318-327 | Proceedings Article | |
| | 1990 | Klein, R.
Mehlhorn, Kurt
Meiser, Stefan | | On the Construction of Abstract Voronoi Diagrams, II
In: Algorithms (ISA-90) : 1st international symposium (SIGAL-90), 138-154 | Proceedings Article | |
| 1 |
| Asano, T. (ed.) |
| |
| | 1999 | Krysta, Piotr
Solis-Oba, Roberto | | Approximation algorithms for bounded facility location
In: Proceedings of the 5th Annual International Conference on Computing and Combinatorics (COCOON-99), 241-250 | Proceedings Article | |
| 1 |
| Ashoff, Oliver |
| |
| | 2000 | Ashoff, Oliver | | Agorithmen der modularen Arithmetik
Universität des Saarlandes | Thesis - Masters thesis | |
| 2 |
| Aspnes, James (ed.) |
| |
| | 2007 | Funke, Stefan
Laue, Sören
Naujoks, Rouven | | Minimum Energy Broadcast with Few Senders
In: Distributed Computing in Sensor Systems : Third IEEE International Conference, DCOSS 2007, 404-416 | Proceedings Article | |
| | 2006 | Funke, Stefan
[Guibas, Leonidas]
[Nguyen, An]
[Wang, Yusu] | | Distance-Sensitive Information Brokerage in Sensor Networks
In: Distributed Computing in Sensor Systems, Second IEEE International Conference, DCOSS 2006, 234-251 | Proceedings Article | |
| 2 |
| Atallah, Mikhail J. (ed.) |
| |
| | 1999 | Mutzel, Petra
[Eades, Peter] | | Graph Drawing Algorithms
In: Algorithms & Theory of Computation Handbook, 9-1-9-26 | Part of a Book | |
| | 1998 | [Eades, Peter]
Mutzel, Petra | | Graph Drawing Algorithms
In: Algorithms and Theory of Computation Handbook, 9-26 | Part of a Book | |
| 1 |
| Auger, Anne (ed.) |
| |
| | 2011 | | | Theory of Randomized Search Heuristics | Book | |
| 1 |
| Auletta, Vincenzo |
| |
| | 1999 | [Auletta, Vincenzo]
[Dinitz, Yefim]
Nutov, Zeev
[Parente, Domenico] | | A 2-approximation algorithm for finding an optimum 3-vertex-connected spanning subgraph
In: Journal of Algorithms [32], 21-30 | Journal Article | |
| 2 |
| Ausiello, Giorgio (ed.) |
| |
| | 1989 | Mehlhorn, Kurt
[Paul, Wolfgang J.] | | Two Versus One Index Register and Modifiable Versus Non-modifiable Programs
In: Automata, languages and programming (ICALP-89) : 16th international colloquium, 603-609 | Proceedings Article | |
| | 1978 | Altenkamp, Doris
Mehlhorn, Kurt | | Codes: Unequal Probabilities, Unequal Letter Cost
In: Automata, languages and programming (ICALP-78): 5th international colloquium, 15-25 | Proceedings Article | |
| 2 |
| |
| | 2012 | [Ailon, Nir]
[Avigdor-Elgrabli, Noa]
[Liberty, Edo]
van Zuylen, Anke | | Improved Approximation Algorithms for Bipartite Correlation Clustering
In: SIAM Journal on Computing [41], 1110-1121 | Journal Article | |
| | 2011 | [Ailon, Nir]
[Avigdor-Elgrabli, Noa]
[Liberty, Noa]
van Zuylen, Anke | | Improved Approximation Algorithms for Bipartite Correlation Clustering
In: Algorithms - ESA 2011 : 19th Annual European Symposium, 25-36 | Proceedings Article | |
| 1 |
| Awerbuch, Baruch |
| |
| | 1995 | [Awerbuch, Baruch]
[Azar, Yossi]
Grove, Edward
[Kao, Ming-Yang]
Krishnan, P.
[Vitter, Jeffrey Scott] | | Load Balancing in the Euclidean Norm
In: 36th Annual Symposium on Foundations of Computer Science, 383-391 | Proceedings Article | |
| 1 |
| Azar, Yossi |
| |
| | 1995 | [Awerbuch, Baruch]
[Azar, Yossi]
Grove, Edward
[Kao, Ming-Yang]
Krishnan, P.
[Vitter, Jeffrey Scott] | | Load Balancing in the Euclidean Norm
In: 36th Annual Symposium on Foundations of Computer Science, 383-391 | Proceedings Article | |
| 5 |
| Azar, Yossi (ed.) |
| |
| | 2006 | [Khachiyan, Leonid]
[Boros, Endre]
[Borys, Konrad]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Makino, Kazuhisa] | | Enumerating Spanning and Connected Subsets in Graphs and Matroids
In: Algorithms - ESA 2006, 14th Annual European Symposium, 444-455 | Proceedings Article | |
| | 2006 | Kaligosi, Kanela
[Sanders, Peter] | | How Branch Mispredictions Affect Quicksort
In: Algorithms - ESA 2006, 14th Annual European Symposium, 780-791 | Proceedings Article | |
| | 2006 | Meyer, Ulrich
[Zeh, Norbert] | | I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths
In: Algorithms - ESA 2006, 14th Annual European Symposium, 540-551 | Proceedings Article | |
| | 2006 | [Eisenbrand, Friedrich]
Karrenbauer, Andreas
[Skutella, Martin]
[Xu, Chihao] | | Multiline Addressing by Network Flow
In: Algorithms - ESA 2006 : 14th Annual European Symposium, 744-755 | Proceedings Article | |
| | 2006 | Elbassioni, Khaled M. | | On the Complexity of the Multiplication Method for Monotone CNF/DNF Dualization
In: Algorithms - ESA 2006, 14th Annual European Symposium, 340-351 | Proceedings Article | |
| 1 |
| A. Gustafsson (ed.) |
| |
| | 2007 | Giesen, Joachim | | The Combinatorial Structure of Polyhedral Choice Based Conjoint Analysis
In: Conjoint Measurement: Methods and Applications, 259-271 | Part of a Book | |
| 1 |
| A. Herrmann (ed.) |
| |
| | 2007 | Giesen, Joachim | | The Combinatorial Structure of Polyhedral Choice Based Conjoint Analysis
In: Conjoint Measurement: Methods and Applications, 259-271 | Part of a Book | |
| 1 |
| Baader, F. (ed.) |
| |
| | 2001 | [Edelkamp, Stefan]
Meyer, Ulrich | | Theory and Practice of Time-Space Trade-Offs in Memory Limited Search
In: Proceedings of the Joint German/Austrian Conference on AI: Advances in Artificial Intelligence (KI-01), 169-184 | Proceedings Article | |
| 1 |
| Babaoglu, Ozalp (ed.) |
| |
| | 2004 | Bast, Holger | | Dimension Reduction: A Powerful Principle for Automatically Finding Concepts in Unstructured Data
In: International Workshop on Self-* Properties in Complex Information Systems (SELF-STAR 2004), 113-116 | Proceedings Article | |
| 1 |
| Babenko, Maxim A. |
| |
| | 2014 | [Babenko, Maxim A.]
[Gawrychowski, Pawel]
[Kociumaka, Tomasz]
[Starikovskaya, Tatiana A.] | | Computing Minimal and Maximal Suffixes of a Substring Revisited
In: Combinatorial Pattern Matching - 25th Annual Symposium, CPM 2014, Moscow, Russia, June 16-18, 2014. Proceedings, 30-39 | Proceedings Article | |
| 1 |
| Bacardit, Jaume (ed.) |
| |
| | 2009 | | | GECCO 2009: Proceedings of the 11th Annual conference on Genetic and evolutionary computation. | Proceedings | |
| 1 |
| Bachrach, Ran |
| |
| | 2002 | [Bachrach, Ran]
[El-Yaniv, Ran]
Reinstädtler, Martin | | On the competitive theory and practice of online list accessing algorithms
In: Algorithmica [32], 201-246 | Journal Article | |
| 1 |
| Bacik, Roman |
| |
| | 1995 | [Bacik, Roman]
Mahajan, Sanjeev | | Semidefinite programming and its applications to NP problems
In: Computing and Combinatorics: 1st Annual International Conference (COCOON95), 566-575 | Proceedings Article | |
| 1 |
| Backes, Werner |
| |
| | 1998 | Backes, Werner | | Berechnung kürzester Gittervektoren
Univesität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Bader, David |
| |
| | 2002 | [Bader, David]
[Moret, Bernard]
Sanders, Peter | | Algorithm Engineering for Parallel Computation
In: Experimental Algorithmics, 1-23 | Part of a Book | |
| 3 |
| Baeten, Jos C.M. (ed.) |
| |
| | 2003 | [Hall, Alex]
[Hippler, Steffen]
Skutella, Martin | | Multicommodity Flows Over Time: Efficient Algorithms and Complexity
In: Automata, languages and programming : 30th International Colloquium, ICALP 2003, 397-409 | Proceedings Article | |
| | 2003 | Fotakis, Dimitris | | On the Competitive Ratio for Online Facility Location
In: Automata, languages and programming : 30th International Colloquium, ICALP 2003, 637-652 | Proceedings Article | |
| | 2003 | Kärkkäinen, Juha
Sanders, Peter | | Simple Linear Work Suffix Array Construction
In: Automata, languages and programming : 30th International Colloquium, ICALP 2003, 943-955 | Proceedings Article | |
| 3 |
| Baeza-Yates, Ricardo (ed.) |
| |
| | 2005 | Bast, Holger
Majumdar, Debapriyo | | Why Spectral Retrieval Works
In: 28th Annual International Conference on Research and Development in Information Retrieval (SIGIR'05), 11-18 | Proceedings Article | |
| | 1995 | Bradford, Phillip Gnassi
[Choppela, Venkatesh]
[Rawlins, Gregory J.E.] | | Lower Bounds for the Matrix Chain Ordering Problem
In: LATIN'95: Theoretical Informatics, 2nd Latin American Symposium, 112-130 | Proceedings Article | |
| | 1995 | Chaudhuri, Shiva
[Dubhashi, Devdatt] | | Probabilistic Recurrence Relations Revisited
In: LATIN'95: Theoretical Informatics, Second Latin American Symposium, 207-219 | Proceedings Article | |
| 1 |
| Baeza-Yates, R. (ed.) |
| |
| | 2003 | Burkhardt, Stefan
Kärkkäinen, Juha | | Fast Lightweight Suffix Array Construction and Checking
In: Combinatorial Pattern Matching: 14th Annual Symposium, CPM 2003, 55-69 | Proceedings Article | |
| 1 |
| Bakker de, Jacobus W. (ed.) |
| |
| | 1980 | Mehlhorn, Kurt | | Pebbling Mountain Ranges and its Application of DCFL-Recognition
In: Automata, languages and programming (ICALP-80) : 7th annual international colloquium, 422-435 | Proceedings Article | |
| 1 |
| Balasundaram, Radheshyam |
| |
| | 2010 | [Ambalath, Abhimanyu M.]
[Balasundaram, Radheshyam]
[H., Chintan Rao]
[Koppula, Venkata]
[Misra, Neeldhara]
Philip, Geevarghese
[Ramanujan, M. S.] | | On the Kernelization Complexity of Colorful Motifs
In: Parameterized and Exact Computation - 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings, 14-25 | Proceedings Article | |
| 3 |
| Baltz, Andreas |
| |
| | 2007 | [Ahuja, Nitin]
[Baltz, Andreas]
Doerr, Benjamin
[Privetivy, Ales]
[Srivastav, Anand] | | On the Minimum Load Coloring Problem
In: Journal of Discrete Algorithms [5], 533-545 | Journal Article | |
| | 2005 | [Ahuja, Nitin]
[Baltz, Andreas]
Doerr, Benjamin
[Privetivy, Ales]
[Srivastav, Anand] | | On the Minimum Load Coloring Problem
In: Third Workshop on Approximation and Online Algorithms (WAOA 2005), 15-26 | Proceedings Article | |
| | 2004 | [Ahuja, Nitin]
[Baltz, Andreas]
Doerr, Benjamin
[Srivastav, Anand] | | Coloring Graphs with Minimal Load
In: Electronic Notes in Discrete Mathematics [17], 129-133 | Journal Article | |
| 4 |
| Bampis, Evripidis (ed.) |
| |
| | 2010 | Angelopoulos, Spyros | | On the Competitiveness of the Online Asymmetric and Euclidean Steiner Tree Problems
In: Approximation and Online Algorithms : 7th International Workshop, WAOA 2009, 1-12 | Proceedings Article | |
| | 2010 | Christodoulou, George
[Chung, Christine]
[Ligett, Katrina]
Pyrga, Evangelia
van Stee, Rob | | On the price of stability for undirected network design
In: Approximation and Online Algorithms : 7th International Workshop, WAOA 2009, 86-97 | Proceedings Article | |
| | 2010 | [Günther, Elisabeth]
[König, Felix]
Megow, Nicole | | Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width
In: Approximation and Online Algorithms : 7th International Workshop, WAOA 2009, 170-181 | Proceedings Article | |
| | 2009 | Amini, Omid
[Peleg, David]
[Pérennes, Stéphane]
[Sau, Ignasi]
[Saurabh, Saket] | | Degree-Constrained Subgraph Problems: Hardness and Approximation Results
In: Approximation and Online Algorithms : 6th International Workshop, WAOA 2008, 29-42 | Proceedings Article | |
| 9 |
| |
| | 2003 | Banderier, Cyril
Beier, Rene
Mehlhorn, Kurt | | Smoothed Analysis of Three Combinatorial Problems
In: Mathematical foundations of computer science 2003 : 28th International Symposium, MFCS 2003, 198-207 | Proceedings Article | |
| | 2002 | Banderier, Cyril
[Flajolet, Philippe] | | Basic analytic combinatorics of directed lattice paths
In: Theoretical Computer Science [281], 37-80 | Journal Article | |
| | 2002 | Banderier, Cyril
[Bousquet-Mélou, Mireille]
[Denise, Alain]
[Flajolet, Philippe]
[Gardy, Danièle]
[Gouyou-Beauchamps, Dominique] | | Generating Functions for Generating Trees
In: Discrete Mathematics [246], 29-55 | Journal Article | |
| | 2001 | Banderier, Cyril | | Combinatoire Analytique des chemins et des cartes
Université de Paris 6 | Thesis - PhD thesis | |
| | 2001 | Banderier, Cyril | | Random Maps, Coalescing Saddles, Singularity Analysis, and Airy Phenomena
In: Random Structures & Algorithms [19], 194-246 | Journal Article | |
| | 2000 | Banderier, Cyril | | A Generalized Cover Time for Random Walks on Graphs
In: Proceedings of FPSAC'00, 113-124 | Proceedings Article | |
| | 2000 | Banderier, Cyril | | Planar Maps and Airy Phenomena,
In: Proceedings of ICALP'00, 388-402 | Proceedings Article | |
| | 1999 | Banderier, Cyril | | An Introduction to Analytic Number Theory | Miscellaneous | |
| | 1999 | Banderier, Cyril | | On Generating Functions of Generating Trees
In: Proceedings of FPSAC'99, 40-52 | Proceedings Article | |
| 1 |
| |
| | 1999 | Sibeyn, Jop F. | | Ultimate Parallel List Ranking?
In: Proceedings of the 6th International Conference on High Performance Computing (HiPC-99), 197-201 | Proceedings Article | |
| 1 |
| |
| | 2013 | [Bannai, Hideo]
Gawrychowski, Pawel
[Inenaga, Shunsuke]
[Takeda, Masayuki] | | Converting SLP to LZ78 in almost Linear Time
In: Combinatorial Pattern Matching, 24th Annual Symposium (CPM 2013), 38-49 | Proceedings Article | |
| 4 |
| |
| | 2011 | [Bansal, Nikhil]
Chan, Ho-Leung
[Pruhs, KIrk] | | Competitive Algorithms for Due Date Schedulin
In: Algorithmica [59], 569-582 | Journal Article | |
| | 2010 | Bansal, Nikhil
[Gupta, Anupam]
[Li, Jian]
Mestre, Julián
[Nagarajan, Viswanath]
[Rudra, Atri] | | When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings (Extended Abstract)
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. II, 218-229 | Proceedings Article | |
| | 2009 | [Bansal, Nikhil]
Chan, Ho-Leung
[Pruhs, Kirk] | | Speed Scaling with an Arbitrary Power Function
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 693-701 | Proceedings Article | |
| | 2009 | [Bansal, Nikhil]
Chan, Ho-Leung | | Weighted flow time does not admit O(1)-competitive algorithms
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 1238-1244 | Proceedings Article | |
| 3 |
| Bar-Yehuda, Reuven |
| |
| | 2011 | [Bar-Yehuda, Reuven]
Hermelin, Danny
[Rawitz, Dror] | | Minimum vertex cover in rectangle graphs
In: Computational Geometry [44], 356-364 | Journal Article | |
| | 2010 | [Bar-Yehuda, Reuven]
Hermelin, Danny
[Rawitz, Dror] | | Minimum Vertex Cover in Rectangle Graphs
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. I, 255-266 | Proceedings Article | |
| | 2007 | [Bar-Yehuda, Reuven]
[Flysher, Guy]
Mestre, Julián
[Rawitz, Dror] | | Approximation of Partial Capacitated Vertex Cover
In: 15th Annual European Symposium on Algorithms, 335-346 | Proceedings Article | |
| 1 |
| Bárány, Imre |
| |
| | 2006 | [Bárány, Imre]
Doerr, Benjamin | | Balanced partitions of vector sequences
In: Linear Algebra and Its Applications [414], 464-469 | Journal Article | |
| 1 |
| Baraque, Raef |
| |
| | 2002 | Baraque, Raef | | Effiziente Multiplikationsverfahren: ein numerischer Vergleich
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Barbeau, Michel (ed.) |
| |
| | 2004 | Funke, Stefan
Kesselman, Alexander
Lotker, Zvi
[Segal, Michael] | | Improved Approximation Algorithms for Connected Sensor Cover
In: Ad-hoc, mobil and wireless networks : Third International Conference, ADHOC-NOW 2004, 56-69 | Proceedings Article | |
| 1 |
| Barkhage, H. (ed.) |
| |
| | 1975 | Mehlhorn, Kurt | | Best possible bounds for the weighted path length of optimum binary search trees
In: Automata Theory and Formal Languages, 2nd GI Conference, 31-41 | Proceedings Article | |
| 1 |
| Barnes, Greg |
| |
| | 1998 | Barnes, Greg
[Edmonds, Jeff A.] | | Time-Space Lower Bounds for Directed st-Connectivity on Graph Automata Models
In: SIAM Journal on Computing [27], 1190-1202 | Journal Article | |
| 1 |
| Barták, Roman (ed.) |
| |
| | 2005 | Elbassioni, Khaled M.
Katriel, Irit | | Multiconsistency and Robustness with Global Constraints
In: Integration of AI and OR techniques in constraint programming for combinatorial optimization problems : Second International Conference, CPAIOR 2005, 168-182 | Proceedings Article | |
| 1 |
| Bartal, Yair |
| |
| | 2006 | [Bartal, Yair]
[Leonardi, Stefano]
[Shallom, Gill]
Sitters, Rene | | On the value of preemption in scheduling
In: 9th Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX, 39-48 | Proceedings Article | |
| 4 |
| Baruah, Sanjoy |
| |
| | 2012 | [Baruah, Sanjoy]
[Bonifaci, Vincenzo]
[D'Angelo, Gianlorenzo]
[Li, Haohan]
[Marchetti-Spaccamela, Alberto]
Megow, Nicole
[Stougie, Leen] | | Scheduling Real-Time Mixed-Criticality Jobs
In: IEEE Transactions on Computers [61], 1140-1152 | Journal Article | |
| | 2011 | [Baruah, Sanjoy]
Bonifaci, Vincenzo
[D'Angelo, Gianlorenzo]
[Marchetti-Spaccamela, Alberto]
[van der Ster, Suzanne]
[Stougie, Leen] | | Mixed-criticality scheduling of sporadic task systems
In: Algorithms - ESA 2011 : 19th Annual European Symposium, 555-566 | Proceedings Article | |
| | 2010 | [Baruah, Sanjoy]
Bonifaci, Vincenzo
[Marchetti-Spaccamela, Alberto]
[Stiller, Sebastian] | | Improved Multiprocessor Global Schedulability Analysis
In: Real-Time Systems [46], 3-24 | Journal Article | |
| | 2010 | [Baruah, Sanjoy]
Bonifaci, Vincenzo
[D'Angelo, Gianlorenzo]
[Li, Haohan]
[Marchetti-Spaccamela, Alberto]
Megow, Nicole
[Stougie, Leen] | | Scheduling Real-Time Mixed-Criticality Jobs
In: Mathematical Foundations of Computer Science 2010 : 35th International Symposium, MFCS 2010, 90-101 | Proceedings Article | |
| 1 |
| |
| | 1995 | [Barve, Rakesh D.]
Grove, Edward
[Vitter, Jeffrey Scott] | | An Application-Controlled Paging Algorithm for a Shared Cache
In: 36th Annual Symposium on Foundations of Computer Science, 204-213 | Proceedings Article | |
| 1 |
| |
| | 2010 | [Basit, Abdul]
[Mustafa, Nabil H.]
Ray, Saurabh
[Raza, Sarfraz] | | Centerpoints and Tverberg's technique
In: Computational Geometry [43], 593-600 | Journal Article | |
| 1 |
| |
| | 2001 | [Bäsken, Matthias]
[Brönnimann, Hervé]
[Frank, Da]
[Devillers, Olivier]
[Ester, Ezra]
[Fabri, Andreas]
[Flato, Eyal]
[Gärtner, Bernd]
[Giezeman, Geert-Jan]
[Halperin, Dan]
[Hanniel, Iddo]
[Har-Peled, Sariel]
[Herrmann, Thomas]
Hert, Susan
[Hirsch, Shai]
[Hoffmann, Michael]
Kettner, Lutz
[Nechushtan, Oren]
[Neyer, Gabriele]
[Pasechnik, Dmitrii]
[Pion, Sylvain]
Schirra, Stefan
[Schönherr, Sven]
Seel, Michael
[Teillaud, Monique]
[Veltkamp, Remco]
[Wein, Ron]
[Wesselink, Wieger]
[Yvinec, Mariette] | | CGAL Reference and User Manuals | Unknown Form: eBookForm | |
| 9 |
| |
| | 2009 | Bast, Hannah | | Car or Public Transport -- Two Worlds
In: Efficient Algorithms : Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday, 355-367 | Part of a Book | |
| | 2009 | Celikik, Marjan
Bast, Hannah | | Fast Single-Pass Construction of a Half-Inverted Index
In: String processing and information retrieval : 16th International Symposium, SPIRE 2009, 194-205 | Proceedings Article | |
| | 2002 | Bast, Hannah | | Scheduling at Twilight the Easy Way
In: STACS 2002 : 19th Annual Symposium on Theoretical Aspects of Computer Science, 166-178 | Proceedings Article | |
| | 2000 | Bast, Hannah | | On Scheduling Parallel Tasks at Twilight
In: Theory of Computing Systems [33], 489-563 | Journal Article | |
| | 2000 | Bast, Hannah | | Provably Optimal Scheduling of Similar Tasks
Universität des Saarlandes | Thesis - PhD thesis | |
| | 2000 | Bast, Hannah
Hert, Susan | | The Area Partitioning Problem
In: Proceedings of the 12th Annual Canadian Conference on Computational Geometry (CCCG-00), 163-171 | Proceedings Article | |
| | 1998 | Bast, Hannah | | Dynamic Scheduling with Incomplete Information
In: Proceedings of the 10th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-98), 182-191 | Proceedings Article | |
| | 1995 | Bast, Hannah
Hagerup, Torben | | Fast Parallel Space Allocation, Estimation, and Integer Sorting
In: Information and Computation [123], 72-110 | Journal Article | |
| | 1994 | Bast, Hannah | | Fast Parallel Space Allocation, Estimation and Integer Sorting
Universität des Saarlandes | Thesis - Masters thesis | |
| 30 |
| |
| | 2011 | Celikik, Marjan
Bast, Holger
Manolache, Gabriel | | Efficient Index-Based Snippet Generation | Unpublished/Draft | |
| | 2009 | Celikik, Marjan
Bast, Holger | | Fast Error-Tolerant Search on Very Large Texts
In: The 24th Annual ACM Symposium on Applied Computing, 1724-1731 | Proceedings Article | |
| | 2009 | Bast, Holger
Funke, Stefan
Matijevic, Domagoj | | Ultrafast shortest-path queries via transit nodes
In: The shortest path problem : ninth DIMACS implemenation challenge, 175-192 | Part of a Book | |
| | 2007 | Bast, Holger
[Majumdar, Debapriyo]
Weber, Ingmar | | Efficient interactive query expansion with CompleteSearch
In: 16th Conference on Information and Knowledge Management (CIKM'07), 857-860 | Proceedings Article | |
| | 2007 | Bast, Holger
Chitea, Alexandru
Suchanek, Fabian
Weber, Ingmar | | ESTER: Efficient Search in Text, Entities, and Relations
In: 30th International Conference on Research and Development in Information Retrieval (SIGIR'07), 671-678 | Proceedings Article | |
| | 2007 | Bast, Holger
Funke, Stefan
[Sanders, Peter]
[Schultes, Dominik] | | Fast Routing in Road Networks using Transit Nodes
In: Science [316], 566 | Journal Article | |
| | 2007 | Bast, Holger
Funke, Stefan
Matijevic, Domagoj
[Sanders, Peter]
[Schultes, Dominik] | | In Transit to Constant Time Shortest-Path Queries in Road Networks
In: 9th Workshop on Algorithm Enginneering and Experiments (ALENEX'07), 46-59 | Proceedings Article | |
| | 2007 | Bast, Holger
Weber, Ingmar | | Managing Helpdesk Tasks with CompleteSearch: A Case Study
In: 4th Conference on Professional Knowledge Management (WM'07), 101-108 | Proceedings Article | |
| | 2007 | Bast, Holger
Weber, Ingmar | | The CompleteSearch Engine: Interactive, Efficient, and Towards IR & DB integration
In: CIDR 2007 : 3rd Biennial Conference on Innovative Data Systems Research, 88-95 | Electronic Proceedings Article | |
| | 2007 | Weikum, Gerhard
Bast, Holger
[Canright, Geoffrey]
[Hales, David]
[Schindelhauer, Christian]
[Triantafillou, Peter] | | Towards Peer-to-Peer Web Search
In: 1st European Conference on Complex Systems, ECCS'05, ? | Proceedings Article | |
| | 2006 | Bast, Holger
[Dupret, Georges]
Majumdar, Debapriyo
[Piwowarski, Benjamin] | | Discovering a Term Taxonomy from Term Similarities Using Principal Component Analysis
In: Semantics, web and mining : Joint International Workshops, EWMF 2005 and KDO 2005, 103-120 | Proceedings Article | |
| | 2006 | Bast, Holger | | Intelligente Suche mit garantiert schnellen Antwortzeiten
In: MPG Jahrbuch [?], | Electronic Journal Article | |
| | 2006 | Bast, Holger
Majumdar, Debapriyo
Schenkel, Ralf
Theobald, Martin
Weikum, Gerhard | | IO-Top-k at TREC 2006: Terabyte Track
In: The Fifteenth Text Retrieval Conference Proceedings, TREC 2006, 1-5 | Electronic Proceedings Article | |
| | 2006 | Bast, Holger
Majumdar, Debapriyo
Schenkel, Ralf
Theobald, Martin
Weikum, Gerhard | | IO-Top-k: Index-Access Optimized Top-k Query Processing | Report | |
| | 2006 | Bast, Holger
Majumdar, Debapriyo
Schenkel, Ralf
Theobald, Martin
Weikum, Gerhard | | IO-Top-k: Index-Access Optimized Top-k Query Processing
In: Proceedings of the 32nd International Conference on Very Large Data Bases, VLDB 2006, 475-486 | Proceedings Article | |
| | 2006 | Bast, Holger
Mehlhorn, Kurt
Schäfer, Guido
[Tamaki, Hisao] | | Matching Algorithms are Fast in Sparse Random Graphs
In: Theory of Computing Systems [39], 3-14 | Journal Article | |
| | 2006 | Bast, Holger
[Mortensen, Christian Worm]
Weber, Ingmar | | Output-Sensitive Autocompletion Search
In: String Processing and Information Retrieval : 13th International Conference, SPIRE 2006, 150-162 | Proceedings Article | |
| | 2006 | Bast, Holger
Funke, Stefan
Matijevic, Domagoj | | TRANSIT: Ultrafast Shortest-Path Queries with Linear-Time Preprocessing
In: 9th DIMACS Implementation Challenge --- Shortest Path, | Electronic Proceedings Article | |
| | 2006 | Bast, Holger
Weber, Ingmar | | Type Less, Find More: Fast Autocompletion Search with a Succinct Index
In: SIGIR 2006: Proceedings of the 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 364-371 | Proceedings Article | |
| | 2006 | Bast, Holger
Weber, Ingmar | | When You're Lost For Words: Faceted Search With Autocompletion
In: SIGIR'06 Workshop on Faceted Search, 31-35 | Proceedings Article | |
| | 2005 | Bast, Holger
Weber, Ingmar | | Don't Compare Averages
In: 4th International Workshop on Efficient and Experimental Algorithms (WEA'05), 67-76 | Proceedings Article | |
| | 2005 | Bast, Holger
Weber, Ingmar | | Insights from Viewing Ranked Retrieval as Rank Aggregation
In: Workshop on Challenges in Web Information Retrieval and Integration (WIRI'05), 243-248 | Proceedings Article | |
| | 2005 | Bast, Holger | | Präzisionssuche im homöopathischen Netz
In: Homöopathie-Zeitschrift [I/05], 119-122 | Journal Article | |
| | 2005 | Weikum, Gerhard
Bast, Holger
[Canright, Geoffrey]
[Hales, David]
[Schindelhauer, Christian]
[Triantafillou, Peter] | | Towards Self-Organizing Query Routing and Processing for Peer-to-Peer Web Search
In: Workshop on Peer-to-peer Data Management in the Complex Systems Perspective, 7-24 | Proceedings Article | |
| | 2005 | Bast, Holger
Majumdar, Debapriyo | | Why Spectral Retrieval Works
In: 28th Annual International Conference on Research and Development in Information Retrieval (SIGIR'05), 11-18 | Proceedings Article | |
| | 2004 | Bast, Holger | | Dimension Reduction: A Powerful Principle for Automatically Finding Concepts in Unstructured Data
In: International Workshop on Self-* Properties in Complex Information Systems (SELF-STAR 2004), 113-116 | Proceedings Article | |
| | 2004 | Bast, Holger
Mehlhorn, Kurt
Schäfer, Guido
[Tamaki, Hisao] | | Matching Algorithms Are Fast in Sparse Random Graphs
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 81-92 | Proceedings Article | |
| | 2003 | Bast, Holger
Mehlhorn, Kurt
Schäfer, Guido
Tamaki, Hisao | | A Heuristic for Dijkstra's Algorithm With Many Targets and its Use in Weighted Matching Algorithms
In: Algorithmica [36], 75-88 | Journal Article | |
| | 1992 | Bast, Holger
[Dietzfelbinger, Martin]
Hagerup, Torben | | A Perfect Parallel Dictionary
In: 17th International Symposium on Mathematical Foundations of Computer Science (MFCS'92), 133-141 | Proceedings Article | |
| | 1991 | Bast, Holger
Hagerup, Torben | | Fast and Reliable Parallel Hashing
In: 3rd Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'91), 50-61 | Proceedings Article | |
| 7 |
| Baswana, Surender |
| |
| | 2011 | [Baswana, Surender]
[Kavitha, Telikepalli]
Mehlhorn, Kurt
[Pettie, Seth] | | Additive Spanners and (α, β)-Spanners
In: ACM Transactions on Algorithms [7], 5:1-5:26 | Journal Article | |
| | 2009 | [Baswana, Surender]
[Biswas, Somenath]
Doerr, Benjamin
[Friedrich, Tobias]
[Kurur, Piyush P.]
Neumann, Frank | | Computing Single Source Shortest Paths using Single-Objective Fitness Functions
In: FOGA'09 : revised selected papers from ACM SIGEVO
Foundations of Genetic Algorithms X, 59-66 | Proceedings Article | |
| | 2007 | Baswana, Surender
[Sen, Sandeep] | | A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
In: Random Structures & Algorithms [30], 532-563 | Journal Article | |
| | 2005 | Baswana, Surender
[Goyal, Vishrut]
[Sen, Sandeep] | | All-pairs nearly 2-approximate shortest paths in $O(n^2 \mathrm polylog n)$ time
In: STACS 2005 : 22nd Annual Symposium on Theoretical Aspects of Computer Science, 666-679 | Proceedings Article | |
| | 2005 | Baswana, Surender
Telikepalli, Kavitha
Mehlhorn, Kurt
Pettie, Seth | | New Constructions of (alpha, beta)-Spanners and Purely Additive Spanners
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 672-681 | Proceedings Article | |
| | 2004 | Baswana, Surender
[Sen, Sandeep] | | Approximate distance oracle for unweighted graphs in Expected O(n²) time
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 271-280 | Proceedings Article | |
| | 2004 | Baswana, Surender
[Sen, Sandeep] | | Randomized graph data-structures for approximate shortest path problem
In: Handbook of Data Structures and Applications, 38.1-38.19 | Part of a Book | |
| 1 |
| Batra, Prashant |
| |
| | 2010 | [Batra, Prashant]
Sharma, Vikram | | Bounds on absolute positiveness of multivariate polynomials
In: Journal of Symbolic Computation [45], 617-628 | Journal Article | |
| 1 |
| Battiti, R (ed.) |
| |
| | 1998 | [Alberts, David]
[Cattaneo, G]
[Italiano, Giuseppe]
[Nanni, Umberto]
Zaroliagis, Christos | | A Software Library of Dynamic Graph Algorithms
In: Proceedings of Workshop on Algorithms and Experiments (ALEX-98), 129-136 | Proceedings Article | |
| 1 |
| Battiti, Roberto and (ed.) |
| |
| | 2008 | Neumann, Frank
[Witt, Carsten] | | Ant Colony Optimization and the Minimum Spanning Tree Problem
In: International Conference on Learning and Intelligent Optimization 2007, 153-166 | Proceedings Article | |
| 1 |
| Baumann, Nadine |
| |
| | 2004 | Baumann, Nadine
[Köhler, Ekkehard] | | Approximating Earliest Arrival Flows with Flow-Dependent Transit Times
In: Mathematical foundations of computer science 2004 : 29th International Symposium, MFCS 2004, 599-610 | Proceedings Article | |
| 1 |
| Baumann, Tobias |
| |
| | 2007 | Althaus, Ernst
[Baumann, Tobias]
[Schömer, Elmar]
[Werth, Kai] | | Trunk Packing Revisited
In: Experimental Algorithms, 6th International Workshop, 420-432 | Proceedings Article | |
| 2 |
| Baumbach, Jan |
| |
| | 2012 | Baumbach, Jan
Friedrich, Tobias
Kötzing, Timo
[Krohmer, Anton]
Müller, Joachim
Pauling, Josch | | Efficient algorithms for extracting biological key pathways with global constraints
In: GECCO'12 : Proceedings of the Fourteenth International Conference on
Genetic and Evolutionary Computation, 169-176 | Proceedings Article | |
| | 2012 | Alcaraz, Nicolas
Friedrich, Tobias
Kötzing, Timo
[Krohmer, Anton]
Müller, Joachim
Pauling, Josch
Baumbach, Jan | | Efficient key pathway mining: combining networks and OMICS data
In: Integrative Biology [4], 756-764 | Journal Article | |
| 2 |
| |
| | 1994 | Baumgarten, Hanna
Jung, Hermann
Mehlhorn, Kurt | | Dynamic point location in general subdivisions
In: Journal of Algorithms [3], 342-380 | Journal Article | |
| | 1992 | Baumgarten, Hanna
Jung, Hermann
Mehlhorn, Kurt | | Dynamic Point Location in General Subdivisions
In: Discrete algorithms (SODA-92) : 3rd annual ACM-SIAM symposium, 250-258 | Proceedings Article | |
| 2 |
| Baus, Andreas |
| |
| | 2005 | Baus, Andreas | | Symbolic Constraints in Linear Integer Programming
Universität des Saarlandes | Thesis - Masters thesis | |
| | 2004 | Baus, Andreas | | Symbolic Constraints in Linear Integer Programming
Universität des Saarlandes | Thesis - Masters thesis | |
| 2 |
| |
| | 2013 | Jez, Artur | | Recompression: Word Equations and Beyond
In: 17th International Conference on Developments in Language Theory (DLT 2013), 12-26 | Proceedings Article | |
| | 2013 | Jez, Artur
[Okhotin, Alexander] | | Unambiguous Conjunctive Grammars over a One-Letter Alphabet
In: 17th International Conference on Developments in Language Theory (DLT 2013), 277-288 | Proceedings Article | |
| 1 |
| Bebis, George (ed.) |
| |
| | 2009 | Emeliyanenko, Pavel
Berberich, Eric
Sagraloff, Michael | | Visualizing Arcs of Implicit Algebraic Curves, Exactly and Fast
In: Advances in Visual Computing : 5th International Symposium, ISVC 2009, 608-619 | Proceedings Article | |
| 2 |
| Becchetti, Luca |
| |
| | 2003 | [Becchetti, Luca]
[Leonardi, Stefano]
[Marchetti-Spaccamela, Alberto]
Schäfer, Guido
[Vredeveld, Tjark] | | Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm
In: 44th Annual Symposium on Foundations of Computer Science (FOCS-03), 462-471 | Proceedings Article | |
| | 2003 | [Becchetti, Luca]
[Leonardi, Stefano]
[Marchetti-Spaccamela, Alberto]
Schäfer, Guido | | Scheduling to minimize flow time metrics
In: International Parallel and Distributed Processing Symposium (IPDPS-03), 223b-CDROM | Proceedings Article | |
| 1 |
| |
| | 2010 | [Althaus, Ernst]
[Altmeyer, Sebastian]
Naujoks, Rouven | | A New Combinatorial Approach to Parametric Path Analysis | Report | |
| 1 |
| |
| | 1996 | Becker, Jörg | | Allgemeine approximative Kongruenz zweier Punktmengen im R³
Universität des Saarlandes | Thesis - Masters thesis | |
| 3 |
| |
| | 1986 | Becker, Michael
Mehlhorn, Kurt | | Algorithms for Routing in Planar Graphs
In: Acta Informatica [23], 163-176 | Journal Article | |
| | 1984 | Becker, Michael
Mehlhorn, Kurt | | Algorithms for routing in planar graphs | Report | |
| | 1982 | Becker, Michael
Degenhardt, W.
Doenhardt, J.
Hertel, S.
Kaninke, G.
Kerber, W.
Mehlhorn, Kurt
Näher, Stefan
Rohnert, H.
Winter, T. | | A Probabilistic Algorithm for Vertex Connectivity of Graphs
In: Information Processing Letters [15], 135-136 | Journal Article | |
| 1 |
| |
| | 2012 | Becker, Ruben | | The Bolzano Method to Isolate the Roots of a Bitstream Polynomial
Universität des Saarlandes | Thesis - Bachelor thesis | |
| 3 |
| |
| | 1979 | Mehlhorn, Kurt | | Searching, Sorting and Information Theory
In: Mathematical foundations of computer science (MFCS-79) : 8th symposium, 131-145 | Proceedings Article | |
| | 1979 | Mehlhorn, Kurt | | Some Remarks on Boolean Sums
In: Mathematical foundations of computer science (MFCS-79) : 8th symposium, 375-380 | Proceedings Article | |
| | 1975 | Mehlhorn, Kurt
Galil, Zvi | | Monotone Switching Circuits and Boolean Matrix Product
In: Mathematical foundations of computer science (MFCS-75) : 4th symposium, 315-319 | Proceedings Article | |
| 2 |
| |
| | 2007 | Behle, Markus
[Jünger, Michael]
[Liers, Frauke] | | A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem
In: Experimental Algorithms : 6th International Workshop, WEA 2007, 379-392 | Proceedings Article | |
| | 2007 | Behle, Markus | | On threshold BDDs and the optimal variable ordering problem
In: Combinatorial Optimization and Applications : First International Conference, COCOA 2007, 124-135 | Proceedings Article | |
| 1 |
| Behrens, Christian |
| |
| | 2000 | Behrens, Christian | | Solid Modeling durch Boolesche Operationen
Universität des Saarlandes | Thesis - Masters thesis | |
| 15 |
| Beier, Rene |
| |
| | 2011 | Beier, Rene
Funke, Stefan
Matijevic, Domagoj
[Sanders, Peter] | | Energy-Efficient Paths in Radio Networks
In: Algorithmica [61], 298-319 | Journal Article | |
| | 2007 | Beier, René
[Röglin, Heiko]
[Vöcking, Berthold] | | The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
In: Integer Programming and Combinatorial Optimization : 12th International IPCO Conference, 53-67 | Proceedings Article | |
| | 2006 | Beier, René
[Vöcking, Berthold] | | An Experimental Study of Random Knapsack Problems
In: Algorithmica [45], 121-136 | Journal Article | |
| | 2006 | Beier, René
[Czumaj, Artur]
[Krysta, Piotr]
[Vöcking, Berthold] | | Computing Equilibria for a Service Provider Game with (Im)perfect Information
In: ACM Transactions on Algorithms [2], 679-706 | Journal Article | |
| | 2006 | Beier, René
[Vöcking, Berthold] | | Typical Properties of Winners and Losers in Discrete Optimization
In: SIAM Journal on Computing [35], 855-881 | Journal Article | |
| | 2004 | Beier, Rene
[Krysta, Piotr]
[Czumaj, Artur]
[Vöcking, Berthold] | | Computing Equilibria for Congestion Games with (Im)perfect Information
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 739-748 | Proceedings Article | |
| | 2004 | Beier, Rene | | Probabilistic Analysis of Discrete Optimization Problems
Universität des Saarlandes | Thesis - PhD thesis | |
| | 2004 | Beier, Rene
Vöcking, Berthold | | Probabilistic Analysis of Knapsack Core Algorithms
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 461-470 | Proceedings Article | |
| | 2004 | Beier, René
Vöcking, Berthold | | Random knapsack in expected polynomial time
In: Journal of Computer and System Sciences [69], 306-329 | Journal Article | |
| | 2004 | Beier, Rene
Vöcking, Berthold | | Typical Properties of Winners and Losers in Discrete Optimization
In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC-04), 343-352 | Proceedings Article | |
| | 2003 | Beier, Rene
Vöcking, Berthold | | Random Knapsack in Expected Polynomial Time
In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC-03), 232-241 | Proceedings Article | |
| | 2003 | Banderier, Cyril
Beier, Rene
Mehlhorn, Kurt | | Smoothed Analysis of Three Combinatorial Problems
In: Mathematical foundations of computer science 2003 : 28th International Symposium, MFCS 2003, 198-207 | Proceedings Article | |
| | 2002 | Beier, Rene
Sanders, Peter
Sivadasan, Naveen | | Energy Optimal Routing in Radio Networks Using Geometric Data Structures
In: Automata, Languages and Programming : 29th International Colloquium, ICALP 2002, 366-376 | Proceedings Article | |
| | 2000 | Beier, Rene
Sibeyn, Jop F. | | A powerful heuristic for telephone gossiping
In: Proceedings of the 7th International Colloquium on Structural Information and Communication Complexity (SIROCCO-00), 17-36 | Proceedings Article | |
| | 2000 | Beier, Rene | | Eine Heuristik für das Gossiping-Problem
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Bein, Wolfgang W. |
| |
| | 2000 | [Bein, Wolfgang W.]
Fleischer, Rudolf
[Larmore, Lawrence L.] | | Limited bookmark randomized online algorithms for the paging problem
In: Information Processing Letters [76], 155-162 | Journal Article | |
| 1 |
| Bei, Xiaohui |
| |
| | 2015 | Bei, Xiaohui | | Solving Linear Programming with Constraints Unknown
In: Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I., 129-142 | Proceedings Article | |
| 7 |
| Beldiceanu, Nicolas |
| |
| | 2007 | [Beldiceanu, Nicolas]
Katriel, Irit
Thiel, Sven | | Filtering Algorithms for the Same and UsedBy Constraints
In: Archives of Control Sciences [to appear], to appear | Journal Article | |
| | 2005 | [Beldiceanu, Nicolas]
Katriel, Irit
Thiel, Sven | | GCC-like Restrictions on the Same constraint
In: Constraint Satisfaction and Constraint Logic Programming : ERCIM/CoLogNet International Workshop, CSCLP 2004, 1-11
In: Recent Advances in Constraints [3419], 1-11 | Proceedings Article | |
| | 2004 | Beldiceanu, Nicolas
Katriel, Irit
Thiel, Sven | | Filtering algorithms for the Same and UsedBy constraints | Report | |
| | 2004 | [Beldiceanu, Nicolas]
Katriel, Irit
Thiel, Sven | | Filtering algorithms for the Same constraint
In: Integration of AI and OR techniques in constraint programming for combinatorial optimization problems : First International Conference, CPAIOR 2004, 65-79 | Proceedings Article | |
| | 2003 | [Beldiceanu, Nicolas]
[Carlsson, Mats]
Thiel, Sven | | Sweep Synchronization as a Global Propagation Mechanism
In: Fifth International Workshop on Integration of AI and OR Techniques
in Constraint Programming for Combinatorial Optimization Problems, 139-152 | Electronic Proceedings Article | |
| | 2002 | [Beldiceanu, Nicolas]
[Carlsson, Mats]
Thiel, Sven | | Cost-Filtering Algorithms for the two Sides of the Sum of Weights of Distinct Values Constraint | Report | |
| | 2001 | [Beldiceanu, Nicolas]
[Guo, Qi]
Thiel, Sven | | Non-overlapping Constraints between Convex Polytopes
In: Proceedings of the 7th International Symposium on Principles and Practice of Constraint Programming (CP-01), 392-407 | Proceedings Article | |
| 1 |
| Belfrage, Michael |
| |
| | 2012 | [Belfrage, Michael]
[Mütze, Torsten]
Spöhel, Reto | | Probabilistic one-player Ramsey games via deterministic two-player games
In: SIAM Journal on Discrete Mathematics [26], 1031-1049 | Journal Article | |
| 1 |
| Bellobás, Béla (ed.) |
| |
| | 1997 | Hundack, Christoph
Prömel, Hans Jürgen
Steger, Angelika | | Extremal Graph Problems for Graphs with a Color-Critical Vertex
In: Combinatorics, Geometry and Probability, 421-433 | Part of a Book | |
| 1 |
| Ben-Asher, Y. |
| |
| | 1995 | [Ben-Asher, Y.]
[Schuster, Assaf]
Sibeyn, Jop F. | | Load balancing: A programmer's approach or the impact of task-length parameter on the load balancing performance of parallel programs
In: International Journal on High-Speed Computing [7], 303-326 | Journal Article | |
| 1 |
| Ben-Zwi, Oren |
| |
| | 2011 | [Ben-Zwi, Oren]
Hermelin, Danny
[Lokshtanov, Daniel]
[Newman, Ilan] | | Treewidth governs the complexity of target set selection
In: Discrete Optimization [8], 87-96 | Journal Article | |
| 1 |
| Bender, Michael A. (ed.) |
| |
| | 2005 | | | Cache-Oblivious and Cache-Aware Algorithms | Report | |
| 49 |
| Berberich, Eric |
| |
| | 2013 | Berberich, Eric
Emeliyanenko, Pavel
Kobel, Alexander
Sagraloff, Michael | | Exact symbolic–numeric computation of planar algebraic curves
In: Theoretical Computer Science [491], 1-32 | Journal Article | |
| | 2012 | Berberich, Eric
[Halperin, Dan]
[Kerber, Michael]
[Pogalnikova, Roza] | | Deconstructing Approximate Offsets
In: Discrete & Computational Geometry [48], 964-989 | Journal Article | |
| | 2012 | Berberich, Eric
Emeliyanenko, Pavel
Kobel, Alexander
Sagraloff, Michael | | Exact Symbolic-Numeric Computation of Planar Algebraic Curves
In: arXiv [abs/1201.1548v1], 1-46 | Electronic Journal Article | |
| | 2011 | Berberich, Eric
[Hemmer, Michael]
[Kerber, Michael] | | A Generic Algebraic Kernel for Non-linear Geometric Applications
In: Proceedings of the 27th Annual Symposium on Computational Geometry (SCG'11), 179-186 | Proceedings Article | |
| | 2011 | Berberich, Eric
Emeliyanenko, Pavel
Sagraloff, Michael | | An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks
In: 2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX), 35-47 | Proceedings Article | |
| | 2011 | Berberich, Eric
Emeliyanenko, Pavel
Kobel, Alexander
Sagraloff, Michael | | Arrangement Computation for Planar Algebraic Curves
In: arXiv [abs/1103.4697], | Electronic Journal Article | |
| | 2011 | Berberich, Eric
Emeliyanenko, Pavel
Kobel, Alexander
Sagraloff, Michael | | Arrangement Computation for Planar Algebraic Curves
In: Proceedings of the 4th Internal Workshop on Symbolic-Numeric Computation, 88-98 | Proceedings Article | |
| | 2011 | Berberich, Eric
[Halperin, Dan]
[Kerber, Michael]
[Pogalnikova, Roza] | | Deconstructing Approximate Offsets
In: arXiv [abs/1109.2158], | Electronic Journal Article | |
| | 2011 | Berberich, Eric
[Halperin, Dan]
[Kerber, Michael]
[Pogalnikova, Roza] | | Deconstructing Approximate Offsets
In: Proceedings of the 27th Annual Symposium on Computational Geometry (SCG'11), 187-196 | Proceedings Article | |
| | 2010 | Berberich, Eric
[Hemmer, Michael]
[Kerber, Michael] | | A Generic Algebraic Kernel for Non-linear Geometric Applications | Report | |
| | 2010 | Berberich, Eric
Kerber, Michael
Sagraloff, Michael | | An efficient algorithm for the stratification and triangulation of an algebraic surface
In: Computational Geometry: Theory and Applications (CGTA) [43], 257-278 | Journal Article | |
| | 2010 | Berberich, Eric
Emeliyanenko, Pavel
Sagraloff, Michael | | An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks
In: CoRR [abs/1010.1386], 1-16 | Electronic Journal Article | |
| | 2010 | Berberich, Eric
[Fogel, Efi]
[Halperin, Dan]
[Kerber, Michael]
[Setter, Ophir] | | Arrangements on Parametric Surfaces II: Concretizations and Applications
In: Mathematics in Computer Science [4], 67-91 | Journal Article | |
| | 2010 | Berberich, Eric
[Fogel, Efi]
[Halperin, Dan]
Mehlhorn, Kurt
[Wein, Ron] | | Arrangements on Parametric Surfaces I: General Framework and Infrastructure
In: Mathematics in Computer Science [4], 45-66 | Journal Article | |
| | 2010 | Berberich, Eric
[Hagen, Matthias]
[Hiller, Benjamin]
[Moser, Hannes] | | Experiments
In: Algorithm Engineering : Bridging the Gap between Algorithm Theory and Practice, 325-388 | Part of a Book | |
| | 2010 | [Mörig, Marc]
[Scholz, Sven]
[Tscheuschner, Tobias]
Berberich, Eric | | Implementation aspects
In: Algorithm Engineering : Bridging the Gap between Algorithm Theory and Practice, 237-289 | Part of a Book | |
| | 2010 | Berberich, Eric
[Halperin, Dan]
[Kerber, Michael]
[Pogalnikova, Roza] | | Polygonal Reconstruction from Approximate Offsets
In: 26th European Workshop on Computational Geometry : Workshop Proceedings, 65-68 | Electronic Proceedings Article | |
| | 2009 | Berberich, Eric
Sagraloff, Michael | | A Generic and Flexible Framework for the Geometrical and Topological Analysis of (Algebraic) Surfaces
In: Computer Aided Geometric Design (CAGD) [26], 627-647 | Journal Article | |
| | 2009 | Emeliyanenko, Pavel
Berberich, Eric
Sagraloff, Michael | | Visualizing Arcs of Implicit Algebraic Curves, Exactly and Fast
In: Advances in Visual Computing : 5th International Symposium, ISVC 2009, 608-619 | Proceedings Article | |
| | 2008 | Berberich, Eric
Sagraloff, Michael | | A Generic and Flexible Framework for the Geometrical and Topological Analysis of (Algebraic) Surfaces
In: Proceedings of the 2008 ACM Symposium on Solid and Physical Modeling, 171-182 | Proceedings Article | |
| | 2008 | Berberich, Eric
Kerber, Michael | | Arrangements on Surfaces of Genus One: Tori and Dupin Cyclides
In: 24th European Workshop on Computational Geometry - Collection of Abstracts, 209-212 | Proceedings Article | |
| | 2008 | Berberich, Eric
Emeliyanenko, Pavel | | CGAL's Curved Kernel via Analysis | Report | |
| | 2008 | Berberich, Eric
Kerber, Michael | | Exact Arrangements on Tori and Dupin Cyclides
In: Proceedings of the 2008 ACM Symposium on Solid and Physical Modeling, 59-66 | Proceedings Article | |
| | 2008 | Berberich, Eric
Kerber, Michael
Sagraloff, Michael | | Exact Geometric-Topological Analysis of Algebraic Surfaces
In: Proceedings of the 24th ACM Symposium on Computational Geometry, 164-173 | Proceedings Article | |
| | 2008 | Berberich, Eric
Kerber, Michael
Sagraloff, Michael | | Geometric Analysis of Algebraic Surfaces Based on Planar Arrangements
In: 24th European Workshop on Computational Geometry - Collection of Abstracts, 29-32 | Proceedings Article | |
| | 2008 | Berberich, Eric
Hemmer, Michael
[Karavelas, Menelaos]
[Pion, Sylvain]
[Teillaud, Monique]
[Tsigaridas, Elias] | | Prototype implementation of the algebraic kernel | Report | |
| | 2008 | Berberich, Eric | | Robust and Efficient Software for Problems in 2.5-Dimensional Non-Linear Geometry - Algorithms and Implementations
Universität des Saarlandes | Thesis - PhD thesis | |
| | 2007 | Berberich, Eric
[Meyerovitch, Michal] | | Computing Envelopes of Quadrics | Report | |
| | 2007 | Berberich, Eric
[Meyerovitch, Michal] | | Computing Envelopes of Quadrics
In: Proceedings of 23rd European Workshop on Computational Geometry, 235-238 | Proceedings Article | |
| | 2007 | Berberich, Eric
[Hemmer, Michael] | | Definition of the 3D Quadrical Kernel Content | Report | |
| | 2007 | Berberich, Eric
Caroli, Manuel
[Wolpert, Nicola] | | Exact Computation of Arrangements of Rotated Conics | Report | |
| | 2007 | Berberich, Eric
Caroli, Manuel
[Wolpert, Nicola] | | Exact Computation of Arrangements of Rotated Conics
In: Proceedings of 23rd European Workshop on Computational Geometry, 231-234 | Proceedings Article | |
| | 2007 | Berberich, Eric
Kettner, Lutz | | Linear-Time Reordering in a Sweep-line Algorithm for Algebraic Curves Intersecting in a Common Point | Report | |
| | 2007 | Berberich, Eric
Hemmer, Michael
[Karavelas, Menelaos I.]
[Teillaud, Monique] | | Revision of interface specification of algebraic kernel | Report | |
| | 2007 | Berberich, Eric
[Fogel, Efi]
[Halperin, Dan]
Mehlhorn, Kurt
[Wein, Ron] | | Sweeping and Maintaining Two-Dimensional Arrangements on Quadrics | Report | |
| | 2007 | Berberich, Eric
[Fogel, Efi]
[Halperin, Dan]
[Wein, Ron] | | Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces
In: Proceedings of 23rd European Workshop on Computational Geometry, 223-226 | Proceedings Article | |
| | 2007 | Berberich, Eric
[Fogel, Efi]
[Halperin, Dan]
Mehlhorn, Kurt
[Wein, Ron] | | Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step
In: Algorithms - ESA 2007, 15th Annual European Symposium, 645-656 | Proceedings Article | |
| | 2007 | Berberich, Eric
[Fogel, Efi]
Meyer, Andreas | | Updated Website to include Benchmark Instances for Arrangements of Quadrics and Planar Algebraic Curves | Report | |
| | 2006 | Berberich, Eric
Ebert, Franziska
Kettner, Lutz | | Definition of file format for benchmark instances for arrangements of Quadrics | Report | |
| | 2006 | Berberich, Eric
Hemmer, Michael
[Karavelas, Menelaos]
[Pion, Sylvain]
[Teillaud, Monique]
[Tsigaridas, Elias] | | Interface specification of algebraic kernel | Report | |
| | 2006 | Berberich, Eric
Hemmer, Michael | | Prototype implementation of the algebraic kernel | Report | |
| | 2006 | Berberich, Eric
Ebert, Franziska
[Fogel, Efi]
Kettner, Lutz | | Web-site with benchmark instances for planar curve arrangements | Report | |
| | 2005 | Berberich, Eric
[Hemmer, Michael]
Kettner, Lutz
[Schömer, Elmar]
Wolpert, Nicola | | An Exact, Complete and Efficient Implementation for Computing Planar Maps of Quadric Intersection Curves
In: 21st Annual Symposium on Computational Geometry (SCG'05), 99-106 | Proceedings Article | |
| | 2005 | Berberich, Eric
Eigenwillig, Arno
[Hemmer, Michael]
[Hert, Susan]
Kettner, Lutz
Mehlhorn, Kurt
Reichel, Joachim
Schmitt, Susanne
[Schömer, Elmar]
Wolpert, Nicola | | EXACUS: Efficient and exact algorithms for curves and surfaces
In: 13th Annual European Symposium on Algorithms (ESA 2005), 155-166 | Proceedings Article | |
| | 2004 | Berberich, Eric
Eigenwillig, Arno
[Emiris, Ioannis]
[Fogel, Efraim]
[Hemmer, Michael]
[Halperin, Dan]
[Kakargias, Athanasios]
Kettner, Lutz
Mehlhorn, Kurt
[Pion, Sylvain]
[Schömer, Elmar]
[Teillaud, Monique]
[Wein, Ron]
Wolpert, Nicola | | An Empirical Comparison of Software for Constructing Arrangements of Curved Arcs | Report | |
| | 2004 | Berberich, Eric | | Exact Arrangements of Quadric Intersection Curves
Universität des Saarlandes | Thesis - Masters thesis | |
| | 2004 | Berberich, Eric
Eigenwillig, Arno
[Hemmer, Michael]
[Hert, Susan]
Kettner, Lutz
Mehlhorn, Kurt
Reichel, Joachim
Schmitt, Susanne
[Schömer, Elmar]
Weber, Dennis
Wolpert, Nicola | | EXACUS: Efficient and Exact Algorithms for Curves and Surfaces | Report | |
| | 2003 | Berberich, Eric
Eigenwillig, Arno
[Fogel, Efi]
[Halperin, Dan]
Hert, Susan
Kettner, Lutz
[Teillaud, Monique]
[Wein, Ron] | | Specification of the traits classes for CGAL arrangements of curves | Report | |
| | 2002 | Berberich, Eric
Eigenwillig, Arno
Hemmer, Michael
Hert, Susan
Mehlhorn, Kurt
Schömer, Elmar | | A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 174-186 | Proceedings Article | |
| 4 |
| Berenbrink, Petra |
| |
| | 2012 | [Akbari, Hoda]
[Berenbrink, Petra]
Sauerwald, Thomas | | A simple approach for adapting continuous load balancing processes to discrete settings
In: PODC'12 : Proceedings of the 2012 ACM Symposium on Principles of Distributed Computing, 271-280 | Proceedings Article | |
| | 2011 | [Berenbrink, Petra]
[Hoefer, Martin]
Sauerwald, Thomas | | Distributed Selfish Load Balancing on Networks
In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 1487-1497 | Proceedings Article | |
| | 2011 | [Berenbrink, Petra]
[Friedetzky, Tom]
[Elsaesser, Robert]
[Nagel, Lars]
Sauerwald, Thomas | | Faster Coupon Collecting via Replication with Applications in Gossiping
In: 36th International Symposium on Mathematical Foundations of Computer Science (MFCS-11), 72-83 | Proceedings Article | |
| | 2011 | [Berenbrink, Petra]
[Cooper, Colin]
[Friedetzky, Tom]
Friedrich, Tobias
Sauerwald, Thomas | | Randomized Diffusion for Indivisible Loads
In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 429-439 | Proceedings Article | |
| 1 |
| |
| | 2006 | Bast, Holger
[Dupret, Georges]
Majumdar, Debapriyo
[Piwowarski, Benjamin] | | Discovering a Term Taxonomy from Term Similarities Using Principal Component Analysis
In: Semantics, web and mining : Joint International Workshops, EWMF 2005 and KDO 2005, 103-120 | Proceedings Article | |
| 1 |
| |
| | 2010 | [Berghammer, Rudolf]
Friedrich, Tobias
Neumann, Frank | | Set-based Multi-Objective Optimization, Indicators, and Deteriorative Cycles
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 495-502 | Proceedings Article | |
| 1 |
| |
| | 2008 | [Diedrich, Florian]
[Kehden, Britta]
Neumann, Frank | | Multi-objective Problems in Terms of Relational Algebra
In: Relations and Kleene Algebra in Computer Science 2008, 84-98 | Proceedings Article | |
| 1 |
| |
| | 1995 | [Berg, Marc de]
[Kreveld, Marc van]
Schirra, Stefan | | A new approach to subdivision simplification
In: ACSM/ASPRS Annual Convention & Exposition Technical Papers, 79-88 | Proceedings Article | |
| 1 |
| |
| | 2003 | Berman, Piotr
Krysta, Piotr | | Optimizing Misdirection
In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 192-201 | Proceedings Article | |
| 1 |
| Bermond, Jean-Claude (ed.) |
| |
| | 1999 | Sibeyn, Jop F. | | Power and Limitations of Optical Reconfigurable Arrays
In: Proceedings of the 6th International Colloquium on Structural Information and Communication Complexity (SIROCCO 6), 249-263 | Proceedings Article | |
| 1 |
| |
| | 1995 | [Berthomé, P.]
[Duboux, T.]
Hagerup, Torben
[Newman, I.]
[Schuster, Assaf] | | Self-Simulation for the Passive Optical Star Model
In: Algorithms-ESA'95: 3rd Annual European Symposium, 268-380 | Proceedings Article | |
| 1 |
| |
| | 2012 | Elbassioni, Khaled
[Fouad, Mohamed]
[Bertino, Elisa] | | Modeling the Risk & Utility of Information Sharing in Social Networks
In: 2012 ASE/IEEE International Conference on Privacy, Security, Risk and Trust and
2012 ASE/IEEE International Conference on Social Computing : SocialCom/PASSAT 2012, 441-450 | Proceedings Article | |
| 1 |
| |
| | 1998 | [Alberts, David]
[Cattaneo, G]
[Italiano, Giuseppe]
[Nanni, Umberto]
Zaroliagis, Christos | | A Software Library of Dynamic Graph Algorithms
In: Proceedings of Workshop on Algorithms and Experiments (ALEX-98), 129-136 | Proceedings Article | |
| 4 |
| |
| | 2008 | [Brockhoff, Dimo]
Friedrich, Tobias
Neumann, Frank | | Analyzing Hypervolume Indicator Based Algorithms
In: Parallel Problem Solving from Nature (PPSN X), 651-660 | Proceedings Article | |
| | 2008 | Neumann, Frank
[Reichel, Joachim] | | Approximating Minimum Multicuts by Evolutionary Multi-Objective Algorithms
In: Parallel Problem Solving from Nature (PPSN X), 72-81 | Proceedings Article | |
| | 2008 | [Kroeske, Jense]
[Ghandar, Adam]
[Michalewicz, Zbigniew]
Neumann, Frank | | Learning Fuzzy Rules with Evolutionary Algorithms - An Analytic Approach
In: Parallel Problem Solving from Nature (PPSN X), 1051-1060 | Proceedings Article | |
| | 2008 | Friedrich, Tobias
[Horoba, Christian]
Neumann, Frank | | Runtime Analyses for Using Fairness in Evolutionary Multi-Objective Optimization
In: Parallel Problem Solving from Nature (PPSN X), 671-680 | Proceedings Article | |
| 5 |
| Beyer, Hans- Georg (ed.) |
| |
| | 2011 | [Durrett, Greg]
[Neumann, Frank]
[O'Reilly, Una-May] | | Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics
In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, 69-80 | Proceedings Article | |
| | 2011 | Doerr, Benjamin
Johannsen, Daniel
Kötzing, Timo
[Lehre, Per Christian]
Wagner, Markus
Winzen, Carola | | Faster black-box algorithms through higher arity operators
In: Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI (FOGA 2011), 163-172 | Proceedings Article | |
| | 2011 | Doerr, Benjamin
Johannsen, Daniel
[Schmidt, Martin] | | Runtime analysis of the (1+1) evolutionary algorithm on strings over finite alphabets
In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, 119-126 | Proceedings Article | |
| | 2011 | Kötzing, Timo
[Neumann, Frank]
[Sudholt, Dirk]
[Wagner, Markus] | | Simple max-min ant systems and the optimization of linear pseudo-Boolean functions
In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, 209-218 | Proceedings Article | |
| | 2011 | Friedrich, Tobias
[Bringmann, Karl]
[Voss, Thomas]
[Igel, Christian] | | The Logarithmic Hypervolume Indicator
In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, 81-92 | Proceedings Article | |
| 2 |
| Beyer, Hans-Georg (ed.) |
| |
| | 2009 | | | GECCO 2009: Proceedings of the 11th Annual conference on Genetic and evolutionary computation. | Proceedings | |
| | 2007 | | | GECCO 2007: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation | Proceedings | |
| 1 |
| |
| | 2006 | Doerr, Benjamin
Hebbinghaus, Nils
Neumann, Frank | | Speeding Up Evolutionary Algorithms Through Restricted Mutation Operators
In: Parallel Problem Solving from Nature - PPSN IX, 9th International Conference, 978-987 | Proceedings Article | |
| 1 |
| |
| | 2013 | [Anshelevich, Elliot]
[Bhardwaj, Onkar]
Hoefer, Martin | | Friendship and Stable Matching.
In: 21st European Symposium on Algorithms (ESA-13), 49-60 | Proceedings Article | |
| 1 |
| Bhaskar Krishnamachari (ed.) |
| |
| | 2008 | Funke, Stefan
Laue, Sören
Naujoks, Rouven
[Lotker, Zvi] | | Power Assignment Problems in Wireless Communication: Covering Points by Disks, Reaching few Receivers Quickly, and Energy-Efficient Travelling Salesman Tours
In: Distributed Computing in Sensor Systems, 4th IEEE International Conference, DCOSS 2008, 282-295 | Proceedings Article | |
| 1 |
| |
| | 2009 | [Bhaskar, Umang]
[Fleischer, Lisa]
[Hoy, Darrell]
Huang, Chien-Chung | | Equilibria of Atomic Flow Games are not Unique
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 748-757 | Proceedings Article | |
| 1 |
| |
| | 1998 | [Biedl, Therese]
[Kaufmann, Michael]
Mutzel, Petra | | Drawing Planar Partitions II: HH-Drawings
In: Proceedings of the 24th Workshop on Graph-Theoretic Concepts in Computer Science (WG-98), 124-136 | Proceedings Article | |
| 1 |
| |
| | 2004 | Sanders, Peter | | Algorithms for Scalable Storage Servers
In: SOFSEM 2004 : theory and practice of computer science ; 30th Conference on Current Trends in Theory and Practice of Computer Science, 82-101 | Proceedings Article | |
| 1 |
| |
| | 2004 | [Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Khachiyan, Leonid] | | Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems
In: Integer programming and combinatorial optimization : 10th International IPCO Conference, 152-162 | Proceedings Article | |
| 1 |
| |
| | 2010 | Megow, Nicole | | Keller oder Dach zuerst
In: Besser als Mathe, 111-116 | Part of a Book | |
| 1 |
| |
| | 2005 | [Bifet, Albert]
[Castillo, Carlos]
[Chirita, Paul-Elexandru]
Weber, Ingmar | | An Analysis of Factors Used in Search Engine Ranking
In: 1st International Workshop on Adversarial Information Retrieval on the Web (AIRWeb'05), 1-10 | Electronic Proceedings Article | |
| 1 |
| |
| | 1994 | Bilardi, Gianfranco
Chaudhuri, Shiva
Dubhashi, Devdatt
Mehlhorn, Kurt | | A lower bound for area-universal graphs
In: Information Processing Letters [51], 101-105 | Journal Article | |
| 5 |
| Bilardi, Gianfranco (ed.) |
| |
| | 1998 | Solis-Oba, Roberto | | 2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 441-452 | Proceedings Article | |
| | 1998 | [Frigioni, Daniele]
Miller, Tobias
[Nanni, Umberto]
[Pasqualone, Giulio]
Schäfer, Guido
Zaroliagis, Christos | | An experimental study of dynamic algorithms for directed graphs
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 368-380 | Proceedings Article | |
| | 1998 | Chong, Ka Wong
Ramos, Edgar A. | | Improved deterministic parallel padded sorting
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 405-416 | Proceedings Article | |
| | 1998 | Bradford, Phillip Gnassi
[Golin, Mordecai J.]
[Larmore, Lawrence L.]
[Rytter, Wojciech] | | Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 43-54 | Proceedings Article | |
| | 1998 | Meyer, Ulrich
Sanders, Peter | | $\Delta$-Stepping: A Parallel Single Source Shortest Path Algorithm
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 393-404 | Proceedings Article | |
| 1 |
| |
| | 1997 | Sibeyn, Jop F.
[Guillaume, Frank]
[Seidel, Tillmann] | | Practical Parallel List Ranking
In: Proceedings of the 4th Symposium on Solving Irregularly Structured Problems in Parallel (IRREGULAR-97), 25-36 | Proceedings Article | |
| 4 |
| |
| | 2010 | Kötzing, Timo
Neumann, Frank
[Röglin, Heiko]
[Witt, Carsten] | | Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem
In: Swarm Intelligence : 7th International Conference, ANTS 2010, 324-335 | Proceedings Article | |
| | 2009 | | | GECCO 2009: Proceedings of the 11th Annual conference on Genetic and evolutionary computation. | Proceedings | |
| | 2008 | Neumann, Frank
[Sudholt, Dirk]
[Witt, Carsten] | | Rigorous Analyses for the Combination of Ant Colony Optimization and Local Search
In: International Conference on Ant Colony Optimization and Swarm Intelligence 2008, 132-143 | Proceedings Article | |
| | 2007 | Neumann, Frank
[Sudholt, Dirk]
[Witt, Carsten] | | Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions
In: Engineering Stochastic Local Search Algorithms 2007, 61-75 | Proceedings Article | |
| 1 |
| Birk, Rüdiger |
| |
| | 1997 | Birk, Rüdiger | | Lösung von Varianten des Post-Office-Problems mit Hilfe von Skip List Range Trees
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Biswas, Somenath |
| |
| | 2009 | [Baswana, Surender]
[Biswas, Somenath]
Doerr, Benjamin
[Friedrich, Tobias]
[Kurur, Piyush P.]
Neumann, Frank | | Computing Single Source Shortest Paths using Single-Objective Fitness Functions
In: FOGA'09 : revised selected papers from ACM SIGEVO
Foundations of Genetic Algorithms X, 59-66 | Proceedings Article | |
| 1 |
| Bj{ |
| |
| 1 |
| |
| | 2007 | Bast, Holger
[Majumdar, Debapriyo]
Weber, Ingmar | | Efficient interactive query expansion with CompleteSearch
In: 16th Conference on Information and Knowledge Management (CIKM'07), 857-860 | Proceedings Article | |
| 1 |
| |
| | 1996 | Blanchebarbe, Markus | | Untersuchung zur Implementierung eines parallelen Algorithmus mit guter asymptotischer Laufzeit auf einem Rechner mit verteiltem Speicher und Message-Passing
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| |
| | 2010 | [Blelloch, Guy E.]
Farzan, Arash | | Succinct Representations of Separable Graphs
In: Combinatorial Pattern Matching : 21st Annual Symposium, CPM 2010, 138-150 | Proceedings Article | |
| 3 |
| |
| | 2013 | Doerr, Benjamin
Künnemann, Marvin | | How the (1+λ) Evolutionary Algorithm Optimizes Linear Functions
In: 15th Annual Conference on Genetic and Evolutionary Computation Conference (GECCO '13), 1589-1596 | Proceedings Article | |
| | 2009 | | | GECCO 2009: Proceedings of the 11th Annual conference on Genetic and evolutionary computation. | Proceedings | |
| | 2008 | Neumann, Frank
[Sudholt, Dirk]
[Witt, Carsten] | | Rigorous Analyses for the Combination of Ant Colony Optimization and Local Search
In: International Conference on Ant Colony Optimization and Swarm Intelligence 2008, 132-143 | Proceedings Article | |
| 4 |
| |
| | 1991 | Alt, Helmut
Blum, Norbert
Mehlhorn, Kurt
Paul, Markus | | Computing a maximum cardinality matching in a bipartite graph in time $O(n^1.5 \sqrtm/\log n)$
In: Information Processing Letters [37], 237-240 | Journal Article | |
| | 1980 | Blum, Norbert
Mehlhorn, Kurt | | On the Average Number of Rebalancing Operations in Weight-Balanced Trees
In: Theoretical Computer Science [11], 303-320 | Journal Article | |
| | 1979 | Blum, Norbert
Mehlhorn, Kurt | | Mittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten Bäumen
In: Theoretical Computer Science, 4th GI-Conference, 67-78 | Proceedings Article | |
| | 1978 | Blum, Norbert
Mehlhorn, Kurt | | On the Average Number of Rebalancing Operations in Weight-Balanced Trees | Report | |
| 1 |
| Böcker, Sebastian |
| |
| | 2009 | [Böcker, Sebastian]
[Hüffner, Falk]
[Truss, Anke]
Wahlström, Magnus | | A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams
In: Parameterized and Exact Computation : 4th International Workshop, IWPEC 2009, 38-49 | Proceedings Article | |
| 1 |
| Bockmayr, Alexander |
| |
| | 2002 | Althaus, Ernst
[Bockmayr, Alexander]
[Elf, Matthias]
[Kasper, Thomas]
[Jünger, Michael]
Mehlhorn, Kurt | | SCIL - Symbolic Constraints in Integer Linear Programming.
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 75-87 | Proceedings Article | |
| 3 |
| Bode, Arndt (ed.) |
| |
| | 2000 | Sanders, Peter
Sibeyn, Jop F. | | A Bandwidth Latency Tradeoff for Broadcast and Reduction
In: Euro-Par 2000 Parallel Processing, Proceedings of the 6th International Euro-Par Conference (Euro-Par-00), 918-926 | Proceedings Article | |
| | 2000 | Meyer, Ulrich
Sanders, Peter | | Parallel Shortest Path for Arbitrary Graphs
In: Euro-Par 2000 Parallel Processing, Proceedings of the 6th International Euro-Par Conference (Euro-Par-00), 461-470 | Proceedings Article | |
| | 1998 | Sanders, Peter | | Tree Shaped Computations as a Model for Parallel Applications
In: Anwendungsbezogene Lastverteilung (ALV), 123-132 | Proceedings Article | |
| 2 |
| Bodirsky, Manuel |
| |
| | 2007 | [Bodirsky, Manuel]
[Gröpl, Clemens]
Johannsen, Daniel
[Kang, Mihyun] | | A Direct Decomposition of 3-connected Planar Graphs
In: Séminaire Lotharingien de Combinatoire [B54Ak], 15 | Journal Article | |
| | 2007 | [Bodirsky, Manuel]
Kutz, Martin | | Determining the consistency of partial tree descriptions
In: Artificial Intelligence [171], 185-196 | Journal Article | |
| 5 |
| |
| | 2006 | [Bodlaender, Hans L.]
[Feremans, Corinne]
[Grigoriev, Alexander]
[Penninkx, Eelko]
Sitters, Rene
[Wolle, Thomas] | | On the minimum corridor connection and other generalized geometric problems
In: 4th Workshop on Approximation and Online Algorithms, WAOA, 69-82 | Proceedings Article | |
| | 2005 | Katriel, Irit
[Bodlaender, Hans L.] | | Online Topological Ordering
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 443-450 | Proceedings Article | |
| | 1998 | [Bodlaender, Hans L.]
Hagerup, Torben | | Parallel Algorithms with Optimal Speedup for Bounded Treewidth
In: SIAM Journal on Computing [27], 1725-1746 | Journal Article | |
| | 1998 | [Bodlaender, Hans L.]
[Deogun, Jitender S.]
Jansen, Klaus
[Kloks, Ton]
[Kratsch, Dieter]
[Müller, Haiko]
[Tuza, Zsolt] | | Ranking of Graphs
In: SIAM Journal on Discrete Mathematics [11], 168-181 | Journal Article | |
| | 1995 | [Bodlaender, Hans L.]
Hagerup, Torben | | Parallel Algorithms with Optimal Speedup for Bounded Treewidth
In: Automata, Languages, and Programming: 22nd International Colloquium (ICALP95), 268-279 | Proceedings Article | |
| 2 |
| Bodlaender, Hans L. (ed.) |
| |
| | 2013 | [Curticapean, Radu]
Künnemann, Marvin | | A Quantization Framework for Smoothed Analysis of Euclidean Optimization Problems
In: 21st Annual European Symposium on Algorithms (ESA 2013), 349-360 | Proceedings Article | |
| | 2013 | Khosla, Megha | | Balls into Bins Made Faster
In: Algorithms - ESA 2013, | Proceedings Article | |
| 1 |
| Bodlaender, Hans (ed.) |
| |
| | 2013 | [Anshelevich, Elliot]
[Bhardwaj, Onkar]
Hoefer, Martin | | Friendship and Stable Matching.
In: 21st European Symposium on Algorithms (ESA-13), 49-60 | Proceedings Article | |
| 1 |
| Bogdan S. Chlebus (ed.) |
| |
| | 2008 | Funke, Stefan
Laue, Sören
Naujoks, Rouven
[Lotker, Zvi] | | Power Assignment Problems in Wireless Communication: Covering Points by Disks, Reaching few Receivers Quickly, and Energy-Efficient Travelling Salesman Tours
In: Distributed Computing in Sensor Systems, 4th IEEE International Conference, DCOSS 2008, 282-295 | Proceedings Article | |
| 1 |
| Bogdan, Paul |
| |
| | 2013 | [Bogdan, Paul]
Sauerwald, Thomas
[Stauffer, Alexandre]
Sun, He | | Balls into Bins via Local Search
In: 24th ACM-SIAM Symposium on Discrete Algorithms (SODA-13), 16-34 | Electronic Proceedings Article | |
| 1 |
| Boghossian, Nicolas Pascal |
| |
| | 1999 | Boghossian, Nicolas Pascal
Kohlbacher, Oliver
Lenhof, Hans-Peter | | BALL: Biochemical Algorithms Library
In: Algorithm engineering (WAE-99) : 3rd International Workshop, WAE'99, 330-344 | Proceedings Article | |
| 1 |
| Böhling, Karl-Heinz (ed.) |
| |
| | 1979 | Mehlhorn, Kurt | | Konzepte der Komplexitätstheorie illustriert am Beispiel des Sortierens
In: GI - 9. Jahrestagung, 16-22 | Proceedings Article | |
| 2 |
| Böhme, Sascha |
| |
| | 2013 | [Alkassar, Eyad]
[Böhme, Sascha]
Mehlhorn, Kurt
Rizkallah, Christine | | A Framework for the Verification of Certifying Computations | Unpublished/Draft | |
| | 2011 | [Alkassar, Eyad]
[Böhme, Sascha]
Mehlhorn, Kurt
Rizkallah, Christine | | Verification of Certifying Computations
In: Computer Aided Verification : 23rd International Conference, CAV 2011, 67-82 | Proceedings Article | |
| 1 |
| |
| | 1978 | Altenkamp, Doris
Mehlhorn, Kurt | | Codes: Unequal Probabilities, Unequal Letter Cost
In: Automata, languages and programming (ICALP-78): 5th international colloquium, 15-25 | Proceedings Article | |
| 2 |
| Boissonnat, Jean-Daniel (ed.) |
| |
| | 2007 | [Mourrain, Bernard]
[Pion, Sylvain]
Schmitt, Susanne
[Técourt, Jean-Pierre]
[Tsigaridas, Elias]
Wolpert, Nicola | | Algebraic Issues in Computational Geometry
In: Effective Computational Geometry for Curves and Surfaces, 117-155 | Part of a Book | |
| | 2007 | [Fogel, Efi]
[Halperin, Dan]
Kettner, Lutz
[Teillaud, Monique]
[Wein, Ron]
Wolpert, Nicola | | Arrangements
In: Effective Computational Geometry for Curves and Surfaces, 1-66 | Part of a Book | |
| 1 |
| Boldi, Paolo (ed.) |
| |
| | 2010 | Elmasry, Amr
[Jensen, Claus]
[Katajainen, Jyrki] | | The Magic of a Number System
In: Fun with Algorithms : 5th International Conference, FUN 2010, 156-165 | Proceedings Article | |
| 1 |
| Bongard, Joshua (ed.) |
| |
| | 2007 | | | GECCO 2007: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation | Proceedings | |
| 2 |
| Bongiovanni, Giancarlo (ed.) |
| |
| | 1997 | Katajainen, Jyrki
Träff, Jesper Larsson | | A meticulous analysis of mergesort programs
In: Proceedings of the 3rd Italian Conference on Algorithms and Complexity (CIAC-97), 217-228 | Proceedings Article | |
| | 1997 | Sibeyn, Jop F.
[Kaufmann, Michael] | | BSP-Like External-Memory Computation
In: Proceedings of the 3rd Italian Conference on Algorithms and Complexity (CIAC-97), 229-240 | Proceedings Article | |
| 16 |
| |
| | 2013 | [Bonifaci, Vincenzo]
[Marchetti-Spaccamela, Alberto]
[Stiller, Sebastian]
Wiese, Andreas | | Feasibility Analysis in the Sporadic DAG Task Model
In: Proceedings of the 25th Euromicro Conference on Real-Time Systems (ECRTS 2013), | Proceedings Article | |
| | 2013 | [Bonifaci, Vincenzo]
[Marchetti-Spaccamela, Alberto]
Megow, Nicole
Wiese, Andreas | | Polynomial-Time Exact Schedulability Tests for Harmonic Real-Time Tasks
In: Proceedings of the 34th IEEE Real-Time Systems Symposium (RTSS 2013), | Proceedings Article | |
| | 2012 | Bonifaci, Vincenzo
[Marchetti-Spaccamela, Alberto]
[Stiller, Sebastian] | | A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
In: Algorithmica [62], 1034-1049 | Journal Article | |
| | 2012 | [Bonifaci, Vincenzo]
[Chan, Ho-Leung]
[Marchetti-Spaccamela, Alberto]
Megow, Nicole | | Algorithms and Complexity for Periodic Real-Time Scheduling
In: ACM Transactions on Algorithms [9], 601-619 | Journal Article | |
| | 2012 | Bonifaci, Vincenzo
[Marchetti-Spaccamela, Alberto] | | Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems
In: Algorithmica [63], 763-780 | Journal Article | |
| | 2012 | Bonifaci, Vincenzo
Mehlhorn, Kurt
[Varma, Girish] | | Physarum Can Compute Shortest Paths
In: Journal of Theoretical Biology [309], 121-133 | Journal Article | |
| | 2012 | Bonifaci, Vincenzo
Mehlhorn, Kurt
[Varma, Girish] | | Physarum Can Compute Shortest Paths
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 233-240 | Proceedings Article | |
| | 2012 | [Baruah, Sanjoy]
[Bonifaci, Vincenzo]
[D'Angelo, Gianlorenzo]
[Li, Haohan]
[Marchetti-Spaccamela, Alberto]
Megow, Nicole
[Stougie, Leen] | | Scheduling Real-Time Mixed-Criticality Jobs
In: IEEE Transactions on Computers [61], 1140-1152 | Journal Article | |
| | 2011 | Bonifaci, Vincenzo
[Korteweg, Peter]
[Marchetti-Spaccamela, Alberto]
[Stougie, Leen] | | Minimizing Flow Time in the Wireless Gathering Problem
In: ACM Transactions on Algorithms [7], 33:1-33:20 | Journal Article | |
| | 2011 | [Baruah, Sanjoy]
Bonifaci, Vincenzo
[D'Angelo, Gianlorenzo]
[Marchetti-Spaccamela, Alberto]
[van der Ster, Suzanne]
[Stougie, Leen] | | Mixed-criticality scheduling of sporadic task systems
In: Algorithms - ESA 2011 : 19th Annual European Symposium, 555-566 | Proceedings Article | |
| | 2011 | Bonifaci, Vincenzo
[Korteweg, Peter]
[Marchetti-Spaccamela, Alberto]
[Stougie, Leen] | | The Distributed Wireless Gathering Problem
In: Theoretical Computer Science [412], 633-641 | Journal Article | |
| | 2010 | Bonifaci, Vincenzo
Chan, Ho-Leung
[Marchetti-Spaccamela, Alberto]
Megow, Nicole | | Algorithms and Complexity for Periodic Real-Time Scheduling
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1350-1359 | Proceedings Article | |
| | 2010 | Bonifaci, Vincenzo
[Marchetti-Spaccamela, Alberto] | | Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. II, 230-241 | Proceedings Article | |
| | 2010 | [Baruah, Sanjoy]
Bonifaci, Vincenzo
[Marchetti-Spaccamela, Alberto]
[Stiller, Sebastian] | | Improved Multiprocessor Global Schedulability Analysis
In: Real-Time Systems [46], 3-24 | Journal Article | |
| | 2010 | [Baruah, Sanjoy]
Bonifaci, Vincenzo
[D'Angelo, Gianlorenzo]
[Li, Haohan]
[Marchetti-Spaccamela, Alberto]
Megow, Nicole
[Stougie, Leen] | | Scheduling Real-Time Mixed-Criticality Jobs
In: Mathematical Foundations of Computer Science 2010 : 35th International Symposium, MFCS 2010, 90-101 | Proceedings Article | |
| | 2010 | Bonifaci, Vincenzo
[Harks, Tobias]
[Schäfer, Guido] | | Stackelberg Routing in Arbitrary Networks
In: Mathematics of Operations Research [35], 330 - 346 | Journal Article | |
| 1 |
| Bonizzoni, Paola (ed.) |
| |
| | 2013 | Gawrychowski, Pawel
[Manea, Florin]
[Nowotka, Dirk] | | Discovering Hidden Repetitions in Words
In: 9th Conference on Computability in Europe (CiE 2013), 210-219 | Proceedings Article | |
| 1 |
| Borgefors, G (ed.) |
| |
| | 2000 | Hagedoorn, Michiel
Overmars, Mark H.
Veltkamp, Remco | | A New Visibility Partition for Affine Pattern Matching
In: Discrete Geometry for Computer Imagery, Proceedings of the 9th International Conference (DGCI-00), 358-370 | Proceedings Article | |
| 2 |
| Borgwardt, Karsten M. |
| |
| | 2011 | [Shervashidze, Nino]
Schweitzer, Pascal
[van Leeuwen, Erik Jan]
Mehlhorn, Kurt
[Borgwardt, Karsten M.] | | Weisfeiler-Lehman graph kernels
In: Journal of Machine Learning Research [12], 2539-2561 | Journal Article | |
| | 2009 | [Shervashidze, Nino]
Vishwanathan, S .V. N.
[Petri, Tobias H.]
Mehlhorn, Kurt
[Borgwardt, Karsten M.] | | Efficient Graphlet Kernels for Large Graph Comparison
In: Proceedings of the Twelfth International Conference on Artificial Intelligence and Statistics (AISTATS), 488-495 | Electronic Proceedings Article | |
| 1 |
| Bornstein, Claudson (ed.) |
| |
| | 2008 | [Epstein, Leah]
van Stee, Rob | | Maximizing the minimum load for selfish agents
In: LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, 264-275 | Proceedings Article | |
| 1 |
| |
| | 2010 | Angelopoulos, Spyros
[Borodin, Allan] | | Randomized Priority Algorithms
In: Theoretical Computer Science [411], 2542-2558 | Journal Article | |
| 45 |
| |
| | 2012 | [Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Makino, Kazuhisa] | | Every Stochastic Game with Perfect Information Admits a Canonical Form
In: 2nd International ICST Conference on Game Theory for Networks (GameNets 2011), | Unpublished/Draft | |
| | 2012 | [Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Makino, Kazuhisa] | | On Nash equilibria and improvement cycles in pure positional strategies for Chess-like and Backgammon-like n-person games
In: Discrete Mathematics [312], 772-788 | Journal Article | |
| | 2011 | [Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Makino, Kazuhisa] | | A lower bound for discounting algorithms solving two-person zero-sum limit average payoff stochastic games | Unpublished/Draft | |
| | 2011 | [Boros, Endre]
Elbassioni, Khaled
[Fouz, Mahmoud]
[Gurvich, Vladimir]
[Makino, Kazuhisa]
[Manthey, Bodo] | | Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 147-158 | Proceedings Article | |
| | 2011 | [Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Tiwary, Hans Raj] | | The negative cycles polyhedron and hardness of checking some polyhedral properties
In: Annals of Operations Research [188], 63-76 | Journal Article | |
| | 2010 | [Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Makino, Kazuhisa] | | A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information
In: Integer Programming and Combinatorial Optimization : 14th International Conference, IPCO 2010, 341-354 | Proceedings Article | |
| | 2010 | [Boros, Endre]
Elbassioni, Khaled
[Makino, Kazuhisa] | | Left-to-right multiplication for monotone Boolean dualization
In: SIAM Journal on Computing [39], 3424-3439 | Journal Article | |
| | 2010 | [Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Makino, Kazuhisa] | | On effectivity functions of game forms
In: Games and Economic Behavior [68], 512-531 | Journal Article | |
| | 2010 | [Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Makino, Kazuhisa] | | On Nash Equilibria and Improvement Cycles in Pure Positional Strategies for Chess-like and Backgammon-like $n$-person Games | Unpublished/Draft | |
| | 2008 | [Boros, Endre]
Elbassioni, Khaled
Gurvich, Vladimir
[Makino, Kazuhisa]
[Oudalov, Vladimir] | | A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2x2 subgames
In: Computer Science - Theory and Applications, Third International Computer Science Symposium in Russia, CSR 2008, 99-109 | Proceedings Article | |
| | 2008 | [Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Tiwary, Hans Raj] | | Characterization of the vertices and extreme directions of the negative cycle polyhedron and hardness of generating vertices of 0/1-polyhedra
In: CoRR [abs/0801.3790], x-x | Journal Article | |
| | 2008 | [Khachiyan, Leonid]
[Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir] | | Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions
In: Discrete Applied Mathematics [156], 2020-2034 | Journal Article | |
| | 2008 | [Khachiyan, Leonid]
[Boros, Endre]
[Borys, Konrad]
Elbassioni, Khaled
[Gurvich, Vladimir] | | Generating All Vertices of a Polyhedron Is Hard
In: Discrete & Computational Geometry [39], 174-190 | Journal Article | |
| | 2008 | [Khachiyan, Leonid]
[Boros, Endre]
[Borys, Konrad]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Makino, Kazuhisa] | | Generating Cut Conjunctions in Graphs and Related Problems
In: Algorithmica [51], 239-263 | Journal Article | |
| | 2008 | [Boros, Endre]
Elbassioni, Khaled
[Makino, Kazuhisa] | | On Berge Multiplication for Monotone Boolean Dualization
In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, 48-59 | Proceedings Article | |
| | 2008 | [Khachiyan, Leonid]
[Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir] | | On Enumerating Minimal Dicuts and Strongly Connected Subgraphs
In: Algorithmica [50], 159-172 | Journal Article | |
| | 2008 | [Khachiyan, Leonid]
[Boros, Endre]
[Borys, Konrad]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Rudolf, Gabor]
[Zhao, Jihui] | | On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction
In: Theory Comput. Syst. [43], 204-233 | Journal Article | |
| | 2007 | [Khachiyan, Leonid]
[Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir] | | A global parallel algorithm for the hypergraph transversal problem
In: Information Processing Letters [101], 148-155 | Journal Article | |
| | 2007 | [Khachiyan, Leonid]
[Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Makino, Kazuhisa] | | Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data
In: Theoretical Computer Science [379], 361-376 | Journal Article | |
| | 2007 | [Khachiyan, Leonid]
[Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Makino, Kazuhisa] | | Enumerating disjunctions and conjunctions of paths and cuts in reliability theory
In: Discrete Applied Mathematics [155], 137-149 | Journal Article | |
| | 2007 | [Boros, Endre]
[Borys, Konrad]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Makino, Kazuhisa]
[Rudolf, Gabor] | | Generating Minimal k-Vertex Connected Spanning Subgraphs
In: Computing and Combinatorics, 13th Annual International Conference, COCOON 2007, Proceedings, 222-231 | Proceedings Article | |
| | 2007 | [Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Makino, Kazuhisa] | | Generating Vertices of Polyhedra and Related Monotone Generation Problems | Unpublished/Draft | |
| | 2007 | [Khachiyan, Leonid]
[Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir] | | On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs
In: Theoretical Computer Science [382], 139-150 | Journal Article | |
| | 2006 | [Khachiyan, Leonid]
[Boros, Endre]
[Borys, Konrad]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Makino, Kazuhisa] | | Enumerating Spanning and Connected Subsets in Graphs and Matroids
In: Algorithms - ESA 2006, 14th Annual European Symposium, 444-455 | Proceedings Article | |
| | 2006 | [Khachiyan, Leonid]
[Boros, Endre]
[Borys, Konrad]
Elbassioni, Khaled M.
[Gurvich, Vladimir] | | Generating All Vertices of a Polyhedron is Hard
In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06, 758-765 | Proceedings Article | |
| | 2005 | [Khachiyan, Leonid]
[Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir] | | A New Algorithm for the Hypergraph Transversal Problem
In: Computing and combinatorics : 11th Annual International Conference, COCOON 2005, 767-776 | Proceedings Article | |
| | 2005 | [Khachiyan, Leonid]
[Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir] | | Generating All Minimal Integral Solutions to Monotone $\wedge,\vee$-Systems of Linear, Transversal and Polymatroid Inequalities
In: Mathematical Foundations of Computer Science 2005 : 30th International Symposium, MFCS 2005, 556-567 | Proceedings Article | |
| | 2005 | [Khachiyan, Leonid]
[Boros, Endre]
[Borys, Konrad]
Elbassioni, Khaled M.
[Gurvich, Vladimir] | | Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 156-165 | Proceedings Article | |
| | 2005 | [Khachiyan, Leonid]
[Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Makino, Kazuhisa] | | On the Complexity of Some Enumeration Problems for Matroids
In: SIAM Journal on Discrete Mathematics [19], 966-984 | Journal Article | |
| | 2004 | [Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir] | | Algorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems
In: Algorithms – ESA 2004: 12th Annual European Symposium, 122-133 | Proceedings Article | |
| | 2004 | [Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Khachiyan, Leonid] | | An Efficient Implementation of a Joint Generation Algorithm
In: Experimental and efficient algorithms : Third International Workshop, WEA 2004, 114-128 | Proceedings Article | |
| | 2004 | [Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Khachiyan, Leonid] | | Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems
In: Integer programming and combinatorial optimization : 10th International IPCO Conference, 152-162 | Proceedings Article | |
| | 2004 | [Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Khachiyan, Leonid] | | Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections
In: LATIN 2004: Theoretical Informatics, 6th Latin American Symposium, 488-498 | Proceedings Article | |
| | 2004 | [Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Khachiyan, Leonid]
[Makino, Kazuhisa] | | Generating Paths and Cuts in Multi-pole (Di)graphs
In: Mathematical foundations of computer science 2004 : 29th International Symposium, MFCS 2004, 298-309 | Proceedings Article | |
| | 2003 | [Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Khachiyan, Leonid] | | Algorithms for Enumerating Circuits in Matroids.
In: Algorithms and Computation, 14th International Symposium, ISAAC 2003, 485-494 | Proceedings Article | |
| | 2003 | [Boros, Endre]
Elbassioni, Khaled M.
[Khachiyan, Leonid]
[Gurvich, Vladimir] | | An Efficient Implementation of a Quasi-polynomial Algorithm for Generating Hypergraph Transversals
In: Algorithms - ESA 2003, 11th Annual European Symposium, 556-567 | Proceedings Article | |
| | 2003 | [Boros, Endre]
Elbassioni, Khaled M.
[Khachiyan, Leonid]
[Gurvich, Vladimir] | | An Inequality for Polymatroid Functions and its Applications
In: Discrete Applied mathematics [131], 27 | Journal Article | |
| | 2003 | [Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Khachiyan, Leonid]
[Makino, Kazuhisa] | | An Intersection Inequality for Discrete Distributions and Related Generation Problems
In: Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, 543-555 | Proceedings Article | |
| | 2003 | [Boros, Endre]
Elbassioni, Khaled M.
[Khachiyan, Leonid]
[Gurvich, Vladimir] | | Extending the Balas-Yu Bounds on the Number of Maximal Independent Sets in Graphs to Hypergraphs and Lattices
In: Mathematical Programming, Ser. B [98], 14 | Journal Article | |
| | 2002 | [Boros, Endre]
Elbassioni, Khaled M.
[Khachiyan, Leonid]
[Gurvich, Vladimir]
[Makino, Kazuhisa] | | Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities
In: SIAM Journal on Computing [31], 20 | Journal Article | |
| | 2002 | [Boros, Endre]
Elbassioni, Khaled M.
[Khachiyan, Leonid]
[Gurvich, Vladimir] | | Generating Dual-Bounded Hypergraphs
In: Optimization Methods and Software [17], 33 | Electronic Journal Article | |
| | | | | | | |
| | 2002 | [Boros, Endre]
Elbassioni, Khaled M.
[Khachiyan, Leonid]
[Gurvich, Vladimir] | | Matroid Intersections, Polymatroid Inequalities, and Related Problems
In: Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, 143-154 | Proceedings Article | |
| | 2001 | [Boros, Endre]
Elbassioni, Khaled M.
[Khachiyan, Leonid]
[Gurvich, Vladimir]
[Makino, Kazuhisa] | | On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities
In: Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, 92-103 | Proceedings Article | |
| | 2000 | [Boros, Endre]
Elbassioni, Khaled M.
[Khachiyan, Leonid]
[Gurvich, Vladimir] | | An Efficient Incremental Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension
In: Parallel Processing Letters [10], 14 | Journal Article | |
| 7 |
| |
| | 2008 | [Khachiyan, Leonid]
[Boros, Endre]
[Borys, Konrad]
Elbassioni, Khaled
[Gurvich, Vladimir] | | Generating All Vertices of a Polyhedron Is Hard
In: Discrete & Computational Geometry [39], 174-190 | Journal Article | |
| | 2008 | [Khachiyan, Leonid]
[Boros, Endre]
[Borys, Konrad]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Makino, Kazuhisa] | | Generating Cut Conjunctions in Graphs and Related Problems
In: Algorithmica [51], 239-263 | Journal Article | |
| | 2008 | [Khachiyan, Leonid]
[Boros, Endre]
[Borys, Konrad]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Rudolf, Gabor]
[Zhao, Jihui] | | On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction
In: Theory Comput. Syst. [43], 204-233 | Journal Article | |
| | 2007 | [Boros, Endre]
[Borys, Konrad]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Makino, Kazuhisa]
[Rudolf, Gabor] | | Generating Minimal k-Vertex Connected Spanning Subgraphs
In: Computing and Combinatorics, 13th Annual International Conference, COCOON 2007, Proceedings, 222-231 | Proceedings Article | |
| | 2006 | [Khachiyan, Leonid]
[Boros, Endre]
[Borys, Konrad]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Makino, Kazuhisa] | | Enumerating Spanning and Connected Subsets in Graphs and Matroids
In: Algorithms - ESA 2006, 14th Annual European Symposium, 444-455 | Proceedings Article | |
| | 2006 | [Khachiyan, Leonid]
[Boros, Endre]
[Borys, Konrad]
Elbassioni, Khaled M.
[Gurvich, Vladimir] | | Generating All Vertices of a Polyhedron is Hard
In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06, 758-765 | Proceedings Article | |
| | 2005 | [Khachiyan, Leonid]
[Boros, Endre]
[Borys, Konrad]
Elbassioni, Khaled M.
[Gurvich, Vladimir] | | Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 156-165 | Proceedings Article | |
| 1 |
| |
| | 2009 | | | GECCO 2009: Proceedings of the 11th Annual conference on Genetic and evolutionary computation. | Proceedings | |
| 1 |
| Böszörményi, László (ed.) |
| |
| | 2003 | [Agarwal, Amit]
[Agarwal, Tarun]
[Chopra, Sumit]
[Feldmann, Anja]
[Kammenhuber, Nils]
Krysta, Piotr
[Vöcking, Berthold] | | An experimental study of k-splittable scheduling for DNS-based traffic allocation
In: Euro-Par 2003 parallel processing : 9th International Euro-Par Conference ; proceedings, 230-235 | Proceedings Article | |
| 1 |
| |
| | 2010 | [Böttcher, Süntje]
Doerr, Benjamin
Neumann, Frank | | Optimal fixed and adaptive mutation rates for the LeadingOnes problem
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 1-10 | Proceedings Article | |
| 1 |
| Bouchachia, Abdelhamid (ed.) |
| |
| | 2009 | [Helwig, Sabine]
Neumann, Frank
[Wanka, Rolf] | | Particle Swarm Optimization with Velocity Adaptation
In: 2009 International Conference on Adaptive and Intelligent Systems ICAIS 2009 : proceedings, 146-151 | Proceedings Article | |
| 2 |
| |
| | 1996 | Sibeyn, Jop F. | | List Ranking on Interconnection Networks
In: 2nd Euro-Par Conference, 529-541 | Proceedings Article | |
| | 1996 | [Juurlink, Ben]
Sibeyn, Jop F.
[Rao, P. Srinivasa] | | Worm-Hole Gossiping on Meshes and Tori
In: 2nd Euro-Par Conference, 361-369 | Proceedings Article | |
| 1 |
| Boullay, Johannes |
| |
| | 1996 | Boullay, Johannes | | Eine parallelisierbare Heuristik für das Min-Cost-Flow Problem
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Bousquet-Mélou, Mireille |
| |
| | 2002 | Banderier, Cyril
[Bousquet-Mélou, Mireille]
[Denise, Alain]
[Flajolet, Philippe]
[Gardy, Danièle]
[Gouyou-Beauchamps, Dominique] | | Generating Functions for Generating Trees
In: Discrete Mathematics [246], 29-55 | Journal Article | |
| 1 |
| Bouziane, Driss |
| |
| | 2002 | [Bouziane, Driss]
El Kahoui, M'hammed | | Computation of the dual of a plane projective curve
In: Journal of Symbolic Computation [34], 105-117 | Journal Article | |
| 2 |
| Bovet, Daniel Pierre (ed.) |
| |
| | 1997 | Katajainen, Jyrki
Träff, Jesper Larsson | | A meticulous analysis of mergesort programs
In: Proceedings of the 3rd Italian Conference on Algorithms and Complexity (CIAC-97), 217-228 | Proceedings Article | |
| | 1997 | Sibeyn, Jop F.
[Kaufmann, Michael] | | BSP-Like External-Memory Computation
In: Proceedings of the 3rd Italian Conference on Algorithms and Complexity (CIAC-97), 229-240 | Proceedings Article | |
| 1 |
| |
| | 2009 | Emeliyanenko, Pavel
Berberich, Eric
Sagraloff, Michael | | Visualizing Arcs of Implicit Algebraic Curves, Exactly and Fast
In: Advances in Visual Computing : 5th International Symposium, ISVC 2009, 608-619 | Proceedings Article | |
| 9 |
| |
| | 2002 | Bradford, Phillip Gnassi
[Golin, Mordecai J.]
[Larmore, Lawrence L.] | | Optimal prefix-free codes for unequal letter costs: Dynamic programming with the Monge property
In: Journal of Algorithms [42], 277-303 | Journal Article | |
| | 1998 | Bradford, Phillip Gnassi
[Rawlins, Gregory J.E.]
[Shannon, Greogory E.] | | Efficient Matrix Chain Ordering in Polylog Time
In: SIAM Journal on Computing [27], 466-490 | Journal Article | |
| | 1998 | Bradford, Phillip Gnassi
[Golin, Mordecai J.]
[Larmore, Lawrence L.]
[Rytter, Wojciech] | | Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 43-54 | Proceedings Article | |
| | 1997 | Bradford, Phillip Gnassi
Fleischer, Rudolf
Smid, Michiel | | More efficient parallel totally monotone matrix searching
In: Journal of Algorithms [23], 386-400 | Journal Article | |
| | 1997 | Bradford, Phillip Gnassi
Capoyleas, Vasilis | | Weak epsilon-Nets for Points on a Hypersphere
In: Discrete & Computational Geometry [18], 83-91 | Journal Article | |
| | 1996 | Bradford, Phillip Gnassi
Reinert, Knut | | Lower Bounds for Row Minima Searching
In: Automata Languages and Programming: 23rd International Colloquium (ICALP'96), 454-465 | Proceedings Article | |
| | 1996 | [Alon, Noga]
Bradford, Phillip Gnassi
Fleischer, Rudolf | | Matching nuts and bolts faster
In: Information Processing Letters [59], 123-127 | Journal Article | |
| | 1995 | Bradford, Phillip Gnassi
[Choppela, Venkatesh]
[Rawlins, Gregory J.E.] | | Lower Bounds for the Matrix Chain Ordering Problem
In: LATIN'95: Theoretical Informatics, 2nd Latin American Symposium, 112-130 | Proceedings Article | |
| | 1995 | Bradford, Phillip Gnassi
Fleischer, Rudolf | | Matching nuts and bolts faster
In: Algorithms and Computation: 6th International Symposium (ISAAC'95), 402-408 | Proceedings Article | |
| 1 |
| |
| | 2010 | [Bradonjić, Milan]
[Elsässer, Robert]
Friedrich, Tobias
[Sauerwald, Thomas]
[Stauffer, Alexandre] | | Efficient Broadcast on Random Geometric Graphs
In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1412-1421 | Proceedings Article | |
| 1 |
| |
| | 2003 | Bramer, Andreas | | Zwei Algorithmen zur Bestimmung kostenminimaler Flüsse in Netzwerken
Universität des Saarlandes | Thesis - Masters thesis | |
| 3 |
| |
| | 1999 | [Brandenburg, Franz J.]
[Schreiber, Falk]
[Jünger, Michael]
[Marks, Joe]
Mutzel, Petra | | Graph Drawing Contest Report
In: Proceedings of the 7th International Symposium on Graph Drawing (GD-99), 400-409 | Proceedings Article | |
| | 1997 | [Brandenburg, Franz J.]
[Jünger, Michael]
Mutzel, Petra | | Algorithmen zum automatischen Zeichnen von Graphen
In: Informatik Spektrum [20], 199-207 | Journal Article | |
| | 1997 | [Brandenburg, Franz J.]
[Jünger, Michael]
Mutzel, Petra
[Lengauer, Thomas] | | SPP 731 : Algorithmen zum automatischen Zeichnen von Graphen im Rahmen des DFG-Schwerpunkts "Effiziente Algorithmen für diskrete Probleme und ihre Anwendungen"
In: Informatik '97 : Informatik als Innovationsmotor : 27. Jahrestagung der Gesellschaft für Informatik, 58-67 | Proceedings Article | |
| 1 |
| Brandenburg, Franz J. (ed.) |
| |
| | 1987 | Kaufmann, Michael
Mehlhorn, Kurt | | On Local Routing of Two-Terminal Nets
In: STACS '87 : 4th Annual Symposium on Theoretical Aspects of Computer Science, 40-52 | Proceedings Article | |
| 1 |
| |
| | 1996 | [Jünger, Michael]
Mutzel, Petra | | Exact and heuristic algorithms for 2-layer straightline crossing minimization
In: Graph Drawing (GD95), - | Proceedings Article | |
| 1 |
| |
| | 2007 | | | GECCO 2007: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation | Proceedings | |
| 6 |
| |
| | 2010 | Kötzing, Timo
[Lehre, Per Kristian]
Neumann, Frank
[Oliveto, Pietro S.] | | Ant Colony Optimization and the Minimum Cut Problem
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1393-1400 | Proceedings Article | |
| | 2010 | Johannsen, Daniel
Lengler, Johannes | | Can Quantum Search Accelerate Evolutionary Algorithms?
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1433-1440 | Proceedings Article | |
| | 2010 | Doerr, Benjamin
[Johannsen, Daniel] | | Edge-based representation beats vertex-based representation in shortest path problems
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 759-766 | Proceedings Article | |
| | 2010 | Doerr, Benjamin
Johannsen, Daniel
Winzen, Carola | | Multiplicative Drift Analysis
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1449-1456 | Proceedings Article | |
| | 2010 | Doerr, Benjamin
Fouz, Mahmoud
[Witt, Carsten] | | Quasirandom Evolutionary Algorithms
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1457-1464 | Proceedings Article | |
| | 2010 | [Berghammer, Rudolf]
Friedrich, Tobias
Neumann, Frank | | Set-based Multi-Objective Optimization, Indicators, and Deteriorative Cycles
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 495-502 | Proceedings Article | |
| 1 |
| Brattka, Vasco (ed.) |
| |
| | 2013 | Gawrychowski, Pawel
[Manea, Florin]
[Nowotka, Dirk] | | Discovering Hidden Repetitions in Words
In: 9th Conference on Computability in Europe (CiE 2013), 210-219 | Proceedings Article | |
| 5 |
| Brauer, Wilfried (ed.) |
| |
| | 1985 | Mehlhorn, Kurt
Tsakalidis, Athanasios K. | | Dynamic Interpolation Search
In: Automata, languages and programming (ICALP-85) : 12th international colloquium, 424-434 | Proceedings Article | |
| | 1985 | Mehlhorn, Kurt
Tsakalidis, Athanasios K. | | Routing Through a Generalized Switchbox
In: Automata, languages and programming (ICALP-85) : 12th international colloquium, 328-337 | Proceedings Article | |
| | 1984 | Mehlhorn, Kurt | | Data structures and algorithms. Volume 1 : Sorting and searching | Book | |
| | 1984 | Mehlhorn, Kurt | | Data structures and algorithms. Volume 2 : Graph algorithms and NP-completeness | Book | |
| | 1984 | Mehlhorn, Kurt | | Data structures and algorithms. Volume 3 : Multi-dimensional searching and computational geometry | Book | |
| 1 |
| Braun, Sebastian |
| |
| | 2000 | Braun, Sebastian | | Entwicklung und Test von für statische Graphen optimierte Datentypen
Universität des Saarlandes | Thesis - Masters thesis | |
| 2 |
| Bredereck, Robert |
| |
| | 2011 | [Bredereck, Robert]
[Nichterlein, Andr{\'e}]
[Niedermeier, Rolf]
Philip, Geevarghese | | Pattern-Guided Data Anonymization and Clustering
In: Mathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011. Proceedings, 182-193 | Proceedings Article | |
| | 2011 | [Bredereck, Robert]
[Nichterlein, Andr{\'e}]
[Niedermeier, Rolf]
Philip, Geevarghese | | The Effect of Homogeneity on the Complexity of $k$-Anonymity
In: Fundamentals of Computation Theory - 18th International Symposium, FCT 2011, Oslo, Norway, August 22-25, 2011. Proceedings, 53-64 | Proceedings Article | |
| 1 |
| |
| | 1995 | Meyer, Ulrich
Sibeyn, Jop F. | | Simulating the Simulator: Determinstic PRAM Simulation on a Mesh Simulator
In: Eurosim '95, 285-290 | Proceedings Article | |
| 1 |
| |
| | 1995 | Bremer, Dirk | | Analyse und Simulation eines Maximum-Flow Algorithmus für das Gitter
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| |
| | 2000 | Bast, Hannah
Hert, Susan | | The Area Partitioning Problem
In: Proceedings of the 12th Annual Canadian Conference on Computational Geometry (CCCG-00), 163-171 | Proceedings Article | |
| 3 |
| |
| | 2001 | Crauser, Andreas
Meyer, Ulrich
Brengel, Klaus | | An experimental study of priority queues in external memory
In: Journal of Experimental Algorithmics [5], 24 | Unpublished/Draft | |
| | 2000 | Brengel, Klaus | | Externe Prioritätswarteschlangen
Universität des Saarlandes | Thesis - Masters thesis | |
| | 1999 | Brengel, Klaus
Crauser, Andreas
Meyer, Ulrich
[Ferragina, Paolo] | | An Experimental Study of Priority Queues in External Memory
In: Algorithm engineering (WAE-99) : 3rd International Workshop, WAE'99, 345-359 | Proceedings Article | |
| 2 |
| |
| | 1997 | Breslauer, Dany
[Jiang, Tao]
[Jiang, Zhigen] | | Rotations of periodic strings and short superstrings
In: Journal of Algorithms [24], 340-353 | Journal Article | |
| | 1996 | Breslauer, Dany
Ramesh, Hariharan | | Optimal Parallel Construction of Minimal Suffix and Factor Automata
In: Parallel Processing Letters [6], 35-44 | Journal Article | |
| 1 |
| Brewka, G. (ed.) |
| |
| | 2001 | [Edelkamp, Stefan]
Meyer, Ulrich | | Theory and Practice of Time-Space Trade-Offs in Memory Limited Search
In: Proceedings of the Joint German/Austrian Conference on AI: Advances in Artificial Intelligence (KI-01), 169-184 | Proceedings Article | |
| 1 |
| Brightwell, Graham |
| |
| | 2012 | [Brightwell, Graham]
Panagiotou, Konstantinos
[Steger, Angelika] | | Extremal subgraphs of random graphs
In: Random Structures & Algorithms [41], 147-178 | Journal Article | |
