Publications

2024

  1. Article
    D1
    “New bounds on the anti-Ramsey numbers of star graphs via maximum edge q-coloring,” Discrete Mathematics, vol. 347, no. 4, 2024.
  2. Article
    D1
    “Legal Hypergraphs,” Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, vol. 382, no. 2270, 2024.
  3. Article
    D1
    “Computing Generalized Convolutions Faster Than Brute Force,” Algorithmica, vol. 86, 2024.
  4. “EFX Exists for Three Agents,” Journal of the ACM, vol. 71, no. 1, 2024.

2023

  1. Conference paper
    D1
    “Parameterized Approximation Schemes for Clustering with General Norm Objectives,” in IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS 2023), Santa Cruz, CA, USA, 2023.
  2. Conference paper
    D1
    “Stronger 3-SUM Lower Bounds for Approximate Distance Oracles via Additive Combinatorics,” in STOC ’23, 55th Annual ACM Symposium on Theory of Computing, Orlando, FL, USA, 2023.
  3. “Simplification and Improvement of MMS Approximation,” in Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence (IJCAI 2023), Macao, 2023.
  4. “Breaking the 3/4 Barrier for Approximate Maximin Share,” 2023. [Online]. Available: https://arxiv.org/abs/2307.07304.
  5. “EFX: A Simpler Approach and an (Almost) Optimal Guarantee via Rainbow Cycle Number,” in EC 2023, 24th ACM Conference on Economics and Computation, London, UK, 2023.
  6. “Fair and Efficient Allocation of Indivisible Chores with Surplus,” in Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence (IJCAI 2023), Macao, 2023.
  7. “Improving Approximation Guarantees for Maximin Share,” 2023. [Online]. Available: https://arxiv.org/abs/2307.12916.
  8. Conference paper
    D1
    “Randomized and Deterministic Maximin-share Approximations for Fractionally Subadditive Valuations,” in Advances in Neural Information Processing Systems 36 (NeurIPS 2023), New Orleans, LA, USA, 2023.
  9. Article
    D1
    “Online Metric Algorithms with Untrusted Predictions,” ACM Transactions on Algorithms, vol. 19, no. 2, 2023.
  10. “Secretary and Online Matching Problems with Machine Learned Advice,” Discrete Optimization, vol. 48, no. 2, 2023.
  11. Conference paper
    D1
    “Balanced Substructures in Bicolored Graphs,” in SOFSEM 2023: Theory and Practice of Computer Science, Nový Smokovec, Slovakia, 2023.
  12. Paper
    D1
    “Parallel and Distributed Exact Single-Source Shortest Paths with Negative Edge Weights,” 2023. [Online]. Available: https://arxiv.org/abs/2303.00811.
  13. Article
    D1
    “Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences,” Algorithmica, 2023.
  14. Conference paper
    D1
    “Mind the Gap: Edge Facility Location Problems in Theory and Practice,” in Algorithms and Discrete Applied Mathematics (CALDAM 2023), Gandhinagar, India, 2023.
  15. Paper
    D1
    “Negative-Weight Single-Source Shortest Paths in Near-linear Time,” 2023. [Online]. Available: https://arxiv.org/abs/2203.03456.
  16. Article
    D1
    “Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover,” SIAM Journal on Computing, vol. 52, no. 5, 2023.
  17. Conference paper
    D1
    “Sublinear Algorithms for (1.5+Epsilon)-Approximate Matching,” in STOC ’23, 55th Annual ACM Symposium on Theory of Computing, Orlando, FL, USA, 2023.
  18. Paper
    D1
    “Dynamic (1.5+Epsilon)-Approximate Matching Size in Truly Sublinear Update Time,” 2023. [Online]. Available: https://arxiv.org/abs/2302.05030.
  19. Conference paper
    D1
    “Dynamic Algorithms for Packing-Covering LPs via Multiplicative Weight,” in Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023), Florence, Italy, 2023.
  20. Conference paper
    D1
    “Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time,” in Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023), Florence, Italy, 2023.
  21. Conference paper
    D1
    “Fast Algorithms via Dynamic-Oracle Matroids,” in STOC ’23, 55th Annual ACM Symposium on Theory of Computing, Orlando, FL, USA, 2023.
  22. Paper
    D1
    “Incremental (1 - ε)-approximate dynamic matching in O(poly(1/ε)) update time,” 2023. [Online]. Available: https://arxiv.org/abs/2302.08432.
  23. Article
    D1
    “Treedepth Vs Circumference,” Combinatorica, vol. 43, 2023.
  24. Article
    D1
    “Treedepth Versus Circumference,” Combinatorica, 2023.
  25. Conference paper
    D1
    “Negative-Weight Single-Source Shortest Paths in Near-Linear Time: Now Faster!,” in IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS 2023), Santa Cruz, CA, USA, 2023.
  26. Conference paper
    D1
    “Traversing the FFT Computation Tree for Dimension-Independent Sparse Fourier Transforms,” in Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023), Florence, Italy, 2023.
  27. Article
    D1
    “A Linear-Time n0.4-Approximation for Longest Common Subsequence,” ACM Transactions on Algorithms, vol. 19, no. 1, 2023.
  28. Conference paper
    D1
    “Optimal Algorithms for Bounded Weighted Edit Distance,” in IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS 2023), Santa Cruz, CA, USA, 2023.
  29. Conference paper
    D1
    “Reducing Exposure to Harmful Content via Graph Rewiring,” in KDD ’23, 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Long Beach, CA, USA, 2023.
  30. Article
    D1
    “All the world’s a (hyper)graph: A data drama,” Digital Scholarship in the Humanities, 2023.
  31. Thesis
    D1
    “Beyond Flatland : Exploring Graphs in Many Dimensions,” Universität des Saarlandes, Saarbrücken, 2023.
  32. Conference paper
    D1
    “Ollivier-Ricci Curvature for Hypergraphs: A Unified Framework,” in Eleventh International Conference on Learning Representations (ICLR 2023), Kigali, Rwanda.
  33. Conference paper
    D1
    “Weighted Edit Distance Computation: Strings, Trees, and Dyck,” in STOC ’23, 55th Annual ACM Symposium on Theory of Computing, Orlando, FL, USA, 2023.
  34. Paper
    D1
    “Counting Small Induced Subgraphs with Edge-monotone Properties,” 2023. [Online]. Available: https://arxiv.org/abs/2311.08988.
  35. Conference paper
    D1
    “Gap-ETH-Tight Approximation Schemes for Red-Green-Blue Separation and Bicolored Noncrossing Euclidean Travelling Salesman Tours,” in Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023), Florence, Italy, 2023.
  36. Article
    D1
    “On Batch Teaching Without Collusion,” Journal of Machine Learning Research, vol. 24, 2023.
  37. Thesis
    D1
    “Algorithms for Sparse Convolution and Sublinear Edit Distance,” Universität des Saarlandes, Saarbrücken, 2023.
  38. Conference paper
    D1
    “Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs,” in Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023), Florence, Italy, 2023.
  39. Paper
    D1
    “Perfect Simulation of Las Vegas Algorithms via Local Computation,” 2023. [Online]. Available: https://arxiv.org/abs/2311.11679.
  40. Article
    D1
    “Domination and Cut Problems on Chordal Graphs with Bounded Leafage,” Algorithmica, 2023.
  41. Article
    D1
    “Parameterized Complexity of Weighted Multicut in Trees,” Theoretical Computer Science, vol. 978, 2023.
  42. Article
    D1
    “Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters,” SIAM Journal on Discrete Mathematics, vol. 37, no. 4, 2023.
  43. Paper
    D1
    “Robust and Practical Solution of Laplacian Equations by Approximate Elimination,” 2023. [Online]. Available: https://arxiv.org/abs/2303.00709.
  44. “Satiation in Fisher Markets and Approximation of Nash Social Welfare,” Mathematics of Operations Research, 2023.
  45. Article
    D1
    “Tight Bound for the Number of Distinct Palindromes in a Tree,” The Electronic Journal of Combinatorics, vol. 30, no. 2, 2023.
  46. Conference paper
    D1
    “A Constant-Factor Approximation Algorithm for Reconciliation k-Median,” in Proceedings of the 26th International Conference on Artificial Intelligence and Statistics (AISTATS 2023), Valencia, Spain, 2023.
  47. Conference paper
    D1
    “An Algorithmic Bridge Between Hamming and Levenshtein Distances,” in 14th Innovations in Theoretical Computer Science Conference (ITCS 2023), Cambridge, MA, USA, 2023.
  48. Conference paper
    D1
    “Fully Dynamic Exact Edge Connectivity in Sublinear Time,” in Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023), Florence, Italy, 2023.
  49. Conference paper
    D1
    “Learning-Augmented Algorithms for Online TSP on the Line,” in Proceedings of the 37th AAAI Conference on Artificial Intelligence, Washington, DC, USA, 2023.
  50. Article
    D1
    “The Hamilton Compression of Highly Symmetric Graphs,” Annals of Combinatorics, 2023.
  51. Conference paper
    D1
    “Coloring Mixed and Directional Interval Graphs,” in Graph Drawing and Network Visualization (GD 2022), Tokyo, Japan, 2023.
  52. Conference paper
    D1
    “Fixed-Parameter Tractability of Directed Multicut with Three Terminal Pairs Parameterized by the Size of the Cutset: Twin-width Meets Flow-Augmentation,” in Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023), Florence, Italy, 2023.
  53. Conference paper
    D1
    “Finding a Small Vertex Cut on Distributed Networks,” in STOC ’23, 55th Annual ACM Symposium on Theory of Computing, Orlando, FL, USA, 2023.
  54. Conference paper
    D1
    “Collapsing the Hierarchy of Compressed Data Structures: Suffix Arrays in Optimal Compressed Space,” in IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS 2023), Santa Cruz, CA, USA, 2023.
  55. Conference paper
    D1
    “Breaking the O(n)-Barrier in the Construction of Compressed Suffix Arrays,” in Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023), Florence, Italy, 2023.
  56. Article
    D1
    “Primal and Dual Combinatorial Dimensions,” Discrete Applied Mathematics, vol. 327, 2023.
  57. Conference paper
    D1
    “Approximating Edit Distance in the Fully Dynamic Model,” in IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS 2023), Santa Cruz, CA, USA, 2023.
  58. Article
    D1
    “Near-Optimal Search Time in δ-Optimal Space,” Algorithmica, 2023.
  59. Conference paper
    D1
    “Near-Linear Time Approximations for Cut Problems via Fair Cuts,” in Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023), Florence, Italy, 2023.
  60. Article
    D1
    “A Mathematical Model Predicting the Abundance and Spatio-temporal Dispersal of Adfluvial Salmonid (Salvelinus Malma) fry in a Stream,” Ecological Informatics, vol. 78, 2023.
  61. Conference paper
    D1
    “Coverability in 2-VASS with One Unary Counter is in NP,” in Foundations of Software Science and Computation Structures (FoSSaCS 2023), Paris, France, 2023.
  62. Article
    D1
    “Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number,” Algorithmica, 2023.
  63. Article
    D1
    “A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics,” SIAM Journal on Computing, vol. 52, no. 6, 2023.
  64. Article
    D1
    “Bounding Generalized Coloring Numbers of Planar Graphs Using Coin Models,” The Electronic Journal of Combinatorics, vol. 30, no. 3, 2023.
  65. Article
    D1
    “Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space,” SIAM Journal on Discrete Mathematics, vol. 37, no. 3, 2023.
  66. Conference paper
    D1
    “Dynamic Data Structures for Parameterized String Problems,” in 40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023), Hamburg, Germany, 2023.
  67. Article
    D1
    “Parameterized Counting and Cayley Graph Expanders,” SIAM Journal on Discrete Mathematics, vol. 37, no. 2, 2023.
  68. “Improving EFX Guarantees through Rainbow Cycle Number,” Mathematics of Operations Research, 2023.
  69. Conference paper
    D1
    “Tournaments, Johnson Graphs, and NC-Teaching,” in Proceedings of the 34th International Conference on Algorithmic Learning Theory (ALT 2023), Singapore, Singapore, 2023.
  70. Paper
    D1
    “KDEformer: Accelerating Transformers via Kernel Density Estimation,” 2023. [Online]. Available: https://arxiv.org/abs/2302.02451.

2022

  1. Conference paper
    D1
    “Hardness of Approximation in p via Short Cycle Removal: Cycle Detection, Distance Oracles, and Beyond,” in STOC ’22, 54th Annual ACM Symposium on Theory of Computing, Rome, Italy, 2022.
  2. Article
    D1
    “Scheduling Lower Bounds via AND Subset Sum,” Journal of Computer and System Sciences, vol. 127, 2022.
  3. Article
    D1
    “SETH-Based Lower Bounds for Subset Sum and Bicriteria Path,” ACM Transactions on Algorithms, vol. 18, no. 1, 2022.
  4. Article
    D1
    “Erdős–Pósa Property of Obstructions to Interval Graphs,” Journal of Graph Theory, vol. 102, no. 4, 2022.
  5. “EFX Allocations: Simplifications and Improvements,” 2022. [Online]. Available: https://arxiv.org/abs/2205.07638.
  6. Conference paper
    D1
    “Maximizing Nash Social Welfare in 2-Value Instances,” in Proceedings of the 36th AAAI Conference on Artificial Intelligence, Virtual Conference, 2022.
  7. Paper
    D1
    “Maximizing Nash Social Welfare in 2-Value Instances: The Half-Integer Case,” 2022. [Online]. Available: https://arxiv.org/abs/2207.10949.
  8. Conference paper
    D1
    “An EF2X Allocation Protocol for Restricted Additive Valuations,” in Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence (IJCAI 2022), Vienna, Austria, 2022.
  9. Paper
    D1
    “An EF2X Allocation Protocol for Restricted Additive Valuations,” 2022. [Online]. Available: https://arxiv.org/abs/2202.13676.
  10. Article
    D1
    “Rapid Mixing of the Switch Markov Chain for 2-Class Joint Degree Matrices,” SIAM Journal on Discrete Mathematics, vol. 36, no. 1, 2022.
  11. Article
    D1
    “Distributed Distance-r Dominating Set on Sparse High-Girth Graphs,” Theoretical Computer Science, vol. 906, 2022.
  12. Conference paper
    D1
    “Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts,” in 36th International Symposium on Distributed Computing (DISC 2022), Augusta, GA, USA, 2022.
  13. Article
    D1
    “The Fine-Grained Complexity of Multi-Dimensional Ordering Properties,” Algorithmica, vol. 84, 2022.
  14. Conference paper
    D1
    “A Novel Prediction Setup for Online Speed-Scaling,” in 18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022), Tórshavn, Faroe Islands, 2022.
  15. Paper
    D1
    “A Novel Prediction Setup for Online Speed-Scaling,” 2022. [Online]. Available: https://arxiv.org/abs/2112.03082.
  16. Conference paper
    D1
    “Cut Query Algorithms with Star Contraction,” in FOCS 2022, IEEE 63rd Annual Symposium on Foundations of Computer Science, Denver, CO, USA, 2022.
  17. Conference paper
    D1
    “Unlabeled Multi-Robot Motion Planning with Tighter Separation Bounds,” in 38th International Symposium on Computational Geometry (SoCG 2022), Berlin, Germany, 2022.
  18. Article
    D1
    “The Smoothed Number of Pareto-optimal Solutions in Bicriteria Integer Optimization,” Mathematical Programming / A, 2022.
  19. Conference paper
    D1
    “Negative-Weight Single-Source Shortest Paths in Near-linear Time,” in FOCS 2022, IEEE 63rd Annual Symposium on Foundations of Computer Science, Denver, CO, USA, 2022.
  20. Paper
    D1
    “Sublinear Algorithms for (1.5+Epsilon)-Approximate Matching,” 2022. [Online]. Available: https://arxiv.org/abs/2212.00189.
  21. Conference paper
    D1
    “Nearly Optimal Communication and Query Complexity of Bipartite Matching,” in FOCS 2022, IEEE 63rd Annual Symposium on Foundations of Computer Science, Denver, CO, USA, 2022.
  22. Article
    D1
    “Physarum-inspired Multi-commodity Flow Dynamics,” Theoretical Computer Science, vol. 920, 2022.
  23. Conference paper
    D1
    “Polynomial Time Algorithms to Find an Approximate Competitive Equilibrium for Chores,” in Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2022), Virtual, 2022.
  24. Paper
    D1
    “Treedepth Vs Circumference,” 2022. [Online]. Available: https://arxiv.org/abs/2211.11410.
  25. Conference paper
    D1
    “Almost-Optimal Sublinear-Time Edit Distance in the Low Distance Regime,” in STOC ’22, 54th Annual ACM Symposium on Theory of Computing, Rome, Italy, 2022.
  26. Conference paper
    D1
    “Tight Bounds for Approximate Near Neighbor Searching for Time Series under the Fréchet Distance,” in Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2022), Virtual, 2022.
  27. Conference paper
    D1
    “Deterministic and Las Vegas Algorithms for Sparse Nonnegative Convolution,” in Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2022), Virtual, 2022.
  28. Article
    D1
    “Greedy Routing and the Algorithmic Small-World Phenomenon,” Journal of Computer and System Sciences, vol. 125, 2022.
  29. Article
    D1
    “Faster Minimization of Tardy Processing Time on a Single Machine,” Algorithmica, vol. 84, 2022.
  30. Conference paper
    D1
    “Dynamic Time Warping Under Translation: Approximation Guided by Space-Filling Curves,” in 38th International Symposium on Computational Geometry (SoCG 2022), Berlin, Germany, 2022.
  31. Conference paper
    D1
    “Towards Sub-Quadratic Diameter Computation in Geometric Intersection Graphs,” in 38th International Symposium on Computational Geometry (SoCG 2022), Berlin, Germany, 2022.
  32. Conference paper
    D1
    “A Structural Investigation of the Approximability of Polynomial-Time Problems,” in 49th EATCS International Conference on Automata, Languages, and Programming (ICALP 2022), Paris, France, 2022.
  33. Conference paper
    D1
    “Improved Sublinear-Time Edit Distance for Preprocessed Strings,” in 49th EATCS International Conference on Automata, Languages, and Programming (ICALP 2022), Paris, France, 2022.
  34. Conference paper
    D1
    “Faster Knapsack Algorithms via Bounded Monotone Min-Plus-Convolution,” in 49th EATCS International Conference on Automata, Languages, and Programming (ICALP 2022), Paris, France, 2022.
  35. Conference paper
    D1
    “Tight Fine-Grained Bounds for Direct Access on Join Queries,” in PODS ’22, 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, Philadelphia, PA, USA, 2022.
  36. Conference paper
    D1
    “Computing Continuous Dynamic Time Warping of Time Series in Polynomial Time,” in 38th International Symposium on Computational Geometry (SoCG 2022), Berlin, Germany, 2022.
  37. “Hazard-free Clock Synchronization,” Universität des Saarlandes, Saarbrücken, 2022.
  38. Paper
    D1
    “Independence Number of Intersection Graphs of Axis-Parallel Segments,” 2022. [Online]. Available: https://arxiv.org/abs/2205.15189.
  39. Conference paper
    D1
    “Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver,” in 49th EATCS International Conference on Automata, Languages, and Programming (ICALP 2022), Paris, France, 2022.
  40. Paper
    D1
    “Faster Pattern Matching under Edit Distance,” 2022. [Online]. Available: https://arxiv.org/abs/2204.03087.
  41. Conference paper
    D1
    “Faster Pattern Matching under Edit Distance: A Reduction to Dynamic Puzzle Matching and the Seaweed Monoid of Permutation Matrices,” in FOCS 2022, IEEE 63rd Annual Symposium on Foundations of Computer Science, Denver, CO, USA, 2022.
  42. Conference paper
    D1
    “Approximate Circular Pattern Matching,” in 30th Annual European Symposium on Algorithms (ESA 2022), Berlin/Potsdam, Germany, 2022.
  43. Conference paper
    D1
    “Computing Graph Hyperbolicity Using Dominating Sets,” in Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX 2022), Alexandria, VA, USA, 2022.
  44. Article
    D1
    “Enumeration of Far-Apart Pairs by Decreasing Distance for Faster Hyperbolicity Computation,” ACM Journal of Experimental Algorithmics, vol. 27, 2022.
  45. Paper
    D1
    “All the World’s a (Hyper)Graph: A Data Drama,” 2022. [Online]. Available: https://arxiv.org/abs/2206.08225.
  46. Paper
    D1
    “Sharing and Caring: Creating a Culture of Constructive Criticism in Computational Legal Studies,” 2022. [Online]. Available: https://arxiv.org/abs/2205.01071.
  47. Article
    D1
    “Rechtsstrukturvergleichung,” Rabels Zeitschrift für ausländisches und internationales Privatrecht, vol. 86, no. 4, 2022.
  48. Conference paper
    D1
    “Differentially Describing Groups of Graphs,” in Proceedings of the 36th AAAI Conference on Artificial Intelligence, Virtual Conference, 2022.
  49. Article
    D1
    “Law Smells - Defining and Detecting Problematic Patterns in Legal Drafting,” Artificial Intelligence and Law, 2022.
  50. Paper
    D1
    “Differentially Describing Groups of Graphs,” 2022. [Online]. Available: https://arxiv.org/abs/2201.04064.
  51. Article
    D1
    “Indepth Combinatorial Analysis of Admissible Sets for Abstract Argumentation,” Annals of Mathematics and Artificial Intelligence, vol. 90, 2022.
  52. Article
    D1
    Á. Cseh, Y. Faenza, T. Kavitha, and V. Powers, “Understanding Popular Matchings via Stable Matchings,” SIAM Journal on Discrete Mathematics, vol. 36, no. 1, 2022.
  53. Paper
    D1
    “Parameterized Approximation for Maximum Weight Independent Set of Rectangles and Segments,” 2022. [Online]. Available: https://arxiv.org/abs/2212.01620.
  54. Conference paper
    D1
    “Improved Approximation Algorithms for Dyck Edit Distance and RNA Folding,” in 49th EATCS International Conference on Automata, Languages, and Programming (ICALP 2022), Paris, France, 2022.
  55. Conference paper
    D1
    “Õ(n + poly(k))-time Algorithm for Bounded Tree Edit Distance,” in FOCS 2022, IEEE 63rd Annual Symposium on Foundations of Computer Science, Denver, CO, USA, 2022.
  56. Conference paper
    D1
    “Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search,” in 30th Annual European Symposium on Algorithms (ESA 2022), Berlin/Potsdam, Germany, 2022.
  57. Conference paper
    D1
    “Computing Generalized Convolutions Faster Than Brute Force,” in 17th International Symposium on Parameterized and Exact Computation (IPEC 2022), Potsdam, Germany, 2022.
  58. Paper
    D1
    “Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search,” 2022. [Online]. Available: https://arxiv.org/abs/2206.13481.
  59. Conference paper
    D1
    “Hypergraph Representation via Axis-Aligned Point-Subspace Cover,” in WALCOM: Algorithms and Computation, Jember, Indonesia, 2022.
  60. Article
    D1
    “Parameterized Complexity of Directed Spanner Problems,” Algorithmica, vol. 84, 2022.
  61. Article
    D1
    “Fast All-Digital Clock Frequency Adaptation Circuit for Voltage Droop Tolerance,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 41, no. 8, 2022.
  62. Conference paper
    D1
    “Parameterized Complexity of Weighted Multicut in Trees,” in Graph-Theoretic Concepts in Computer Science (WG 2022), Tübingen, Germany, 2022.
  63. Conference paper
    D1
    “Domination and Cut Problems on Chordal Graphs with Bounded Leafage,” in 17th International Symposium on Parameterized and Exact Computation (IPEC 2022), Potsdam, Germany, 2022.
  64. Conference paper
    D1
    “Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters,” in 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022), Vienna, Austria, 2022.
  65. Paper
    D1
    “Parameterized Complexity of Weighted Multicut in Trees,” 2022. [Online]. Available: https://arxiv.org/abs/2205.10105.
  66. Paper
    D1
    “Domination and Cut Problems on Chordal Graphs with Bounded Leafage,” 2022. [Online]. Available: https://arxiv.org/abs/2208.02850.
  67. Paper
    D1
    “Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters,” 2022. [Online]. Available: https://arxiv.org/abs/2206.15424.
  68. Paper
    D1
    “Subexponential Parameterized Directed Steiner Network Problems on Planar Graphs: A Complete Classification,” 2022. [Online]. Available: https://arxiv.org/abs/2208.06015.
  69. Paper
    D1
    “Physarum Inspired Dynamics to Solve Semi-Definite Programs,” 2022. [Online]. Available: https://arxiv.org/abs/2111.02291.
  70. Conference paper
    D1
    “Improved Online Algorithm for Fractional Knapsack in the Random Order Model,” in Approximation and Online Algorithms, Lisbon, Portugal, 2022.
  71. Conference paper
    D1
    “Gap Edit Distance via Non-Adaptive Queries: Simple and Optimal,” in FOCS 2022, IEEE 63rd Annual Symposium on Foundations of Computer Science, Denver, CO, USA, 2022.
  72. Paper
    D1
    “Learning-Augmented Algorithms for Online TSP on the Line,” 2022. [Online]. Available: https://arxiv.org/abs/2206.00655.
  73. Paper
    D1
    “Coloring Mixed and Directional Interval Graphs,” 2022. [Online]. Available: https://arxiv.org/abs/2208.14250.
  74. Article
    D1
    “The Maximum-Level Vertex in an Arrangement of Lines,” Discrete & Computational Geometry, vol. 67, 2022.
  75. Conference paper
    D1
    “Fast Neural Kernel Embeddings for General Activations,” in Advances in Neural Information Processing Systems 35 (NeurIPS 2022), New Orleans, LA, USA, 2022.
  76. Conference paper
    D1
    “Random Gegenbauer Features for Scalable Kernel Methods,” in Proceedings of the 39th International Conference on Machine Learning (ICML 2022), Baltimore, MA, USA, 2022.
  77. Paper
    D1
    “Fixed-Parameter Tractability of Directed Multicut with Three Terminal Pairs Parameterized by the Size of the Cutset: Twin-width Meets Flow-Augmentation,” 2022. [Online]. Available: https://arxiv.org/abs/2207.07425.
  78. Paper
    D1
    “b-Coloring Parameterized by Pathwidth is XNLP-complete,” 2022. [Online]. Available: https://arxiv.org/abs/2209.07772.
  79. Conference paper
    D1
    “Robust and Optimal Contention Resolution without Collision Detection,” in SPAA ’22, 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, 2022.
  80. Paper
    D1
    “On Weighted Graph Separation Problems and Flow-Augmentation,” 2022. [Online]. Available: https://arxiv.org/abs/2208.14841.
  81. Thesis
    D1IMPR-CS
    “On Time, Time Synchronization and Noise in Time Measurement Systems,” Universität des Saarlandes, Saarbrücken, 2022.
  82. Article
    D1
    “Optimal Collusion-Free Teaching,” Journal of Machine Learning Research.
  83. Conference paper
    D1
    “A Gap-ETH-Tight Approximation Scheme for Euclidean TSP,” in FOCS 2021, IEEE 62nd Annual Symposium on Foundations of Computer Science, Denver, CO, USA (Virtual Conference), 2022.
  84. Conference paper
    D1
    “Near-Optimal Search Time in δ-Optimal Space,” in LATIN 2022: Theoretical Informatics, Guanajuato, Mexico, 2022.
  85. Article
    D1
    “Toward a Definitive Compressibility Measure for Repetitive Sequences,” IEEE Transactions on Information Theory, vol. 69, no. 4, 2022.
  86. Conference paper
    D1
    “The Complexity of Contracting Bipartite Graphs into Small Cycles,” in Graph-Theoretic Concepts in Computer Science (WG 2022), Tübingen, Germany, 2022.
  87. Paper
    D1
    “The Complexity of Contracting Bipartite Graphs into Small Cycles,” 2022. [Online]. Available: https://arxiv.org/abs/2206.07358.
  88. Conference paper
    D1
    “Polygon Placement Revisited: (Degree of Freedom + 1)-SUM Hardness and an Improvement via Offline Dynamic Rectangle Union,” in Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2022), Virtual, 2022.
  89. Paper
    D1
    “Near-Linear Time Approximations for Cut Problems via Fair Cuts,” 2022. [Online]. Available: https://arxiv.org/abs/2203.00751.
  90. Conference paper
    D1
    “On Batch Teaching with Sample Complexity Bounded by VCD,” in Advances in Neural Information Processing Systems 35 (NeurIPS 2022), New Orleans, LA, USA, 2022.
  91. Conference paper
    D1
    “Isolation Schemes for Problems on Decomposable Graphs,” in 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022), Marseille, France (Virtual Conference), 2022.
  92. Paper
    D1
    “Makespan Scheduling of Unit Jobs with Precedence Constraints in O(1.995n) time,” 2022. [Online]. Available: https://arxiv.org/abs/2208.02664.
  93. Thesis
    D1IMPR-CS
    “Fine-Grained Complexity and Algorithm Engineering of Geometric Similarity Measures,” Universität des Saarlandes, Saarbrücken, 2022.
  94. “Fair Division of Indivisible Goods for a Class of Concave Valuations,” Journal of Artificial Intelligence Research, vol. 74, 2022.
  95. Article
    D1
    “Counting Small Induced Subgraphs Satisfying Monotone Properties,” SIAM Journal on Computing, 2022.
  96. Thesis
    D1
    “Pulse Propagation, Graph Cover, and Packet Forwarding,” Universität des Saarlandes, Saarbrücken, 2022.
  97. Conference paper
    D1
    “Leverage Score Sampling for Tensor Product Matrices in Input Sparsity Time,” in Proceedings of the 39th International Conference on Machine Learning (ICML 2022), Baltimore, MA, USA, 2022.
  98. Paper
    D1
    “Near Optimal Reconstruction of Spherical Harmonic Expansions,” 2022. [Online]. Available: https://arxiv.org/abs/2202.12995.

2021

  1. Paper
    D1
    “Maximizing Nash Social Welfare in 2-Value Instances,” 2021. [Online]. Available: https://arxiv.org/abs/2107.08965.
  2. Paper
    D1
    “Nash Social Welfare for 2-value Instances,” 2021. [Online]. Available: https://arxiv.org/abs/2106.14816.
  3. Paper
    D1
    “Approximate Sampling and Counting of Graphs with Near-Regular Degree Intervals,” 2021. [Online]. Available: https://arxiv.org/abs/2110.09068.
  4. Conference paper
    D1
    “Robust Learning under Strong Noise via SQs,” in Proceedings of the 24th International Conference on Artificial Intelligence and Statistics (AISTATS 2021), Virtual Conference, 2021.
  5. Conference paper
    D1
    “Deterministic Distributed Algorithms and Lower Bounds in the Hybrid Model,” in 35th International Symposium on Distributed Computing (DISC 2021), Freiburg, Germany (Virtual Conference), 2021.
  6. Conference paper
    D1
    “The Fine-Grained Complexity of Multi-Dimensional Ordering Properties,” in 16th International Symposium on Parameterized and Exact Computation (IPEC 2021), Lisbon, Portugal, 2021.
  7. Paper
    D1
    “Online Search for a Hyperplane in High-Dimensional Euclidean Space,” 2021. [Online]. Available: https://arxiv.org/abs/2109.04340.
  8. Conference paper
    D1
    “Fast and Simple Modular Subset Sum,” in Symposium on Simplicity in Algorithms (SOSA 2021), Alexandria, VA, USA (Virtual Conference), 2021.
  9. Article
    D1
    “Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models,” SIAM Journal on Computing, vol. 50, no. 3, 2021.
  10. Article
    D1
    “Finding and Counting Permutations via CSPs,” Algorithmica, vol. 83, 2021.
  11. Paper
    D1
    “Current Algorithms for Detecting Subgraphs of Bounded Treewidth are Probably Optimal,” 2021. [Online]. Available: https://arxiv.org/abs/2105.05062.
  12. Conference paper
    D1
    “Sparse Nonnegative Convolution is Equivalent to Dense Nonnegative Convolution,” in STOC ’21, 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual, Italy, 2021.
  13. Article
    D1
    “Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance,” Journal of Computational Geometry, vol. 12, no. 1, 2021.
  14. Paper
    D1
    “Fine-Grained Complexity Theory: Conditional Lower Bounds for Computational Geometry,” 2021. [Online]. Available: https://arxiv.org/abs/2110.10283.
  15. Conference paper
    D1
    “Fine-Grained Complexity Theory: Conditional Lower Bounds for Computational Geometry,” in Connecting with Computability (CiE 2021), Ghent, Belgium (Virtual Event), 2021.
  16. Paper
    D1
    “Translating Hausdorff is Hard: Fine-Grained Lower Bounds for Hausdorff Distance Under Translation,” 2021. [Online]. Available: https://arxiv.org/abs/2101.07696.
  17. Article
    D1
    “Discrete Fréchet Distance under Translation: Conditional Hardness and an Improved Algorithm,” ACM Transactions on Algorithms, vol. 17, no. 3, 2021.
  18. Article
    D1
    “Translating Hausdorff is Hard: Fine-Grained Lower Bounds for Hausdorff Distance under Translation,” Journal of Computational Geometry, vol. 13, no. 2, 2021.
  19. Paper
    D1
    “Fast n-fold Boolean Convolution via Additive Combinatorics,” 2021. [Online]. Available: https://arxiv.org/abs/2105.03968.
  20. Paper
    D1
    “Tight Bounds for Approximate Near Neighbor Searching for Time Series under the Fréchet Distance,” 2021. [Online]. Available: https://arxiv.org/abs/2107.07792.
  21. Conference paper
    D1
    “Current Algorithms for Detecting Subgraphs of Bounded Treewidth Are Probably Optimal,” in 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), Glasgow, UK (Virtual Conference), 2021.
  22. Conference paper
    D1
    “A Linear-Time n0.4-Approximation for Longest Common Subsequence,” in 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), Glasgow, UK (Virtual Conference), 2021.
  23. Paper
    D1
    “Sparse Fourier Transform by Traversing Cooley-Tukey FFT Computation Graphs,” 2021. [Online]. Available: https://arxiv.org/abs/2107.07347.
  24. Conference paper
    D1
    “Translating Hausdorff Is Hard: Fine-Grained Lower Bounds for Hausdorff Distance Under Translation,” in 37th International Symposium on Computational Geometry (SoCG 2021), Buffalo, NY, USA (Virtual Conference), 2021.
  25. Conference paper
    D1
    “Fast n-Fold Boolean Convolution via Additive Combinatorics,” in 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), Glasgow, UK (Virtual Conference), 2021.
  26. Paper
    D1
    “Deterministic and Las Vegas Algorithms for Sparse Nonnegative Convolution,” 2021. [Online]. Available: https://arxiv.org/abs/2107.07625.
  27. Paper
    D1
    “Top-k-Convolution and the Quest for Near-Linear Output-Sensitive Subset Sum,” 2021. [Online]. Available: https://arxiv.org/abs/2107.13206.
  28. Conference paper
    D1
    “Fine-Grained Completeness for Optimization in P,” in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021), Seattle, WA, USA, 2021.
  29. Paper
    D1
    “Fine-Grained Completeness for Optimization in P,” 2021. [Online]. Available: https://arxiv.org/abs/2107.01721.
  30. Conference paper
    D1
    “A Fine-Grained Perspective on Approximating Subset Sum and Partition,” in Proceedings of the Thirty-Second ACM-SIAM Symposium on Discrete Algorithms (SODA 2021), Alexandria, VA, USA (Virtual Conference), 2021.
  31. Conference paper
    D1
    “On Near-Linear-Time Algorithms for Dense Subset Sum,” in Proceedings of the Thirty-Second ACM-SIAM Symposium on Discrete Algorithms (SODA 2021), Alexandria, VA, USA (Virtual Conference), 2021.
  32. Paper
    D1
    “Sparse Nonnegative Convolution Is Equivalent to Dense Nonnegative Convolution,” 2021. [Online]. Available: https://arxiv.org/abs/2105.05984.
  33. Paper
    D1
    “A Linear-Time n0.4-Approximation for Longest Common Subsequence,” 2021. [Online]. Available: https://arxiv.org/abs/2106.08195.
  34. Conference paper
    D1
    “Faster Approximate Pattern Matching: A Unified Approach,” in FOCS 2020, 61st Annual IEEE Symposium on Foundations of Computer Science, Durham, NC, USA (Virtual Conference), 2021.
  35. Thesis
    D1IMPR-CS
    “Finding Fair and Efficient Allocations,” Universität des Saarlandes, Saarbrücken, 2021.
  36. “Improving EFX Guarantees through Rainbow Cycle Number,” in EC ’21, 22nd ACM Conference on Economics and Computation, Budapest, Hungary (Virtual), 2021.
  37. Conference paper
    D1
    “Combinatorial Group Testing and Sparse Recovery Schemes with Near-Optimal Decoding Time,” in FOCS 2020, 61st Annual IEEE Symposium on Foundations of Computer Science, Durham, NC, USA (Virtual Conference), 2021.
  38. Conference paper
    D1
    “Simplify Your Law: Using Information Theory to Deduplicate Legal Documents,” in 21st IEEE International Conference on Data Mining Workshops (ICDMW 2021), Virtual Conference, 2021.
  39. Article
    D1
    “Measuring Law Over Time: A Network Analytical Framework with an Application to Statutes and Regulations in the United States and Germany,” Frontiers in Physics, vol. 9, 2021.
  40. Conference paper
    D1
    “Graph Similarity Description: How Are These Graphs Similar?,” in KDD ’21, 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Virtual Event, Singapore, 2021.
  41. Conference paper
    D1
    “A Breezing Proof of the KMW Bound,” in Symposium on Simplicity in Algorithms (SOSA 2021), Alexandria, VA, USA (Virtual Conference), 2021.
  42. Article
    D1
    “Phase Transition of the 2-Choices Dynamics on Core-Periphery Networks,” Distributed Computing, vol. 34, 2021.
  43. Article
    D1
    “Memory-Adjustable Navigation Piles with Applications to Sorting and Convex Hulls,” ACM Transactions on Algorithms, vol. 17, no. 2, 2021.
  44. Article
    D1
    “Foraging-based Optimization of Menu Systems,” International Journal of Human-Computer Studies, vol. 151, 2021.
  45. Conference paper
    D1
    “Clique-Based Separators for Geometric Intersection Graphs,” in 32nd International Symposium on Algorithms and Computation (ISAAC 2021), Fukuoka, Japan, 2021.
  46. Conference paper
    D1
    “Optimal Testing of Discrete Distributions with High Probability,” in STOC ’21, 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual, Italy, 2021.
  47. Article
    D1
    “Counting Induced Subgraphs: An Algebraic Approach to #W[1]-hardness,” Algorithmica, 2021.
  48. Article
    D1
    “The VC Dimension of Metric Balls under Fréchet and Hausdorff Distances,” Discrete & Computational Geometry, 2021.
  49. Article
    D1
    “Sampling Hypergraphs with Given Degrees,” Discrete Mathematics, vol. 344, no. 11, 2021.
  50. Article
    D1
    “AZERTY Amélioré: Computational Design on a National Scale,” Communications of the ACM, vol. 64, no. 2, 2021.
  51. Article
    D1
    “Interplay of Periodic Dynamics and Noise: Insights from a Simple Adaptive System,” Physical Review E, vol. 104, no. 5, 2021.
  52. Paper
    D1
    “Improved Online Algorithm for Fractional Knapsack in the Random Order Model,” 2021. [Online]. Available: https://arxiv.org/abs/2109.04428.
  53. Conference paper
    D1
    “Isomorphism Testing for Graphs Excluding Small Minors,” in FOCS 2020, 61st Annual IEEE Symposium on Foundations of Computer Science, Durham, NC, USA (Virtual Conference), 2021.
  54. Paper
    D1
    “Primal and Dual Combinatorial Dimensions,” 2021. [Online]. Available: https://arxiv.org/abs/2108.10037.
  55. Conference paper
    D1
    “Sampling from the Gibbs Distribution in Congestion Games,” in EC ’21, 22nd ACM Conference on Economics and Computation, Budapest, Hungary (Virtual), 2021.
  56. Paper
    D1
    “Sampling from the Gibbs Distribution in Congestion Games,” 2021. [Online]. Available: https://arxiv.org/abs/2105.12982.
  57. Article
    D1
    “Computation and Efficiency of Potential Function Minimizers of Combinatorial Congestion Games,” Mathematical Programming, vol. 190, no. 1, 2021.
  58. Paper
    D1
    “Polygon Placement Revisited: (Degree of Freedom + 1)-SUM Hardness and an Improvement via Offline Dynamic Rectangle Union,” 2021. [Online]. Available: https://arxiv.org/abs/2111.02544.
  59. Conference paper
    D1
    “Approximate Minimum Directed Spanning Trees Under Congestion,” in Structural Information and Communication Complexity (SIROCCO 2021), Wrocław, Poland (Online), 2021.
  60. Article
    D1
    “2-Approximating Feedback Vertex Set in Tournaments,” ACM Transactions on Algorithms, vol. 17, no. 2, 2021.
  61. Conference paper
    D1
    “FPT-approximation for FPT Problems,” in Proceedings of the Thirty-Second ACM-SIAM Symposium on Discrete Algorithms (SODA 2021), Alexandria, VA, USA (Virtual Conference), 2021.
  62. Article
    D1
    “A Sub-exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs,” Algorithmica, vol. 83, 2021.
  63. Conference paper
    D1
    “Improving Schroeppel and Shamir’s Algorithm for Subset Sum via Orthogonal Vectors,” in STOC ’21, 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual, Italy, 2021.
  64. Article
    D1
    “Computational Design and Optimization of Electro-physiological Sensors,” Nature Communications, vol. 12, no. 1, 2021.
  65. Thesis
    D1IMPR-CS
    “Variety Membership Testing in Algebraic Complexity Theory,” Universität des Saarlandes, Saarbrücken, 2021.
  66. Conference paper
    D1
    “Knapsack and Subset Sum with Small Items,” in 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), Glasgow, UK (Virtual Conference), 2021.
  67. Conference paper
    D1
    “Fair and Efficient Allocations under Subadditive Valuations,” in AAAI Technical Track on Game Theory and Economic Paradigms, Virtual Conference, 2021.
  68. “Improving EFX Guarantees through Rainbow Cycle Number,” 2021. [Online]. Available: https://arxiv.org/abs/2103.01628.
  69. Conference paper
    D1
    “Competitive Allocation of a Mixed Manna,” in Proceedings of the Thirty-Second ACM-SIAM Symposium on Discrete Algorithms (SODA 2021), Alexandria, VA, USA (Virtual Conference), 2021.
  70. Article
    D1
    “A Little Charity Guarantees Almost Envy-Freeness,” SIAM Journal on Computing, vol. 50, no. 4, 2021.
  71. Conference paper
    D1
    “Detecting and Counting Small Subgraphs, and Evaluating a Parameterized Tutte Polynomial: Lower Bounds via Toroidal Grids and Cayley Graph Expanders,” in 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), Glasgow, UK (Virtual Conference), 2021.
  72. Conference paper
    D1
    “Counting Small Induced Subgraphs Satisfying Monotone Properties,” in FOCS 2020, 61st Annual IEEE Symposium on Foundations of Computer Science, Durham, NC, USA (Virtual Conference), 2021.
  73. Conference paper
    D1
    “Strong Connectivity Augmentation is FPT,” in Proceedings of the Thirty-Second ACM-SIAM Symposium on Discrete Algorithms (SODA 2021), Alexandria, VA, USA (Virtual Conference), 2021.
  74. Thesis
    D1IMPR-CS
    “Counting Patterns in Strings and Graphs,” Universität des Saarlandes, Saarbrücken, 2021.
  75. Conference paper
    D1
    “Scaling Neural Tangent Kernels via Sketching and Random Features,” in Advances in Neural Information Processing Systems 34 (NeurIPS 2021), Virtual, 2021.

2020

  1. Conference paper
    D1
    “Impossibility Results for Grammar-Compressed Linear Algebra,” in Advances in Neural Information Processing Systems 33 (NeurIPS 2020), Virtual Event, 2020.
  2. Conference paper
    D1
    “Scheduling Lower Bounds via AND Subset Sum,” in 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), Saarbrücken, Germany (Virtual Conference), 2020.
  3. Article
    D1
    “Fooling Views: A New Lower Bound Technique for Distributed Computations under Congestion,” Distributed Computing, vol. 33, 2020.
  4. Paper
    D1
    “Scheduling Lower Bounds via AND Subset Sum,” 2020. [Online]. Available: https://arxiv.org/abs/2003.07113.
  5. Conference paper
    D1
    “Simple Local Computation Algorithms for the General Lovász Local Lemma,” in SPAA ’20, 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, 2020.
  6. Article
    D1
    “Polylogarithmic Approximation Algorithms for Weighted-F-deletion Problems,” ACM Transactions on Algorithms, vol. 16, no. 4, 2020.
  7. Conference paper
    D1
    “Parameterized Complexity of MAXIMUM EDGE COLORABLE SUBGRAPH,” in Computing and Combinatorics (COCOON 2020), Atlanta, GA, USA, 2020.
  8. Conference paper
    D1
    “Euclidean TSP in Narrow Strips,” in 36th International Symposium on Computational Geometry (SoCG 2020), Zürich, Switzerland (Virtual Conference), 2020.
  9. Paper
    D1
    “Euclidean TSP in Narrow Strips,” 2020. [Online]. Available: https://arxiv.org/abs/2003.09948.
  10. Article
    D1
    “Rapid Mixing of the Switch Markov Chain for Strongly Stable Degree Sequences,” Random Structures and Algorithms, vol. 57, no. 3, 2020.
  11. Conference paper
    D1
    “Complexity of Computing the Anti-Ramsey Numbers for Paths,” in 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020), Prague, Czech Republic (Virtual Event), 2020.
  12. Paper
    D1
    “Distributed Distance-r Dominating Set on Sparse High-Girth Graphs,” 2020. [Online]. Available: https://arxiv.org/abs/1910.02794.
  13. Article
    D1
    “Walking Through Waypoints,” Algorithmica, vol. 82, no. 7, 2020.
  14. Paper
    D1
    “Robust Learning under Strong Noise via SQs,” 2020. [Online]. Available: https://arxiv.org/abs/2010.09106.
  15. Conference paper
    D1
    “Secretary and Online Matching Problems with Machine Learned Advice,” in Advances in Neural Information Processing Systems 33 (NeurIPS 2020), Virtual Event, 2020.
  16. Paper
    D1
    “On the Approximability of the Traveling Salesman Problem with Line Neighborhoods,” 2020. [Online]. Available: https://arxiv.org/abs/2008.12075.
  17. Article
    D1
    “A PTAS for Euclidean TSP with Hyperplane Neighborhoods,” ACM Transactions on Algorithms, vol. 16, no. 3, 2020.
  18. Conference paper
    D1
    “Parallel Machine Scheduling to Minimize Energy Consumption,” in Proceedings of the Thirty-First ACM-SIAM Symposium on Discrete Algorithms (SODA 2020), Salt Lake City, UT, USA, 2020.
  19. Conference paper
    D1
    “Online Metric Algorithms with Untrusted Predictions,” in Proceedings of the 37th International Conference on Machine Learning (ICML 2020), Virtual Conference, 2020.
  20. Conference paper
    D1
    “A General Framework for Energy-Efficient Cloud Computing Mechanisms,” in AAMAS’20, 19th International Conference on Autonomous Agents and MultiAgent Systems, Auckland, New Zealand (Virtual), 2020.
  21. Paper
    D1
    “Secretary and Online Matching Problems with Machine Learned Advice,” 2020. [Online]. Available: https://arxiv.org/abs/2006.01026.
  22. Conference paper
    D1
    “Improved Bounds on Fourier Entropy and Min-entropy,” in 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020), Montpellier, France, 2020.
  23. Paper
    D1
    “Fast and Simple Modular Subset Sum,” 2020. [Online]. Available: https://arxiv.org/abs/2008.10577.
  24. Conference paper
    D1
    “Low Diameter Graph Decompositions by Approximate Distance Computation,” in 11th Innovations in Theoretical Computer Science Conference (ITCS 2020), Seattle, WA, USA, 2020.
  25. Article
    D1
    “Tracking Routes in Communication Networks,” Theoretical Computer Science, vol. 844, 2020.
  26. “Physarum Multi-Commodity Flow Dynamics,” 2020. [Online]. Available: https://arxiv.org/abs/2009.01498.
  27. Conference paper
    D1
    “(k, l)-Medians Clustering of Trajectories Using Continuous Dynamic Time Warpin,” in 28th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (ACM SIGSPATIAL GIS 2020), Seattle, WA, USA (Online), 2020.
  28. Paper
    D1
    “When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance under Translation,” 2020. [Online]. Available: https://arxiv.org/abs/2008.07510.
  29. Conference paper
    D1
    “Top-k-convolution and the Quest for Near-linear Output-sensitive Subset Sum,” in STOC ’20, 52nd Annual ACM SIGACT Symposium on Theory of Computing, Chicago, IL, USA, 2020.
  30. Conference paper
    D1
    “Faster Minimization of Tardy Processing Time on a Single Machine,” in 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), Saarbrücken, Germany (Virtual Conference), 2020.
  31. Conference paper
    D1
    “When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance Under Translation,” in 28th Annual European Symposium on Algorithms (ESA 2020), Pisa, Italy (Virtual Conference), 2020.
  32. Paper
    D1
    “Faster Minimization of Tardy Processing Time on a Single Machine,” 2020. [Online]. Available: https://arxiv.org/abs/2003.07104.
  33. Article
    D1
    “Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless APSP can),” ACM Transactions on Algorithms, vol. 16, no. 4, 2020.
  34. Article
    D1
    “Multivariate Analysis of Orthogonal Range Searching and Graph Distances Parameterized by Treewidth,” Algorithmica, vol. 82, no. 8, 2020.
  35. Paper
    D1
    “On Near-Linear-Time Algorithms for Dense Subset Sum,” 2020. [Online]. Available: https://arxiv.org/abs/2010.09096.
  36. Article
    D1
    “Synchronizer-Free Digital Link Controller,” IEEE Transactions on Circuits and Systems / I, Regular Papers, vol. 27, no. 10, 2020.
  37. “PALS: Plesiochronous and Locally Synchronous Systems,” 2020. [Online]. Available: https://arxiv.org/abs/2003.05542.
  38. Conference paper
    D1
    “PALS: Plesiochronous and Locally Synchronous Systems,” in 26th IEEE International Symposium on Asynchronous Circuits and Systems, Salt Lake City, UT, USA, 2020.
  39. Article
    D1
    “Optimal Metastability-Containing Sorting via Parallel Prefix Computation,” IEEE Transactions on Computers, vol. 69, no. 2, 2020.
  40. Article
    D1
    “From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More,” SIAM Journal on Computing, vol. 49, no. 4, 2020.
  41. Paper
    D1
    “Faster Approximate Pattern Matching: A Unified Approach,” 2020. [Online]. Available: https://arxiv.org/abs/2004.08350.
  42. Article
    D1
    “Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions),” SIAM Journal on Computing, vol. 49, no. 2, 2020.
  43. Conference paper
    D1
    “Resource-Aware Protocols for Network Cost-Sharing Games,” in EC ’20, 21st ACM Conference on Economics and Computation, Virtual Event, Hungary, 2020.
  44. Paper
    D1
    “On the Computational Tractability of a Geographic Clustering Problem Arising in Redistricting,” 2020. [Online]. Available: https://arxiv.org/abs/2009.00188.
  45. Paper
    D1
    “A Breezing Proof of the KMW Bound,” 2020. [Online]. Available: https://arxiv.org/abs/2002.06005.
  46. Paper
    D1
    “Foraging-based Optimization of Menu Systems,” 2020. .
  47. Book chapter / section
    D1
    “Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs,” in Treewidth, Kernels, and Algorithms, Berlin: Springer, 2020.
  48. Article
    D1
    “A Framework for Exponential-Time-Hypothesis-Tight Algorithms and Lower Bounds in Geometric Intersection Graphs,” SIAM Journal on Computing, vol. 49, no. 6, 2020.
  49. Paper
    D1
    “Optimal Testing of Discrete Distributions with High Probability,” 2020. [Online]. Available: https://arxiv.org/abs/2009.06540.
  50. Article
    D1
    “Improved Protocols and Hardness Results for the Two-Player Cryptogenography Problem,” IEEE Transactions on Information Theory, vol. 66, no. 9, 2020.
  51. Paper
    D1
    “Sampling Hypergraphs with Given Degrees,” 2020. [Online]. Available: https://arxiv.org/abs/2006.12021.
  52. “Convergence of the Non-Uniform Directed Physarum Model,” Theoretical Computer Science, vol. 816, 2020.
  53. Conference paper
    D1
    “Quasi-popular Matchings, Optimality, and Extended Formulations,” in Proceedings of the Thirty-First ACM-SIAM Symposium on Discrete Algorithms (SODA 2020), Salt Lake City, UT, USA, 2020.
  54. Article
    D1
    “The Computational Complexity of Plethysm Coefficients,” Computational Complexity, vol. 29, no. 2, 2020.
  55. Conference paper
    D1
    “Parameterized Complexity of Directed Spanner Problems,” in 15th International Symposium on Parameterized and Exact Computation (IPEC 2020), Hong Kong, China (Virtual Conference), 2020.
  56. Conference paper
    D1
    “On the Complexity of Recovering Incidence Matrices,” in 28th Annual European Symposium on Algorithms (ESA 2020), Pisa, Italy (Virtual Conference), 2020.
  57. Conference paper
    D1
    “Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms,” in Proceedings of the Thirty-First ACM-SIAM Symposium on Discrete Algorithms (SODA 2020), Salt Lake City, UT, USA, 2020.
  58. Conference paper
    D1
    “Hitting Long Directed Cycles Is Fixed-Parameter Tractable,” in 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), Saarbrücken, Germany (Virtual Conference), 2020.
  59. “Parameterized Algorithms for Generalizations of Directed Feedback Vertex Set,” 2020. [Online]. Available: https://arxiv.org/abs/2003.02483.
  60. “Hitting Long Directed Cycles is Fixed-Parameter Tractable,” 2020. [Online]. Available: https://arxiv.org/abs/2003.05267.
  61. Paper
    D1
    “Isomorphism Testing for Graphs Excluding Small Minors,” 2020. [Online]. Available: https://arxiv.org/abs/2004.07671.
  62. Conference paper
    D1
    “On the Parameterized Approximability of Contraction to Classes of Chordal Graphs,” in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020), Virtual Conference, 2020.
  63. Paper
    D1
    “The Maximum-Level Vertex in an Arrangement of Lines,” 2020. [Online]. Available: http://arxiv.org/abs/2003.00518.
  64. Article
    D1
    “Conflict Free Version of Covering Problems on Graphs: Classical and Parameterized,” Theory of Computing Systems, vol. 64, 2020.
  65. Thesis
    D1IMPR-CS
    “Of Keyboards and Beyond,” Universität des Saarlandes, Saarbrücken, 2020.
  66. Conference paper
    D1
    “Reading Articles Online,” in Combinatorial Optimization and Applications (COCOA 2020), Dallas, TX, USA (Virtual Conference), 2020.
  67. “Convergence of the Non-Uniform Physarum Dynamics,” Theoretical Computer Science, vol. 816, 2020.
  68. Article
    D1
    “Complex Societies and the Growth of the Law,” Scientific Reports, vol. 10, 2020.
  69. Paper
    D1
    “A Gap-ETH-Tight Approximation Scheme for Euclidean TSP,” 2020. [Online]. Available: https://arxiv.org/abs/2011.03778.
  70. Conference paper
    D1
    “Hyperbolic Intersection Graphs and (Quasi)-Polynomial Time,” in Proceedings of the Thirty-First ACM-SIAM Symposium on Discrete Algorithms (SODA 2020), Salt Lake City, UT, USA, 2020.
  71. Article
    D1
    “Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals on Few Faces,” ACM Transactions on Algorithms, vol. 16, no. 3, 2020.
  72. Conference paper
    D1
    “A Quasi-Polynomial Algorithm for Well-Spaced Hyperbolic TSP,” in 36th International Symposium on Computational Geometry (SoCG 2020), Zürich, Switzerland (Virtual Conference), 2020.
  73. Article
    D1
    “Switch-Based Markov Chains for Sampling Hamiltonian Cycles in Dense Graphs,” The Electronic Journal of Combinatorics, vol. 27, no. 4, 2020.
  74. Paper
    D1
    “Topological Price of Anarchy Bounds for Clustering Games on Networks,” 2020. [Online]. Available: https://arxiv.org/abs/2011.09717.
  75. Conference paper
    D1
    “Finding Small Satisfying Assignments Faster Than Brute Force: A Fine-Grained Perspective into Boolean Constraint Satisfaction,” in 35th Computational Complexity Conference (CCC 2020), Saarbrücken, Germany (Virtual Conference), 2020.
  76. Paper
    D1
    “Finding Small Satisfying Assignments Faster Than Brute Force: A Fine-grained Perspective into Boolean Constraint Satisfaction,” 2020. [Online]. Available: https://arxiv.org/abs/2005.11541.
  77. Paper
    D1
    “TRIX: Low-Skew Pulse Propagation for Fault-Tolerant Hardware,” 2020. [Online]. Available: https://arxiv.org/abs/2010.01415.
  78. Conference paper
    D1
    “Brief Announcement: TRIX: Low-Skew Pulse Propagation for Fault-Tolerant Hardware,” in Stabilization, Safety, and Security of Distributed Systems (SSS 2020), Austin, TX, USA (Virtual Event), 2020.
  79. Article
    D1
    “Scanning the Issue,” Proceedings of the IEEE, vol. 108, no. 3, 2020.
  80. Article
    D1
    “Sublinear-Time Algorithms for Compressive Phase Retrieval,” IEEE Transactions on Information Theory, vol. 66, no. 11, 2020.
  81. Conference paper
    D1
    “Deterministic Sparse Fourier Transform with an ℓ_{∞} Guarantee,” in 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), Saarbrücken, Germany (Virtual Conference), 2020.
  82. Conference paper
    D1
    “Fault Tolerant Subgraphs with Applications in Kernelization,” in 11th Innovations in Theoretical Computer Science Conference (ITCS 2020), Seattle, WA, USA, 2020.
  83. Conference paper
    D1
    “A (2 + ε)-Factor Approximation Algorithm for Split Vertex Deletion,” in 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), Saarbrücken, Germany (Virtual Conference), 2020.
  84. Conference paper
    D1
    “2-Approximating Feedback Vertex Set in Tournaments,” in Proceedings of the Thirty-First ACM-SIAM Symposium on Discrete Algorithms (SODA 2020), Salt Lake City, UT, USA, 2020.
  85. Conference paper
    D1
    “An Exponential Time Parameterized Algorithm for Planar Disjoint Paths,” in STOC ’20, 52nd Annual ACM SIGACT Symposium on Theory of Computing, Chicago, IL, USA, 2020.
  86. Paper
    D1
    “Incompressibility of H-free Edge Modification Problems: Towards a Dichotomy,” 2020. [Online]. Available: https://arxiv.org/abs/2004.11761.
  87. Book chapter / section
    D1
    “Four Shorts Stories on Surprising Algorithmic Uses of Treewidth,” in Treewidth, Kernels, and Algorithms, Berlin: Springer, 2020.
  88. Paper
    D1
    “Four Short Stories on Surprising Algorithmic Uses of Treewidth,” 2020. [Online]. Available: https://arxiv.org/abs/2008.07968.
  89. Conference paper
    D1
    “Quick Separation in Chordal and Split Graphs,” in 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020), Prague, Czech Republic (Virtual Event), 2020.
  90. Article
    D1
    “Nearly Optimal Sparse Polynomial Multiplication,” IEEE Transactions on Information Theory, vol. 66, no. 11, 2020.
  91. Conference paper
    D1
    “Hypergraph Isomorphism for Groups with Restricted Composition Factors,” in 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), Saarbrücken, Germany (Virtual Conference), 2020.
  92. Article
    D1
    “Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon,” Discrete & Computational Geometry, vol. 63, no. 2, 2020.
  93. Article
    D1
    “Combinatorial Optimization of Graphical User Interface Designs,” Proceedings of the IEEE, vol. 108, no. 3, 2020.
  94. “Fair and Efficient Allocations under Subadditive Valuations,” 2020. [Online]. Available: https://arxiv.org/abs/2005.06511.
  95. “EFX Exists for Three Agents,” in EC ’20, 21st ACM Conference on Economics and Computation, Virtual Event, Hungary, 2020.
  96. “Competitive Allocation of a Mixed Manna,” 2020. [Online]. Available: https://arxiv.org/abs/2008.02753.
  97. “EFX exists for three agents,” 2020. [Online]. Available: http://arxiv.org/abs/2002.05119.
  98. Conference paper
    D1
    “A Little Charity Guarantees Almost Envy-Freeness,” in Proceedings of the Thirty-First ACM-SIAM Symposium on Discrete Algorithms (SODA 2020), Salt Lake City, UT, USA, 2020.
  99. Conference paper
    D1
    “Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems Share on,” in PODC ’20, 39th Symposium on Principles of Distributed Computing, Virtual Event, Italy, 2020.
  100. Paper
    D1
    “Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems,” 2020. [Online]. Available: https://arxiv.org/abs/1907.08160.
  101. Conference paper
    D1
    “Counting and Finding Homomorphisms is Universal for Parameterized Complexity Theory,” in Proceedings of the Thirty-First ACM-SIAM Symposium on Discrete Algorithms (SODA 2020), Salt Lake City, UT, USA, 2020.
  102. Paper
    D1
    “Detecting and Counting Small Subgraphs, and Evaluating a Parameterized Tutte Polynomial: Lower Bounds via Toroidal Grids and Cayley Graph Expanders,” 2020. [Online]. Available: https://arxiv.org/abs/2011.03433.
  103. Paper
    D1
    “Counting Small Induced Subgraphs Satisfying Monotone Properties,” 2020. [Online]. Available: https://arxiv.org/abs/2004.06595.
  104. Conference paper
    D1
    “On the Parameterized Complexity of Grid Contraction,” in 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020), Tórshavn, Faroe Islands, 2020.
  105. Conference paper
    D1
    “On the Parameterized Complexity of Maximum Degree Contraction Problem,” in 15th International Symposium on Parameterized and Exact Computation (IPEC 2020), Hong Kong, China (Virtual Conference), 2020.
  106. Conference paper
    D1
    “Fine-Grained Complexity of Regular Expression Pattern Matching and Membership,” in 28th Annual European Symposium on Algorithms (ESA 2020), Pisa, Italy (Virtual Conference), 2020.
  107. Thesis
    D1IMPR-CS
    “Approximation Algorithms for Network Design and Cut Problems in Bounded-Treewidth,” Universität des Saarlandes, Saarbrücken, 2020.

2019

  1. Conference paper
    D1
    “SETH-Based Lower Bounds for Subset Sum and Bicriteria Path,” in Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2019), San Diego, CA, USA, 2019.
  2. Paper
    D1
    “Trustworthy Graph Algorithms,” 2019. [Online]. Available: http://arxiv.org/abs/1907.04065.
  3. Conference paper
    D1
    “Trustworthy Graph Algorithms,” in 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019), Aachen, Germany, 2019.
  4. Article
    D1
    “The Query Complexity of a Permutation-based Variant of Mastermind,” Discrete Applied Mathematics, vol. 260, 2019.
  5. Article
    D1
    “On Romeo and Juliet Problems: Minimizing Distance-to-Sight,” Computational Geometry: Theory and Applications, vol. 84, 2019.
  6. Article
    D1
    “Minimum-width Annulus with Outliers: Circular, Square, and Rectangular Cases,” Information Processing Letters, vol. 145, 2019.
  7. Paper
    D1
    “Ratio-Balanced Maximum Flows,” 2019. [Online]. Available: http://arxiv.org/abs/1902.11047.
  8. Article
    D1
    “Ratio-Balanced Maximum Flows,” Information Processing Letters, vol. 150, 2019.
  9. Article
    D1
    “Distributed Dominating Set Approximations beyond Planar Graphs,” ACM Transactions on Algorithms, vol. 15, no. 3, 2019.
  10. Article
    D1
    “Routing with Congestion in Acyclic Digraphs,” Information Processing Letters, vol. 151, 2019.
  11. Conference paper
    D1
    “On Polynomial-Time Congestion-Free Software-Defined Network Updates,” in IFIP Networking Conference, Warsaw, Poland, 2019.
  12. Article
    D1
    “A Fully Polynomial-Time Approximation Scheme for Speed Scaling with Sleep State,” Algorithmica, vol. 81, no. 9, 2019.
  13. Article
    D1
    “A o(n)-Competitive Deterministic Algorithm for Online Matching on a Line,” Algorithmica, vol. 81, no. 7, 2019.
  14. Conference paper
    D1
    “On the Complexity of Anchored Rectangle Packing,” in 27th Annual European Symposium on Algorithms (ESA 2019), Munich/Garching, Germany, 2019.
  15. Conference paper
    D1
    “A PTAS for Euclidean TSP with Hyperplane Neighborhoods,” in Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2019), San Diego, CA, USA, 2019.
  16. Article
    D1
    “The Geometry of Rank Decompositions of Matrix Multiplication II: 3 x 3 Matrices,” Journal of Pure and Applied Algebra, vol. 223, no. 8, 2019.
  17. Paper
    D1
    “Locality of Not-So-Weak Coloring,” 2019. [Online]. Available: http://arxiv.org/abs/1904.05627.
  18. Conference paper
    D1
    “Locality of Not-so-Weak Coloring,” in Structural Information and Communication Complexity (SIROCCO 2019), L’Aquila, Italy, 2019.
  19. “A PTAS for l_p-Low Rank Approximation,” in Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2019), San Diego, CA, USA, 2019.
  20. Article
    D1
    “Self-Stabilizing Repeated Balls-into-Bins,” Distributed Computing, vol. 32, no. 1, 2019.
  21. Conference paper
    D1
    “Distributed Algorithms for Low Stretch Spanning Trees,” in 33rd International Symposium on Distributed Computing (DISC 2019), Budapest, Hungary, 2019.
  22. Paper
    D1
    “Low Diameter Graph Decompositions by Approximate Distance Computation,” 2019. [Online]. Available: http://arxiv.org/abs/1909.09002.
  23. Article
    D1
    “Two Results on Slime Mold Computations,” Theoretical Computer Science, vol. 773, 2019.
  24. “Earning and Utility Limits in Fisher Markets,” ACM Transactions on Economics and Computation, vol. 7, no. 2, 2019.
  25. Conference paper
    D1
    “Finding and Counting Permutations via CSPs,” in 14th International Symposium on Parameterized and Exact Computation (IPEC 2019), Munich, Germany, 2019.
  26. Article
    D1
    “A Game Characterisation of Tree-like Q-Resolution Size,” Journal of Computer and System Sciences, vol. 104, 2019.
  27. Conference paper
    D1
    “A Deterministic PTAS for the Algebraic Rank of Bounded Degree Polynomials,” in Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2019), San Diego, CA, USA, 2019.
  28. Conference paper
    D1
    “Tracking Routes in Communication Networks,” in Structural Information and Communication Complexity (SIROCCO 2019), L’Aquila, Italy, 2019.
  29. Paper
    D1
    “Variety Membership Testing, Algebraic Natural Proofs, and Geometric Complexity Theory,” 2019. [Online]. Available: http://arxiv.org/abs/1911.02534.
  30. Article
    D1
    “Minimizing Message Size in Stochastic Communication Patterns: Fast Self-Stabilizing Protocols with 3 bits,” Distributed Computing, vol. 32, no. 3, 2019.
  31. Article
    D1
    “KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation,” Journal of Experimental Algorithmics, vol. 24, no. 1, 2019.
  32. Article
    D1
    “Motivo: Fast Motif Counting via Succinct Color Coding and Adaptive Sampling,” Proccedings of the VLDB Endowment, vol. 12, no. 11, 2019.
  33. Conference paper
    D1
    “Multivariate Analysis of Orthogonal Range Searching and Graph Distances Parameterized by Treewidth,” in 13th International Symposium on Parameterized and Exact Computation (IPEC 2018), Helsinki, Finland, 2019.
  34. Conference paper
    D1
    “Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance,” in 35th International Symposium on Computational Geometry (SoCG 2019), Portland, OR, USA, 2019.
  35. Conference paper
    D1
    “Fréchet Distance Under Translation: Conditional Hardness and an Algorithm via Offline Dynamic Grid Reachability,” in Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2019), San Diego, CA, USA, 2019.
  36. Conference paper
    D1
    “Fine-Grained Complexity Theory (Tutorial),” in 36th Symposium on Theoretical Aspects of Computer Science (STACS 2019), Berlin, Germany, 2019.
  37. Paper
    D1
    “Approximating APSP without Scaling: Equivalence of Approximate Min-Plus and Exact Min-Max,” 2019. [Online]. Available: http://arxiv.org/abs/1907.11078.
  38. Article
    D1
    “Geometric Inhomogeneous Random Graphs,” Theoretical Computer Science, vol. 760, 2019.
  39. Conference paper
    D1
    “Polyline Simplification has Cubic Complexity,” in 35th International Symposium on Computational Geometry (SoCG 2019), Portland, OR, USA, 2019.
  40. Conference paper
    D1
    “A Fine-Grained Analogue of Schaefer’s Theorem in P: Dichotomy of ∃k∀-Quantified First-Order Graph Properties,” in 34th Computational Complexity Conference (CCC 2019), New Brunswick, NJ, USA, 2019.
  41. Paper
    D1
    “Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance,” 2019. [Online]. Available: http://arxiv.org/abs/1901.01504.
  42. Article
    D1
    “Truly Subcubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product,” SIAM Journal on Computing, vol. 48, no. 2, 2019.
  43. Conference paper
    D1
    “On Geometric Set Cover for Orthants,” in 27th Annual European Symposium on Algorithms (ESA 2019), Munich/Garching, Germany, 2019.
  44. Conference paper
    D1
    “Few Matches or Almost Periodicity: Faster Pattern Matching with Mismatches in Compressed Texts,” in Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2019), San Diego, CA, USA, 2019.
  45. Conference paper
    D1
    “Approximating APSP without Scaling: Equivalence of Approximate Min-Plus and Exact Min-Max,” in STOC ’19, 51st Annual ACM Symposium on the Theory of Computing, Phoenix, AZ, USA, 2019.
  46. Conference paper
    D1
    “klcluster: Center-based Clustering of Trajectories,” in 27th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (ACM SIGSPATIAL GIS 2019), Chicago, IL, USA, 2019.
  47. Paper
    D1
    “Optimal Metastability-Containing Sorting via Parallel Prefix Computation,” 2019. [Online]. Available: http://arxiv.org/abs/1911.00267.
  48. Conference paper
    D1
    “Fault Tolerant Gradient Clock Synchronization,” in PODC ’19, ACM Symposium on Principles of Distributed Computing, Toronto, Canada, 2019.
  49. Paper
    D1
    “Fault Tolerant Gradient Clock Synchronization,” 2019. [Online]. Available: http://arxiv.org/abs/1902.08042.
  50. Article
    D1
    “No Occurrence Obstructions in Geometric Complexity Theory,” Journal of the American Mathematical Society, vol. 32, 2019.
  51. Conference paper
    D1
    “A Tight Extremal Bound on the Lovász Cactus Number in Planar Graphs,” in 36th Symposium on Theoretical Aspects of Computer Science (STACS 2019), Berlin, Germany, 2019.
  52. “Hadwiger’s Conjecture for Squares of 2-Trees,” European Journal of Combinatorics, vol. 76, 2019.
  53. Conference paper
    D1
    “A General Framework for Handling Commitment in Online Throughput Maximization,” in Integer Programming and Combinatorial Optimization (IPCO 2019), Ann Arbor, MI, USA, 2019.
  54. Article
    D1
    “Secretary Markets with Local Information,” Distributed Computing, vol. 32, no. 5, 2019.
  55. “Tracing Equilibrium in Dynamic Markets via Distributed Adaptation,” in AAMAS ’19, 18th International Conference on Autonomous Agents and Multiagent Systems, Montreal, Canada, 2019.
  56. Article
    D1
    “The Geometry of Rank Decompositions of Matrix Multiplication I: 2x2 Matrices,” Experimental Mathematics, vol. 28, no. 3, 2019.
  57. “Polynomial-Sized Topological Approximations Using the Permutahedron,” Discrete & Computational Geometry, vol. 61, no. 1, 2019.
  58. Article
    D1
    “Delaunay Simplices in Diagonally Distorted Lattices,” Computational Geometry: Theory and Applications, vol. 81, 2019.
  59. “Improved Topological Approximations by Digitization,” in Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2019), San Diego, CA, USA, 2019.
  60. Article
    D1
    “Designing Networks with Good Equilibria under Uncertainty,” SIAM Journal on Computing, vol. 48, no. 4, 2019.
  61. Article
    D1
    “Recent Developments in Prophet Inequalities,” ACM SIGecom Exchanges, vol. 17, no. 1, 2019.
  62. Book
    D1
    Juristische Netzwerkforschung : Modellierung, Quantifizierung und Visualisierung relationaler Daten im Recht. Tübingen: Mohr Siebeck, 2019.
  63. Conference paper
    D1
    “Distributed Community Detection via Metastability of the 2-Choices Dynamics,” in Thirty-Third AAAI Conference on Artificial Intelligence, Honolulu, HI, USA, 2019.
  64. “Altitude Terrain Guarding and Guarding Uni-monotone Polygons,” Computational Geometry: Theory and Applications, vol. 84, 2019.
  65. Conference paper
    D1
    “On One-Round Discrete Voronoi Games,” in 30th International Symposium on Algorithms and Computation (ISAAC 2019), Shanghai, China, 2019.
  66. Conference paper
    D1
    “Counting Answers to Existential Questions,” in 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019), Patras, Greece, 2019.
  67. Conference paper
    D1
    “Distribution-Independent PAC Learning of Halfspaces with Massart Noise,” in Advances in Neural Information Processing Systems 32 (NeurIPS 2019), Vancouver, Canada, 2019.
  68. Paper
    D1
    “On Geometric Complexity Theory: Multiplicity Obstructions are Stronger than Occurrence Obstructions,” 2019. [Online]. Available: http://arxiv.org/abs/1901.04576.
  69. Conference paper
    D1
    “Counting Induced Subgraphs: An Algebraic Approach to #W[1]-hardness,” in 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019), Aachen, Germany, 2019.
  70. Article
    D1
    “Tight Conditional Lower Bounds for Longest Common Increasing Subsequence,” Algorithmica, vol. 81, no. 10, 2019.
  71. Paper
    D1
    “The Arboricity Captures the Complexity of Sampling Edges,” 2019. [Online]. Available: http://arxiv.org/abs/1902.08086.
  72. “Convergence of the Non-Uniform Directed Physarum Model,” 2019. [Online]. Available: http://arxiv.org/abs/1906.07781.
  73. Article
    D1
    “Noisy Rumor Spreading and Plurality Consensus,” Distributed Computing, vol. 32, no. 4, 2019.
  74. Conference paper
    D1
    “PATHFINDER: Storage and Indexing of Massive Trajectory Sets,” in SSTD ’19, 16th International Symposium on Spatial and Temporal Databases, Vienna, Austria, 2019.
  75. Conference paper
    D1
    “Optimal Sorting with Persistent Comparison Errors,” in 27th Annual European Symposium on Algorithms (ESA 2019), Munich/Garching, Germany, 2019.
  76. Conference paper
    D1
    “Dual-Mode Greedy Algorithms Can Save Energy,” in 30th International Symposium on Algorithms and Computation (ISAAC 2019), Shanghai, China, 2019.
  77. Article
    D1
    “A Stable Marriage Requires Communication,” Games and Economic Behavior, vol. 118, 2019.
  78. Conference paper
    D1
    “O(log 2 k/ log log k)-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial-Time Algorithm,” in STOC ’19, 51st Annual ACM Symposium on the Theory of Computing, Phoenix, AZ, USA, 2019.
  79. Article
    D1
    “Faster Approximation Schemes for the Two-dimensional Knapsack Problem,” ACM Transactions on Algorithms, vol. 15, no. 4, 2019.
  80. Conference paper
    D5D1
    “Bridging Quantities in Tables and Text,” in ICDE 2019, 35th IEEE International Conference on Data Engineering, Macau, China, 2019.
  81. Article
    D1
    “On the Complexity of Hazard-free Circuits,” Journal of the ACM, vol. 66, no. 4, 2019.
  82. “On Some Covering, Partition and Connectivity Problems in Graphs,” Universität des Saarlandes, Saarbrücken, 2019.
  83. Conference paper
    D1
    “On the Complexity of Symmetric Polynomials,” in 10th Innovations in Theoretical Computer Science (ITCS 2019), San Diego, CA, USA, 2019.
  84. Conference paper
    D1
    “Dynamic Sparsification for Quadratic Assignment Problems,” in Mathematical Optimization Theory and Operations Research (MOTOR 2019), Ekaterinburg, Russia, 2019.
  85. “Convergence of the Non-Uniform Physarum Dynamics,” 2019. [Online]. Available: http://arxiv.org/abs/1901.07231.
  86. Article
    D1
    “Self-Stabilizing Byzantine Clock Synchronization with Optimal Precision,” Theory of Computing Systems, vol. 63, no. 2, 2019.
  87. Conference paper
    D1
    “A Fresh Look at the Design of Low Jitter Hard Limiters,” in Joint Conference of the European Frequency and Time Forum and IEEE International Frequency Control Symposium (EFTF/IFC 2019), Orlando, FL, USA, 2019.
  88. Conference paper
    D1
    “A Physical Sine-to-Square Converter Noise Model,” in IEEE International Frequency Control Symposium (IFCS 2018), Olympic Valley, CA, USA, 2019.
  89. Conference paper
    D1
    “How Does Object Fatness Impact the Complexity of Packing in d Dimensions?,” in 30th International Symposium on Algorithms and Computation (ISAAC 2019), Shanghai, China, 2019.
  90. Article
    D1
    “Subquadratic Algorithms for Succinct Stable Matching,” Algorithmica, vol. 81, no. 7, 2019.
  91. Conference paper
    D1
    “Parallel Balanced Allocations: The Heavily Loaded Case,” in SPAA’19, 31st ACM Symposium on Parallelism in Algorithms and Architectures, Phoenix, AZ, USA, 2019.
  92. “Near-Optimal Self-stabilising Counting and Firing Squads,” Distributed Computing, vol. 32, no. 4, 2019.
  93. “Self-Stabilising Byzantine Clock Synchronisation is Almost as Easy as Consensus,” Journal of the ACM, vol. 66, no. 5, 2019.
  94. Paper
    D1
    “Parallel Balanced Allocations: The Heavily Loaded Case,” 2019. [Online]. Available: http://arxiv.org/abs/1904.07532.
  95. Article
    D1
    “Distributed Distance Computation and Routing with Small Messages,” Distributed Computing, vol. 32, no. 2, 2019.
  96. Conference paper
    D1
    “Resilient Dictionaries for Randomly Unreliable Memory,” in 27th Annual European Symposium on Algorithms (ESA 2019), Munich/Garching, Germany, 2019.
  97. Paper
    D1
    “With Great Speed Come Small Buffers: Space-Bandwidth Tradeoffs for Routing,” 2019. [Online]. Available: http://arxiv.org/abs/1902.08069.
  98. Conference paper
    D1
    “With Great Speed Come Small Buffers: Space-Bandwidth Tradeoffs for Routing,” in PODC ’19, ACM Symposium on Principles of Distributed Computing, Toronto, Canada, 2019.
  99. Article
    D1
    “Computing the Center Region and its Variants,” Theoretical Computer Science, vol. 789, 2019.
  100. Article
    D1
    “Assigning Weights to Minimize the Covering Radius in the Plane,” Computational Geometry: Theory and Applications, vol. 81, 2019.
  101. Article
    D1
    “A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-Off Algorithms,” Algorithmica, vol. 81, no. 7, 2019.
  102. Conference paper
    D1
    “Optimal Algorithm for Geodesic Nearest-point Voronoi Diagrams in Simple Polygons,” in Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2019), San Diego, CA, USA, 2019.
  103. Conference paper
    D1
    “Space-Optimal Packet Routing on Trees,” in IEEE Conference on Computer Communications (IEEE INFOCOM 2019), Paris, France, 2019.
  104. Paper
    D1
    “A Little Charity Guarantees Almost Envy-Freeness,” 2019. [Online]. Available: http://arxiv.org/abs/1907.04596.
  105. Book
    D1
    Sequential and Parallel Algorithms and Data Structures. Cham: Springer, 2019.
  106. Thesis
    D1IMPR-CS
    “Plane and Simple,” Universität des Saarlandes, Saarbrücken, 2019.
  107. Article
    D1
    “Optimal Online Algorithms for the Portfolio Selection Problem, Bi-Directional Trading and -Search with Interrelated Prices,” RAIRO - Operations Research, vol. 53, no. 2, 2019.

2018

  1. Paper
    D1
    “Tighter Connections Between Formula-SAT and Shaving Logs,” 2018. [Online]. Available: http://arxiv.org/abs/1804.08978.
  2. Conference paper
    D1
    “More Consequences of Falsifying SETH and the Orthogonal Vectors Conjecture,” in STOC’18, 50th Annual ACM SIGACT Symposium on Theory of Computing, Los Angeles, CA, USA, 2018.
  3. Paper
    D1
    “SETH-Based Lower Bounds for Subset Sum and Bicriteria Path,” 2018. [Online]. Available: http://arxiv.org/abs/1704.04546.
  4. Paper
    D1
    “Fine-Grained Complexity of Analyzing Compressed Data: Quantifying Improvements over Decompress-And-Solve,” 2018. [Online]. Available: http://arxiv.org/abs/1803.00796.
  5. Conference paper
    D1
    “Tighter Connections Between Formula-SAT and Shaving Logs,” in 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), Prague, Czech Republic, 2018.
  6. Paper
    D1
    “Fast Fencing,” 2018. [Online]. Available: http://arxiv.org/abs/1804.00101.
  7. Conference paper
    D1
    “Fast Fencing,” in STOC’18, 50th Annual ACM SIGACT Symposium on Theory of Computing, Los Angeles, CA, USA, 2018.
  8. Conference paper
    D1
    “Approximating Airports and Railways,” in 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018), Caen, France, 2018.
  9. Conference paper
    D1
    “Walking Through Waypoints,” in LATIN 2018: Theoretical Informatics, Buenos Aires, Argentinia, 2018.
  10. Conference paper
    D1
    “Distributed Domination on Graph Classes of Bounded Expansion,” in SPAA’18, 30th ACM Symposium on Parallelism in Algorithms and Architectures, Vienna, Austria, 2018.
  11. Conference paper
    D1
    “Congestion-Free Rerouting of Flows on DAGs,” in 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), Prague, Czech Republic, 2018.
  12. Article
    D1
    “Charting the Algorithmic Complexity of Waypoint Routing,” ACM SIGCOMM Computer Communication Review, vol. 48, no. 1, 2018.
  13. Conference paper
    D1
    “A Collection of Lower Bounds for Online Matching on the Line,” in LATIN 2018: Theoretical Informatics, Buenos Aires, Argentinia, 2018.
  14. Conference paper
    D1
    “A Tight Lower Bound for Online Convex Optimization with Switching Costs,” in Approximation and Online Algorithms (WAOA 2017), Vienna, Austria, 2018.
  15. Conference paper
    D1
    “Near Optimal Mechanism for Energy Aware Scheduling,” in Algorithmic Game Theory (SAGT 2018), Beijing, China, 2018.
  16. Paper
    D1
    “A PTAS for Euclidean TSP with Hyperplane Neighborhoods,” 2018. [Online]. Available: http://arxiv.org/abs/1804.03953.
  17. Paper
    D1
    “Improved Bounds on Fourier Entropy and Min-entropy,” 2018. [Online]. Available: http://arxiv.org/abs/1809.09819.
  18. Paper
    D1
    “A Fast Implementation of Near Neighbors Queries for Fréchet Distance (GIS Cup),” 2018. [Online]. Available: http://arxiv.org/abs/1803.00806.
  19. Paper
    D1
    “The Geometry of Rank Decompositions of Matrix Multiplication II: 3 x 3 Matrices,” 2018. [Online]. Available: http://arxiv.org/abs/1801.00843.
  20. “A PTAS for l p-Low Rank Approximation,” 2018. [Online]. Available: http://arxiv.org/abs/1807.06101.
  21. Paper
    D1
    “Finding a Bounded-Degree Expander Inside a Dense One,” 2018. [Online]. Available: http://arxiv.org/abs/1811.10316.
  22. Conference paper
    D1
    “Pooling or Sampling: Collective Dynamics for Electrical Flow Estimation,” in AAMAS’18, 17th International Conference on Autonomous Agents and MultiAgent Systems, Stockholm, Sweden, 2018.
  23. Conference paper
    D1
    “Average Whenever You Meet: Opportunistic Protocols for Community Detection,” in 26th Annual European Symposium on Algorithms (ESA 2018), Helsinki, Finland, 2018.
  24. Article
    D1
    “A Simple Near-Optimal Subdivision Algorithm for Complex Root Isolation based on the Pellet Test and Newton Iteration,” Journal of Symbolic Computation, vol. 86, 2018.
  25. “Sampling in Space Restricted Settings,” Algorithmica, vol. 80, no. 5, 2018.
  26. Conference paper
    D1
    “Generalized Matrix Completion and Algebraic Natural Proofs,” in STOC’18, 50th Annual ACM SIGACT Symposium on Theory of Computing, Los Angeles, CA, USA, 2018.
  27. Article
    D1
    “A Deterministic PTAS for Commutative Rank of Matrix Spaces,” Theory of Computing, vol. 14, 2018.
  28. Article
    D1
    “Generalized Matrix Completion and Algebraic Natural Proofs Contact Add Comment RSS-Feed,” Electronic Colloquium on Computational Complexity (ECCC): Report Series, vol. 18–064, 2018.
  29. Conference paper
    D1
    “Limits for Rumor Spreading in Stochastic Populations,” in 9th Innovations in Theoretical Computer Science (ITCS 2018), Cambridge, MA, USA, 2018.
  30. Article
    D1
    “Limits on Reliable Information Flows through Stochastic Populations,” PLoS Computational Biology, vol. 14, no. 6, 2018.
  31. Article
    D1
    “Delaunay Triangulation of Manifolds,” Foundations of Computational Mathematics, vol. 18, no. 2, 2018.
  32. Article
    D1
    “A Note on Hardness of Diameter Approximation,” Information Processing Letters, vol. 133, 2018.
  33. Paper
    D1
    “Fréchet Distance Under Translation: Conditional Hardness and an Algorithm via Offline Dynamic Grid Reachability,” 2018. [Online]. Available: http://arxiv.org/abs/1810.10982.
  34. Conference paper
    D1
    “Multivariate Fine-Grained Complexity of Longest Common Subsequence,” in Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2018), New Orleans, LA, USA, 2018.
  35. Paper
    D1
    “Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars,” 2018. [Online]. Available: http://arxiv.org/abs/1803.00804.
  36. Conference paper
    D1
    “Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless APSP can),” in Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2018), New Orleans, LA, USA, 2018.
  37. Article
    D1
    “On Algebraic Branching Programs of Small Width,” Journal of the ACM, vol. 65, no. 5, 2018.
  38. Paper
    D1
    “Multivariate Fine-Grained Complexity of Longest Common Subsequence,” 2018. [Online]. Available: http://arxiv.org/abs/1803.00938.
  39. Paper
    D1
    “Sketching, Streaming, and Fine-Grained Complexity of (Weighted) LCS,” 2018. [Online]. Available: http://arxiv.org/abs/1810.01238.
  40. Paper
    D1
    “Maximum Volume Subset Selection for Anchored Boxes,” 2018. [Online]. Available: http://arxiv.org/abs/1803.00849.
  41. Paper
    D1
    “Multivariate Analysis of Orthogonal Range Searching and Graph Distances Parameterized by Treewidth,” 2018. [Online]. Available: http://arxiv.org/abs/1805.07135.
  42. Article
    D1
    “De-anonymization of Heterogeneous Random Graphs in Quasilinear Time,” Algorithmica, vol. 80, no. 11, 2018.
  43. Conference paper
    D1
    “Sketching, Streaming, and Fine-Grained Complexity of (Weighted) LCS,” in 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018), Ahmedabad, India, 2018.
  44. Conference paper
    D1
    “Optimal Metastability-containing Sorting Networks,” in Proceedings of the 2018 Design, Automation & Test in Europe (DATE 2018), Dresden, Germany, 2018.
  45. Paper
    D1
    “Optimal Metastability-Containing Sorting Networks,” 2018. [Online]. Available: http://arxiv.org/abs/1801.07549.
  46. Paper
    D1
    “Small Hazard-free Transducers,” 2018. [Online]. Available: http://arxiv.org/abs/1811.12369.
  47. Paper
    D1
    “A Tight Extremal Bound on the Lovász Cactus Number in Planar Graphs,” 2018. [Online]. Available: http://arxiv.org/abs/1804.03485.
  48. Conference paper
    D1
    “Multi-Finger Binary Search Trees,” in 29th International Symposium on Algorithms and Computation (ISAAC 2018), Jiaoxi, Yilan, Taiwan, 2018.
  49. Paper
    D1
    “Survivable Network Design for Group Connectivity in Low-Treewidth Graphs,” 2018. [Online]. Available: http://arxiv.org/abs/1802.10403.
  50. Conference paper
    D1
    “Survivable Network Design for Group Connectivity in Low-Treewidth Graphs,” in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018), Princeton, NJ, USA, 2018.
  51. “Spanning Tree Congestion and Computation of Generalized Györi-Lovász Partition,” in 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), Prague, Czech Republic, 2018.
  52. Conference paper
    D1
    “Algorithms and Bounds for Very Strong Rainbow Coloring,” in LATIN 2018: Theoretical Informatics, Buenos Aires, Argentinia, 2018.
  53. Conference paper
    D1
    “Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity,” in 29th International Symposium on Algorithms and Computation (ISAAC 2018), Jiaoxi, Yilan, Taiwan, 2018.
  54. Conference paper
    D1
    “Amortized Analysis of Asynchronous Price Dynamics,” in 26th Annual European Symposium on Algorithms (ESA 2018), Helsinki, Finland, 2018.
  55. Conference paper
    D1
    “Multiplicative Weights Updates with Constant Step-Size in Graphical Constant-Sum Games,” in Advances in Neural Information Processing Systems 31 (NeurIPS 2018), Montréal, Canada, 2018.
  56. Paper
    D1
    “Parallel Stochastic Asynchronous Coordinate Descent: Tight Bounds on the Possible Parallelism,” 2018. [Online]. Available: http://arxiv.org/abs/1811.05087.
  57. “Tracing Equilibrium in Dynamic Markets via Distributed Adaptation,” 2018. [Online]. Available: http://arxiv.org/abs/1804.08017.
  58. Conference paper
    D1
    “Steiner Point Removal - Distant Terminals Don’t (Really) Bother,” in Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2018), New Orleans, LA, USA, 2018.
  59. Conference paper
    D1
    “Dynamics of Distributed Updating in Fisher Markets,” in ACM EC’18, Nineteenth ACM Conference on Economics and Computation, Ithaca, NY, USA, 2018.
  60. Paper
    D1
    “(Near) Optimal Parallelism Bound for Fully Asynchronous Coordinate Descent with Linear Speedup,” 2018. [Online]. Available: http://arxiv.org/abs/1811.03254.
  61. Article
    D1
    “Polynomials and the Exponent of Matrix Multiplication,” Bulletin of the London Mathematical Society, vol. 50, no. 3, 2018.
  62. Conference paper
    D1
    “Coxeter Triangulations Have Good Quality,” in EuroCG 18 Extended Abstracts, Berlin, Germany, 2018.
  63. Conference paper
    D1
    “A Tight Analysis of the Parallel Undecided-State Dynamics with Two Colors,” in 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018), Liverpool, UK, 2018.
  64. Paper
    D1
    “Consensus Needs Broadcast in Noiseless Models but can be Exponentially Easier in the Presence of Noise,” 2018. [Online]. Available: http://arxiv.org/abs/1807.05626.
  65. Article
    D1
    “On Testing Substitutability,” Information Processing Letters, vol. 138, 2018.
  66. Paper
    D1
    “On Testing Substitutability,” 2018. [Online]. Available: http://arxiv.org/abs/1805.07642.
  67. Article
    D1
    “On the Metastability of Quadratic Majority Dynamics on Clustered Graphs and its Biological Implications,” Bulletin of the EATCS, vol. 125, 2018.
  68. Conference paper
    D1
    “On the Emergent Behavior of the 2-Choices Dynamics,” in Proceedings of the 19th Italian Conference on Theoretical Computer Science (ICTCS 2018), Urbino, Italy, 2018.
  69. Paper
    D1
    “Phase Transition of the 2-Choices Dynamics on Core-Periphery Networks,” 2018. [Online]. Available: http://arxiv.org/abs/1804.07223.
  70. Article
    D1
    “Phase Transition of the 2-Choices Dynamics on Core-Periphery Networks,” Bulletin of the EATCS, vol. 125, 2018.
  71. Conference paper
    D1
    “Phase Transition of the 2-Choices Dynamics on Core-Periphery Networks,” in AAMAS’18, 17th International Conference on Autonomous Agents and MultiAgent Systems, Stockholm, Sweden, 2018.
  72. Paper
    D1
    “On Subexponential Running Times for Approximating Directed Steiner Tree and Related Problems,” 2018. [Online]. Available: http://arxiv.org/abs/1811.00710.
  73. Article
    D1
    “Fast Hamiltonicity Checking Via Bases of Perfect Matchings,” Journal of the ACM, vol. 65, no. 3, 2018.
  74. Conference paper
    D1
    “On the Complexity of Closest Pair via Polar-Pair of Point-Sets,” in 34th International Symposium on Computational Geometry (SoCG 2018), Budapest, Hungary, 2018.
  75. Conference paper
    D1
    “Testing Bounded Arboricity,” in Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2018), New Orleans, LA, USA, 2018.
  76. Conference paper
    D1
    “Online Generalized Caching with Varying Weights and Costs,” in SPAA’18, 30th ACM Symposium on Parallelism in Algorithms and Architectures, Vienna, Austria, 2018.
  77. Conference paper
    D1
    “Distributed Set Cover Approximation: Primal-Dual with Optimal Locality,” in 32nd International Symposium on Distributed Computing (DISC 2018), New Orleans, LA, USA, 2018.
  78. Conference paper
    D1
    “A Sublinear Tester for Outerplanarity (and Other Forbidden Minors) With One-Sided Error,” in 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), Prague, Czech Republic, 2018.
  79. Article
    D1
    “New Algorithms for Maximum Disjoint Paths Based on Tree-likeness,” Mathematical Programming / A, vol. 171, no. 1–2, 2018.
  80. “Parallel Metric Tree Embedding based on an Algebraic View on Moore-Bellman-Ford,” Journal of the ACM, vol. 65, no. 6, 2018.
  81. Article
    D1
    “Metastability-Containing Circuits,” IEEE Transactions on Computers, vol. 67, no. 8, 2018.
  82. Conference paper
    D1
    “Fast All-Digital Clock Frequency Adaptation Circuit for Voltage Droop Tolerance,” in 24th IEEE International Symposium on Asynchronous Circuits and Systems, Vienna, Austria, 2018.
  83. Conference paper
    D1
    “Approximating the Nash Social Welfare with Budget-Additive Valuations,” in Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2018), New Orleans, LA, USA, 2018.
  84. Article
    D1
    “Near-Optimal Distributed Maximum Flow,” SIAM Journal on Computing, vol. 47, no. 6, 2018.
  85. Conference paper
    D1
    “A(5/3+ε)-Approximation for Unsplittable Flow on a Path: Placing Small Tasks into Boxes,” in STOC’18, 50th Annual ACM SIGACT Symposium on Theory of Computing, Los Angeles, CA, USA, 2018.
  86. Paper
    D1
    “O(log 2 k/ log log k)-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial-Time Algorithm,” 2018. [Online]. Available: http://arxiv.org/abs/1811.03020.
  87. Article
    D1
    “Macroscopic Equivalence for Microscopic Motion in a Turbulence Driven Three-dimensional Self-assembly Reactor,” Journal of Applied Physics, vol. 123, no. 2, 2018.
  88. “Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs,” in 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018), Liverpool, UK, 2018.
  89. Thesis
    D1IMPR-CS
    “A Tale of Two Packing Problems: Improved Algorithms and Tighter Bounds for Online Bin Packing and the Geometric Knapsack Problem,” Universität des Saarlandes, Saarbrücken, 2018.
  90. Paper
    D1
    “A Classification of Spherical Schubert Varieties in the Grassmannian,” 2018. [Online]. Available: http://arxiv.org/abs/1809.08003.
  91. Article
    D1
    “Dynamics in Matching and Coalition Formation Games with Structural Constraints,” Artificial Intelligence, vol. 262, 2018.
  92. Article
    D1
    “How Unsplittable-flow-covering Helps Scheduling with Job-dependent Cost Functions,” Algorithmica, vol. 80, no. 4, 2018.
  93. Article
    D1
    “On the Relative Power of Reduction Notions in Arithmetic Circuit Complexity,” Information Processing Letters, vol. 130, 2018.
  94. Conference paper
    D1
    “On the Complexity of Hazard-free Circuits,” in STOC’18, 50th Annual ACM SIGACT Symposium on Theory of Computing, Los Angeles, CA, USA, 2018.
  95. Conference paper
    D1
    “On the Parameterized Complexity of Approximating Dominating Set,” in STOC’18, 50th Annual ACM SIGACT Symposium on Theory of Computing, Los Angeles, CA, USA, 2018.
  96. Conference paper
    D1
    “Price of Anarchy for Mechanisms with Risk-Averse Agents,” in 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), Prague, Czech Republic, 2018.
  97. “Algorithmic Results for Clustering and Refined Physarum Analysis,” Universität des Saarlandes, Saarbrücken, 2018.
  98. Article
    D1
    “Corrigendum to ‘Faster algorithms for computing Hong’s bound on absolute positiveness’ [J. Symb. Comput. 45 (2010) 677–683],” Journal of Symbolic Computation, vol. 87, 2018.
  99. Paper
    D1
    “Optimal Gradient Clock Synchronization in Dynamic Networks (Version 3),” 2018. [Online]. Available: http://arxiv.org/abs/1005.2894.
  100. Conference paper
    D1
    “On Nondeterministic Derandomization of Freivalds’ Algorithm: Consequences, Avenues and Algorithmic Progress,” in 26th Annual European Symposium on Algorithms (ESA 2018), Helsinki, Finland, 2018.
  101. Paper
    D1
    “On Nondeterministic Derandomization of Freivalds’ Algorithm: Consequences, Avenues and Algorithmic Progress,” 2018. [Online]. Available: http://arxiv.org/abs/1806.09189.
  102. Article
    D1
    “Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical Machines,” Mathematical Programming / B, vol. 172, no. 1–2, 2018.
  103. Conference paper
    D2D1
    “Partial Optimality and Fast Lower Bounds for Weighted Correlation Clustering,” in Proceedings of the 35th International Conference on Machine Learning (ICML 2018), Stockholm, Sweden, 2018.
  104. Conference paper
    D1
    “A Centralized Local Algorithm for the Sparse Spanning Graph Problem,” in 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), Prague, Czech Republic, 2018.
  105. Article
    D1
    “Simple Proof of Optimal Epsilon Nets,” Combinatorica, vol. 38, no. 5, 2018.
  106. Article
    D1
    “On the Computational Power of Simple Dynamics,” Bulletin of the EATCS, vol. 124, 2018.
  107. Conference paper
    D1
    “Polygon Queries for Convex Hulls of Points,” in Computing and Combinatorics (COCOON 2018), QingDao, China, 2018.
  108. Conference paper
    D1
    “Approximate Range Queries for Clustering,” in 34th International Symposium on Computational Geometry (SoCG 2018), Budapest, Hungary, 2018.
  109. Conference paper
    D1
    “Point Location in Dynamic Planar Subdivisions,” in 34th International Symposium on Computational Geometry (SoCG 2018), Budapest, Hungary, 2018.
  110. Conference paper
    D1
    “Point Location in Incremental Planar Subdivisions,” in 29th International Symposium on Algorithms and Computation (ISAAC 2018), Jiaoxi, Yilan, Taiwan, 2018.
  111. Conference paper
    D1
    “Minimizing Distance-to-Sight in Polygonal Domains,” in 29th International Symposium on Algorithms and Computation (ISAAC 2018), Jiaoxi, Yilan, Taiwan, 2018.
  112. Conference paper
    D1
    “The Itinerant List Update Problem,” in Approximation and Online Algorithms (WAOA 2018), Helsiniki, Finland, 2018.
  113. Book chapter / section
    D1
    “Combinatorial Optimization for UI Design,” in Computational Interaction, Oxford, UK: Oxford University Press, 2018.
  114. Article
    D1
    “Algebraic Independence over Positive Characteristic: New Criterion and Applications to Locally Low Algebraic Rank Circuits,” Computational Complexity, vol. 27, no. 4, 2018.
  115. Article
    D1
    “Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs,” ACM Transactions on Algorithms, vol. 14, no. 4, 2018.
  116. “On Fair Division of Indivisible Items,” 2018. [Online]. Available: http://arxiv.org/abs/1805.06232.
  117. “On Fair Division for Indivisible Items,” in 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018), Ahmedabad, India, 2018.
  118. Paper
    D1
    “Combinatorial Algorithms for General Linear Arrow-Debreu Markets,” 2018. [Online]. Available: http://arxiv.org/abs/1810.01237.
  119. Conference paper
    D1
    “Combinatorial Algorithms for General Linear Arrow-Debreu Markets,” in 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018), Ahmedabad, India, 2018.
  120. Article
    D1
    “Computing 2-Walks in Polynomial Time,” ACM Transactions on Algorithms, vol. 14, no. 2, 2018.
  121. Conference paper
    D1
    “Computing Tutte Paths,” in 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), Prague, Czech Republic, 2018.
  122. Article
    D1
    “Independent Set of Convex Polygons: From nϵ to 1+ϵ via Shrinking,” Algorithmica, vol. 80, no. 3, 2018.

2017

  1. Conference paper
    D1
    “Fine-Grained Complexity of Analyzing Compressed Data: Quantifying Improvements over Decompress-And-Solve,” in 58th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2017), Berkeley, CA, USA, 2017.
  2. Conference paper
    D1
    “Fully Dynamic All-Pairs Shortest Paths with Worst-Case Update-Time Revisited,” in Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017), Barcelona, Spain, 2017.
  3. Article
    D1
    “Reordering Buffer Management with Advice,” Journal of Scheduling, vol. 20, no. 5, 2017.
  4. Article
    D1
    “Sign Rank versus Vapnik-Chervonenkis Dimension,” Sbornik: Mathematics, vol. 208, no. 12, 2017.
  5. Article
    D1RG1
    “Verification of Linear Hybrid Systems with Large Discrete State Spaces Using Counterexample-guided Abstraction Refinement,” Science of Computer Programming, vol. 148, 2017.
  6. Article
    D1
    “Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines,” Algorithmica, vol. 77, no. 2, 2017.
  7. Conference paper
    D1
    “A QPTAS for the General Scheduling Problem with Identical Release Dates,” in 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017), Warsaw, Poland, 2017.
  8. Article
    D1
    “Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-Off Schedules,” Algorithmica, vol. 79, no. 2, 2017.
  9. Article
    D1
    “Continuous Speed Scaling with Variability: A simple and Direct Approach,” Theoretical Computer Science, vol. 678, 2017.
  10. Article
    D1
    “Truthful Mechanism Design via Correlated Tree Rounding,” Mathematical Programming / A, vol. 163, no. 1–2, 2017.
  11. Conference paper
    D1
    “A Fast Implementation of Near Neighbors Queries for Fréchet Distance (GIS Cup),” in 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (GIS 2017), Redondo Beach, CA, USA, 2017.
  12. Article
    D1
    “Simple Dynamics for Plurality Consensus,” Distributed Computing, vol. 30, no. 4, 2017.
  13. Conference paper
    D1
    “Find Your Place: Simple Distributed Algorithms for Community Detection,” in Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017), Barcelona, Spain, 2017.
  14. Paper
    D1
    “Counting Solutions of a Polynomial System Locally and Exactly,” 2017. [Online]. Available: http://arxiv.org/abs/1712.05487.
  15. Conference paper
    D1
    “Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models,” in 31st International Symposium on Distributed Computing (DISC 2017), Vienna, Austria, 2017.
  16. Thesis
    D1IMPR-CS
    “On Flows, Paths, Roots, and Zeros,” Universität des Saarlandes, Saarbrücken, 2017.
  17. Paper
    D1
    “Two Results on Slime Mold Computations,” 2017. [Online]. Available: http://arxiv.org/abs/1707.06631.
  18. Conference paper
    D1
    “Earning Limits in Fisher Markets with Spending-Constraint Utilities,” in Algorithmic Game Theory (SAGT 2017), L’Aquila, Italy, 2017.
  19. Conference paper
    D1
    “Optimization of Bootstrapping in Circuits,” in Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017), Barcelona, Spain, 2017.
  20. Conference paper
    D1
    “Ignore or Comply?: On Breaking Symmetry in Consensus,” in PODC’17, ACM Symposium on Principles of Distributed Computing, Washington, DC, USA, 2017.
  21. Conference paper
    D1
    “Greedy Strikes Again: A Deterministic PTAS for Commutative Rank of Matrix Spaces,” in 32nd Computational Complexity Conference (CCC 2017), Riga, Latvia, 2017.
  22. Conference paper
    D1
    “Minimizing Message Size in Stochastic Communication Patterns: Fast Self-Stabilizing Protocols with 3 bits,” in Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017), Barcelona, Spain, 2017.
  23. Conference paper
    D1
    “Software Defined Radio Platform for Time and Frequency Metrology,” in Joint Conference of the European Frequency and Time Forum and IEEE International Frequency Control Symposium (EFTF/IFC 2017), Besançon, France, 2017.
  24. Conference paper
    D1
    “Damped Sine Based Time Interval Counter,” in Joint Conference of the European Frequency and Time Forum and IEEE International Frequency Control Symposium (EFTF/IFC 2017), Besançon, France, 2017.
  25. Paper
    D1
    “On Algebraic Branching Programs of Small Width,” 2017. [Online]. Available: http://arxiv.org/abs/1702.05328.
  26. Conference paper
    D1
    “On Algebraic Branching Programs of Small Width,” in 32nd Computational Complexity Conference (CCC 2017), Riga, Latvia, 2017.
  27. Conference paper
    D1
    “Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars,” in 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017), Warsaw, Poland, 2017.
  28. Conference paper
    D1
    “A Dichotomy for Regular Expression Membership Testing,” in 58th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2017), Berkeley, CA, USA, 2017.
  29. Conference paper
    D1
    “Greedy Routing and the Algorithmic Small-World Phenomenon,” in PODC’17, ACM Symposium on Principles of Distributed Computing, Washington, DC, USA, 2017.
  30. Paper
    D1
    “Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless APSP can),” 2017. [Online]. Available: http://arxiv.org/abs/1703.08940.
  31. Conference paper
    D1
    “Maximum Volume Subset Selection for Anchored Boxes,” in 33rd International Symposium on Computational Geometry (SoCG 2017), Brisbane, Australia, 2017.
  32. Conference paper
    D1
    “Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs,” in 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017), Warsaw, Poland, 2017.
  33. Paper
    D1
    “A Note on Hardness of Diameter Approximation,” 2017. [Online]. Available: http://arxiv.org/abs/1705.02127.
  34. Article
    D1
    “On Algebraic Branching Programs of Small Width,” Electronic Colloquium on Computational Complexity (ECCC) : Report Series, vol. 34 (Revision 1), 2017.
  35. Conference paper
    D1
    “A Near-Linear Pseudopolynomial Time Algorithm for Subset Sum,” in Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017), Barcelona, Spain, 2017.
  36. Article
    D1
    “Improved Approximation for Fréchet Distance on c-packed Curves Matching Conditional Lower Bounds,” International Journal of Computational Geometry and Applications, vol. 27, no. 1/2, 2017.
  37. “Approximation Algorithms for l_0-Low Rank Approximation,” in Advances in Neural Information Processing Systems 30 (NIPS 2017), Long Beach, CA, USA, 2017.
  38. Article
    D1
    “Efficient Sampling Methods for Discrete Distributions,” Algorithmica, vol. 79, no. 2, 2017.
  39. Conference paper
    D1
    “Sampling Geometric Inhomogeneous Random Graphs in Linear Time,” in 25th Annual European Symposium on Algorithms (ESA 2017), Vienna, Austria, 2017.
  40. Paper
    D1
    “Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs,” 2017. [Online]. Available: http://arxiv.org/abs/1704.08122.
  41. Conference paper
    D1
    “Near-Optimal Metastability-Containing Sorting Networks,” in Proceedings of the 2017 Design, Automation & Test in Europe (DATE 2017), Lausanne, Switzerland, 2017.
  42. Article
    D1
    “Permanent versus Determinant: Not via Saturations,” Proceedings of the American Mathematical Society, vol. 145, 2017.
  43. Article
    D1
    “Fundamental Invariants of Orbit Closures,” Journal of Algebra, vol. 477, 2017.
  44. Conference paper
    D1
    “Beyond Metric Embedding: Approximating Group Steiner Trees on Bounded Treewidth Graphs,” in Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017), Barcelona, Spain, 2017.
  45. Conference paper
    D1
    “Finding Triangles for Maximum Planar Subgraphs,” in WALCOM: Algorithms and Computation, Hsinchu, Taiwan, 2017.
  46. Conference paper
    D1
    “New Integrality Gap Results for the Firefighters Problem on Trees,” in Approximation and Online Algorithms (WAOA 2016), Aarhus, Denmark, 2017.
  47. “On the Parameterized Complexity of Biclique Cover and Partition,” in 11th International Symposium on Parameterized and Exact Computation (IPEC 2016), Aarhus, Denmark, 2017.
  48. “Improved Approximate Rips Filtrations with Shifted Integer Lattices,” in 25th Annual European Symposium on Algorithms (ESA 2017), Vienna, Austria, 2017.
  49. Thesis
    D1IMPR-CS
    “Approximation Algorithms for Vietoris-Rips and Ĉech Filtrations,” Universität des Saarlandes, Saarbrücken, 2017.
  50. Thesis
    D1IMPR-CS
    “Graph Models for Rational Social Interaction,” Universität des Saarlandes, Saarbrücken, 2017.
  51. Article
    D1
    “Polynomial Kernelization for Removing Induced Claws and Diamonds,” Theory of Computing Systems, vol. 60, no. 4, 2017.
  52. Article
    D1
    “Complexity of Metric Dimension on Planar Graphs,” Journal of Computer and System Sciences, vol. 83, no. 1, 2017.
  53. Thesis
    D1IMPR-CS
    “Preliminaries for Distributed Natural Computing Inspired by the Slime Mold Physarum Polycephalum,” Universität des Saarlandes, Saarbrücken, 2017.
  54. Article
    D1
    “Characterizing Networks Formed by P. Polycephalum,” Journal of Physics D: Applied Physics, vol. 50, no. 22, 2017.
  55. Article
    D1
    “Introducing the Slime Mold Graph Repository,” Journal of Physics D: Applied Physics, vol. 50, no. 26, 2017.
  56. “Prophet Inequalities Made Easy: Stochastic Optimization by Pricing Non-Stochastic Inputs,” in 58th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2017), Berkeley, CA, USA, 2017.
  57. Paper
    D1
    “Tight Conditional Lower Bounds for Longest Common Increasing Subsequence,” 2017. [Online]. Available: http://arxiv.org/abs/1709.10075.
  58. Conference paper
    D1
    “Tight Conditional Lower Bounds for Longest Common Increasing Subsequence,” in 12th International Symposium on Parameterized and Exact Computation (IPEC 2017), Vienna, Austria, 2017.
  59. Conference paper
    D1
    “Shallow Packings, Semialgebraic Set Systems, Macbeath Regions and Polynomial Partitioning,” in 33rd International Symposium on Computational Geometry (SoCG 2017), Brisbane, Australia, 2017.
  60. Conference paper
    D1
    “Best-Response Dynamics in Combinatorial Auctions with Item Bidding,” in Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017), Barcelona, Spain, 2017.
  61. “Algorithms for Art Gallery Illumination,” Journal of Global Optimization, vol. 68, no. 1, 2017.
  62. Paper
    D1
    “Faster and Simpler Distributed Algorithms for Testing and Correcting Graph Properties in the CONGEST-Model,” 2017. [Online]. Available: http://arxiv.org/abs/1705.04898.
  63. Article
    D1
    “Online Packet-Routing in Grids with Bounded Buffers,” Algorithmica, vol. 78, no. 3, 2017.
  64. Conference paper
    D1
    “Three Notes on Distributed Property Testing,” in 31st International Symposium on Distributed Computing (DISC 2017), Vienna, Austria, 2017.
  65. Conference paper
    D1
    “Sublinear Random Access Generators for Preferential Attachment Graphs,” in 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017), Warsaw, Poland, 2017.
  66. “Metastability-Containing Circuits, Parallel Distance Problems, and Terrain Guarding,” Unversität des Saarlandes, Saarbrücken, 2017.
  67. “Metastability-Aware Memory-Efficient Time-to-Digital Converters,” in 23rd IEEE International Symposium on Asynchronous Circuits and Systems (ASYNC 2017), San Diego, CA, USA, 2017.
  68. Conference paper
    D1
    “Approximating Geometric Knapsack via L-Packings,” in 58th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2017), Berkeley, CA, USA, 2017.
  69. “Approximating the Nash Social Welfare with Budget-Additive Valuations,” 2017. [Online]. Available: http://arxiv.org/abs/1707.04428.
  70. Article
    D1
    “Geometric Complexity Theory and Matrix Powering,” Differential Geometry and its Applications, vol. 55, 2017.
  71. Conference paper
    D1
    “Distance Sensitive Bloom Filters Without False Negatives,” in Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017), Barcelona, Spain, 2017.
  72. Article
    D1
    “Computing Teichmüller Maps Between Polygons,” Foundations of Computational Mathematics, vol. 17, no. 2, 2017.
  73. Conference paper
    D1
    “To Augment or Not to Augment: Solving Unsplittable Flow on a Path by Creating Slack,” in Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017), Barcelona, Spain, 2017.
  74. Conference paper
    D1
    “Faster Approximation Schemes for the Two-dimensional Knapsack Problem,” in Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017), Barcelona, Spain, 2017.
  75. Paper
    D1
    “Combinatorial Secretary Problems with Ordinal Information,” 2017. [Online]. Available: http://arxiv.org/abs/1702.01290.
  76. Conference paper
    D1
    “Combinatorial Secretary Problems with Ordinal Information,” in 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017), Warsaw, Poland, 2017.
  77. Article
    D1
    “Locally Stable Marriage with Strict Preferences,” SIAM Journal on Discrete Mathematics, vol. 31, no. 1, 2017.
  78. Article
    D1
    “On the Complexity of the Permanent in Various Computational Models,” Journal of Pure and Applied Algebra, vol. 221, no. 12, 2017.
  79. Paper
    D1
    “Strassen’s 2x2 Matrix Multiplication Algorithm: A Conceptual Perspective,” 2017. [Online]. Available: http://arxiv.org/abs/1708.08083.
  80. Article
    D1
    “On Vanishing of Kronecker Coefficients,” Computational Complexity, vol. 26, no. 4, 2017.
  81. Article
    D1
    “Rectangular Kronecker Coefficients and Plethysms in Geometric Complexity Theory,” Advances in Mathematics, vol. 319, 2017.
  82. Paper
    D1
    “On the Complexity of Hazard-free Circuits,” 2017. [Online]. Available: http://arxiv.org/abs/1711.01904.
  83. “Density Independent Algorithms for Sparsifying k-Step Random Walks,” in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017), Berkeley, CA, USA, 2017.
  84. Paper
    D1
    “Efficiently Computing Real Roots of Sparse Polynomials,” 2017. [Online]. Available: http://arxiv.org/abs/1704.06979.
  85. Conference paper
    D1
    “Efficiently Computing Real Roots of Sparse Polynomials,” in ISSAC’17, International Symposium on Symbolic and Algebraic Computation, Kaiserslautern, Germany, 2017.
  86. “Density Independent Algorithms for Sparsifying k-Step Random Walks,” 2017. [Online]. Available: http://arxiv.org/abs/1702.06110.
  87. Conference paper
    D1
    “Fractional Brownian Motion and its Application in the Simulation of Noise in Atomic Clocks,” in Joint Conference of the European Frequency and Time Forum and IEEE International Frequency Control Symposium (EFTF/IFC 2017), Besançon, France, 2017.
  88. Conference paper
    D1
    “The Use of Fault-tolerant Clock Synchronization Algorithms for Time Scales,” in Joint Conference of the European Frequency and Time Forum and IEEE International Frequency Control Symposium (EFTF/IFC 2017), Besançon, France, 2017, pp. 38–41.
  89. Thesis
    D1IMPR-CS
    “Incentives in Dynamic Markets,” Universität des Saarlandes, Saarbrücken, 2017.
  90. “Self-stabilising Byzantine Clock Synchronisation is Almost as Easy as Consensus,” 2017. [Online]. Available: http://arxiv.org/abs/1705.06173.
  91. Paper
    D1
    “Robust Routing Made Easy,” 2017. [Online]. Available: http://arxiv.org/abs/1705.04042.
  92. Article
    D1
    “Searching without Communicating: Tradeoffs between Performance and Selection Complexity,” Distributed Computing, vol. 30, no. 3, 2017.
  93. Article
    D1
    “Efficient Counting with Optimal Resilience,” SIAM Journal on Computing, vol. 46, no. 4, 2017.
  94. Conference paper
    D1
    “Brief Announcement: A Centralized Local Algorithm for the Sparse Spanning Graph Problem,” in 31st International Symposium on Distributed Computing (DISC 2017), Vienna, Austria, 2017.
  95. Paper
    D1
    “A Local Algorithm for the Sparse Spanning Graph Problem,” 2017. [Online]. Available: http://arxiv.org/abs/1703.05418.
  96. “Self-Stabilising Byzantine Clock Synchronisation is Almost as Easy as Consensus,” in 31st International Symposium on Distributed Computing (DISC 2017), Vienna, Austria, 2017.
  97. Conference paper
    D1
    “Robust Routing Made Easy,” in Stabilization, Safety, and Security of Distributed Systems (SSS 2017), Boston, MA, USA, 2017.
  98. Article
    D1
    “Constructing Near Spanning Trees with Few Local Inspections,” Random Structures and Algorithms, vol. 50, 2017.
  99. Article
    D1
    “Certifying 3-Edge-Connectivity,” Algorithmica, vol. 77, no. 2, 2017.
  100. Paper
    D1
    “Engineering DFS-Based Graph Algorithms,” 2017. [Online]. Available: http://arxiv.org/abs/1703.10023.
  101. Article
    D1
    “Polynomial Kernels for Deletion to Classes of Acyclic Digraphs,” Discrete Optimization, vol. 25, 2017.
  102. Conference paper
    D1
    “Dynamic spanning forest with worst-case update time: adaptive, Las Vegas, and O(n1/2 - ε)-time,” in STOC ’17, 49th Annual ACM SIGACT Symposium on Theory of Computing, Montreal, Canada, 2017.
  103. Article
    D1
    “Computational Support for Functionality Selection in Interaction Design,” ACM Transactions on Computer-Human Interaction, vol. 24, no. 5, 2017.
  104. Article
    D1
    “Shortcutting Directed and Undirected Networks with a Degree Constraint,” Discrete Applied Mathematics, vol. 220, 2017.
  105. “Metastability Tolerant Computing,” in 23rd IEEE International Symposium on Asynchronous Circuits and Systems (ASYNC 2017), San Diego, CA, USA, 2017.
  106. Conference paper
    D1
    “From DQBF to QBF by Dependency Elimination,” in Theory and Applications of Satisfiability Testing -- SAT 2017, Melbourne, Australia, 2017.
  107. Conference paper
    D1D5
    “Efficiency-aware Answering of Compositional Questions using Answer Type Prediction,” in The 8th International Joint Conference on Natural Language Processing (IJCNLP 2017), Taipei, Taiwan, 2017.

2016

  1. Paper
    D1
    “Fully Dynamic All-pairs Shortest Paths with Worst-case Update-time revisited,” 2016. [Online]. Available: http://arxiv.org/abs/1607.05132.
  2. Conference paper
    D1
    “On Fully Dynamic Graph Sparsifiers,” in FOCS 2016, New Brunswick, NJ, USA, 2016.
  3. Paper
    D1
    “On Fully Dynamic Graph Sparsifiers,” 2016. [Online]. Available: http://arxiv.org/abs/1604.02094.
  4. Article
    D1
    “Concurrent Imitation Dynamics in Congestion Games,” Distributed Computing, vol. 29, no. 2, 2016.
  5. Conference paper
    D1
    “Submodular Unsplittable Flow on Trees,” in Integer Programming and Combinatorial Optimization (IPCO 2016), Liège, Belgium, 2016.
  6. Conference paper
    D1
    “Airports and Railways: Facility Location Meets Network Design,” in 33rd International Symposium on Theoretical Aspects of Computer Science (STACS 2016), Orléans, France, 2016.
  7. Conference paper
    D1
    “Sign Rank Versus VC Dimension,” in 29th Annual Conference on Learning Theory (COLT 2016), New York, NY, USA, 2016.
  8. Report
    D1RG1IMPR-CS
    “Verification of Linear Hybrid Systems with Large Discrete State Spaces: Exploring the Design Space for Optimization,” SFB/TR 14 AVACS, ATR103, 2016.
  9. Conference paper
    D1
    “Chasing Convex Bodies and Functions,” in LATIN 2016: Theoretical Informatics, Ensenada, Mexico, 2016.
  10. Paper
    D1
    “On Induced Colourful Paths in Triangle-free Graphs,” 2016. [Online]. Available: http://arxiv.org/abs/1604.06070.
  11. Paper
    D1
    “Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models,” 2016. [Online]. Available: http://arxiv.org/abs/1607.05127.
  12. Conference paper
    D1
    “Complexity Analysis of Root Clustering for a Complex Polynomial,” in ISSAC 2016, 41st International Symposium on Symbolic and Algebraic Computation, Waterloo, Canada, 2016.
  13. Paper
    D1
    “A Simple Near-Optimal Subdivision Algorithm for Complex Root Isolation based on the Pellet Test and Newton Iteration,” 2016. [Online]. Available: http://arxiv.org/abs/1509.06231.
  14. Paper
    D1
    “An Integer Interior Point Method for Min-Cost Flow Using Arc Contractions and Deletions,” 2016. [Online]. Available: http://arxiv.org/abs/1612.04689.
  15. Conference paper
    D1
    “A Novel Dual Ascent Algorithm for Solving the Min-Cost Flow Problem,” in Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX 2016), Arlington, VA, USA, 2016.
  16. Conference paper
    D1
    “Learning Market Parameters Using Aggregate Demand Queries,” in Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, Phoenix, AZ, USA, 2016.
  17. Conference paper
    D1
    “Ascending-Price Algorithms for Unknown Markets,” in EC’16, ACM Conference on Economics and Computation, Maastricht, The Netherlands, 2016.
  18. Conference paper
    D1
    “Computing Equilibria in Markets with Budget-Additive Utilities,” in 24th Annual European Symposium on Algorithms (ESA 2016), Aarhus, Denmark, 2016.
  19. Paper
    D1
    “Computing Equilibria in Markets with Budget-Additive Utilities,” 2016. [Online]. Available: http://arxiv.org/abs/1603.07210.
  20. Article
    D1
    “(1,j)-set Problem in Graphs,” Discrete Mathematics, vol. 339, no. 10, 2016.
  21. Article
    D1
    “Greedy Strikes Again: A Deterministic PTAS for Commutative Rank of Matrix Spaces,” Electronic Colloquium on Computational Complexity (ECCC): Report Series, vol. 145, 2016.
  22. Paper
    D1
    “Fully Dynamic Spanners with Worst-Case Update Time,” 2016. [Online]. Available: http://arxiv.org/abs/1606.07864.
  23. Conference paper
    D1
    “Fully Dynamic Spanners with Worst-Case Update Time,” in 24th Annual European Symposium on Algorithms (ESA 2016), Aarhus, Denmark, 2016.
  24. Article
    D1
    “Solving Bivariate Systems Using Rational Univariate Representations,” Journal of Complexity, vol. 37, 2016.
  25. Conference paper
    D1
    “On the Complexity of Solving Zero-Dimensional Polynomial Systems via Projection,” in ISSAC 2016, 41st International Symposium on Symbolic and Algebraic Computation, Waterloo, Canada, 2016.
  26. Paper
    D1
    “On the Complexity of Solving Zero-Dimensional Polynomial Systems via Projection,” 2016. [Online]. Available: http://arxiv.org/abs/1604.08944.
  27. Conference paper
    D1
    “Cliques in Regular Graphs and the Core-Periphery Problem in Social Networks,” in Combinatorial Optimization and Applications (COCOA 2016), Hong Kong, China, 2016.
  28. Conference paper
    D1
    “Truly Sub-cubic Algorithms for Language Edit Distance and RNA-Folding via Fast Bounded-Difference Min-Plus Product,” in FOCS 2016, New Brunswick, NJ, USA, 2016.
  29. Article
    D1
    “Parameterized Complexity Dichotomy for Steiner Multicut,” Journal of Computer and System Sciences, 2016.
  30. Paper
    D1
    “A Dichotomy for Regular Expression Membership Testing,” 2016. [Online]. Available: http://arxiv.org/abs/1611.00918.
  31. Paper
    D1
    “Geometric Inhomogeneous Random Graphs,” 2016. [Online]. Available: http://arxiv.org/abs/1511.00576.
  32. Conference paper
    D1
    “Hitting Set for Hypergraphs of Low VC-dimension,” in 24th Annual European Symposium on Algorithms (ESA 2016), Aarhus, Denmark, 2016.
  33. Paper
    D1
    “Greedy Routing and the Algorithmic Small-World Phenomenom,” 2016. [Online]. Available: http://arxiv.org/abs/1612.05539.
  34. Article
    D1
    “Balls into Bins via Local Search: Cover Time and Maximum Load,” Random Structures and Algorithms, vol. 48, no. 4, 2016.
  35. Article
    D1
    “Approximability of the Discrete Fréchet Distance,” Journal on Computational Geometry, vol. 7, no. 2, 2016.
  36. Paper
    D1
    “Average Distance in a General Class of Scale-Free Networks with Underlying Geometry,” 2016. [Online]. Available: http://arxiv.org/abs/1602.05712.
  37. Article
    D1
    “Topological Separations in Inductive Inference,” Theoretical Computer Science, vol. 260, 2016.
  38. Article
    D1
    “Algebraic Methods in the Congested Clique,” Distributed Computing, vol. 32, 2016.
  39. Article
    D1
    “A Note on Fractional Coloring and the Integrality gap of LP for Maximum Weight Independent Set,” Electronic Notes in Discrete Mathematics (Proc. CTW 2016), vol. 55, 2016.
  40. Paper
    D1
    “The Landscape of Bounds for Binary Search Trees,” 2016. [Online]. Available: http://arxiv.org/abs/1603.04892.
  41. Conference paper
    D1
    “Hadwiger’s Conjecture and Squares of Chordal Graphs,” in Computing and Combinatorics (COCOON 2016), Ho Chi Minh City, Vietnam, 2016.
  42. “Fast, Robust, Quantizable Approximate Consensus,” in 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016), Rome, Italy, 2016.
  43. Paper
    D1
    “A Unified Approach to Analyzing Asynchronous Coordinate Descent and Tatonnement,” 2016. [Online]. Available: http://arxiv.org/abs/1612.09171.
  44. Paper
    D1
    “The Geometry of Rank Decompositions of Matrix Multiplication I: 2x2 Matrices,” 2016. [Online]. Available: http://arxiv.org/abs/1610.08364.
  45. Conference paper
    D1
    “Polynomial-Sized Topological Approximations Using the Permutahedron,” in 32nd International Symposium on Computational Geometry (SoCG 2016), Boston, MA, USA, 2016.
  46. “Polynomial-Sized Topological Approximations Using The Permutahedron,” 2016. [Online]. Available: http://arxiv.org/abs/1601.02732.
  47. Article
    D1
    “Rumor Spreading in Random Evolving Graphs,” Random Structures and Algorithms, vol. 48, no. 2, 2016.
  48. Conference paper
    D1
    “Bipartite Digraphs Debates,” in 9th Multidisciplinary Workshop on Advances in Preference Handling (MPref 2015), Buenos Aires, Argentinia, 2016.
  49. Conference paper
    D1
    “Opposition Frameworks,” in Logics in Artificial Intelligence (JELIA 2016), Larnaca, Cyprus, 2016.
  50. Conference paper
    D1
    “Polynomial Kernelization for Removing Induced Claws and Diamonds,” in Graph-Theoretic Concepts in Computer Science (WG 2015), Garching, Germany, 2016.
  51. “Jamming-resistant Learning in Wireless Networks,” IEEE/ACM Transactions on Networking, vol. 24, no. 5, 2016.
  52. Thesis
    IMPR-CSD1
    “Market Equilibrium Computation for the Linear Arrow-Debreu Model,” Universität des Saarlandes, Saarbrücken, 2016.
  53. Article
    D1
    “Improved Balanced Flow Computation Using Parametric Flow,” Information Processing Letters, vol. 116, no. 9, 2016.
  54. “Engineering Art Galleries,” in Algorithm Engineering, Berlin: Springer, 2016.
  55. Article
    D1
    “Playing Mastermind with Many Colors,” Journal of the ACM, vol. 63, no. 5, 2016.
  56. Article
    D1
    “Simple and Optimal Randomized Fault-tolerant Rumor Spreading,” Distributed Computing, vol. 29, no. 2, 2016.
  57. Article
    D1
    “Simple and Optimal Fault-tolerant Rumor Spreading,” Distributed Computing, vol. 29, no. 2, 2016.
  58. Conference paper
    D1
    “Improved Protocols and Hardness Results for the Two-Player Cryptogenography Problem,” in 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016), Rome, Italy, 2016.
  59. “Synchronous Counting and Computational Algorithm Design,” Journal of Computer and System Sciences, vol. 82, no. 2, 2016.
  60. “HEX: Scaling Honeycombs is Easier than Scaling Clock Trees,” Journal of Computer and System Sciences, vol. 82, no. 5, 2016.
  61. “An Improved Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market,” in Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2016), Arlington, VA, USA, 2016.
  62. Conference paper
    D1
    “On Subgraphs of Bounded Degeneracy in Hypergraphs,” in Graph-Theoretic Concepts in Computer Science (WG 2016), Istanbul, Turkey, 2016.
  63. Article
    D1
    “Improved Bounds on Induced Acyclic Subgraphs in Random Digraphs,” SIAM Journal on Discrete Mathematics, vol. 30, no. 3, 2016.
  64. “Posted Prices, Smoothness, and Combinatorial Prophet Inequalities,” 2016. [Online]. Available: http://arxiv.org/abs/1612.03161.
  65. Paper
    D1
    “Best-Response Dynamics in Combinatorial Auctions with Item Bidding,” 2016. [Online]. Available: http://arxiv.org/abs/1607.04149.
  66. Article
    D1
    “Towards More Practical Linear Programming-based Techniques for Algorithmic Mechanism Design,” Theory of Computing Systems, vol. 59, no. 4, 2016.
  67. Article
    D1
    “Dynamic Range Majority Data Structures,” Theoretical Computer Science, vol. 647, 2016.
  68. Article
    D1
    “Lower Bounds for Projections of Power Symmetric Polynomials,” Electronic Colloquium on Computational Complexity (ECCC): Report Series, vol. 153, 2016.
  69. Conference paper
    D1
    “A Constant Approximation Algorithm for Scheduling Packets on Line Networks,” in 24th Annual European Symposium on Algorithms (ESA 2016), Aarhus, Denmark, 2016.
  70. Conference paper
    D1
    “On-Line Path Computation and Function Placement in SDNs,” in Stabilization, Safety, and Security of Distributed Systems (SSS 2016), Lyon, France, 2016.
  71. Paper
    D1
    “Sublinear Random Access Generators for Preferential Attachment Graphs,” 2016. [Online]. Available: http://arxiv.org/abs/1602.06159.
  72. Article
    D1
    “The Firefighter Problem on Graph Classes,” Theoretical Computer Science, vol. 613, 2016.
  73. Article
    D1
    “The Multiple-orientability Thresholds for Random Hypergraphs,” Combinatorics, Probability and Computing, vol. 25, no. 6, 2016.
  74. “The Continuous 1.5D Terrain Guarding Problem: Discretization, Optimal Solutions, and PTAS,” Journal of Computational Geometry, vol. 7, no. 1, 2016.
  75. “Parallel Metric Tree Embedding based on an Algebraic View on Moore-Bellman-Ford,” in SPAA’16, 28th ACM Symposium on Parallelism in Algorithms and Architectures, Pacific Grove, CA, USA, 2016.
  76. Paper
    D1
    “Metastability-Containing Circuits,” 2016. [Online]. Available: http://arxiv.org/abs/1606.06570.
  77. “Unfaithful Glitch Propagation in Existing Binary Circuit Models,” IEEE Transactions on Computers, vol. 65, no. 3, 2016.
  78. Conference paper
    D1
    “Raising The Bar For Vertex Cover: Fixed-parameter Tractability Above A Higher Guarantee,” in Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2016), Arlington, VA, USA, 2016.
  79. Paper
    D1
    “Geometric complexity theory and matrix powering,” 2016. [Online]. Available: http://arxiv.org/abs/1611.00827.
  80. Article
    D1
    “Induced Disjoint Paths in Circular-Arc Graphs in Linear Time,” Theoretical Computer Science, vol. 640, 2016.
  81. Conference paper
    D1
    “Non-local Probes Do Not Help with Many Graph Problems,” in Distributed Computing (DISC 2016), Paris, France, 2016.
  82. Article
    D1
    “Routing Games with Progressive Filling,” IEEE/ACM Transactions on Networking, vol. 24, no. 4, 2016.
  83. Conference paper
    D1
    “A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths,” in Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing (STOC 2016), Cambridge, MA, USA, 2016.
  84. Paper
    D1
    “Improved Lower Bounds for Online Hypercube Packing,” 2016. [Online]. Available: http://arxiv.org/abs/1607.01229.
  85. Conference paper
    D1
    “Beating the Harmonic Lower Bound for Online Bin Packing,” in 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016), Rome, Italy, 2016.
  86. Conference paper
    D1
    “Smoothness for Simultaneous Composition of Mechanisms with Admission,” in Web and Internet Economics (WINE 2016), Montréal, Canada, 2016.
  87. “Truthfulness and Stochastic Dominance with Monetary Transfers,” ACM Transactions on Economics and Computation, vol. 4, no. 2, 2016.
  88. Article
    D1
    “Preface to Special Issue on Algorithmic Game Theory,” Theory of Computing Systems, vol. 59, no. 4, 2016.
  89. Article
    D1
    “Fair Matchings and Related Problems,” Algorithmica, vol. 74, no. 3, 2016.
  90. Conference paper
    D1
    “A Combinatorial Approximation Algorithm for Graph Balancing with Light Hyper Edges,” in 24th Annual European Symposium on Algorithms (ESA 2016), Aarhus, Denmark, 2016.
  91. Paper
    D1
    “On the Relative Power of Reduction Notions in Arithmetic Circuit Complexity,” 2016. [Online]. Available: http://arxiv.org/abs/1609.05942.
  92. Paper
    D1
    “On the Complexity of the Permanent in Various Computational Models,” 2016. [Online]. Available: http://arxiv.org/abs/1610.00159.
  93. Article
    D1
    “One-variable Word Equations in Linear Time,” Algorithmica, vol. 74, no. 1, 2016.
  94. Conference paper
    D1
    “A Novel SDP Relaxation for the Quadratic Assignment Problem Using Cut Pseudo Bases,” in Combinatorial Optimization (ISCO 2016), Vietri sul Mare, Italy, 2016.
  95. Conference paper
    D1
    “Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs,” in 15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016), Reykjavik, Iceland, 2016.
  96. Conference paper
    D1
    “Geometry Helps to Compare Persistence Diagrams,” in Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX 2016), Arlington, VA, USA, 2016.
  97. Paper
    D1
    “Geometry Helps to Compare Persistence Diagrams,” 2016. [Online]. Available: http://arxiv.org/abs/1606.03357.
  98. Conference paper
    D1
    “Persistent Homology and Nested Dissection,” in Proceedings of the Twenty-Seventh ACM-SIAM Annual Symposium on Discrete Algorithms (SODA 2016), Arlington, VA, USA, 2016.
  99. “Think Eternally: Improved Algorithms for the Temp Secretary Problem and Extensions,” 2016. [Online]. Available: http://arxiv.org/abs/1606.06926.
  100. Conference paper
    D1
    “Think Eternally: Improved Algorithms for the Temp Secretary Problem and Extensions,” in 24th Annual European Symposium on Algorithms (ESA 2016), Aarhus, Denmark, 2016.
  101. “Submodular Secretary Problems: Cardinality, Matching, and Linear Constraints,” 2016. [Online]. Available: http://arxiv.org/abs/1607.08805.
  102. Paper
    D1
    “Self-stabilizing Byzantine Clock Synchronization with Optimal Precision,” 2016. [Online]. Available: http://arxiv.org/abs/1609.09281.
  103. Conference paper
    D1
    “Self-stabilizing Byzantine Clock Synchronization with Optimal Precision,” in Stabilization, Safety, and Security of Distributed Systems (SSS 2016), Lyon, France, 2016.
  104. Conference paper
    D1
    “Fault-Tolerant Clock Synchronization with High Precision,” in ISVLSI 2016, Pittsburgh, PA, USA, 2016.
  105. Paper
    D1
    “Computing Real Roots of Real Polynomials ... and now For Real!,” 2016. [Online]. Available: http://arxiv.org/abs/1605.00410.
  106. Conference paper
    D1
    “Computing Real Roots of Real Polynomials ... and now For Real!,” in ISSAC 2016, 41st International Symposium on Symbolic and Algebraic Computation, Waterloo, Canada, 2016.
  107. “A Note On Spectral Clustering,” in 24th Annual European Symposium on Algorithms (ESA 2016), Aarhus, Denmark, 2016.
  108. Article
    D1
    “Direct Sum Fails for Zero-Error Average Communication,” Algorithmica, vol. 76, no. 3, 2016.
  109. Article
    D1
    “Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems,” ACM Transactions on Computation Theory, vol. 8, no. 1, 2016.
  110. Article
    D1
    “Point Line Cover: The Easy Kernel is Essentially Tight,” ACM Transactions on Algorithms, vol. 12, no. 3, 2016.
  111. Article
    D1
    “Small Depth Proof Systems,” ACM Transactions on Computation Theory, vol. 9, no. 1, 2016.
  112. Book chapter / section
    D1
    “Schnellere Approximationsalgorithmen zur Partiell-Dynamischen Berechnung Kürzester Wege,” in Ausgezeichnete Informatikdissertationen 2015, Bonn: GI, 2016.
  113. Thesis
    D1IMPR-CS
    “Tight(er) Bounds for Similarity Measures, Smoothed Approximation and Broadcasting,” Universität des Saarlandes, Saarbrücken, 2016.
  114. Conference paper
    D1
    “Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical Machines,” in Integer Programming and Combinatorial Optimization (IPCO 2016), Liège, Belgium, 2016.
  115. Conference paper
    D1
    “Efficient Metastability-Containing Gray Code 2-Sort,” in 22nd IEEE International Symposium on Asynchronous Circuits and Systems, Porto Alegre, Brazil, 2016.
  116. Paper
    D1
    “Near-Optimal Self-Stabilising Counting and Firing Squads,” 2016. [Online]. Available: http://arxiv.org/abs/1608.00214.
  117. “Near-Optimal Self-stabilising Counting and Firing Squads,” in Stabilization, Safety, and Security of Distributed Systems (SSS 2016), Lyon, France, 2016.
  118. Paper
    D1
    “CLEX: Yet Another Supercomputer Architecture?,” 2016. [Online]. Available: http://arxiv.org/abs/1607.00298.
  119. Conference paper
    D1
    “A Local Algorithm for Constructing Spanners in Minor-Free Graphs,” in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016), Paris, France, 2016.
  120. Paper
    D1
    “A Local Algorithm for Constructing Spanners in Minor-Free Graphs,” 2016. [Online]. Available: http://arxiv.org/abs/1604.07038.
  121. Conference paper
    D1
    “Independence and Efficient Domination on P6-free Graphs,” in Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2016), Arlington, VA, USA, 2016.
  122. Article
    D1
    “Building Above Read-Once Polynomials: Identity Testing and Hardness of Representation,” Algorithmica, vol. 76, no. 4, 2016.
  123. Article
    D1
    “The Power of Recourse for Online MST and TSP,” SIAM Journal on Computing, vol. 45, no. 3, 2016.
  124. Article
    D1
    “Algorithms and Programs: Erasmus Lecture 2014,” European Review, vol. 24, no. 1, 2016.
  125. Article
    D1
    “A Still Simpler Way of Introducing the Interior-Point Method for Linear Programming,” Computer Science Review, vol. 22, 2016.
  126. Article
    D1
    “Randomized Rumor Spreading in Poorly Connected Small-world Networks,” Random Structures and Algorithms, vol. 49, no. 1, 2016.
  127. Conference paper
    D1
    “Polynomial Kernels for Deletion to Classes of Acyclic Digraphs,” in 33rd International Symposium on Theoretical Aspects of Computer Science (STACS 2016), Orléans, France, 2016.
  128. Conference paper
    D1
    “Labeled Compression Schemes for Extremal Classes,” in Algorithmic Learning Theory (ALT 2016), Bari, Italy, 2016.
  129. Article
    D1
    “A Note on Average-case Sorting,” Order, vol. 33, no. 1, 2016.
  130. Conference paper
    D1D4
    “Shattered Sets and the Hilbert Function,” in 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016), Kraków, Poland, 2016.
  131. Article
    D1
    “Sample Compression Schemes for VC Classes,” Journal of the ACM, vol. 63, no. 3, 2016.
  132. Conference paper
    D1
    “Fooling Pairs in Randomized Communication Complexity,” in Structural Information and Communication Complexity (SIROCCO 2016), Helsinki, Finland, 2016.
  133. Article
    D1
    “Succinct Posets,” Algorithmica, vol. 76, no. 2, 2016.
  134. Conference paper
    D1
    “On Approximating Strip Packing with a Better Ratio than 3/2,” in Proceedings of the Twenty-Seventh ACM-SIAM Annual Symposium on Discrete Algorithms (SODA 2016), Arlington, VA, USA, 2016.
  135. “Trend Detection Based Regret Minimization for Bandit Problems,” in 3rd IEEE International Conference on Data Science and Advanced Analytics (DSAA 2016), Montréal, Canada, 2016.
  136. Article
    D1
    “Identification of Key Player Genes in Gene Regulatory Networks,” BMC Systems Biology, vol. 10, 2016.
  137. Paper
    D1
    “This House Proves that Debating is Harder than Soccer,” 2016. [Online]. Available: http://arxiv.org/abs/1605.03063.
  138. Conference paper
    D1
    “This House Proves That Debating is Harder Than Soccer,” in 8th International Conference on Fun with Algorithms, La Maddalena, Italy, 2016.
  139. Conference paper
    D1
    “Supervised Learning Through the Lens of Compression,” in Advances in Neural Information Processing Systems 29 (NIPS 2016), Barcelona, Spain, 2016.
  140. Thesis
    D1IMPR-CS
    “Algorithms for Classical and Modern Scheduling Problems,” Universität des Saarlandes, Saarbrücken, 2016.
  141. Conference paper
    D1D4
    “Algebraic Independence over Positive Characteristic: New Criterion and Applications to Locally Low Algebraic Rank Circuits,” in 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016), Kraków, Poland, 2016.
  142. Thesis
    D1
    “ScheduleMe: personal assistant,” Universität des Saarlandes, Saarbrücken, 2016.
  143. Paper
    D1
    “Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking,” 2016. [Online]. Available: http://arxiv.org/abs/1611.06501.
  144. Paper
    D1
    “Homotopy Equivalence Between Voronoi Medusa and Delaunay Medusa,” 2016. [Online]. Available: http://arxiv.org/abs/1604.03302.
  145. Article
    D1
    “Computing Real Roots of Real Polynomials,” Journal of Symbolic Computation, vol. 73, 2016.
  146. Conference paper
    D1
    “Independent Set of Convex Polygons: From nϵ to 1+ϵ via Shrinking,” in LATIN 2016: Theoretical Informatics, Ensenada, Mexico, 2016.

2015

  1. Thesis
    D1IMPR-CS
    “Coordinating Selfish Players in Scheduling Games,” Universität des Saarlandes, Saarbrücken, 2015.
  2. Conference paper
    D1
    “On Guillotine Cutting Sequences,” in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015), Princeton, NJ, USA, 2015.
  3. Article
    D1
    “Coordinating Oligopolistic Players in Unrelated Machine Scheduling,” Theoretical Computer Science, vol. 570, 2015.
  4. Conference paper
    D1
    “How to Tame Rectangles: Solving Independent Set and Coloring of Rectangles via Shrinking,” in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015), Princeton, NJ, USA, 2015.
  5. Article
    D1
    “Algorithmic and Hardness Results for the Colorful Components Problems,” Algorithmica, vol. 73, no. 2, 2015.
  6. Conference paper
    D1
    “A Quasi-PTAS for the Two-dimensional Geometric Knapsack Problem,” in Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2015), San Diego, CA, USA, 2015.
  7. “Approximation and Hardness Results for the Maximum Edges in Transitive Closure Problem,” in Combinatorial Algorithms (IWOCA 2014), Duluth, MN, USA, 2015.
  8. “Dense Flag Triangulations of 3-manifolds via Extremal Graph Theory,” Transactions of the American Mathematical Society, vol. 367, no. 4, 2015.
  9. “Face Numbers of Down-sets,” American Mathematical Monthly, vol. 122, no. 4, 2015.
  10. Article
    D1
    “On Multi-processor Speed Scaling with Migration,” Journal of Computer and System Sciences, vol. 81, no. 7, 2015.
  11. Conference paper
    D1
    “Improving Interpolants for Linear Arithmetic,” in Automated Technology for Verification and Analysis (ATVA 2015), Shanghai, China, 2015.
  12. Article
    D1
    “Counting Triangulations and Other Crossing-free Structures Approximately,” Computational Geometry: Theory and Applications, vol. 48, no. 5, 2015.
  13. Article
    D1
    “Counting Triangulations and Other Crossing-free Structures via Onion Layers,” Discrete & Computational Geometry, vol. 53, no. 4, 2015.
  14. Conference paper
    D1
    “A Fully Polynomial-Time Approximation Scheme for Speed Scaling with Sleep State,” in Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2015), San Diego, CA, USA, 2015.
  15. Conference paper
    D1
    “A o(n)-Competitive Deterministic Algorithm for Online Matching on a Line,” in Approximation and Online Algorithms (WAOA 2014), Wrocław, Poland, 2015.
  16. Conference paper
    D1
    “Truthful Mechanism Design via Correlated Tree Rounding,” in EC’15, Sixteenth ACM Conference on Economics and Computation, Portland, OR, USA, 2015.
  17. Conference paper
    D1
    “Wavelet Trees Meet Suffix Trees,” in Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2015), San Diego, CA, USA, 2015.
  18. Conference paper
    D1
    “New Approximation Schemes for Unsplittable Flow on a Path,” in Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2015), San Diego, CA, USA, 2015.
  19. Conference paper
    D1
    “Internal Compression of Protocols to Entropy,” in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015), Princeton, NJ, USA, 2015.
  20. “Solving Linear Programming with Constraints Unknown,” in Automata, Languages, and Programming (ICALP 2015), Kyoto, Japan, 2015.
  21. Conference paper
    D1
    “Queries on LZ-Bounded Encodings,” in DCC 2015, Data Compression Conference, Snowbird, UT, USA, 2015.
  22. Conference paper
    D1
    “The 1-2-3-Toolkit for Building Your Own Balls-into-Bins Algorithm,” in Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments (ALENEX 2015), San Diego, CA, USA, 2015.
  23. Article
    D1
    “Correction of Noisy Labels via Mutual Consistency Check,” Neurocomputing, vol. 160, 2015.
  24. “Sampling in Space Restricted Settings,” in Computing and Combinatorics (COCOON 2015), Beijing, China, 2015.
  25. Conference paper
    D1
    “Maintaining Near-popular Matchings,” in Automata, Languages, and Programming (ICALP 2015), Kyoto, Japan, 2015.
  26. Conference paper
    D1
    “Uniformity of Point Samples in Metric Spaces Using Gap Ratio,” in Theory and Applications of Models of Computation (TAMC 2015), Singapore, 2015.
  27. Paper
    D1
    “A Probabilistic Approach to Reducing the Algebraic Complexity of Computing Delaunay Triangulations,” 2015. [Online]. Available: http://arxiv.org/abs/1505.05454.
  28. Conference paper
    D1
    “A Probabilistic Approach to Reducing Algebraic Complexity of Delaunay Triangulations,” in Algorithms -- ESA 2015, Patras, Greece, 2015.
  29. Article
    D1
    “What’s the Frequency, Kenneth?: Sublinear Fourier Sampling Off the Grid,” Algorithmica, vol. 73, no. 2, 2015.
  30. Article
    D1
    “Using Patterns to Form Homogeneous Teams,” Algorithmica, vol. 71, no. 2, 2015.
  31. Conference paper
    D1
    “Parameterized Complexity Dichotomy for Steiner Multicut,” in 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015), Munich, Germany, 2015.
  32. Conference paper
    D1
    “Improved Approximation for Fréchet Distance on c-packed Curves Matching Conditional Lower Bounds,” in Algorithms and Computation (ISAAC 2015), Nagoya, Japan, 2015.
  33. Conference paper
    D1
    “Ultra-fast Load Balancing on Scale-free Networks,” in Automata, Languages, and Programming (ICALP 2015), Kyoto, Japan, 2015.
  34. Conference paper
    D1IMPR-CS
    “Approximability of the Discrete Fréchet Distance,” in 31st International Symposium on Computational Geometry (SoCG 2015), Eindhoven, The Netherlands, 2015.
  35. Article
    D1
    “Online Checkpointing with Improved Worst-case Guarantees,” INFORMS Journal on Computing, vol. 27, no. 3, 2015.
  36. Article
    D1
    “Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems,” Algorithmica, vol. 73, no. 1, 2015.
  37. Conference paper
    D1
    “Quadratic Conditional Lower Bounds for String Problems and Dynamic Time Warping,” in FOCS 2015, IEEE 56th Annual Symposium on Foundations of Computer Science, Berkeley, CA, USA, 2015.
  38. Article
    D1
    “Sampling from Discrete Distributions and Computing Fréchet Distances,” Bulletin of the EATCS, vol. 116, 2015.
  39. Article
    D1
    “The Interval Constrained 3-coloring Problem,” Theoretical Computer Science, vol. 593, 2015.
  40. Article
    D1
    “Macroscopic Quantum Information Processing Using Spin Coherent States,” Optics Communications, vol. 337, 2015.
  41. Paper
    D1
    “Algebraic Methods in the Congested Clique,” 2015. [Online]. Available: http://arxiv.org/abs/1503.04963.
  42. Article
    D1
    “Two Lower Bounds for Shortest Double-Base Number System,” IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences - Series A, vol. E98, no. 6, 2015.
  43. Conference paper
    D1
    “Pattern-avoiding Access in Binary Search Trees,” in FOCS 2015, IEEE 56th Annual Symposium on Foundations of Computer Science, Berkeley, CA, USA, 2015.
  44. Paper
    D1
    “Greedy Is an Almost Optimal Deque,” 2015. [Online]. Available: http://arxiv.org/abs/1506.08319.
  45. Conference paper
    D1
    “Greedy Is an Almost Optimal Deque,” in Algorithms and Data Structures (WADS 2015), Victoria, Canada, 2015.
  46. Conference paper
    D1
    “Self-Adjusting Binary Search Trees: What Makes Them Tick?,” in Algorithms -- ESA 2015, Patras, Greece, 2015.
  47. Paper
    D1
    “Pattern-avoiding Access in Binary Search Trees,” 2015. [Online]. Available: http://arxiv.org/abs/1507.06953.
  48. Paper
    D1
    “Self-Adjusting Binary Search Trees: What Makes Them Tick?,” 2015. [Online]. Available: http://arxiv.org/abs/1503.03105.
  49. Conference paper
    D1
    “Social Network Monetization via Sponsored Viral Marketing,” in SIGMETRICS’15, International Conference on Measurement and Modeling of Computer Systems, Portland, OR, USA, 2015.
  50. Conference paper
    D1
    “On Survivable Set Connectivity,” in Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2015), San Diego, CA, USA, 2015.
  51. “Approximate Consensus in Highly Dynamic Networks: The Role of Averaging Algorithms,” in Automata, Languages, and Programming (ICALP 2015), Kyoto, Japan, 2015.
  52. Conference paper
    D1
    “Secretary Markets with Local Information,” in Automata, Languages, and Programming (ICALP 2015), Kyoto, Japan, 2015.
  53. Conference paper
    D1
    “Combinatorial Auctions with Conflict-based Externalities,” in Web and Internet Economics (WINE 2015), Amsterdam, The Netherlands, 2015.
  54. “Local Doubling Dimension of Point Sets,” in Proceedings of the 27th Canadian Conference on Computational Geometry (CCCG 2015), Kingston, Canada, 2015.
  55. Article
    D1
    “On the Geometric Ramsey Number of Outerplanar Graphs,” Discrete & Computational Geometry, vol. 53, no. 1, 2015.
  56. Article
    D1
    “Clique Partitioning with Value-monotone Submodular Cost,” Discrete Optimization, vol. 15, 2015.
  57. Article
    D1
    “A Note on Quasi-Kernels in Digraphs,” Information Processing Letters, vol. 115, no. 11, 2015.
  58. Article
    D1
    “A Quantization Framework for Smoothed Analysis of Euclidean Optimization Problems,” Algorithmica, vol. 73, no. 3, 2015.
  59. Paper
    D1
    “Polynomial Kernelization for Removing Induced Claws and Diamonds,” 2015. [Online]. Available: http://arxiv.org/abs/1503.00704.
  60. Article
    D1
    “Scheduling in Wireless Networks with Rayleigh-fading Interference,” IEEE Transactions on Mobile Computing, vol. 14, no. 7, 2015.
  61. Paper
    D1
    “Improved Balanced Flow Computation Using Parametric Flow,” 2015. [Online]. Available: http://arxiv.org/abs/1512.05974.
  62. Paper
    D1
    “Memory-Adjustable Navigation Piles with Applications to Sorting and Convex Hulls,” 2015. [Online]. Available: http://arxiv.org/abs/1510.07185.
  63. Article
    D1
    “NEFI: Network Extraction From Images,” Scientific Reports, vol. 5, 2015.
  64. Article
    D1
    “From Black-Box Complexity to Designing New Genetic Algorithms,” Theoretical Computer Science, vol. 567, 2015.
  65. Article
    D1
    “Optimizing Linear Functions with the Evolutionary Algorithm -- Different Asymptotic Runtimes for Different Instances,” Theoretical Computer Science, vol. 561, 2015.
  66. “Fault-tolerant Distributed Systems in Hardware,” Bulletin of EATCS, vol. 116, 2015.
  67. Article
    D1
    “A Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market,” Information and Computation, vol. 243, 2015.
  68. “An Improved Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market,” 2015. [Online]. Available: http://arxiv.org/abs/1510.02694.
  69. Article
    D1
    “Combinatorics of Finite Abelian Groups and Weil Representations,” Pacific Journal of Mathematics, vol. 275, no. 2, 2015.
  70. and É. Tardos, “Algorithms as Mechanisms: The Price of Anarchy of Relax-and-Round,” in EC’15, Sixteenth ACM Conference on Economics and Computation, Portland, OR, USA, 2015.
  71. and É. Tardos, “Algorithms as Mechanisms: The Price of Anarchy of Relax-and-Round,” ACM SIGecom Exchanges, vol. 14, no. 2, 2015.
  72. “Algorithms against Anarchy: Understanding Non-truthful Mechanisms,” in EC’15, Sixteenth ACM Conference on Economics and Computation, Portland, OR, USA, 2015.
  73. Paper
    D1
    “Node-balancing by Edge-increments,” 2015. [Online]. Available: http://arxiv.org/abs/1504.06919.
  74. Conference paper
    D1
    “Node-balancing by Edge-increments,” in Algorithms -- ESA 2015, Patras, Greece, 2015.
  75. Conference paper
    D1
    “Towards More Practical Linear Programming-Based Techniques for Algorithmic Mechanism Design,” in Algorithmic Game Theory (SAGT 2015), Saarbrücken, Germany, 2015.
  76. Article
    D1
    “On Randomized Fictitious Play for Approximating Saddle Points Over Convex Sets,” Algorithmica, vol. 73, no. 2, 2015.
  77. Conference paper
    D1
    “Algorithms in the Ultra-Wide Word Model,” in Theory and Applications of Models of Computation (TAMC 2015), Singapore, 2015.
  78. “Facets for Art Gallery Problems,” Algorithmica, vol. 73, no. 2, 2015.
  79. Conference paper
    D1
    “Area- and Boundary-Optimal Polygonalization of Planar Point Sets,” in EuroCG 2015, 31st European Workshop on Computational Geometry, Ljubljana, Slovenia, 2015.
  80. Article
    D1
    “On the Parameterized Complexity of Vertex Cover and Edge Cover with Connectivity Constraints,” Theoretical Computer Science, vol. 565, 2015.
  81. Conference paper
    D1
    “Backtracking-Assisted Multiplication,” in ArcticCrypt 2016, Longyearbyen, Norway, 2015.
  82. Article
    D1
    “Minimum Fill-in of Sparse Graphs: Kernelization and Approximation,” Algorithmica, vol. 71, no. 1, 2015.
  83. Conference paper
    D1
    “Exact solutions for the continuous 1.5D Terrain Guarding Problem,” in EuroCG 2015, 31st European Workshop on Computational Geometry, Ljubljana, Slovenia, 2015.
  84. “Parallel Metric Tree Embedding based on an Algebraic View on Moore-Bellman-Ford,” 2015. [Online]. Available: http://arxiv.org/abs/1509.09047.
  85. Paper
    D1
    “The Continuous 1.5D Terrain Guarding Problem: Discretization, Optimal Solutions, and PTAS,” 2015. [Online]. Available: http://arxiv.org/abs/1509.08285.
  86. Conference paper
    D1
    “Medial Axis Based Routing Has Constant Load Balancing Factor,” in Algorithms -- ESA 2015, Patras, Greece, 2015.
  87. Article
    D1
    “Orientability Thresholds for Random Hypergraph,” Combinatorics, Probability and Computing, vol. 24, no. 5, 2015.
  88. Conference paper
    D1
    “Log-Concavity and Lower Bounds for Arithmetic Circuits,” in Mathematical Foundations of Computer Science 2015 (MFCS 2015), Milan, Italy, 2015.
  89. Conference paper
    D1
    “ETR-Completeness for Decision Versions of Multi-player (Symmetric) Nash Equilibria,” in Automata, Languages, and Programming (ICALP 2015), Kyoto, Japan, 2015.
  90. Conference paper
    D1
    “Markets with Production: A Polynomial Time Algorithm and a Reduction to Pure Exchange,” in EC’15, Sixteenth ACM Conference on Economics and Computation, Portland, OR, USA, 2015.
  91. Paper
    D1
    “Raising The Bar For Vertex Cover: Fixed-parameter Tractability Above A Higher Guarantee,” 2015. [Online]. Available: http://arxiv.org/abs/1509.03990.
  92. Conference paper
    D1
    “Optimal Encodings for Range Min-Max and Top-k,” in Automata, Languages, and Programming (ICALP 2015), Kyoto, Japan, 2015.
  93. Conference paper
    D1
    “Near-Optimal Distributed Maximum Flow: Extended Abstract,” in PODC’15, ACM Symposium on Principles of Distributed Computing, Donostia-San Sebastián, Spain, 2015.
  94. Paper
    D1
    “Near-Optimal Distributed Maximum Flow,” 2015. [Online]. Available: http://arxiv.org/abs/1508.04747.
  95. Conference paper
    D1
    “Online Appointment Scheduling in the Random Order Model,” in Algorithms -- ESA 2015, Patras, Greece, 2015.
  96. Article
    D1
    “Induced Disjoint Paths in Claw-Free Graphs,” SIAM Journal on Discrete Mathematics, vol. 29, no. 1, 2015.
  97. Conference paper
    D1
    “Approximate Range Emptiness in Constant Time and Optimal Space,” in Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2015), San Diego, CA, USA, 2015.
  98. Conference paper
    D1
    “Robust Reoptimization of Steiner Trees,” in 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015), Bangalore, India, 2015.
  99. Conference paper
    D1
    “Gossip vs. Markov Chains, and Randomness-efficient Rumor Spreading,” in Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2015), San Diego, CA, USA, 2015.
  100. Conference paper
    D1
    “The Offset Filtration of Convex Objects,” in Algorithms -- ESA 2015, Patras, Greece, 2015.
  101. Article
    D1
    “Improved Lower Bound for Online Strip Packing,” Theory of Computing Systems, vol. 56, no. 1, 2015.
  102. Article
    D1
    “Finding Disjoint Paths in Split Graphs,” Theory of Computing Systems, vol. 57, no. 1, 2015.
  103. Article
    D1
    “A Completeness Theory for Polynomial (Turing) Kernelization,” Algorithmica, vol. 71, no. 3, 2015.
  104. Article
    D1
    “Dividing Connected Chores Fairly,” Theoretical Computer Science, vol. 593, 2015.
  105. “Secondary Spectrum Auctions for Symmetric and Submodular Bidders,” ACM Transactions on Economics and Computation, vol. 3, no. 2, 2015.
  106. Conference paper
    D1
    “Hedonic Coalition Formation in Networks,” in Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence and the Twenty-Seventh Innovative Applications of Artificial Intelligence Conference, Austin, TX, USA, 2015.
  107. Article
    D1
    “The Saxl Conjecture and the Dominance Order,” Discrete Mathematics, vol. 338, no. 11, 2015.
  108. Article
    D1
    “Faster Fully Compressed Pattern Matching by Recompression,” ACM Transactions on Algorithms, vol. 11, no. 3, 2015.
  109. “An Efficient Parallel Algorithm for Spectral Sparsification of Laplacian and SDDM Matrix Polynomials,” 2015. [Online]. Available: http://arxiv.org/abs/1507.07497.
  110. Paper
    D1
    “What Graphs are 2-Dot Product Graphs?,” 2015. [Online]. Available: http://arxiv.org/abs/1511.05009.
  111. Article
    D1
    “What Graphs are 2-Dot Product Graphs?,” Electronic Notes in Discrete Mathematics (Proc. EuroComb 2015), 2015.
  112. Article
    D1
    “Algorithms to Measure Diversity and Clustering in Social Networks through Dot Product Graphs,” Social Networks, vol. 41, 2015.
  113. Article
    D1
    “Root Refinement for Real Polynomials using Quadratic Interval Refinement,” Journal of Computational and Applied Mathematics, vol. 280, 2015.
  114. “Secretary Problems with Non-Uniform Arrival Order,” in STOC’15, Forty-Seventh Annual ACM Symposium on Theory of Computing, Portland, OR, USA, 2015.
  115. and É. Tardos, “Smooth Online Mechanisms: A Game-theoretic Problem in Renewable Energy Markets,” in EC’15, Sixteenth ACM Conference on Economics and Computation, Portland, OR, USA, 2015.
  116. Article
    D1
    “A Single-exponential FPT Algorithm for the K4-MINOR COVER Problem,” Journal of Computer and System Sciences, vol. 81, no. 1, 2015.
  117. Article
    D1
    “On the Complexity of Computing with Planar Algebraic Curves,” Journal of Complexity, vol. 31, no. 2, 2015.
  118. Paper
    D1
    “A Note On Spectral Clustering,” 2015. [Online]. Available: http://arxiv.org/abs/1509.09188.
  119. Article
    D1
    “Fixed-parameter Tractability of Multicut in Directed Acyclic Graphs,” SIAM Journal on Discrete Mathematics, vol. 29, no. 1, 2015.
  120. Conference paper
    D1
    “Demo Abstract: Voltage Scheduling of Peripheral Components on Wireless Sensor Nodes,” in 12th European Conference on Wireless Sensor Networks (EWSN 2015), Porto, Portugal, 2015.
  121. Conference paper
    D1
    “Towards Understanding the Smoothed Approximation Ratio of the 2-Opt Heuristic,” in Automata, Languages, and Programming (ICALP 2015), Kyoto, Japan, 2015.
  122. Conference paper
    D1
    “Fast Partial Distance Estimation and Applications,” in PODC’15, ACM Symposium on Principles of Distributed Computing, Donostia-San Sebastián, Spain, 2015.
  123. “Towards Optimal Synchronous Counting,” in PODC’15, ACM Symposium on Principles of Distributed Computing, Donostia-San Sebastián, Spain, 2015.
  124. “Efficient Counting with Optimal Resilience,” in Distributed Computing (DISC 2015), Tokyo, Japan, 2015.
  125. Article
    D1
    “PulseSync: An Efficient and Scalable Clock Synchronization Protocol,” IEEE/ACM Transactions on Networking, vol. 23, no. 3, 2015.
  126. “Towards Optimal Synchronous Counting,” 2015. [Online]. Available: http://arxiv.org/abs/1503.06702.
  127. “Efficient Counting with Optimal Resilience,” 2015. [Online]. Available: http://arxiv.org/abs/1508.02535.
  128. Paper
    D1
    “Independence and Efficient Domination on P6-free Graphs,” 2015. [Online]. Available: http://arxiv.org/abs/1507.02163.
  129. Article
    D1
    “Assigning Sporadic Tasks to Unrelated Machines,” Mathematical Programming / A, vol. 152, no. 1–2, 2015.
  130. Paper
    D1
    “A Still Simpler Way of Introducing the Interior-Point Method for Linear Programming,” 2015. [Online]. Available: http://arxiv.org/abs/1510.03339.
  131. Article
    D1
    “From Approximate Factorization to Root Isolation with Application to Cylindrical Algebraic Decomposition,” Journal of Symbolic Computation, vol. 66, 2015.
  132. Book chapter / section
    D1
    “On the Implementation of Combinatorial Algorithms for the Linear Exchange Market,” in Algorithms, Probability, Networks, and Games, Berlin: Springer, 2015.
  133. Book chapter / section
    D1
    “From Theory to Library of Efficient Data Types and Algorithms (LEDA) and Algorithm Engineering,” in The Human Face of Computing, London: Imperial College Press, 2015.
  134. Conference paper
    D1
    “A (2+epsilon)-Approximation Algorithm for the Storage Allocation,” in Automata, Languages, and Programming (ICALP 2015), Kyoto, Japan, 2015.
  135. Conference paper
    D1
    “Compressing and Teaching for Low VC-Dimension,” in FOCS 2015, IEEE 56th Annual Symposium on Foundations of Computer Science, Berkeley, CA, USA, 2015.
  136. Conference paper
    D1
    “Experimental Validation of a Faithful Binary Circuit Model,” in GLSVLSI’15, 25th Edition on Great Lakes Symposium on VLSI, Pittsburgh, PA, USA, 2015.
  137. Thesis
    D1IMPR-CS
    “On Efficiency and Reliability in Computer Science,” Universität des Saarlandes, Saarbrücken, 2015.
  138. Article
    D1
    “Scheduling with an Orthogonal Resource Constraint,” Algorithmica, vol. 71, no. 4, 2015.
  139. Article
    D1
    “Randomized Rumour Spreading: The Effect of the Network Topology,” Combinatorics, Probability and Computing, vol. 24, no. 2, 2015.
  140. Article
    D1
    “Faster Rumor Spreading with Multiple Calls,” The Electronic Journal of Combinatorics, vol. 22, no. 1, 2015.
  141. Article
    D1
    “Randomized Rumor Spreading: the Effect of the Network Topology,” Combinatorics, Probability and Computing, vol. 24, no. 2, 2015.
  142. Conference paper
    D1
    “B-Chromatic Number: Beyond NP-Hardness,” in 10th International Symposium on Parameterized and Exact Computation (IPEC 2015), Patras, Greece, 2015.
  143. Conference paper
    D1
    “Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel,” in Mathematical Foundations of Computer Science 2015 (MFCS 2015), Milan, Italy, 2015.
  144. Thesis
    D1IMPR-CS
    “Random Walk-based Algorithms on Networks,” Universität des Saarlandes, Saarbrücken, 2015.
  145. Thesis
    D1IMPR-CS
    “Application of Multiplicative Weights Update Method in Algorithmic Game Theory,” Universität des Saarlandes, Saarbrücken, 2015.
  146. “Large-scale Habitat Corridors for Biodiversity Conservation: A Forest Corridor in Madagascar,” PLoS ONE, vol. 10, no. 7, 2015.
  147. Thesis
    D1IMPR-CS
    “Verification of Program Computations,” Universität des Saarlandes, Saarbrücken, 2015.
  148. Conference paper
    D1
    “Computing 2-Walks in Polynomial Time,” in 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015), Munich, Germany, 2015.
  149. Conference paper
    D1
    “k-Stacks: High-Density Valet Parking for Automated Vehicles,” in IV2015, IEEE Intelligent Vehicles Symposium, Seoul, Korea, 2015.
  150. Thesis
    D1
    “Implementation and Experimental Evaluation of a Combinatorial Min-Cost Flow Algorithm,” Universität des Saarlandes, Saarbrücken, 2015.
  151. Article
    D1
    “Representation of the Non-dominated Set in Biobjective Discrete Optimization,” Computers & Operations Research, vol. 63, 2015.
  152. Article
    D1
    “Efficient Optimization of many Objectives by Approximation-guided Evolution,” European Journal of Operational Research, vol. 243, no. 2, 2015.

2014

  1. Conference paper
    D1
    “Optimal Coordination Mechanisms for Multi-job Scheduling Games,” in Algorithms - ESA 2014, Wrocław, Poland, 2014.
  2. Paper
    D1
    “Near-optimal Asymmetric Binary Matrix Partitions,” 2014. [Online]. Available: http://arxiv.org/abs/1407.8170.
  3. Conference paper
    D1
    “A QPTAS for Maximum Weight Independent Set of Polygons with Polylogarithmically Many Vertices,” in Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2014), Portland, OR, USA, 2014.
  4. Conference paper
    D1
    “Algorithmic and Hardness Results for the Colorful Components Problems,” in LATIN 2014: Theoretical Informatics, Montevideo, Uruguay, 2014.
  5. Conference paper
    D1
    “Reordering Buffer Management with Advice,” in Approximation and Online Algorithms (WAOA 2013), Sophia Antipolis, France, 2014.
  6. Paper
    D1
    “Nerve Complexes of Circular Arcs,” 2014. [Online]. Available: http://arxiv.org/abs/1410.4336.
  7. “Transitivity is Not a (Big) Restriction on Homotopy Types,” 2014. [Online]. Available: http://arxiv.org/abs/1409.4966.
  8. Thesis
    D1
    “Shortest and Alternative Paths in Road Networks,” Universität des Saarlandes, Saarbrücken, 2014.
  9. Article
    D1
    “A Framework for the Verification of Certifying Computations,” Journal of Automated Reasoning, vol. 52, no. 3, 2014.
  10. Article
    D1
    “Sign Rank, VC Dimension and Spectral Gaps,” Electronic Colloquium on Computational Complexity (ECCC) : Report Series, vol. 135, 2014.
  11. Conference paper
    D1
    “A Mazing 2+ε Approximation for Unsplittable Flow on a Path,” in Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2014), Portland, OR, USA, 2014.
  12. Paper
    D1
    “A Fully Polynomial-Time Approximation Scheme for Speed Scaling with Sleep State,” 2014. [Online]. Available: http://arxiv.org/abs/1407.0892.
  13. Conference paper
    D1
    “Computing Minimal and Maximal Suffixes of a Substring Revisited,” in Combinatorial Pattern Matching (CPM 2014), Moscow, Russia, 2014.
  14. Paper
    D1
    “Wavelet Trees Meet Suffix Trees,” 2014. [Online]. Available: http://arxiv.org/abs/1408.6182.
  15. Article
    D1
    “Internal Compression of Protocols to Entropy,” Electronic Colloquium on Computational Complexity (ECCC) : Report Series, vol. 101, 2014.
  16. Book chapter / section
    D1
    “Clear and Compress: Computing Persistent Homology in Chunks,” in Topological Methods in Data Analysis and Visualization III, Cham: Springer International, 2014.
  17. Conference paper
    D1
    “PHAT - Persistent Homology Algorithms Toolbox,” in Mathematical Software - ICMS 2014, Seoul, South Korea, 2014.
  18. Conference paper
    D1
    “Distributed Computation of Persistent Homology,” in ALENEX14, Sixteenth Workshop on Algorithm Engineering and Experiments, Portland, OR, USA, 2014.
  19. Conference paper
    D1
    “A Simple Efficient Interior Point Method for Min-cost Flow,” in Algorithms and Computation (ISAAC 2014), Jeonju, Korea, 2014.
  20. Thesis
    D1
    “A Simple Efficient Interior Point Method for Min-cost Flow,” Universität des Saarlandes, Saarbrücken, 2014.
  21. Conference paper
    D1
    “The Batched Predecessor Problem in External Memory,” in Algorithms - ESA 2014, Wrocław, Poland, 2014.
  22. Conference paper
    D1
    “Robustly and Efficiently Computing Algebraic Curves and Surfaces,” in Mathematical Software - ICMS 2014, Seoul, South Korea, 2014.
  23. Conference paper
    D1
    “CGAL - Reliable Geometric Computing for Academia and Industry,” in Mathematical Software - ICMS 2014, Seoul, South Korea, 2014.
  24. Article
    D1
    “Distributed Selfish Load Balancing on Networks,” ACM Transactions on Algorithms, vol. 11, no. 1, 2014.
  25. Article
    D1
    “Randomised Broadcasting: Memory vs. Randomness,” Theoretical Computer Science, vol. 520, 2014.
  26. Conference paper
    D1
    “Brief Announcement: The 1-2-3-Toolkit for Building Your Own Balls-into-Bins Algorithm,” in Distributed Computing (DISC 2014), Austin, TX, USA, 2014.
  27. Paper
    D1
    “The 1-2-3-Toolkit for Building Your Own Balls-into-Bins Algorithm,” 2014. [Online]. Available: http://arxiv.org/abs/1407.8433.
  28. Conference paper
    D1
    “Coordination Mechanisms for Selfish Routing over Time on a Tree,” in Automata, Languages, and Programming (ICALP 2014), Copenhagen, Denmark, 2014.
  29. Conference paper
    D1
    “New Approximability Results for the Robust k-Median Problem,” in Algorithm Theory -- SWAT 2014, Copenhagen, Denmark, 2014.
  30. Conference paper
    D1
    “Coordination Mechanisms from (almost) all Scheduling Policies,” in ITCS’14, 5th Conference on Innovations in Theoretical Computer Science, Princeton, NJ, USA, 2014.
  31. Paper
    D1
    “(1,j)-set Problem in Graphs,” 2014. [Online]. Available: http://arxiv.org/abs/1410.3091.
  32. Paper
    D1
    “Uniformity of Point Samples in Metric Spaces using Gap Ratio,” 2014. [Online]. Available: http://arxiv.org/abs/1411.7819.
  33. Paper
    D1
    “Linear Kernels for k-Tuple and Liar’s Domination in Bounded Genus Graphs,” 2014. [Online]. Available: http://arxiv.org/abs/1309.5461.
  34. Conference paper
    D1
    “A New Deterministic Algorithm for Sparse Multivariate Polynomial Interpolation,” in ISSAC 2014, 39th International Symposium on Symbolic and Algebraic Computation, Kobe, Japan, 2014.
  35. Paper
    D1
    “Only Distances are Required to Reconstruct Submanifolds,” 2014. [Online]. Available: http://arxiv.org/abs/1410.7012.
  36. Article
    D1
    “A Constant-factor Approximation Algorithm for Unsplittable Flow on Paths,” SIAM Journal on Computing, vol. 43, no. 2, 2014.
  37. Article
    D1
    “The Effect of Homogeneity on the Computational Complexity of Combinatorial Data Anonymization,” Data Mining and Knowledge Discovery, vol. 28, no. 1, 2014.
  38. Conference paper
    D1
    “Why Walking the Dog Takes Time: Frechet Distance Has no Strongly Subquadratic Algorithms Unless SETH Fails,” in FOCS 2014, 55th Annual IEEE Symposium on Foundations of Computer Science, Philadelphia, PA, USA, 2014.
  39. Paper
    D1
    “Parameterized Complexity Dichotomy for Steiner Multicut,” 2014. [Online]. Available: http://arxiv.org/abs/1404.7006.
  40. Conference paper
    D1
    “Generic Postprocessing via Subset Selection for Hypervolume and Epsilon-indicator,” in Parallel Problem Solving from Nature -- PPSN XIII, Ljublijana, Slovenia, 2014.
  41. Thesis
    D1IMPR-CS
    “Sampling from Discrete Distributions and Computing Fréchet Distances,” Universität des Saarlandes, Saarbrücken, 2014.
  42. Conference paper
    D1
    “Balls into Bins via Local Search: Cover Time and Maximum Load,” in 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), Lyon, France, 2014.
  43. Conference paper
    D1
    “De-anonymization of Heterogeneous Random Graphs in Quasilinear Time,” in Algorithms - ESA 2014, Wrocław, Poland, 2014.
  44. Paper
    D1
    “Improved Approximation for Fréchet Distance on C-packed Curves Matching Conditional Lower Bounds,” 2014. [Online]. Available: http://arxiv.org/abs/1408.1340.
  45. Paper
    D1
    “Why Walking the Dog Takes Time: Frechet Distance Has no Strongly Subquadratic Algorithms Unless SETH Fails,” 2014. [Online]. Available: http://arxiv.org/abs/1404.1448.
  46. Conference paper
    D1
    “Two-dimensional Subset Selection for Hypervolume and Epsilon-indicator,” in GECCO’14, 16th Annual Conference on Genetic and Evolutionary Computation, Vancouver, Canada, 2014.
  47. Conference paper
    D1
    “Internal DLA: Efficient Simulation of a Physical Growth Model,” in Automata, Languages, and Programming (ICALP 2014), Copenhagen, Denmark, 2014.
  48. Paper
    D1
    “Balls into Bins via Local Search: Cover Time and Maximum Load,” 2014. [Online]. Available: http://arxiv.org/abs/1310.0801.
  49. Article
    D1
    “Convergence of Hypervolume-based Archiving Algorithms,” IEEE Transactions on Evolutionary Computation, vol. 18, no. 5, Oct. 2014.
  50. Article
    D1
    “Glivenko and Kuroda for Simple Type Theory,” The Journal of Symbolic Logic, vol. 79, no. 2, 2014.
  51. Article
    D1
    “The Complexity of Complex Weighted Boolean #CSP,” Journal of Computer and System Sciences, vol. 80, no. 1, 2014.
  52. Conference paper
    D1
    “Coloring Graph Powers: Graph Product Bounds and Hardness of Approximation,” in LATIN 2014: Theoretical Informatics, Montevideo, Uruguay, 2014.
  53. Conference paper
    D1
    “Nearly Tight Approximability Results for Minimum Biclique Cover and Partition,” in Algorithms - ESA 2014, Wrocław, Poland, 2014.
  54. Conference paper
    D1
    “Pre-reduction Graph Products: Hardnesses of Properly Learning DFAs and Approximating EDP on DAGs,” in FOCS 2014, 55th Annual IEEE Symposium on Foundations of Computer Science, Philadelphia, PA, USA, 2014.
  55. Paper
    D1
    “Pre-reduction Graph Products: Hardnesses of Properly Learning DFAs and Approximating EDP on DAGs,” 2014. [Online]. Available: http://arxiv.org/abs/1408.0828.
  56. Article
    D1
    “An SDP Primal-Dual Algorithm for Approximating the Lovász-Theta Function,” Algorithmica, vol. 69, no. 3, Jul. 2014.
  57. Paper
    D1
    “New Results on Online Resource Minimization,” 2014. [Online]. Available: http://arxiv.org/abs/1407.7998.
  58. Article
    D1
    “The Price of Anarchy for Selfish Ring Routing is Two,” ACM Transactions on Economics and Computation, vol. 2, no. 2, Jun. 2014.
  59. Paper
    D1
    “Local Doubling Dimension of Point Sets,” 2014. [Online]. Available: http://arxiv.org/abs/1406.4822.
  60. Article
    D1
    “Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms,” Algorithmica, vol. 69, no. 3, 2014.
  61. Article
    D1
    “Counting Independent Sets in Hypergraphs,” Combinatorics, Probability and Computing, vol. 23, no. 4, 2014.
  62. Conference paper
    D1
    “Argumentative Aggregation of Individual Opinions,” in Logics in Artificial Intelligence (JELIA 2014), Funchal, Portugal, 2014.
  63. Conference paper
    D1
    “Polyhedral Labellings for Argumentation Frameworks,” in Scalable Uncertainty Management (SUM 2014), Oxford, UK, 2014.
  64. Conference paper
    D1
    “A Normal Form for Argumentation Frameworks,” in Theory and Applications of Formal Argumentation (TAFA 2013), Beijing, China, 2014.
  65. Article
    D1
    “Max-Cut Parameterized Above the Edwards-Erdős Bound,” Algorithmica, 2014.
  66. Article
    D1
    “Clique Cover and Graph Separation: New Incompressibility Results,” ACM Transactions on Computation Theory, vol. 6, no. 2, 2014.
  67. Conference paper
    D1
    “Jamming-resistant Learning in Wireless Networks,” in Automata, Languages, and Programming (ICALP 2014), Copenhagen, Denmark, 2014.
  68. Conference paper
    D1
    “Optimal Time-Space Tradeoff for the 2D Convex-Hull Problem,” in Algorithms - ESA 2014, Wroclaw, Poland, 2014.
  69. Paper
    D1
    “Engineering Art Galleries,” 2014. [Online]. Available: http://arxiv.org/abs/1410.8720.
  70. Conference paper
    D1
    “Finding All Solutions of Equations in Free Groups and Monoids with Involution,” in Computer Science - Theory and Applications (CSR 2014), Moscow, Russia, 2014.
  71. Book
    D1
    Algorithmen und Datenstrukturen : die Grundwerkzeuge. Berlin: Springer Vieweg, 2014.
  72. Conference paper
    D1
    “Packing a Knapsack of Unknown Capacity,” in 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), Lyon, France, 2014, vol. 25.
  73. Article
    D1
    “Ranking-based Black-box Complexity,” Algorithmica, vol. 68, no. 3, 2014.
  74. Article
    D1
    “A Lower Bound for the Discrepancy of a Random Point Set,” Journal of Complexity, vol. 30, no. 1, 2014.
  75. Article
    D1
    “Playing Mastermind with Constant-size Memory,” Theory of Computing Systems, vol. 55, no. 4, Nov. 2014.
  76. Conference paper
    D1
    “Tight Analysis of Randomized Rumor Spreading in Complete Graphs,” in 2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics and Combinatorics (ANALCO 2014), Portland, OR, USA, 2014.
  77. Article
    D1
    “Randomized Rounding in the Presence of a Cardinality Constraint,” ACM Journal of Experimental Algorithmics, vol. 19, no. 1, 2014.
  78. Article
    D1
    “Quasirandom Rumor Spreading,” ACM Transactions on Algorithms, vol. 11, no. 2, 2014.
  79. Article
    D1
    “Reducing the Arity in Unbiased Black-Box Complexity,” Theoretical Computer Science, vol. 545, 2014.
  80. Article
    D1
    “Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time,” Journal of Graph Algorithms and Applications, vol. 18, no. 3, 2014.
  81. Book chapter / section
    D1
    “Calculation of Discrepancy Measures and Applications,” in A Panorama of Discrepancy Theory, Cham: Springer International, 2014.
  82. Conference paper
    D1
    “Approximation Algorithms for the Gromov Hyperbolicity of Discrete Metric Spaces,” in LATIN 2014: Theoretical Informatics, Montevideo, Uruguay, 2014.
  83. Article
    D1
    “Linear-time Approximation for Maximum Weight Matching,” Journal of the ACM, vol. 61, no. 1, 2014.
  84. Paper
    D1
    “Size Sensitive Packing Number for Hamming Cube and its Consequences,” 2014. [Online]. Available: http://arxiv.org/abs/1412.3922.
  85. Article
    D1
    “Induced Acyclic Tournaments in Random Digraphs: Sharp Concentration, Thresholds and Algorithms,” Discussiones Mathematicae Graph Theory, vol. 34, no. 3, 2014.
  86. Paper
    D1
    “Combinatorics of Finite Abelian Groups and Weil Representations,” 2014. [Online]. Available: http://arxiv.org/abs/1010.3528.
  87. Paper
    D1
    “On Randomized Fictitious Play for Approximating Saddle Points Over Convex Sets,” 2014. [Online]. Available: http://arxiv.org/abs/1301.5290.
  88. Paper
    D1
    “Towards More Practical Linear Programming-based Techniques for Algorithmic Mechanism Design,” 2014. [Online]. Available: http://arxiv.org/abs/1408.1577.
  89. Article
    D1
    “The Cost of Selfishness for Maximizing the Minimum Load on Uniformly Related Machines,” Journal of Combinatorial Optimization, vol. 27, no. 4, May 2014.
  90. Paper
    D1
    “Algorithms for Art Gallery Illumination,” 2014. [Online]. Available: http://arxiv.org/abs/1410.5952.
  91. Article
    D1
    “A Uniform Paradigm to Succinctly Encode Various Families of Trees,” Algorithmica, vol. 68, no. 1, 2014.
  92. Article
    D1
    “Compact Navigation and Distance Oracles for Graphs with Small Treewidth,” Algorithmica, vol. 69, no. 1, 2014.
  93. Article
    D1
    “A Supermodularity-based Differential Privacy Preserving Algorithm for Data Anonymization,” IEEE Transactions on Knowledge and Data Engineering, vol. 26, no. 7, 2014.
  94. Conference paper
    D1
    “LZ77‐based Self‐indexing with Faster Pattern Matching,” in LATIN 2014: Theoretical Informatics, Montevideo, Uruguay, 2014.
  95. Article
    D1
    “Uniform Generation of d-Factors in Dense Host Graphs,” Graphs and Combinatorics, vol. 30, no. 3, 2014.
  96. “Market Equilibrium under Piecewise Leontief Concave Utilities,” in Web and Internet Economics (WINE 2014), Beijing, China, 2014.
  97. “Leontief Exchange Markets Can Solve Multivariate Polynomial Equations, Yielding FIXP and ETR Hardness,” 2014. [Online]. Available: http://arxiv.org/abs/1411.5060.
  98. Paper
    D1
    “Optimal Encodings for Range Min-Max and Top-k,” 2014. [Online]. Available: http://arxiv.org/abs/1411.6581.
  99. Conference paper
    D1
    “Improved Submatrix Maximum Queries in Monge Matrices,” in Automata, Languages, and Programming (ICALP 2014), Copenhagen, Denmark, 2014.
  100. Conference paper
    D1
    “Testing Generalised Freeness of Words,” in 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), Lyon, France, 2014.
  101. Conference paper
    D1
    “Weighted Ancestors in Suffix Trees,” in Algorithms - ESA 2014, Wrocław, Poland, 2014.
  102. Article
    D1
    “Simple and Efficient LZW‐compressed Multiple Pattern Matching,” Journal of Discrete Algorithms, vol. 25, 2014.
  103. Conference paper
    D1
    “Order‐preserving Pattern Matching with k Mismatches,” in Combinatorial Pattern Matching (CPM 2014), Moscow, Russia, 2014.
  104. Conference paper
    D1
    “Euclidean TSP with Few Inner Points in Linear Space,” in Algorithms and Computation (ISAAC 2014), Jeonju, Korea, 2014.
  105. Paper
    D1
    “Encodings of Range Maximum-Sum Segment Queries and Applications,” 2014. [Online]. Available: http://arxiv.org/abs/1410.2847.
  106. Conference paper
    D1
    “Near-optimal Distributed Tree Embedding,” in Distributed Computing (DISC 2014), Austin, TX, USA, 2014.
  107. Paper
    D1
    “For-all Sparse Recovery in Near-optimal Time,” 2014. [Online]. Available: http://arxiv.org/abs/1402.1726.
  108. Conference paper
    D1
    “For-all Sparse Recovery in Near-optimal Time,” in Automata, Languages, and Programming (ICALP 2014), Copenhagen, Denmark, 2014.
  109. “Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods,” in Automata, Languages, and Programming (ICALP 2014), Copenhagen, Denmark, 2014.
  110. Conference paper
    D1
    “Induced Disjoint Paths in Circular-Arc Graphs in Linear Time,” in Graph-Theoretic Concepts in Computer Science (WG 2014), Nouan-le-Fuzelier, France, 2014.
  111. Paper
    D1
    “Induced Disjoint Paths in Circular-Arc Graphs in Linear Time,” 2014. [Online]. Available: http://arxiv.org/abs/1403.0789.
  112. Paper
    D1
    “Computing Teichmüller Maps between Polygons,” 2014. [Online]. Available: http://arxiv.org/abs/1401.6395.
  113. Paper
    D1
    “Approximate Range Emptiness in Constant Time and Optimal Space,” 2014. [Online]. Available: http://arxiv.org/abs/1407.2907.
  114. Conference paper
    D1
    “Load Balanced Short Path Routing in Large-scale Wireless Networks Using Area-preserving Maps,” in MobiHoc’14, 15th ACM International Symposium on Mobile Ad Hoc Networking and Computing, Philadelphia, PA, USA, 2014.
  115. Paper
    D1
    “Finding Even Subgraphs Even Faster,” 2014. [Online]. Available: http://arxiv.org/abs/1409.4935.
  116. Conference paper
    D1
    “Topology-driven Trajectory Synthesis with an Example on Retinal Cell Motions,” in Algorithms in Bioinformatics (WABI 2014), Wrocław, Poland, 2014.
  117. Article
    D1
    “Scheduling and Packing Malleable and Parallel Tasks with Precedence Constraints of Bounded Width,” Journal of Combinatorial Optimization, vol. 27, no. 1, 2014.
  118. Paper
    D1
    “The Offset Filtration of Convex Objects,” 2014. [Online]. Available: http://arxiv.org/abs/1407.6132.
  119. Conference paper
    D1
    “Routing Games with Progressive Filling,” in INFOCOM 2014, The 33rd Annual IEEE International Conference on Computer Communications, Toronto, Canada, 2014.
  120. Article
    D1
    “A (5/3 + ε)-Approximation for Strip Packing,” Computational Geometry: Theory and Applications (Proc. WADS 2011), vol. 47, no. 2, Pt. B, 2014.
  121. Conference paper
    D1
    “Finding Disjoint Paths in Split Graphs,” in SOFSEM 2014: Theory and Practice of Computer Science, Nový Smokovec, Slovakia, 2014.
  122. Article
    D1
    “Parameterized Complexity of Induced Graph Matching on Claw-Free Graphs,” Algorithmica, vol. 70, no. 3, 2014.
  123. Thesis
    D1
    “Approximating the Minimum Biclique Cover Problem on Bipartite Graphs,” Universität des Saarlandes, Saarbrücken, 2014.
  124. Paper
    D1
    “Matching Dynamics with Constraints,” 2014. [Online]. Available: http://arxiv.org/abs/1409.4304.
  125. “Approximation Algorithms for Secondary Spectrum Auctions,” ACM Transactions on Internet Technology, vol. 14, no. 2–3, 2014.
  126. Conference paper
    D1
    “Matching Dynamics with Constraints,” in Web and Internet Economics (WINE 2014), Beijing, China, 2014.
  127. Conference paper
    D1
    “How Unsplittable-flow-covering Helps Scheduling with Job-dependent Cost Functions,” in Automata, Languages, and Programming (ICALP 2014), Copenhagen, Denmark, 2014.
  128. Conference paper
    D1
    “New Results for Non-preemptive Speed Scaling,” in Mathematical Foundations of Computer Science 2014 (MFCS 2014), Budapest, Hungary, 2014.
  129. Paper
    D1
    “Sphere Packing with Limited Overlap,” 2014. [Online]. Available: http://arxiv.org/abs/1401.0468.
  130. Conference paper
    D1
    “Sphere Packing with Limited Overlap,” in Proceedings of the 2014 Canadian Conference on Computational Geometry (CCCG 2014), Halifax, Canada, 2014.
  131. Conference paper
    D1
    “Context Unification is in PSPACE,” in Automata, Languages, and Programming (ICALP 2014), Copenhagen, Denmark, 2014.
  132. Conference paper
    D1
    “A really Simple Approximation of Smallest Grammar,” in Combinatorial Pattern Matching (CPM 2014), Moscow, Russia, 2014.
  133. Conference paper
    D1
    “Approximation of Smallest Linear Tree Grammar,” in 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), Lyon, France, 2014.
  134. Paper
    D1
    “A really Simple Approximation of Smallest Grammar,” 2014. [Online]. Available: http://arxiv.org/abs/1403.4445.
  135. Article
    D1
    “The Complexity of Compressed Membership Problems for Finite Automata,” Theory of Computing Systems, vol. 55, no. 4, 2014.
  136. Article
    D1
    “Computational Completeness of Equations Over Sets of Natural Numbers,” Information and Computation, vol. 237, Oct. 2014.
  137. Article
    D1
    “On a Model of Virtual Address Translation,” Journal of Experimental Algorithmics, vol. 19, 2014.
  138. Paper
    D1
    “Cache-Oblivious VAT-Algorithms,” 2014. [Online]. Available: http://arxiv.org/abs/1404.3577.
  139. Conference paper
    D1D4
    “Improvements to Keyboard Optimization with Integer Programming,” in UIST’14, 27th Annual ACM Symposium on User Interface Software and Technology, Honolulu, HI, USA, 2014.
  140. Paper
    D1
    “Approximation and Streaming Algorithms for Projective Clustering via Random Projections,” 2014. [Online]. Available: http://arxiv.org/abs/1407.2063.
  141. Thesis
    D1IMPR-CS
    “Multiple Choice Allocations with Small Maximum Loads,” Universität des Saarlandes, Saarbrücken, 2014.
  142. Thesis
    D1IMPR-CS
    “Matrix Rounding, Evolutionary Algorithms, and Hole Detection,” Universität des Saarlandes, Saarbrücken, 2014.
  143. Thesis
    D1
    “Two-dimensional Subset Selection for Hypervolume and Epsilon-indicator,” Universität des Saarlandes, Saarbrücken, 2014.
  144. Article
    D1
    “Iterative Learning from Positive Data and Counters,” Theoretical Computer Science, vol. 519, 2014.
  145. Article
    D1
    “The Max Problem Revisited: The Importance of Mutation in Genetic Programming,” Theoretical Computer Science, vol. 545, 2014.
  146. Article
    D1
    “Upper Bounds on Probability Thresholds for Asymmetric Ramsey Properties,” Random Structures and Algorithms, vol. 44, no. 1, 2014.
  147. Conference paper
    D1
    “Dirichlet Eigenvalues, Local Random Walks, and Analyzing Clusters in Graphs,” in Algorithms and Computation (ISAAC 2014), Jeonju, Korea, 2014.
  148. Conference paper
    D1
    “Direct Sum Fails for Zero Error Average Communication,” in ITCS’14, 5th Conference on Innovations in Theoretical Computer Science, Princeton, NJ, USA, 2014.
  149. Conference paper
    D1
    “Approximate Nonnegative Rank Is Equivalent to the Smooth Rectangle Bound,” in Automata, Languages, and Programming (ICALP 2014), Copenhagen, Denmark, 2014.
  150. Conference paper
    D1
    “Point Line Cover: The Easy Kernel is Essentially Tight,” in Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2014), Portland, OR, USA, 2014.
  151. Article
    D1
    “Compression via Matroids: A Randomized Polynomial Kernel for Odd Cycle Transversal,” ACM Transactions on Algorithms, vol. 10, no. 4, 2014.
  152. Paper
    D1
    “Fast Partial Distance Estimation and Applications,” 2014. [Online]. Available: http://arxiv.org/abs/1412.7922.
  153. Conference paper
    D1
    “Improved Explicit Data Structures in the Bitprobe Model,” in Algorithms - ESA 2014, Wrocław, Poland, 2014.
  154. Paper
    D1
    “Solving Polynomial Equations with Equation Constraints: the Zero-dimensional Case,” 2014. [Online]. Available: http://arxiv.org/abs/1408.3639.
  155. Conference paper
    D1
    “On Sketching Matrix Norms and the Top Singular Vector,” in Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2014), Portland, OR, USA, 2014.
  156. Conference paper
    D1
    “Turnstile Streaming Algorithms Might as Well Be Linear Sketches,” in STOC’14, 46th Annual ACM Symposium on Theory of Computing, New York, NY, USA, 2014.
  157. Conference paper
    D1
    “Improved Testing of Low Rank Matrices,” in KDD’14, 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, New York, NY, USA, 2014.
  158. Conference paper
    D1
    “On the Communication Complexity of Linear Algebraic Problems in the Message Passing Model,” in Distributed Computing (DISC 2014), Austin, TX, USA, 2014.
  159. Proceedings
    D1
    Eds., Equilibrium Computation, no. 8. Schloss Dagstuhl, 2014.
  160. Article
    D1
    “A Tight 2-Approximation for Preemptive Stochastic Scheduling,” Mathematics of Operation Research, vol. 39, no. 4, 2014.
  161. Conference paper
    D1
    “Algorithms for Equilibrium Prices in Linear Market Models,” in Algorithms and Computation (WALCOM 2014), Chennai, India, 2014.
  162. Conference paper
    D1
    “Randomized Rumor Spreading in Poorly Connected Small-world Networks,” in Distributed Computing (DISC 2014), Austin, TX, USA, 2014.
  163. Article
    D1
    “The Kernelization Complexity of Connected Domination in Graphs with (no) Small Cycles,” Algorithmica, vol. 68, no. 2, 2014.
  164. Article
    D1
    “Beyond Max-Cut: Lambda-extendible Properties Parameterized above the Poljak-Turzík Bound,” Journal of Computer and System Sciences, vol. 80, no. 7, 2014.
  165. Conference paper
    D1
    “Scheduling and Fixed-Parameter Tractability,” in Integer Programming and Combinatorial Optimization (IPCO 2014), Bonn, Germany, 2014.
  166. Article
    D1
    “Fooling Pairs in Randomized Communication Complexity,” Electronic Colloquium on Computational Complexity (ECCC) : Report Series, vol. 22 (Revision 1), 2014.
  167. Article
    D1
    “A Note on Average-case Sorting,” Electronic Colloquium on Computational Complexity (ECCC) : Report Series, vol. 106 (Revision 1), 2014.
  168. Article
    D1
    “Coloring Random Graphs Online Without Creating Monochromatic Subgraphs,” Random Structures and Algorithms, vol. 44, no. 4, 2014.
  169. Article
    D1
    “Editorial for the Special Issue on Theoretical Foundations of Evolutionary Computation,” IEEE Transactions on Evolutionary Computation, vol. 18, no. 5, 2014.
  170. Conference paper
    D1
    “Verification of Certifying Computations through AutoCorres and Simpl,” in NASA Formal Methods (NFM 2014), Houston, TX, USA, 2014.
  171. Paper
    D1
    “Partitioning Well-clustered Graphs with k-Means and Heat Kernel,” 2014. [Online]. Available: http://arxiv.org/abs/1411.2021.
  172. Conference paper
    D1
    “Vertex Exponential Algorithms for Connected f-Factors,” in 34th International Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS 2014), New Delhi, India, 2014.
  173. Paper
    D1
    “Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs,” 2014. [Online]. Available: http://arxiv.org/abs/1306.6593.
  174. Conference paper
    D1
    “Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs,” in FOCS 2014, 55th Annual IEEE Symposium on Foundations of Computer Science, Philadelphia, PA, USA, 2014.
  175. Paper
    D1
    “Balanced Allocation on Graphs: A Random Walk Approach,” 2014. [Online]. Available: http://arxiv.org/abs/1407.2575.
  176. Article
    D1
    “Cutoff Phenomenon for Random Walks on Kneser Graphs,” Discrete Applied Mathematics, vol. 176, 2014.
  177. Conference paper
    D1
    “A Simpl Shortest Path Checker Verification,” in Proceedings of Isabelle Workshop 2014, Vienna, Austria, 2014.
  178. Article
    D1
    “On the Complexity of the Descartes Method when Using Approximate Arithmetic,” Journal of Symbolic Computation, vol. 65, Nov. 2014.
  179. Conference paper
    D1
    “A Near-optimal Algorithm for Computing Real Roots of Sparse Polynomials,” in ISSAC 2014, 39th International Symposium on Symbolic and Algebraic Computation, Kobe, Japan, 2014.
  180. Thesis
    D1
    “2-Walks in 3-Connected Planar Graphs are Polynomial Time Computable,” Universität des Saarlandes, Saarbrücken, 2014.
  181. Conference paper
    D1
    “The Mondshein Sequence,” in Automata, Languages, and Programming (ICALP 2014), Copenhagen, Denmark, 2014.
  182. “A Quantum-walk-inspired Adiabatic Algorithm for Solving Graph Isomorphism Problems,” Journal of Physics A: Mathematical and Theoretical, vol. 47, no. 32, 2014.
  183. Article
    D1
    “Popular Ranking,” Discrete Applied Mathematics, vol. 165, 2014.
  184. Article
    D1
    “On the Configuration-LP for Scheduling on Unrelated Machines,” Journal of Scheduling, vol. 17, no. 4, 2014.

2013

  1. Conference paper
    D1
    “Approximation Schemes for Maximum Weight Independent Set of Rectangles,” in FOCS 2013, 54th Annual IEEE Symposium on Foundations of Computer Science, Berkeley, CA, USA, 2013.
  2. Paper
    D1
    “An Upper Bound Theorem for a Class of Flag Weak Pseudomanifolds,” 2013. [Online]. Available: http://arxiv.org/abs/1303.5603.
  3. Book chapter / section
    D1
    “The Query Complexity of Finding a Hidden Permutation,” in Space-Efficient Data Structures, Streams, and Algorithms, Berlin: Springer, 2013.
  4. Paper
    D1
    “A Framework for the Verification of Certifying Computations,” 2013. [Online]. Available: http://arxiv.org/abs/1301.7462.
  5. Paper
    D1
    “A Simple Sweep Line Algorithm for Counting Triangulations and Pseudo-triangulations,” 2013. [Online]. Available: http://arxiv.org/abs/1312.3188.
  6. Conference paper
    D1
    “Counting Triangulations Approximately,” in CCCG 2013, 25th Canadian Conference on Computational Geometry, Waterloo, Ontario, 2013.
  7. Conference paper
    D1
    “Constant Integrality Gap LP Formulations of Unsplittable Flow on a Path,” in Integer Programming and Combinatorial Optimization (IPCO 2013), Valparaíso, Chile, 2013.
  8. Conference paper
    D1
    “Minimizing Maximum (Weighted) Flow-time on Related and Unrelated Machines,” in Automata, Languages, and Programming (ICALP 2013), Riga, Latvia, 2013.
  9. Conference paper
    D1
    “Friendship and Stable Matching,” in Algorithms - ESA 2013, Sophia Antipolis, France, 2013.
  10. Conference paper
    D1
    “How to Pack Your Items When You Have to Buy Your Knapsack,” in Mathematical Foundations of Computer Science 2013 (MFCS 2013), Klosterneuburg, Austria, 2013.
  11. Conference paper
    D1
    “Converting SLP to LZ78 in almost Linear Time,” in Combinatorial Pattern Matching (CPM 2013), Bad Herrenalb, Germany, 2013.
  12. Conference paper
    D1
    “Physarum Can Compute Shortest Paths: Convergence Proofs and Complexity Bounds,” in Automata, Languages, and Programming (ICALP 2013), Riga, Latvia, 2013.
  13. Article
    D1
    “Exact Symbolic-numeric Computation of Planar Algebraic Curves,” Theoretical Computer Science, vol. 491, 2013.
  14. Conference paper
    D1
    “Near-optimal Multi-unit Auctions with Ordered Bidders,” in EC’13, 14th ACM Conference on Electronic Commerce, Philadelphia, PA, USA, 2013.
  15. Paper
    D1
    “New Approximability Results for the Robust k-Median Problem,” 2013. [Online]. Available: http://arxiv.org/abs/1309.4602.
  16. Conference paper
    D1
    “Balls into Bins via Local Search,” in Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), New Orleans, LA, USA, 2013.
  17. Paper
    D1
    “Delaunay Stability via Perturbations,” 2013. [Online]. Available: http://arxiv.org/abs/1310.7696.
  18. Article
    D1
    “The Stability of Delaunay Triangulations,” International Journal of Computational Geometry and Applications, vol. 23, no. 4–5, 2013.
  19. Paper
    D1
    “Delaunay Triangulation of Manifolds,” 2013. [Online]. Available: http://arxiv.org/abs/1311.0117.
  20. Conference paper
    D1
    “Feasibility Analysis in the Sporadic DAG Task Model,” in Proceedings of the 25th Euromicro Conference on Real-Time Systems (ECRTS 2013), Paris, France, 2013.
  21. Conference paper
    D1
    “Polynomial-time Exact Schedulability Tests for Harmonic Real-time Tasks,” in IEEE 34th Real-Time Systems Symposium (RTSS 2013), Vancouver, Canada, 2013.
  22. Article
    D1
    “Approximation Quality of the Hypervolume Indicator,” Artificial Intelligence, vol. 195, 2013.
  23. Conference paper
    D1
    “Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems,” in Mathematical Foundations of Computer Science 2013 (MFCS 2013), Klosterneuburg, Austria, 2013.
  24. Paper
    D1
    “Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems,” 2013. [Online]. Available: http://arxiv.org/abs/1306.3030.
  25. Conference paper
    D1
    “Parameterized Average-case Complexity of the Hypervolume Indicator,” in GECCO’13, 15th Annual Conference on Genetic and Evolutionary Computation, Amsterdam, The Netherlands, 2013.
  26. Conference paper
    D1
    “Succinct Sampling from Discrete Distributions,” in STOC’13, 45th Annual ACM Symposium on Theory of Computing, Palo Alto, CA, USA, 2013.
  27. Conference paper
    D1
    “Bringing Order to Special Cases of Klee’s Measure Problem,” in Mathematical Foundations of Computer Science 2013 (MFCS 2013), Klosterneuburg, Austria, 2013.
  28. Article
    D1
    “Speeding Up Many-objective Optimization by Monte Carlo Approximations,” Artificial Intelligence, vol. 204, 2013.
  29. Conference paper
    D1
    “Online Checkpointing with Improved Worst-case Guarantees,” in Automata, Languages, and Programming (ICALP 2013), Riga, Latvia, 2013.
  30. Conference paper
    D1
    “Exact and Efficient Generation of Geometric Random Variates and Random Graphs,” in Automata, Languages, and Programming (ICALP 2013), Riga, Latvia, 2013.
  31. Conference paper
    D1
    “From Classical Extensional Higher-order Tableau to Intuitionistic Intentional Natural Deduction,” in PxTP 2013, Third International Workshop on Proof Exchange for Theorem Proving, Lake Placid, NY, USA, 2013.
  32. Conference paper
    D1
    “Dichotomy for Holant Problems with a Function on Domain Size 3,” in Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), New Orleans, LA, USA, 2013.
  33. Article
    D1
    “Memory-limited Non-U-shaped Learning With Solved Open Problems,” Theoretical Computer Science, vol. 473, 2013.
  34. Conference paper
    D1
    “Clustering With Center Constraints,” in 33rd International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013), Guwahati, India, 2013.
  35. Article
    D1
    “Graph Pricing Problem on Bounded Treewidth, Bounded Genus and k-Partite Graphs,” Chicago Journal of Theoretical Computer Science, vol. 2013, 2013.
  36. Conference paper
    D1
    “Independent Set, Induced Matching, and Pricing: Connections and Tight (Subexponential Time) Approximation Hardnesses,” in FOCS 2013, 54th Annual IEEE Symposium on Foundations of Computer Science, Berkeley, CA, USA, 2013.
  37. Article
    D1
    “An Output-sensitive Algorithm for Persistent Homology,” Computational Geometry: Theory and Applications, vol. 46, no. 4, 2013.
  38. Article
    D1
    “Maximizing the Minimum Load: The Cost of Selfishness,” Theoretical Computer Science, vol. 482, 2013.
  39. Proceedings
    D1
    Eds., Computational Geometry, no. 3. Schloss Dagstuhl, 2013.
  40. Paper
    D1
    “Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms,” 2013. [Online]. Available: http://arxiv.org/abs/1202.2877.
  41. Article
    D1
    “A Truthful Constant Approximation for Maximizing the Minimum Load on Related Machines,” Theoretical Computer Science, vol. 489–490, 2013.
  42. Article
    D1
    “On the Compression of Search Trees,” Information Processing & Management, vol. 50, no. 2, 2013.
  43. Conference paper
    D1
    “Rumor Spreading in Random Evolving Graphs,” in Algorithms - ESA 2013, Sophia Antipolis, France, 2013.
  44. Conference paper
    D1
    “Diffusion Probabiliste dans les Reseaux Dynamiques,” in Proc. of the 15èmes Rencontres Francophones pour les Aspects Algorithmiques des Télécommunications (AlgoTel 2013), Bordeaux, France, 2013.
  45. Conference paper
    D1
    “Abstract Debates,” in 25th International Conference on Tools with Artificial Intelligence (ICTAI 2013), Washington, DC, USA, 2013.
  46. Conference paper
    D1
    “Polynomial Kernels for lambda-extendible Properties Parameterized Above the Poljak-Turzík Bound,” in 33rd International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013), Guwahati, India, 2013.
  47. Paper
    D1
    “Polynomial Kernels for lambda-extendible Properties Parameterized Above the Poljak-Turzík Bound,” 2013. [Online]. Available: http://arxiv.org/abs/1310.2928.
  48. Conference paper
    D1
    “A Quantization Framework for Smoothed Analysis of Euclidean Optimization Problems,” in Algorithms - ESA 2013, Sophia Antipolis, France, 2013.
  49. Article
    D1
    “Fast Message Dissemination in Random Geometric Networks,” Distributed Computing, vol. 26, no. 1, 2013.
  50. Conference paper
    D1
    “Sleeping Experts in Wireless Networks,” in Distributed Computing (DISC 2013), Jerusalem, Israel, 2013.
  51. Article
    D1
    “Black-Box Complexities of Combinatorial Problems,” Theoretical Computer Science, vol. 471, 2013.
  52. Conference paper
    D1
    “How the (1 + λ) Evolutionary Algorithm Optimizes Linear Functions,” in GECCO’13, 15th Annual Conference on Genetic and Evolutionary Computation, Amsterdam, The Netherlands, 2013.
  53. Article
    D1
    “Strong Robustness of Randomized Rumor Spreading Protocols,” Discrete Applied Mathematics, vol. 161, no. 6, 2013.
  54. Article
    D1
    “More Effective Crossover Operators for the All-Pairs Shortest Path Problem,” Theoretical Computer Science, vol. 471, 2013.
  55. Article
    D1
    “Mutation Rate Matters Even When Optimizing Monotonic Functions,” Evolutionary Computation, vol. 21, no. 1, 2013.
  56. Paper
    D1
    “Simple and Optimal Fault-tolerant Rumor Spreading,” 2013. [Online]. Available: http://arxiv.org/abs/1209.6158.
  57. Conference paper
    D1
    “When Do Evolutionary Algorithms Optimize Separable Functions in Parallel?,” in FOGA XII, Adelaide, Australia, 2013.
  58. Conference paper
    D1
    “Black-box Complexity: From Complexity Theory to Playing Mastermind,” in GECCO’13, 15th Annual Conference on Genetic and Evolutionary Computation, Amsterdam, The Netherlands, 2013.
  59. Conference paper
    D1
    “Playing Mastermind with Many Colors,” in Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), New Orleans, LA, USA, 2013.
  60. Conference paper
    D1
    “A Method to Derive Fixed Budget Results From Expected Optimisation Times,” in GECCO’13, 15th Annual Conference on Genetic and Evolutionary Computation, Amsterdam, The Netherlands, 2013.
  61. Proceedings
    D1
    Eds., Epidemic Algorithms and Processes: From Theory to Applications, no. 1. Schloss Dagstuhl, 2013.
  62. Conference paper
    D1
    “Lessons From the Black-Box: Fast Crossover-Based Genetic Algorithms,” in GECCO’13, 15th Annual Conference on Genetic and Evolutionary Computation, Amsterdam, The Netherlands, 2013.
  63. Article
    D1
    “Adaptive Drift Analysis,” Algorithmica, vol. 65, no. 1, 2013.
  64. Conference paper
    D1
    “Lower Bounds for the Runtime of a Global Multi-objective Evolutionary Algorithm,” in 2013 IEEE Congress on Evolutionary Computation (CEC 2013), Cancun, Mexico, 2013.
  65. Conference paper
    D1
    “Royal Road Functions and the (1 + λ) Evolutionary Algorithm: Almost no Speed-up from Larger Offspring Populations,” in 2013 IEEE Congress on Evolutionary Computation (CEC 2013), Cancun, Mexico, 2013.
  66. Article
    D1
    “Improved Approximation Algorithms for the Min-Max Selecting Items Problem,” Information Processing Letters, vol. 113, no. 19–21, 2013.
  67. Proceedings
    D1
    Eds., Theory of Evolutionary Algorithms, no. 7. Schloss Dagstuhl, 2013.
  68. Conference paper
    D1
    “Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time,” in Graph-Theoretic Concepts in Computer Science (WG 2013), Lübeck, Germany, 2013.
  69. Conference paper
    D1
    “Constructing Low Star Discrepancy Point Sets with Genetic Algorithms,” in GECCO’13, 15th Annual Conference on Genetic and Evolutionary Computation, Amsterdam, The Netherlands, 2013.
  70. “Synchronous Counting and Computational Algorithm Design,” 2013. [Online]. Available: http://arxiv.org/abs/1304.5719.
  71. Paper
    D1
    “A Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market,” 2013. [Online]. Available: http://arxiv.org/abs/1212.0979.
  72. Conference paper
    D1
    “Breaking the O(n^2.5) Deterministic Time Barrier for Undirected Unit-capacity Maximum Flow,” in Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), New Orleans, LA, USA, 2013.
  73. Conference paper
    D1
    “A Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market,” in Automata, Languages, and Programming (ICALP 2013), Riga, Latvia, 2013.
  74. Thesis
    D1
    “Lessons from the Black-Box: Fast Crossover-based Algorithms,” Universistät des Saarlandes, Saarbrücken, 2013.
  75. Conference paper
    D1
    “On Randomized Fictitious Play for Approximating Saddle Points over Convex Sets,” in Computing and Combinatorics (COCOON 2013), Hangzhou, China, 2013.
  76. Article
    D1
    “On the Hierarchy of Distribution-sensitive Properties for Data Structures,” Acta Informatica, vol. 50, no. 4, 2013.
  77. Article
    D1
    “Every DFS Tree of a 3-connected Graph Contains a Contractible Edge,” Journal of Graph Theory, vol. 72, no. 1, 2013.
  78. Article
    D1
    “Computing Resultants on Graphics Processing Units: Towards GPU-accelerated Computer Algebra,” Journal of Parallel and Distributed Computing, vol. 73, no. 11, 2013.
  79. Conference paper
    D1
    “A Unified Approach to Truthful Scheduling on Related Machines,” in Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), New Orleans, LA, USA, 2013.
  80. Article
    D1
    “Online Capacity Maximization in Wireless Networks,” Journal of Scheduling, vol. 16, no. 1, 2013.
  81. “Facets for Art Gallery Problems,” 2013. [Online]. Available: http://arxiv.org/abs/1308.4670.
  82. Article
    D1
    “Constraint Satisfaction Problems: Convexity Makes AllDifferent Constraints Tractable,” Theoretical Computer Science, vol. 472, 2013.
  83. Article
    D1
    “Quadratic Upper Bounds on the Erdős-Pósa Property for a Generalization of Packing and Covering Cycles,” Journal of Graph Theory, vol. 74, no. 4, 2013.
  84. Article
    D1
    “On the Insertion Time of Cuckoo Hashing,” SIAM Journal on Computing, vol. 42, no. 6, 2013.
  85. Conference paper
    D1
    “The Distance 4-Sector of Two Points Is Unique,” in Algorithms and Computation (ISAAC 2013), Hong Kong, China, 2013.
  86. Article
    D1
    “Fast Simulation of Large-scale Growth Models,” Random Structures and Algorithms, vol. 42, no. 2, 2013.
  87. Article
    D1
    “Weighted Preferences in Evolutionary Multi-objective Optimization,” International Journal of Machine Learning and Cybernetics, vol. 4, no. 2, 2013.
  88. Article
    D1
    “Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions,” Algorithmica, vol. 67, no. 1, 2013.
  89. Conference paper
    D1
    “Heaviest Induced Ancestors and Longest Common Substrings,” in CCCG 2013, 25th Canadian Conference on Computational Geometry, Waterloo, Canada, 2013.
  90. Article
    D1
    “Distribution of the Number of Spanning Regular Subgraphs in Random Graphs,” Random Structures and Algorithms, vol. 43, no. 3, 2013.
  91. Article
    D1
    “Feedback Vertex Sets in Tournaments,” Journal of Graph Theory, vol. 72, no. 1, 2013.
  92. Conference paper
    D1
    “Beating O(nm) in Approximate LZW-Compressed Pattern Matching,” in Algorithms and Computation (ISAAC 2013), Hong Kong, China, 2013.
  93. Conference paper
    D1
    “Discovering Hidden Repetitions in Words,” in The Nature of Computation (CiE 2013), Milan, Italy, 2013.
  94. Conference paper
    D1
    “Minimal Discriminating Words Problem Revisited,” in String Processing and Information Retrieval (SPIRE 2013), Jerusalem, Israel, 2013.
  95. Conference paper
    D1
    “Alphabetic Minimax Trees in Linear Time,” in Computer Science - Theory and Applications (CSR 2013), Ekaterinburg, Russia, 2013.
  96. Conference paper
    D1
    “Finding Pseudo-Repetitions,” in 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), Kiel, Germany, 2013.
  97. Article
    D1
    and Ł. Jeż, “Validating the Knuth-Morris-Pratt Failure Function, Fast and Online,” Theory of Computing Systems, vol. 54, no. 2, Dec. 2013.
  98. Article
    D1
    “Kernel and Fast Algorithm for Dense Triplet Inconsistency,” Theoretical Computer Science, vol. 494, 2013.
  99. Paper
    D1
    “Gossip vs. Markov Chains, and Randomness-efficient Rumor Spreading,” 2013. [Online]. Available: http://arxiv.org/abs/1311.2839.
  100. Article
    D1
    “Two for One: Tight Approximation of 2D Bin Packing,” International Journal of Foundations of Computer Science, vol. 24, no. 8, 2013.
  101. Conference paper
    D1
    “A Completeness Theory for Polynomial (Turing) Kernelization,” in Parameterized and Exact Computation (IPEC 2013), Sophia Antipolis, France, 2013.
  102. Article
    D1
    “Parameterized Two-player Nash Equilibrium,” Algorithmica, vol. 65, no. 4, 2013.
  103. Article
    D1
    “Unified Compression-based Acceleration of Edit-distance Computation,” Algorithmica, vol. 65, no. 2, 2013.
  104. Conference paper
    D1
    “Dividing Connected Chores Fairly,” in Algorithmic Game Theory (SAGT 2013), Aachen, Germany, 2013.
  105. Article
    D1
    “Altruism in Atomic Congestion Games,” ACM Transactions on Economics and Computation, vol. 1, no. 4, 2013.
  106. Conference paper
    D1
    “Truthfulness and Stochastic Dominance with Monetary Transfers,” in EC’13, 14th ACM Conference on Electronic Commerce, Philadelphia, PA, USA, 2013.
  107. Conference paper
    D1
    “Locally Stable Marriage with Strict Preferences,” in Automata, Languages, and Programming (ICALP 2013), Riga, Latvia, 2013.
  108. Conference paper
    D1
    “Brief Announcement: Threshold Load Balancing in Networks,” in PODC’13, ACM Symposium on Principles of Distributed Computing, Montréal, Canada, 2013.
  109. Conference paper
    D1
    “Brief Announcement: Universally Truthful Secondary Spectrum Auctions,” in SPAA ’13, 25th ACM Symposium on Parallelism in Algorithms and Architectures, Montréal, Canada, 2013.
  110. Conference paper
    D1
    “Designing Profit Shares in Matching and Coalition Formation Games,” in Web and Internet Economics (WINE 2013), Cambridge, MA, USA, 2013.
  111. Conference paper
    D1
    “Fair Matchings and Related Problems,” in 33rd International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013), Guwahati, India, 2013.
  112. Report
    D1
    “New Results for Non-preemptive Speed Scaling,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-2013-1-001, 2013.
  113. Conference paper
    D1
    “Unambiguous Conjunctive Grammars over a One-letter Alphabet,” in Developments in Language Theory (DLT 2013), Marne-la-Vallée, France, 2013.
  114. Conference paper
    D1
    “Approximation of Grammar-based Compression via Recompression,” in Combinatorial Pattern Matching (CPM 2013), Bad Herrenalb, Germany, 2013.
  115. Conference paper
    D1
    “One-variable Word Equations in Linear Time,” in Automata, Languages, and Programming (ICALP 2013), Riga, Latvia, 2013.
  116. Conference paper
    D1
    “Recompression: A Simple and Powerful Technique for Word Equations,” in 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), Kiel, Germany, 2013.
  117. Article
    D1
    “Hyper-minimization for Deterministic Tree Automata,” International Journal of Foundations of Computer Science, vol. 24, no. 6, 2013.
  118. Conference paper
    D1
    “Recompression: Word Equations and Beyond,” in Developments in Language Theory (DLT 2013), Marne-la-Vallée, France, 2013.
  119. Conference paper
    D1
    “Algorithms to Measure Diversity and Clustering in Social Networks through Dot Product Graphs,” in Algorithms and Computation (ISAAC 2013), Hong Kong, China, 2013.
  120. Thesis
    D1IMPR-CS
    “Toward Better Computation Models for Modern Machines,” Universität des Saarlandes, Saarbrücken, 2013.
  121. Conference paper
    D1
    “The Cost of Address Translation,” in Proceedings of the 15th Meeting on Algorithm Engineering and Experiments (ALENEX 2013), New Orleans, LA, USA, 2013.
  122. Article
    D1
    “Deterministic Polynomial-time Algorithms for Designing short DNA Words,” Theoretical Computer Science, vol. 494, 2013.
  123. Conference paper
    D1
    “Blinking Molecule Tracking,” in Experimental Algorithms (SEA 2013), Rome, Italy, 2013.
  124. Conference paper
    D1
    “Approximate Čech Complex in Low and High Dimensions,” in Algorithms and Computation (ISAAC 2013), Hong Kong, China, 2013.
  125. Conference paper
    D1
    “Persistent Homology and Nested Dissection,” in 23rd Fall Workshop on Computational Geometry 2013 (FWCG 2013), Manhattan, NY, USA, 2013.
  126. Paper
    D1
    “Embedding the Dual Complex of Hyper-rectangular Partitions,” 2013. [Online]. Available: http://arxiv.org/abs/1207.3202.
  127. Conference paper
    D1
    “3D Kinetic Alpha Complexes and their Implementation,” in Proceedings of the 15th Meeting on Algorithm Engineering and Experiments (ALENEX 2013), New Orleans, LA, USA, 2013.
  128. Article
    D1
    “Embedding the Dual Complex of Hyper-rectangular Partitions,” Journal of Computational Geometry, vol. 4, no. 1, 2013.
  129. Conference paper
    D1
    “Balls into Bins Made Faster,” in Algorithms - ESA 2013, Sophia Antipolis, France, 2013.
  130. Paper
    D1
    “Fast Approximate Polynomial Multipoint Evaluation and Applications,” 2013. [Online]. Available: http://arxiv.org/abs/1304.8069.
  131. “Community Analysis Using Local Random Walks,” Universität des Saarlandes, Saarbrücken, 2013.
  132. Article
    D1
    “Nonpreemptive Coordination Mechanisms for Identical Machines,” Theory of Computing Systems, vol. 53, no. 3, 2013.
  133. Article
    D1
    “Shattering, Graph Orientations and Connectivity,” The Electronic Journal of Combinatorics, vol. 20, no. 3, 2013.
  134. Article
    D1
    “Two Edge Modification Problems without Polynomial Kernels,” Discrete Optimization, vol. 10, no. 3, 2013.
  135. Paper
    D1
    “Point Line Cover: The Easy Kernel is Essentially Tight,” 2013. [Online]. Available: http://arxiv.org/abs/1307.2521.
  136. Conference paper
    D1
    “Large-scale Joint Map Matching of GPS Traces,” in 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (ACM SIGSPATIAL GIS 2013), Orlando, FL, USA, 2013.
  137. Conference paper
    D1
    “Hardness of r-DOMINATING SET on Graphs of Diameter (r + 1),” in Parameterized and Exact Computation (IPEC 2013), Sophia Antipolis, France, 2013.
  138. Report
    D5D1
    “A Distributed Algorithm for Large-scale Generalized Matching,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-2013-5-002, 2013.
  139. Article
    D5D1
    “A Distributed Algorithm for Large-scale Generalized Matching,” Proceedings of the VLDB Endowment (Proc. VLDB 2013), vol. 6, no. 9, 2013.
  140. Conference paper
    D1
    “Instance-sensitive Robustness Guarantees for Sequencing with Unknown Packing and Covering Constraints,” in ITCS’13, 4th Conference on Innovations in Theoretical Computer Science, Berkeley, CA, USA, 2013.
  141. Conference paper
    D1
    “Dual Techniques for Scheduling on a Machine with Varying Speed,” in Automata, Languages, and Programming (ICALP 2013), Riga, Latvia, 2013.
  142. Paper
    D1
    “Competitive-ratio Approximation Schemes for Minimizing the Makespan in the Online-list Model,” 2013. [Online]. Available: http://arxiv.org/abs/1303.1912.
  143. Paper
    D1
    “Certifying 3-Edge-Connectivity,” 2013. [Online]. Available: http://arxiv.org/abs/1211.6553.
  144. Conference paper
    D1
    “Physarum Computations (Invited talk),” in 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), Kiel, Germany, 2013.
  145. Proceedings
    D1
    Eds., Publication Culture in Computing Research, no. 11. Schloss Dagstuhl, 2013.
  146. Paper
    D1
    “From Approximate Factorization to Root Isolation with Application to Cylindrical Algebraic Decomposition,” 2013. [Online]. Available: http://arxiv.org/abs/1301.4870.
  147. Conference paper
    D1
    “Certifying 3-Edge-Connectivity,” in Graph-theoretic Concepts in Computer Science (WG 2013), Lübeck, Germany, 2013.
  148. Conference paper
    D1
    “From Approximate Factorization to Root Isolation,” in ISSAC 2013, 38th International Symposium on Symbolic and Algebraic Computation, Boston, MA, USA, 2013.
  149. Article
    D1
    “Explosive Percolation in Erdös-Rényi-like Random Graph Processes,” Combinatorics, Probability and Computing, vol. 22, no. 1, 2013.
  150. Conference paper
    D1
    “Faster Rumor Spreading with Multiple Calls,” in Algorithms and Computation (ISAAC 2013), Hong Kong, China, 2013.
  151. Article
    D1
    “An Axiomatic Characterization of the Single-source Shortest Path Problem,” Archive of Formal Proofs, 2013.
  152. Paper
    D1
    “Computing Real Roots of Real Polynomials,” 2013. [Online]. Available: http://arxiv.org/abs/1308.4088.
  153. Article
    D1
    “A Case of Depth-3 Identity Testing, Sparse Factorization and Duality,” Computational Complexity, vol. 22, no. 1, 2013.
  154. Article
    D1
    “Real-time Integrated Prefetching and Caching,” Journal of Scheduling, vol. 16, no. 1, 2013.
  155. Article
    D1
    “Clustering With or Without the Approximation,” Journal of Combinatorial Optimization, vol. 25, no. 3, 2013.
  156. Conference paper
    D1
    “A Planarity Test via Construction Sequences,” in Mathematical Foundations of Computer Science 2013 (MFCS 2013), Klosterneuburg, Austria, 2013.
  157. Paper
    D1
    “The Mondshein Sequence,” 2013. [Online]. Available: http://arxiv.org/abs/1311.0750.
  158. Article
    D1
    “A Simple Test on 2-vertex- and 2-edge-connectivity,” Information Processing Letters, vol. 113, no. 7, 2013.
  159. Article
    D1
    “Contractions, Removals and Certifying 3-connectivity in Linear Time,” SIAM Journal on Scientific Computing, vol. 42, no. 2, 2013.
  160. Paper
    D1
    “Counting Hypergraphs in Data Streams,” 2013. [Online]. Available: http://arxiv.org/abs/1304.7456.
  161. Conference paper
    D1
    “Approximating the Configuration-LP for Minimizing Weighted Sum of Completion Times on Unrelated Machines,” in Integer Programming and Combinatorial Optimization (IPCO 2013), Valparaíso, Chile, 2013.
  162. Conference paper
    D1
    “Locating Lucrative Passengers for Taxicab Drivers,” in 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (ACM SIGSPATIAL GIS 2013), Orlando, FL, USA, 2013.
  163. Article
    D1
    “SIGACT News Online Algorithms Column 22,” SIGACT News, vol. 44, no. 2, 2013.
  164. Conference paper
    D1
    “Abusing the Tutte Matrix: An Algebraic Instance Compression for the K-set-cycle Problem,” in 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), Kiel, Germany, 2013.
  165. Article
    D1
    “Partitioned EDF Scheduling on a Few Types of Unrelated Multiprocessors,” Real-Time Systems, vol. 49, no. 2, 2013.
  166. Article
    D1
    “Direction-reversing Quasi-random Rumor Spreading with Restarts,” Information Processing Letters, vol. 113, no. 22–24, 2013.
  167. Article
    D1
    “A Novel Method for Automatic Single Molecule Tracking of Blinking Molecules at Low Intensities,” Physical Chemistry Chemical Physics, vol. 15, no. 17, 2013.
  168. Conference paper
    D1
    “Analytic Root Clustering: A Complete Algorithm Using Soft Zero Tests,” in The Nature of Computation (CiE 2013), Milan, Italy, 2013.
  169. Conference paper
    D1
    “Geometric Registration Based on Distortion Estimation,” in ICCV 2013, IEEE International Conference on Computer Vision, Sydney, Australia, 2013.

2012

  1. Conference paper
    D1
    “Preemptive Coordination Mechanisms for Unrelated Machines,” in Algorithms - ESA 2012, Ljubljana, Slovenia, 2012.
  2. Article
    D1
    “The Query Complexity of Finding a Hidden Permutation,” Electronic Colloquium on Computational Complexity (ECCC) : Report Series, vol. 87 (Revision 1), 2012.
  3. Article
    D1
    “The Deterministic and Randomized Query Complexity of a Simple Guessing Game,” Electronic Colloquium on Computational Complexity (ECCC) : Report Series, vol. 87, 2012.
  4. Conference paper
    D1
    “Jacobian Hits Circuits: Hitting-Sets, Lower Bounds for Depth-D Occur-k Formulas & Depth-3 Transcendence Degree-k Circuits,” in Proceedings of the 2012 ACM Symposium on Theory of Computing (STOC 2012), New York, NY, 2012.
  5. Article
    D1
    “Quasi-polynomial Hitting-set for Set-depth-delta Formulas,” arXiv, vol. abs/1209.2333, 2012.
  6. Article
    D1
    “Improved Approximation Algorithms for Bipartite Correlation Clustering,” SIAM Journal on Computing, vol. 41, no. 5, 2012.
  7. Article
    D1
    “Conflict-free Coloring for Rectangle Ranges Using O(n.382) Colors,” Discrete & Computational Geometry, vol. 48, no. 1, 2012.
  8. Conference paper
    D1
    “A Simple Approach for Adapting Continuous Load Balancing Processes to Discrete Settings,” in Proceedings of the 2012 ACM Symposium on Principles of Distributed Computing (PODC 2012), Madeira, Portugal, 2012.
  9. Article
    D1BIO
    “Efficient Key Pathway Mining: Combining Networks and OMICS Data,” Integrative Biology, vol. 4, no. 7, 2012.
  10. Conference paper
    D1
    “Counting Crossing Free Structures,” in Proceedings of the Twenty-Eight Annual Symposium on Computational Geometry (SCG 2012), Chapel Hill, NC, USA, 2012.
  11. Conference paper
    BIOD1
    “Efficient Algorithms for Extracting Biological Key Pathways with Global Constraints,” in GECCO’12, Fourteenth International Conference on Genetic and Evolutionary Computation, Philadelphia, PA, 2012.
  12. Thesis
    D1
    “The Bolzano Method to Isolate the Roots of a Bitstream Polynomial,” Universität des Saarlandes, Saarbrücken, 2012.
  13. Article
    D1
    “Probabilistic One-player Ramsey Games via Deterministic Two-player Games,” SIAM Journal on Discrete Mathematics, vol. 26, no. 3, 2012.
  14. Paper
    D1
    “Exact Symbolic-numeric Computation of Planar Algebraic Curves,” 2012. [Online]. Available: http://arxiv.org/abs/1201.1548v1.
  15. Article
    D1
    “Deconstructing Approximate Offsets,” Discrete & Computational Geometry, vol. 48, no. 4, 2012.
  16. Conference paper
    D1
    “Physarum Can Compute Shortest Paths,” in Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2012), Kyoto, Japan, 2012.
  17. Article
    D1
    “Physarum Can Compute Shortest Paths,” Journal of Theoretical Biology, vol. 309, 2012.
  18. Article
    D1
    “Algorithms and Complexity for Periodic Real-time Scheduling,” ACM Transactions on Algorithms, vol. 9, no. 1, 2012.
  19. Article
    D1
    “Feasibility Analysis of Sporadic Real-time Multiprocessor Task Systems,” Algorithmica, vol. 63, no. 4, 2012.
  20. Article
    D1
    “A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling,” Algorithmica, vol. 62, no. 3–4, 2012.
  21. Article
    D1
    “On Nash Equilibria and Improvement Cycles in Pure Positional Strategies for Chess-Like and Backgammon-Like n-Person Games,” Discrete Mathematics, vol. 312, no. 4, 2012.
  22. Article
    D1
    “Extremal Subgraphs of Random Graphs,” Random Structures & Algorithms, vol. 41, no. 2, 2012.
  23. Conference paper
    D1
    “Convergence of Hypervolume-based Archiving Algorithms II: Competitiveness,” in GECCO’12, Fourteenth International Conference on Genetic and Evolutionary Computation, Philadelphia, PA, 2012.
  24. Paper
    D1
    “Remarks on Category-based Routing in Social Networks,” 2012. [Online]. Available: http://arxiv.org/abs/1202.2293.
  25. Conference paper
    D1
    “Efficient Sampling Methods for Discrete Distributions,” in Automata, Languages, and Programming (ICALP 2012), Warwick, UK, 2012.
  26. Article
    D1
    “Approximating the Least Hypervolume Contributor: NP-hard in General, But Fast in Practice,” Theoretical computer science, vol. 425, 2012.
  27. Article
    D1
    “An Improved Algorithm for Klee’s Measure Problem on Fat Boxes,” Computational Geometry: Theory and Applications, vol. 45, no. 5–6, 2012.
  28. Paper
    D1
    “Dichotomy for Holant Problems with a Function on Domain Size 3,” 2012. [Online]. Available: http://arxiv.org/abs/1207.2354.
  29. Conference paper
    D1
    “Charge Group Partitioning in Biomolecular Simulation,” in Research in Computational Molecular Biology : 16th Annual International Conference (RECOMB 2012), Barcelona, Spain, 2012.
  30. Article
    D1
    “Learning Secrets Interactively. Dynamic Modeling in Inductive Inference,” Information and Computation, vol. 220–221, 2012.
  31. Article
    D1
    “Computability-theoretic Learning Complexity,” Philosophical Transaction of the Royal Society A, vol. 370, no. 1971, 2012.
  32. Paper
    D1
    “Geometric Pricing: How Low Dimensionality Helps in Approximability,” 2012. [Online]. Available: https://arxiv.org/abs/1202.2840.
  33. Article
    D1
    “A Note on Sorting Buffers Offline,” Theoretical Computer Science, vol. 423, 2012.
  34. Article
    D1
    “Continuous Monitoring of Distributed Data Streams over a Time-Based Sliding Window,” Algorithmica, vol. 62, no. 3–4, 2012.
  35. Conference paper
    D1
    “The Price of Anarchy for Selfish Ring Routing is Two,” in Internet and Network Economics (WINE 2012), Liverpool, UK, 2012.
  36. Thesis
    D1IMPR-CS
    “Algorithmic Aspects of Abstract Argumentation Frameworks,” Universität des Saarlandes, Saarbrücken, 2012.
  37. Conference paper
    D1
    “Deliberative Acceptability of Arguments,” in Proceedings of the Sixth Starting AI Researchers’ Symposium (STAIRS 2012), Montpellier, France, 2012, vol. 241.
  38. Conference paper
    D1
    “On Problems as Hard as CNF-SAT,” in 2012 IEEE 27th Conference on Computational Complexity (CCC 2012), Porto, Portugal, 2012.
  39. Conference paper
    D1
    “Clique Cover and Graph Separation: New Incompressibility Results,” in Automata, Languages, and Programming (ICALP 2012), Warwick, UK, 2012.
  40. Proceedings
    D1
    Eds., Automata, Languages, and Programming. Springer, 2012.
  41. Proceedings
    D1
    Eds., Automata, Languages, and Programming. Springer, 2012.
  42. Article
    D1
    “A Self-learning Algebraic Multigrid Method for Extremal Singular Triplets and Eigenpairs,” SIAM Journal on Scientific Computing, vol. 34, no. 4, 2012.
  43. Article
    D1
    “A Nonlinear GMRES Optimization Algorithm for Canonical Tensor Decomposition,” SIAM Journal on Scientific Computing, vol. 34, no. 3, 2012.
  44. Article
    D1IMPR-CS
    “Multiplicative Drift Analysis,” Algorithmica, vol. 64, no. 4, 2012.
  45. Paper
    D1
    “A Lower Bound for the Discrepancy of a Random Point Set,” 2012. [Online]. Available: http://arxiv.org/abs/1210.0572.
  46. Conference paper
    D1
    “Asynchronous Rumor Spreading In Preferential Attachment Graphs,” in Algorithm Theory - SWAT 2012, Helsinki, Finland, 2012.
  47. Conference paper
    D1
    “Black-Box Complexity: Breaking the O(n logn) Barrier of LeadingOnes,” in Artificial Evolution (EA 2011), Angers, France, 2012.
  48. Conference paper
    D1
    “Ants Easily Solve Stochastic Shortest Path Problems,” in GECCO’12, Fourteenth International Conference on Genetic and Evolutionary Computation, Philadelphia, PA, 2012.
  49. Paper
    D1
    “Playing Mastermind with Many Colors,” 2012. [Online]. Available: http://arxiv.org/abs/1207.0773.
  50. Conference paper
    D1
    “Experimental Analysis of Rumor Spreading In Social Networks,” in Design and Analysis of Algorithms (MedAlg 2012), Ein Gedi, Israel, 2012.
  51. Conference paper
    D1
    “Black-Box Complexity: From Complexity Theory to Playing Mastermind,” in GECCO’12, Fourteenth International Conference on Genetic and Evolutionary Computation, Philadelphia, PA, 2012.
  52. Conference paper
    D1
    “Playing Mastermind with Constant-size Memory,” in 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012), Paris, France, 2012.
  53. Article
    D1
    “Memory-Restricted Black-Box Complexity of OneMax,” Information Processing Letters, vol. 112, 2012.
  54. Conference paper
    D1
    “Run-time Analysis Of the (1+1) Evolutionary Algorithm Optimizing Linear Functions Over a Finite Alphabet,” in GECCO’12, Fourteenth International Conference on Genetic and Evolutionary Computation, Philadelphia, PA, 2012.
  55. Article
    D1
    “Crossover Can Provably be Useful in Evolutionary Computation,” Theoretical Computer Science, vol. 425, 2012.
  56. Article
    D1
    “Non-existence of Linear Universal Drift Functions,” Theoretical Computer Science, vol. 436, 2012.
  57. Conference paper
    D1
    “Reducing the Arity in Unbiased Black-Box Complexity,” in GECCO’12, Fourteenth International Conference on Genetic and Evolutionary Computation, Philadelphia, PA, 2012.
  58. Article
    D1
    “Why Rumors Spread Fast in Social Networks,” Communications of the ACM, vol. 55, 2012.
  59. Article
    D1
    “Complexity of Approximating the Vertex Centroid of a Polyhedron,” Theoretical Computer Science, vol. 421, 2012.
  60. Article
    D1
    “On the Complexity of the Highway Problem,” Theoretical Computer Science, vol. 460, 2012.
  61. Conference paper
    D1
    “Approximation Algorithms for the Unsplittable Flow Problem on Paths and Trees,” in 32nd International Conference on Foundations of Software Technology and Theoretical Computer Science : FSTTCS 2012, Hyderabad, India, 2012.
  62. Conference paper
    D1
    “A QPTAS for ε-Envy-free Profit-maximizing Pricing on Line Graphs,” in Automata, Languages, and Programming (ICALP 2012), Warwick, UK, 2012.
  63. Conference paper
    D1
    “Simpler Approximation of the Maximum Asymmetric Traveling Salesman Problem,” in 29th International Symposium on Theoretical Aspects of Computer Science : STACS’12, Paris, France, 2012.
  64. Article
    D1
    “Guarding 1.5D Terrains with Demands,” International Journal of Computer Mathematics, vol. 89, no. 16, 2012.
  65. Conference paper
    D1
    “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), Amsterdam, 2012.
  66. Article
    D1
    “The relation of Connected Set Cover and Group Steiner Tree,” Theoretical Computer Science, vol. 438, 2012.
  67. Article
    D1
    “Enumerating Trichromatic Triangles Containing the Origin in Linear Time,” Journal of Discrete Algorithms, vol. 17, 2012.
  68. Article
    D1
    “An O(n+ m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs,” Algorithmica, vol. 62, no. 3, 2012.
  69. Conference paper
    D1
    “On the Complexity of Solving a Bivariate Polynomial System,” in ISSAC 2012, 37th International Symposium on Symbolic and Algebraic Computation, Grenoble, France, 2012.
  70. Thesis
    D1IMPR-CS
    “Harnessing the Power of GPUs for Problems in Real Algebraic Geometry,” Universität des Saarlandes, Saarbrücken, 2012.
  71. Conference paper
    D1
    “Online Scheduling of Jobs with Fixed Start Times on Related Machines,” in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2012), Cambridge, MA, 2012.
  72. Article
    D1
    “Universal Sequencing on an Unreliable Machine,” SIAM Journal on Computing, vol. 41, no. 3, 2012.
  73. Article
    D1
    “Approximation Schemes for Packing Splittable Items with Cardinality Constraints,” Algorithmica, vol. 62, 2012.
  74. Article
    D1
    “The Price of Anarchy on Uniformly Related Machines Revisited,” Information and Computation, vol. 212, 2012.
  75. Thesis
    D1
    “Stochastic Optimization with Fitness Proportional Ant Systems,” Universität des Saarlandes, Saarbrücken, 2012.
  76. Article
    D1
    “Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications,” Algorithmica, vol. 64, no. 1, 2012.
  77. Conference paper
    D1
    “Ultra-fast Rumor Spreading in Social Networks,” in Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), Kyoto, Japan, 2012.
  78. Article
    D1
    “Tight Load Thresholds for Cuckoo Hashing,” Random Structures and Algorithms, vol. 41, no. 3, 2012.
  79. Thesis
    D1IMPR-CS
    “Randomized Rumor Spreading in Social Networks & Complete Graphs,” Universität des Saarlandes, Saarbrücken, 2012.
  80. Article
    D1
    “Quasirandom Load Balancing,” SIAM Journal on Computing, vol. 41, no. 4, 2012.
  81. Conference paper
    D1
    “Faster Algorithm for Computing the Edit Distance between SLP-Compressed Strings,” in String Processing and Information Retrieval (SPIRE 2012), Cartagena de Indias, Colombia, 2012.
  82. Conference paper
    D1
    “Tying Up the Loose Ends in Fully LZW-compressed Pattern Matching,” in 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012), Paris, France, 2012.
  83. Conference paper
    D1
    “Simple and Efficient LZW-compressed Multiple Pattern Matching,” in Combinatorial Pattern Matching (CPM 2012), Helsinki, Finland, 2012.
  84. Conference paper
    D1
    “Rumor Spreading and Vertex Expansion,” in Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), Kyoto, Japan, 2012.
  85. Conference paper
    D1
    “Low Randomness Rumor Spreading via Hashing,” in 29th International Symposium on Theoretical Aspects of Computer Science : STACS’12, Paris, France, 2012.
  86. Article
    D1
    “Hardness of Discrepancy Computation and ε-Net Verification in High Dimension,” Journal of Complexity, vol. 28, no. 2, 2012.
  87. Article
    D1
    “A New Randomized Algorithm to Approximate the Star Discrepancy Based on Threshold Accepting,” SIAM Journal on Numerical Analysis, vol. 50, no. 2, Apr. 2012.
  88. Article
    D1
    “Absolute Approximation Ratios for Packing Rectangles into Bins,” Journal of Scheduling, vol. 15, no. 1, Feb. 2012.
  89. Conference paper
    D1
    “Improved Lower Bound for Online Strip Packing,” in Approximation and Online Algorithms (WAOA 2011), Saarbruecken, 2012.
  90. Article
    D1
    “Learning in the Limit with Lattice-structured Hypothesis Spaces,” Theoretical Computer Science, vol. 457, 2012.
  91. Conference paper
    D1
    “Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph,” in Algorithms and Computation (ISAAC 2012), Taipei, Taiwan, 2012.
  92. Conference paper
    D1
    “Weak Compositions and Their Applications to Polynomial Lower Bounds for Kernelization,” in Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), Tokyo, Japan, 2012.
  93. Conference paper
    D1
    “Optimization Problems in Dotted Interval Graphs,” in Graph-Theoretic Concepts in Computer Science (WG 2012), Jerusalem, Israel, 2012.
  94. Conference paper
    D1
    “Parameterized Complexity of Induced H-Matching on Claw-Free Graphs,” in Algorithms - ESA 2012, Ljubljana, Slovenia, 2012.
  95. Thesis
    D1
    “Dividing Connected Chores Fairly,” Universität des Saarlandes, Saarbrücken, 2012.
  96. Article
    D1
    “On Eulerian Extensions and their Application to No-Wait Flowshop Scheduling,” Journal of Scheduling, vol. 15, 2012.
  97. Conference paper
    D1
    “Enlarging Learnable Classes,” in Algorithmic Learning Theory (ALT 2012), Lyon, France, 2012.
  98. Paper
    D1
    “The Cost of Address Translation,” 2012. [Online]. Available: http://arxiv.org/abs/1212.0703.
  99. Conference paper
    D1
    “Counting Arbitrary Subgraphs in Data Streams,” in Automata, Languages, and Programming (ICALP 2012), Warwick, UK, 2012.
  100. Article
    D1
    “Max-Coloring Paths: Tight Bounds and Extensions,” Journal of Combinatorial Optimization, vol. 24, 2012.
  101. Article
    D1
    “On the Sum of Square Roots of Polynomials and Related Problems,” The ACM Transactions on Computation Theory, vol. 4, no. 4, 2012.
  102. Article
    D1
    “A Worst-Case Bound for Topology Computation of Algebraic Curves,” Journal of Symbolic Computation, vol. 47, no. 3, 2012.
  103. Conference paper
    D1
    “A Single-exponential FPT Algorithm for the K4-Minor Cover Problem,” in Algorithm Theory - SWAT 2012, Helsinki, Finland, 2012.
  104. Article
    D1
    “Largest Inscribed Rectangles in Convex Polygons,” Journal of Discrete Algorithms, vol. 13, 2012.
  105. Conference paper
    D1
    “ACO Beats EA on a Dynamic Pseudo-Boolean Function,” in Parallel Problem Solving from Nature - PPSN XII, Taormina, Italy, 2012.
  106. Conference paper
    D1
    “The Max Problem Revisited: the Importance of Mutation in Genetic Programming,” in GECCO’12, Fourteenth International Conference on Genetic and Evolutionary Computation, Philadelphia, PA, 2012.
  107. Article
    D1
    “Theoretical Analysis of Two ACO Approaches for the Traveling Salesman Problem,” Swarm Intelligence, vol. 6, no. 1, 2012.
  108. Conference paper
    D1
    “Fixed-parameter Tractability of Multicut in Directed Acyclic Graphs,” in Automata, Languages, and Programming (ICALP 2012), Warwick, UK, 2012.
  109. Conference paper
    D1
    “Representative Sets and Irrelevant Vertices: New Tools for Kernelization,” in IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS-12), New Brunswick, NJ, 2012.
  110. Conference paper
    D1
    “Compression Via Matroids: A Randomized Polynomial Kernel for Odd Cycle Transversal,” in Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), Kyoto, Japan, 2012.
  111. Article
    D1
    “Creating Small Subgraphs in Achlioptas Processes with Growing Parameter,” SIAM Journal on Discrete Mathematics, vol. 26, no. 2, 2012.
  112. Thesis
    D1
    “Finding Cliques in Scale-Free Networks,” Universität des Saarlandes, Saarbrücken, 2012.
  113. Conference paper
    D1
    “Subexponential Parameterized Odd Cycle Transversal on Planar Graphs,” in 32nd International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012), Hyderabad, India, 2012.
  114. Article
    D1
    “Online Graph Exploration: New Results on Old and New Algorithms,” Theoretical Computer Science, vol. 463, 2012.
  115. Conference paper
    D1
    “The Power of Recourse for Online MST and TSP,” in Automata, Languages, and Programming (ICALP 2012), Warwick, 2012.
  116. Article
    D1
    “CGTA-Awards 2011,” Computational Geometry: Theory and Applications, vol. 45, no. 4, 2012.
  117. Article
    D1
    “Beyond Good Partition Shapes: An Analysis of Diffusive Graph Partitioning,” Algorithmica, vol. 64, no. 3, 2012.
  118. Article
    D1
    “FPT Algorithms for Connected Feedback Vertex Set,” Journal of Combinatorial Optimization, vol. 24, no. 2, 2012.
  119. Article
    D1
    “On Parameterized Independent Feedback Vertex Set,” Theoretical Computer Science, vol. 461, Feb. 2012.
  120. Conference paper
    D1
    “Beyond Max-cut: Lambda-extendible Properties Parameterized Above the Poljak-Turzík Bound,” in IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012), Hyderabad, India, 2012.
  121. Thesis
    D1
    “ACO Beats EA on a Dynamic Pseudo-Boolean Function,” Universität des Saarlandes, Saarbrücken, 2012.
  122. Thesis
    D1IMPR-CS
    “Shattering Extremal Systems,” Universität des Saarlandes, Saarbrücken, 2012.
  123. Article
    D1
    “Mod/Resc Parsimony Inference : Theory and Application,” Information and Computation, vol. 213, no. S1, 2012.
  124. Thesis
    D1IMPR-CS
    “General Analysis Tool Box for Controlled Perturbation Algorithms and Complexity and Computation of Θ-Guarded Regions,” Universität des Saarlandes, Saarbrücken, 2012.
  125. Thesis
    D1
    “Thou Shalt Not Lie : On Truthfully Maximizing the Minimum Load On Selfish Related Machines,” Universität des Saarlandes, Saarbrücken, 2012.
  126. Conference paper
    D1
    “Catching the k-NAESAT Threshold,” in STOC’12, ACM Symposium on Theory of Computing, New York, NY, 2012.
  127. Article
    D1
    “Vertices of Degree k in Random Unlabeled Trees,” Journal of Graph Theory, vol. 69, no. 2, 2012.
  128. Article
    D1
    “Polynomial Kernels for Dominating Set in Graphs of Bounded Degeneracy and Beyond,” ACM Transactions on Algorithms, vol. 9, no. 1, 2012.
  129. Conference paper
    D1
    “On the Integrality Gap of the Subtour LP for the 1,2-TSP,” in LATIN 2012, 10th Latin American Symposium on Theoretical Informatics, Arequipa, Peru, 2012.
  130. Article
    D1
    “Exaktes geometrisches Rechnen,” Jahrbuch der Max-Planck-Gesellschaft, 2012.
  131. Conference paper
    D1
    “When Newton meets Descartes: A Simple and Fast Algorithm to Isolate the Real Roots of a Polynomial,” in ISSAC 2012, 37th International Symposium on Symbolic and Algebraic Computation, Grenoble, France, 2012.
  132. Conference paper
    D1
    “Tight Bounds for Randomized Load Balancing on Arbitrary Network Topologies,” in IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS-12), New Brunswick, NJ, 2012.
  133. Conference paper
    D1
    “A Proof of the Boyd-Carr Conjecture,” in Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), Kyoto, Japan, 2012.
  134. Conference paper
    D1
    “Certifying 3-Connectivity in Linear Time,” in Automata, Languages, and Programming (ICALP 2012), Warwick, UK, 2012.
  135. Conference paper
    D1
    “Cubic Plane Graphs on a Given Point Set,” in Proceedings of the Twenty-Eighth Annual Symposium on Computational Geometry (SCG’12), Chapel Hill, North Carolina, 2012.
  136. Article
    D1
    “Construction Sequences and Certifying 3-Connectivity,” Algorithmica, vol. 62, no. 1–2, 2012.
  137. Article
    D1
    “Decompositions of Large-Scale Biological Systems Based on Dynamical Properties,” Bioinformatics, vol. 28, no. 1, Jan. 2012.
  138. Article
    D1
    “SIGACT News Online Algorithms Column 21: APPROX and ALGO,” SIGACT News, vol. 43, no. 4, 2012.
  139. Article
    D1
    “SIGACT News Online Algorithms Column 20: The Power of Harmony,” SIGACT News, vol. 43, no. 2, 2012.
  140. Article
    D1
    “An Improved Algorithm for Online Rectangle Filling,” Theoretical Computer Science, vol. 423, 2012.
  141. Conference paper
    D1
    “Simpler 3/4-Approximation Algorithms for MAX SAT,” in Approximation and Online Algorithms (WAOA 2011), Saarbrücken, 2012.
  142. Thesis
    D1
    “Certification of Curve Arrangements,” Universität des Saarlandes, Saarbrücken, 2012.

2011

  1. Thesis
    D1IMPR-CS
    “Coordination Mechanisms for Unrelated Machine Scheduling,” Universität des Saarlandes, Saarbrücken, 2011.
  2. Conference paper
    D1
    “Improved Approximation Algorithms for Bipartite Correlation Clustering,” in Algorithms - ESA 2011, Saarbrücken, Germany, 2011.
  3. Conference paper
    D1
    “Verification of Certifying Computations,” in Computer Aided Verification, Snowbird, Utah, USA, 2011.
  4. Article
    IMPR-CSD1
    “An Introduction to Certifying Algorithms,” Information technology, vol. 53, no. 6, 2011.
  5. Article
    D1
    “Approximation Algorithms for the Interval Constrained Coloring Problem,” Algorithmica, vol. 61, no. 2, 2011.
  6. Conference paper
    D1
    “On the Low-dimensional Steiner Minimum Tree Problem in Hamming Metric,” in Theory and Applications of Models of Computation (TAMC 2011), Tokyo, Japan, 2011.
  7. Paper
    D1
    “Improved Minimum Cycle Bases Algorithms by Restriction to Isometric Cycles.” 2011.
  8. Conference paper
    D1
    “Meeting Deadlines: How much Speed Suffices?,” in Automata, Languages and Programming (ICALP 2011), Zurich, Switzerland, 2011.
  9. Conference paper
    D1
    “On the Benefit of Virtualization: Strategies for Flexible Server Allocation,” in Workshop on Hot Topics in Management of Internet, Cloud, and Enterprise Networks and Services (Hot-ICE 2011), Boston, MA, USA, 2011.
  10. Conference paper
    D1
    “Memory-constrained Algorithms for Shortest Path Problem,” in 23rd Annual Canadian Conference on Computational Geometry (CCCG 2011), Toronto, ON, 2011.
  11. Book
    D1
    Eds., Theory of Randomized Search Heuristics. Singapore: World Scientific Publishing, 2011.
  12. Article
    D1
    and Ki. Pruhs, “Competitive Algorithms for Due Date Schedulin,” Algorithmica, vol. 59, no. 4, 2011.
  13. Conference paper
    D1
    “Mixed-criticality Scheduling of Sporadic Task Systems,” in Algorithms - ESA 2011, Saarbrücken, Germany, 2011.
  14. Article
    D1
    “Minimum Vertex Cover in Rectangle Graphs,” Computational Geometry, vol. 44, no. 6–7, 2011.
  15. Article
    D1
    “Additive Spanners and (α, β)-Spanners,” ACM Transactions on Algorithms, vol. 7, no. 1, 2011.
  16. Article
    D1
    “Energy-Efficient Paths in Radio Networks,” Algorithmica, vol. 61, no. 2, 2011.
  17. Book chapter / section
    D1
    “The Knapsack Problem,” in Algorithms Unplugged, Berlin: Springer, 2011.
  18. Article
    D1
    “Treewidth Governs the Complexity of Target Set Selection,” Discrete Optimization, vol. 8, no. 1, 2011.
  19. Conference paper
    D1
    “Deconstructing Approximate Offsets,” in Proceedings of the 27th Annual Symposium on Computational Geometry (SCG’11), Paris, France, 2011.
  20. Article
    D1
    “Deconstructing Approximate Offsets,” CoRR, vol. abs/1109.2158, 2011.
  21. Conference paper
    D1
    “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), San Francisco, CA, 2011.
  22. Conference paper
    D1
    “A Generic Algebraic Kernel for Non-linear Geometric Applications,” in Proceedings of the 27th Annual Symposium on Computational Geometry (SCG’11), Paris, France, 2011.
  23. Conference paper
    D1
    “Arrangement Computation for Planar Algebraic Curves,” in Proceedings of the 4th Internal Workshop on Symbolic-Numeric Computation, San Jose, USA, 2011.
  24. Article
    D1
    “Arrangement Computation for Planar Algebraic Curves,” CoRR, vol. abs/1103.4697, 2011.
  25. Conference paper
    D1
    “Faster Coupon Collecting via Replication with Applications in Gossiping,” in 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011. Proceedings, Warsaw, Poland, 2011.
  26. Conference paper
    D1
    “Randomized Diffusion for Indivisible Loads,” in Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), San Francisco, CA, 2011.
  27. Conference paper
    D1
    “Distributed Selfish Load Balancing on Networks,” in Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), San Francisco, CA, 2011.
  28. Article
    D1
    “Minimizing Flow Time in the Wireless Gathering Problem,” ACM Transactions on Algorithms, vol. 7, no. 3, 2011.
  29. Article
    D1
    “The Distributed Wireless Gathering Problem,” Theoretical Computer Science, vol. 412, no. 8–10, 2011.
  30. Conference paper
    D1
    “Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes,” in Automata, Languages and Programming (ICALP 2011), Zurich, Switzerland, 2011.
  31. Article
    D1
    “The Negative Cycles Polyhedron and Hardness of Checking Some Polyhedral Properties,” Annals of Operations Research, vol. 188, no. 1, 2011.
  32. Conference paper
    D1IMPR-CS
    “Approximation-guided Evolutionary Multi-objective Optimization,” in Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI 2011), Barcelona, Spain, 2011.
  33. Conference paper
    D1
    “Convergence of Hypervolume-Based Archiving Algorithms I: Effectiveness,” in GECCO 2011, Dublin, Ireland, 2011.
  34. Thesis
    D1
    “Analysis of the KIT email graph, with an application of randomized rumour spreading protocols,” Universität des Saarlandes, Saarbrücken, 2011.
  35. Conference paper
    D1
    “On Tree-constrained Matchings and Generalizations,” in Automata, Languages and Programming (ICALP 2011), Zurich, Switzerland, 2011.
  36. Conference paper
    D1
    “Measuring Learning Complexity with Criteria Epitomizers,” in 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011), Dortmund, Germany, 2011.
  37. Article
    D1
    “Nonclairvoyant Speed Scaling for Flow and Energy,” Algorithmica, vol. 61, no. 3, 2011.
  38. Conference paper
    D1
    “Scheduling for Weighted Flow Time and Energy with Rejection Penalty,” in 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011), Dortmund, Germany, 2011.
  39. Article
    D1
    “A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics,” Discrete & Computational Geometry, vol. 46, no. 4, 2011.
  40. Conference paper
    D1
    “Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms,” in Algorithms - ESA 2011, Saarbrücken, Germany, 2011.
  41. Article
    D1
    “Recursively Accelerated Multilevel Aggregation for Markov Chains,” SIAM Journal on Scientific Computing, vol. 32, no. 3, 2011.
  42. Conference paper
    D1
    “Drift Analysis,” in GECCO 2011, Dublin, Ireland, 2011.
  43. Conference paper
    D1
    “Asymptotically Optimal Randomized Rumor Spreading,” in Automata, Languages and Programming (ICALP 2011), Zürich, Switzerland, 2011.
  44. Conference paper
    D1
    “Runtime Analysis of the (1+1) Evolutionary Algorithm on Strings over Finite Alphabets,” in FOGA’11, 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, Schwarzenberg, Austria, 2011.
  45. Conference paper
    D1
    “Dependent Randomized Rounding: The Bipartite Case,” in 2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX 2011), San Francisco, California, USA, 2011.
  46. Conference paper
    D1
    “Too Fast Unbiased Black-box Algorithms,” in GECCO 2011, Dublin, Ireland, 2011.
  47. Conference paper
    D1
    “Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity,” in Computer Science - Theory and Applications (CSR 2011), St. Petersburg, Russia, 2011.
  48. Conference paper
    D1
    “Faster Black-box Algorithms Through Higher Arity Operators,” in FOGA’11, 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, Schwarzenberg, Austria, 2011.
  49. Article
    D1
    “Quasi-random Rumor Spreading: Reducing Randomness Can be Costly,” Information Processing Letters, vol. 111, no. 5, 2011.
  50. Conference paper
    D1
    “Sharp Bounds by Probability-generating Functions and Variable Drift,” in GECCO 2011, Dublin, Ireland, 2011.
  51. Article
    D1
    “Theory of Evolutionary Computation,” Algorithmica, vol. 59, no. 3, 2011.
  52. Conference paper
    D1
    “Social Networks Spread Rumors in Sublogarithmic Time,” in STOC ’11, 43rd ACM Symposium on Theory of Computing, San Jose, CA, USA, 2011.
  53. Article
    D1
    “Quasirandom Rumor Spreading: An Experimental Analysis,” ACM Journal of Experimental Algorithmics, vol. 16, 2011.
  54. Article
    D1
    “Runtime analysis of the 1-ANT ant colony optimizer,” Theoretical Computer Science, vol. 412, no. 17, 2011.
  55. Article
    D1
    “Asymptotically Optimal Randomized Rumor Spreading,” Electronic Notes in Discrete Mathematics, vol. 38, 2011.
  56. Conference paper
    D1
    “Stabilizing Consensus with the Power of Two Choices,” in SPAA’11, Twenty-Third Annual Symposium on Parallelism in Algorithms and Architectures, San Jose, USA, 2011.
  57. Article
    D1
    “Evolutionary Algorithms and Dynamic Programming,” Theoretical Computer Science, vol. 412, 2011.
  58. Conference paper
    D1
    “Black-box Complexities of Combinatorial Problems,” in GECCO 2011, 2011 Genetic and Evolutionary Computation Conference, Dublin, Ireland, 2011.
  59. Article
    D1
    “Tight Analysis of the (1+1)-EA for the Single Source Shortest Path Problem,” Evolutionary Computation, vol. 19, no. 4, 2011.
  60. Conference paper
    D1
    “Social Networks Spread Rumors in Sublogarithmic Time,” in The Sixth European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2011), Budapaest, 2011.
  61. Article
    D1BIO
    “Analyzing and Visualizing Residue Networks of Protein Structures,” Trends in Biochemical Sciences, vol. 36, no. 4, 2011.
  62. Book chapter / section
    D1
    “Multiplication of Long Integers -- Faster than Long Multiplication,” in Algorithms Unplugged, Berlin: Springer, 2011.
  63. Article
    D1
    “Improved Approximations for Guarding 1.5-Dimensional Terrains,” Algorithmica, vol. 60, no. 2, 2011.
  64. Article
    D1
    “Finding Simplices Containing the Origin in Two and Three Dimensions,” International Journal of Computational Geometry & Applications, vol. 21, no. 5, 2011.
  65. Article
    D1
    “On the Readability of Monotone Boolean Formulae,” Journal of Combinatorial Optimization, vol. 22, no. 3, 2011.
  66. Article
    D1
    “On a Cone Covering Problem,” Computational Geometry, vol. 44, no. 3, 2011.
  67. Conference paper
    D1
    “Enumerating Minimal Transversals of Geometric Hypergraphs,” in 23rd Canadian Conference on Computational Geometry (CCCG 2011), Toronto, Canada, 2011.
  68. Conference paper
    D1
    “High-performance Polynomial GCD Computations on Graphics Processors,” in Proceedings of the 2011 International Conference on High Performance Computing & Simulation (HPCS 2011), Istanbul, Turkey, 2011.
  69. Article
    D1
    “Improved Results for a Memory Allocation Problem,” Theory of Computing Systems, vol. 48, no. 1, 2011.
  70. Article
    D1
    “Max-min Online Allocations with a Reordering Buffer,” SIAM Journal on Discrete Mathematics, vol. 25, no. 3, 2011.
  71. Article
    D1
    “On the Online Unit Clustering Problem,” ACM Transactions on Algorithms, vol. 7, no. 1, 2011.
  72. Article
    D1
    “Succinct Representation of Dynamic Trees,” Theoretical Computer Science, vol. 412, no. 24, 2011.
  73. Conference paper
    D1
    “Constraint Satisfaction Problems: Convexity Makes All Different Constraints Tractable,” in Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI 2011), Barcelona, Spain, 2011.
  74. Article
    D1
    “Haplotype Inference Constrained by Plausible Haplotype Data,” IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 8, no. 6, 2011.
  75. Article
    D1
    “Upper and Lower Bounds for Finding Connected Motifs in Vertex-colored Graphs,” Journal of Computer and System Sciences, vol. 77, no. 4, 2011.
  76. Conference paper
    D1
    “Minimum Fill-in of Sparse Graphs: Kernelization and Approximation,” in 31st International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011), Mumbai, India, 2011.
  77. Conference paper
    D1
    “Hitting Forbidden Minors: Approximation and Kernelization,” in 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany, Dortmund, Germany, 2011.
  78. Conference paper
    D1
    “The Multiple-orientability Thresholds for Random Hypergraphs,” in Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), San Francisco, CA, 2011.
  79. Article
    D1
    “3-connected Cores In Random Planar Graphs,” Combinatorics, Probability & Computing, vol. 20, no. 3, 2011.
  80. Article
    D1
    “Average Update times for Fully-dynamic All-pairs Shortest Paths,” Discrete Applied Mathematics, vol. 159, no. 16, 2011.
  81. Conference paper
    D1
    “The Logarithmic Hypervolume Indicator,” in FOGA’11, 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, Schwarzenberg, Austria, 2011.
  82. Article
    D1
    “Illustration of Fairness in Evolutionary Multi-objective Optimization,” Theoretical Computer Science, vol. 412, no. 17, 2011.
  83. Article
    D1
    “Smoothed Analysis of Balancing Networks,” Random Structures & Algorithms, vol. 39, no. 1, 2011.
  84. Conference paper
    D1
    “Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions,” in 22nd International Symposium on Algorithms and Computation (ISAAC-11), 2011.
  85. Article
    D1
    “Power Assignment Problems in Wireless Communication: Covering Points by Disks, Reaching Few Receivers Quickly, and Energy-efficient Travelling Salesman Tours,” Ad Hoc Networks, vol. 9, no. 6, 2011.
  86. Paper
    D1
    “Distribution of Certain Sparse Spanning Subgraphs in Random Graphs,” 2011. [Online]. Available: http://arxiv.org/abs/1105.5913.
  87. Conference paper
    D1
    “On Balanced Coloring Games in Random Graphs,” in The Sixth European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2011), Budapest, 2011.
  88. Article
    D1
    “Guest Editorial: Selected Papers from European Symposium on Algorithms,” Algorithmica, vol. 60, no. 1, 2011.
  89. Conference paper
    D1
    “A (5/3 + ε)-Approximation for Strip Packing,” in Algorithms and Data Structures (WADS 2011), New York, NY, 2011.
  90. Article
    D1
    “A Complete, Exact and Efficient Implementation for Computing the Edge-adjacency Graph of an Arrangement of Quadrics,” Journal of Symbolic Computation, vol. 46, no. 4, 2011.
  91. Conference paper
    D1
    “Parameterized Two-player Nash Equilibrium,” in Graph-Theoretic Concepts in Computer Science (WG 2011), Teplá Monastery, Czech Republic, 2011.
  92. Conference paper
    D1
    “Distance Oracles for Vertex-Labeled Graphs,” in Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 2011.
  93. Article
    D1
    “Optimization Problems in Multiple Subtree Graphs,” Discrete Applied Mathematics, vol. 159, no. 7, 2011.
  94. Conference paper
    D1
    “Domination When the Stars Are Out,” in Automata, Languages and Programming (ICALP 2011), Zurich, Switzerland, 2011.
  95. Article
    D1
    “Bounded Unpopularity Matchings,” Algorithmica, vol. 61, no. 3, 2011.
  96. Thesis
    D1
    “Evolutionary algorithms to compute lower bounds for the star discrepancy,” Universität des Saarlandes, Saarbrücken, 2011.
  97. Article
    D1
    “Popular Mixed Matchings,” Theoretical Computer Science, vol. 412, no. 24, 2011.
  98. Article
    D1
    “New Approximation Algorithms for Minimum Cycle Bases of Graphs,” Algorithmica, vol. 59, no. 4, 2011.
  99. Conference paper
    D1
    “Efficient Real Root Approximation,” in ISSAC 2011, San Jose, CA, 2011.
  100. Article
    D1
    “A Note on the Complexity of Real Algebraic Hypersurfaces,” Graphs and Combinatorics, vol. 27, no. 3, 2011.
  101. Thesis
    D1
    “Certified numerical root finding,” Universität des Saarlandes, Saarbrücken, 2011.
  102. Conference paper
    D1
    “How Crossover Helps in Pseudo-Boolean Optimization,” in GECCO 2011, Dublin, Ireland, 2011.
  103. Conference paper
    D1
    “PAC Learning and Genetic Programming,” in GECCO 2011, Dublin, Ireland, 2011.
  104. Conference paper
    D1
    “Simple Max-min Ant Systems and the Optimization of Linear Pseudo-Boolean Functions,” in FOGA’11, 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, Schwarzenberg, Austria, 2011.
  105. Conference paper
    D1
    “Iterative Learning from Positive Data and Counters,” in Algorithmic Learning Theory (ALT 2011), Espoo, Finland, 2011.
  106. Conference paper
    D1
    “Optimising Spatial and Tonal Data for Homogeneous Diffusion Inpainting,” in Scale Space and Variational Methods in Computer Vision (SSVM 2011), Ein-Gedi, Israel, 2011.
  107. Thesis
    IMPR-CSD1
    “A Riemann-Roch Theory for Sublattices of the Root Lattice A n, Graph Automorphisms and Counting Cycles in Graphs,” Universität des Saarlandes, Saarbrücken, 2011.
  108. Conference paper
    D1
    “Approximate Counting of Cycles in Streams,” in Algorithms – ESA 2011, 2011.
  109. Article
    D1
    “Applications of Dimensionality Reduction and Exponential Sums to Graph Automorphism,” Theoretical Computer Science, vol. 412, no. 29, 2011.
  110. Article
    D1
    “Decision Support and Optimization in Shutdown and Turnaround Scheduling,” INFORMS Journal on Computing, vol. 23, no. 2, 2011.
  111. Conference paper
    D1
    “Online Graph Exploration: New Results on Old and New Algorithms,” in Automata, Languages and Programming (ICALP 2011), Zurich, Switzerland, 2011.
  112. Article
    D1
    “A Deterministic Algorithm for Isolating Real Roots of a Real Polynomial,” Journal of Symbolic Computation, vol. 46, no. 1, 2011.
  113. Article
    D1
    “A General Approach to the Analysis of Controlled Perturbation Algorithms,” Computational Geometry, vol. 44, no. 9, 2011.
  114. Conference paper
    D1
    “Zigzag Persistent Homology in Matrix Multiplication Time,” in Proceedings of the 27th Annual Symposium on Computational Geometry (SCG’11), Paris, France, 2011.
  115. Article
    D1
    “On the Path-avoidance Vertex-coloring Game,” The Electronic Journal of Combinatorics, vol. 18, 2011.
  116. Conference paper
    D1
    “Coloring Random Graphs Online Without Creating Monochromatic Subgraphs,” in Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), San Francisco, CA, 2011.
  117. Conference paper
    D1
    “On the Path-avoidance Vertex-coloring Game,” in The Sixth European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2011), Budapest, 2011.
  118. Thesis
    D1
    “Implementation of Schmidt’s algorithm for certifying triconnectivity testing,” Universität des Saarlandes, Saarbrücken, 2011.
  119. Article
    D1
    “Computing Minimum Cuts by Randomized Search Heuristics,” Algorithmica, vol. 59, no. 3, 2011.
  120. Conference paper
    D1
    “Explosive Percolation in Erdős-Rényi-like Random Graph Processes,” in The Sixth European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2011), Budapest, 2011.
  121. Conference paper
    D1
    “On the Degree Sequence of Random Planar Graphs,” in Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), San Francisco, CA, 2011.
  122. Article
    D1
    “Max-coloring and Online coloring with Bandwidths on Interval Graphs,” ACM Transactions on Algorithms, vol. 7, no. 3, 2011.
  123. Thesis
    D1IMPR-CS
    “Polynomially Solvable Cases of Hypergraph Transversal and Related Problems,” Universität des Saarlandes, Saarbrücken, 2011.
  124. Conference paper
    D1
    “A Simple But Exact and Efficient Algorithm for Complex Root Isolation,” in ISSAC 2011, 36th International Symposium on Symbolic and Algebraic Computation, San Jose, CA, USA, 2011.
  125. Article
    D1
    “When Newton meets Descartes: A Simple and Fast Algorithm to Isolate the Real Roots of a Polynomial,” arXiv, vol. abs/1109.6279v1, 2011.
  126. Conference paper
    D1
    “Rumor Spreading and Vertex Expansion on Regular Graphs,” in Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), San Francisco, CA, 2011.
  127. Article
    D1
    “Weisfeiler-Lehman Graph Kernels,” Journal of Machine Learning Research, vol. 12, 2011.
  128. Conference paper
    D1
    “An Improved Algorithm for Online Rectangle Filling,” in Approximation and Online Algorithms (WAOA 2010), Liverpool, Great Britain, 2011.
  129. Article
    D1
    “Linear Programming Based Approximation Algorithms for Feedback Set Problems in Bipartite Tournaments.,” Theoretical Computer Science, vol. 412, no. 23, 2011.
  130. Article
    D1
    “Deterministic Sampling Algorithms for Network Design,” Algorithmica, vol. 60, no. 1, 2011.
  131. Article
    D1
    “An Improved Monotone Algorithm for Scheduling Related Machines with Precedence Constraints,” Operations Research Letters, vol. 39, no. 6, 2011.
  132. Conference paper
    D1
    “Popular Ranking,” in 10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2011), Villa Mondragone, Frascati, Italy, 2011.
  133. Conference paper
    D1
    “Optimizing the Layout of 1000 Wind Turbines,” in European Wind Energy Association Annual Event (EWEA 2011), Brussels, Belgium, 2011.
  134. Article
    D1
    “New Plain-exponential Time Classes for Graph Homomorphism,” Theory of Computing Systems, vol. 49, no. 2, 2011.
  135. Thesis
    D1IMPR-CS
    “Toward a complexity theory for randomized search heuristics : black box models,” Universität des Saarlandes, Saarbrücken, 2011.

2010

  1. Article
    D1
    “Average-case Analysis of Incremental Topological Ordering,” Discrete Applied Mathematics, vol. 158, no. 4, 2010.
  2. Conference paper
    BIOD1
    “On Open Problems in Biological Network Visualization,” in Graph Drawing (GD 2009), Chicago, IL, USA, 2010.
  3. Report
    D1
    “A New Combinatorial Approach to Parametric Path Analysis,” SFB/TR 14 AVACS, ATR58, 2010.
  4. Article
    D1IMPR-CS
    “Riemann-Roch for Sublattices of the Root Lattice A n,” Electronic Journal of Combinatorics, vol. 17, no. 1, 2010.
  5. Article
    D1
    “Randomized Priority Algorithms,” Theoretical Computer Science, vol. 411, no. 26–28, 2010.
  6. Conference paper
    D1
    “On the Competitiveness of the Online Asymmetric and Euclidean Steiner Tree Problems,” in Approximation and Online Algorithms (WAOA 2009), Copenhagen, Denmark, 2010.
  7. Conference paper
    D1
    “Scheduling Real-time Mixed-criticality Jobs,” in Mathematical Foundations of Computer Science 2010 (MFCS 2010), Brno, Czech Republic, 2010.
  8. Article
    D1
    “Improved Multiprocessor Global Schedulability Analysis,” Real-Time Systems, vol. 46, no. 1, 2010.
  9. Conference paper
    D1
    “Minimum Vertex Cover in Rectangle Graphs,” in Algorithms - ESA 2010, Liverpool, England, 2010.
  10. Article
    D1
    “Centerpoints and Tverberg’s Technique,” Computational Geometry, vol. 43, no. 6–7, 2010.
  11. Article
    D1
    “Bounds on Absolute Positiveness of Multivariate Polynomials,” Journal of Symbolic Computation, vol. 45, no. 6, 2010.
  12. Article
    D1
    “An efficient algorithm for the stratification and triangulation of an algebraic surface,” Computational Geometry: Theory and Applications, vol. 43, no. 3, 2010.
  13. Article
    D1
    “Arrangements on Parametric Surfaces II: Concretizations and Applications,” Mathematics in Computer Science, vol. 4, no. 1, 2010.
  14. Book chapter / section
    D1
    “Experiments,” in Algorithm Engineering, Berlin: Springer, 2010.
  15. Report
    D1
    “A Generic Algebraic Kernel for Non-linear Geometric Applications,” INRIA, Sophia Antipolis, France, 7274, 2010.
  16. Article
    D1
    “Arrangements on Parametric Surfaces I: General Framework and Infrastructure,” Mathematics in Computer Science, vol. 4, no. 1, 2010.
  17. Conference paper
    D1
    “Polygonal Reconstruction from Approximate Offsets,” in 26th European Workshop on Computational Geometry (Workshop Proceedings), Dortmund, Germany, 2010.
  18. Article
    D1
    “An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks,” CoRR, vol. abs/1010.1386, 2010.
  19. Conference paper
    D1
    “Set-based Multi-Objective Optimization, Indicators, and Deteriorative Cycles,” in Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO 2010), Portland, USA, 2010.
  20. Conference paper
    D1
    “Succinct Representations of Separable Graphs,” in Combinatorial Pattern Matching (CPM 2010), New York, NY, 2010.
  21. Conference paper
    D1
    “Feasibility Analysis of Sporadic Real-time Multiprocessor Task Systems,” in Algorithms - ESA 2010, Liverpool, United Kingdom, 2010.
  22. Conference paper
    D1
    “Algorithms and Complexity for Periodic Real-Time Scheduling,” in 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), Austin (TX), USA, 2010.
  23. Article
    D1
    “Stackelberg Routing in Arbitrary Networks,” Mathematics of Operations Research, vol. 35, no. 2, 2010.
  24. Article
    D1
    “On Effectivity Functions of Game Forms,” Games and Economic Behavior, vol. 68, no. 2, 2010.
  25. Conference paper
    D1
    “A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information,” in Integer Programming and Combinatorial Optimization (IPCO 2010), Lausanne, Switzerland, 2010.
  26. Article
    D1
    “Left-to-right Multiplication for Monotone Boolean Dualization,” SIAM Journal on Computing, vol. 39, no. 7, 2010.
  27. Conference paper
    D1
    “Optimal Fixed and Adaptive Mutation Rates for the LeadingOnes Problem,” in Parallel Problem Solving from Nature, PPSN XI, Krakow, Poland, 2010.
  28. Conference paper
    D1
    “Efficient Broadcast on Random Geometric Graphs,” in Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), Austin, Texas, 2010.
  29. Article
    D1
    “An Efficient Algorithm for Computing Hypervolume Contributions,” Evolutionary Computation, vol. 18, no. 3, 2010.
  30. Conference paper
    D1
    “The Maximum Hypervolume Set Yields Near-optimal Approximation,” in 12th Annual Conference on Genetic and Evolutionary Computation (GECCO 2010), Portland, USA, 2010.
  31. Article
    D1
    “Approximating the Volume of Unions and Intersections of High-dimensional Geometric Objects,” Computational Geometry: Theory and Applications, vol. 43, no. 6–7, 2010.
  32. Conference paper
    D1
    “Tight Bounds for the Approximation Ratio of the Hypervolume Indicator,” in Parallel Problem Solving from Nature, PPSN XI, Krakow, Poland, 2010.
  33. Article
    D1
    “Optimization Problems in Multiple-interval Graphs,” ACM Transactions on Algorithms, vol. 6, no. 2, 2010.
  34. Conference paper
    D1
    “A Polynomial Delay Algorithm for Enumerating Approximate Solutions to the Interval Coloring Problem,” in Workshop on Algorithm Engineering and Experiments 2010 (ALENEX10), Austin, Texas, 2010.
  35. Conference paper
    D1
    “On the Approximability of the Maximum Interval Constrained Coloring Problem,” in Algorithms and Computation (ISAAC 2010), Jeju Island, Korea, 2010.
  36. Conference paper
    D1
    “Strongly Non-U-Shaped Learning Results by General Techniques,” in COLT 2010, Haifa, Israel, 2010.
  37. Conference paper
    D1
    “Solutions to Open Questions for Non-U-Shaped Learning with Memory Limitations,” in Algorithmic Learning Theory, Canberra, Australia, 2010.
  38. Conference paper
    D1
    “Continuous Monitoring of Distributed Data Streams Over a Time-based Sliding Window,” in 27th International Symposium on Theoretical Aspects of Computer Science (STACS 2010), Nancy, France, 2010.
  39. Conference paper
    D1
    “Non-clairvoyant Speed Scaling for Weighted Flow Time,” in Algorithms - ESA 2010, Liverpool, United Kingdom, 2010.
  40. Conference paper
    D1
    “On the Price of Stability for Undirected Network Design,” in Approximation and Online Algorithms (WAOA 2009), Copenhagen, Denmark, 2010.
  41. Article
    D1
    “Mechanism Design for Fractional Scheduling on Unrelated Machines,” ACM Transactions on Algorithms, vol. 6, no. 2, 2010.
  42. Conference paper
    D1
    “A Deterministic Truthful PTAS for Scheduling Related Machines,” in 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), Austin, Tx., USA, 2010.
  43. Conference paper
    D1
    “Truthful Mechanisms for Exhibitions,” in Internet and Network Economics (WINE 2010), Stanford, CA, USA, 2010.
  44. Conference paper
    D1
    “A Truthful Constant Approximation for Maximizing the Minimum Load on Related Machines,” in Internet and Network Economics (WINE 2010), Stanford, USA, 2010.
  45. Conference paper
    D1
    “Contention Resolution under Selfishness,” in Automata, Languages and Programming (ICALP 2010), Bordeaux, France, 2010.
  46. Article
    D1
    “Deterministic Random Walks on Regular Trees,” Random Structures and Algorithms, vol. 37, no. 3, 2010.
  47. Conference paper
    D1
    “Drift Analysis and Linear Functions Revisited,” in Proceedings of the IEEE Congress on Evolutionary Computation (CEC 2010). - Pt. 3, Barcelona, Spain, 2010.
  48. Article
    D1
    “Algorithmic Construction of Low-discrepancy Point Sets via Dependent Randomized Rounding,” Journal of Complexity, vol. 26, no. 5, 2010.
  49. Conference paper
    D1
    “Adaptive Drift Analysis,” in Parallel Problem Solving from Nature, PPSN XI, Krakow, Poland, 2010.
  50. Conference paper
    D1
    “Multiplicative Drift Analysis,” in Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO 2010), Portland, USA, 2010.
  51. Conference paper
    D1
    “Quasirandom Evolutionary Algorithms,” in Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO 2010), Portland, USA, 2010.
  52. Conference paper
    D1
    “Drift Analysis with Tail Bounds,” in Parallel Problem Solving from Nature, PPSN XI, Krakow, Poland, 2010.
  53. Conference paper
    D1
    “More Effective Crossover Operators for the All-pairs Shortest Path Problem,” in Parallel Problem Solving from Nature, PPSN XI, Krakow, Poland, 2010.
  54. Article
    D1
    “Editorial,” Algorithmica, vol. 57, no. 1, 2010.
  55. Conference paper
    D1
    “Brief Announcement: Stabilizing Consensus with the Power of Two Choices,” in Distributed Computing (DISC 2010), Cambridge, MA USA, 2010.
  56. Conference paper
    D1
    “Randomized Rounding for Routing and Covering Problems: Experiments and Improvements,” in Experimental Algorithms (SEA 2010), Naples, Italy, 2010.
  57. Article
    D1
    “Hereditary Discrepancies in Different Numbers of Colors II,” SIAM Journal on Discrete Mathematics, vol. 24, no. 3, 2010.
  58. Conference paper
    D1
    “Optimizing Monotone Functions Can Be Difficult,” in Parallel Problem Solving from Nature, PPSN XI, Krakow, Poland, 2010.
  59. Conference paper
    D1
    “Edge-based Representation Beats Vertex-based Representation in Shortest Path Problems,” in Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO 2010), Portland, USA, 2010.
  60. Article
    D1
    “In Memoriam: Ingo Wegener,” Algorithmica, vol. 58, no. 3, 2010.
  61. Conference paper
    D1
    “A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics,” in Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), Austin, USA, 2010.
  62. Conference paper
    D1
    “Guarding 1.5-Dimensional with Demands,” in 26th European Workshop on Computational Geometry (EuroCG 2010), Dortmund, Germany, 2010.
  63. Article
    D1
    “Polynomial-time Dualization of r-exact Hypergraphs with Applications in Geometry,” Discrete Mathematics, vol. 310, no. 17–18, 2010.
  64. Conference paper
    D1
    “Approximation Algorithms for Non-single-minded Profit-Maximization Problems with Limited Supply,” in Internet and Network Economics (WINE 2010), Stanford, CA, USA, 2010.
  65. Article
    D1
    “Pairing Heaps, Scrambled Pairing and Square-root Trees,” International Journal of Computer Mathematics, vol. 87, no. 14, 2010.
  66. Article
    D1
    “The Longest Almost-increasing Subsequence,” Information Processing Letters, vol. 110, no. 16, 2010.
  67. Conference paper
    D1
    “The Magic of a Number System,” in Fun with Algorithms, Ischia, 2010.
  68. Conference paper
    D1
    “Strictly-regular Number System and Data Structures,” in Algorithm Theory - SWAT 2010, Bergen, Norway, 2010.
  69. Conference paper
    D1
    “A Complete Modular Resultant Algorithm Targeted for Realization on Graphics Hardware,” in PASCO ’10, 4th International Workshop on Parallel and Symbolic Computation, Grenoble, France, 2010.
  70. Conference poster
    D1
    “Accelerating Symbolic Computations on NVidia Fermi,” Poster presentation at GTC’10 (NVIDIA research summit). 2010.
  71. Conference paper
    D1
    “Modular Resultant Algorithm for Graphics Processors,” in Algorithms and Architectures for Parallel Processing (ICA3PP 2010), Busan, Korea, 2010.
  72. Conference paper
    D1
    “Universal Sequencing on a Single Machine,” in Integer Programming and Combinatorial Optimization (IPCO 2010), Lausanne, Switzerland, 2010.
  73. Article
    D1
    “On the Online Unit Clustering Problem,” ACM Transactions on Algorithms, vol. 7, no. 1, 2010.
  74. Article
    D1
    “Maximizing the Minimum Load for Selfish Agents,” Theoretical Computer Science, vol. 411, no. 1, 2010.
  75. Conference paper
    D1
    “Max-min Online Allocations with a Reordering Puffer,” in Automata, Languages and Programming (ICALP 2010), Bordeaux, France, 2010.
  76. Conference paper
    D1
    “Improved Approximation Guarantees for Weighted Matching in the Semi-streaming Model,” in 27th International Symposium on Theoretical Aspects of Computer Science (STACS 2010), Nancy, France, 2010.
  77. Conference paper
    D1
    “Entropy-bounded Representation of Point Grids,” in Algorithms and Computation (ISAAC 2010), Jeju Island, Korea, 2010.
  78. Article
    D1
    “The t-stability Number of a Random Graph,” The Electronic Journal of Combinatorics, vol. 17, no. 1, 2010.
  79. Conference paper
    D1
    “Rumor Spreading on Random Regular Graphs and Expanders,” in Approximation, Randomization, and Combinatorial Optimization, Barcelona, Spain, 2010.
  80. Paper
    D1
    “On the Insertion Time of Cuckoo Hashing,” 2010. [Online]. Available: http://arxiv.org/abs/1006.1231.
  81. Conference paper
    D1
    “Orientability of Random Hypergraphs and the Power of Multiple Choices,” in Automata, Languages and Programming (ICALP 2010), Bordeaux, France, 2010.
  82. Conference paper
    D1
    “Reliable Broadcasting in Random Networks and the Effect of Density,” in 2010 Proceedings IEEE INFOCOM, San Diego, USA, 2010.
  83. Article
    D1
    “Plateaus Can Be Harder in Multi-Objective Optimization,” Theoretical Computer Science, vol. 411, no. 6, 2010.
  84. Article
    D1
    “Approximating Covering Problems by Randomized Search Heuristics using Multi-objective Models,” Evolutionary Computation, vol. 18, no. 4, 2010.
  85. Article
    D1
    “Smoothed Analysis of Balancing Networks,” Random Structures and Algorithms, vol. Early View, 2010.
  86. Conference paper
    D1
    “Quasirandom Load Balancing,” in 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), Austin, Texas, 2010.
  87. Article
    D1
    “The Cover Time of Deterministic Random Walks,” The Electronic Journal of Combinatorics, vol. 17, no. 1, 2010.
  88. Conference paper
    D1
    “The Cover Time of Deterministic Random Walks,” in Computing and Combinatorics (COCOON 2010), Nha Trang, Vietnam, 2010.
  89. Article
    D1
    “When to Use Bit-wise Neutrality,” Natural Computing, vol. 9, no. 1, 2010.
  90. Paper
    D1
    “Induced Subgraphs in Sparse Random Graphs with Given Degree Sequence,” 2010. [Online]. Available: http://arxiv.org/abs/1011.3810.
  91. Paper
    D1
    “Orientability Thresholds for Random Hypergraphs,” 2010. [Online]. Available: http://arxiv.org/abs/1009.5489.
  92. Article
    D1
    “Assigning Papers to Referees,” Algorithmica, vol. 58, no. 1, 2010.
  93. Article
    D1
    “Computing Geometric Minimum-dilation Graphs is NP-hard,” International Journal of Computational Geometry & Applications, vol. 20, no. 2, 2010.
  94. Article
    D1
    “NBmalloc: Allocating Memory in a Lock-free Manner,” Algorithmica, vol. 58, no. 2, 2010.
  95. Conference paper
    D1
    “Connected Dominating Sets on Dynamic Geometric Graphs,” in Proceedings of the 22nd Canadian Conference on Computational Geometry (CCCG 2010), Winnipeg, Manitoba, Canada, 2010.
  96. Conference paper
    D1
    “Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width,” in Approximation and Online Algorithms (WAOA 2009), Copenhagen, Denmark, 2010.
  97. Conference paper
    D1
    “The Checkpoint Problem,” in Approximation, Randomization, and Combinatorial Optimization, Barcelona, Spain, 2010.
  98. Article
    D1
    “Deadline Scheduling and Power Management for Speed Bounded Processors,” Theoretical Computer Science, vol. 411, no. 40–42, 2010.
  99. Thesis
    D1IMPR-CSD5
    “Two-dimensional packing problems,” Universität des Saarlandes, Saarbrücken, 2010.
  100. Conference paper
    D1
    “Classified Stable Matching,” in 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), Austin, TX, USA, 2010.
  101. Article
    D1
    “Circular Stable Matching and 3-way Kidney Transplant,” Algorithmica, vol. 58, no. 1, 2010.
  102. Report
    D1
    “Maximum Cardinality Popular Matchings in Strict Two-sided Preference Lists,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-2010-1-001, 2010.
  103. Thesis
    D1IMPR-CS
    “Randomized Rounding and Rumor Spreading with Stochastic Dependencies,” Universität des Saarlandes, Saarbrücken, 2010.
  104. Article
    D1
    “Determining the Distance to Monotonicity of a Biological Network: A Graph-Theoretical Approach,” IET Systems Biology, vol. 4, no. 3, 2010.
  105. Conference paper
    D1
    “Bin Packing with Fixed Number of Bins Revisited,” in Algorithm Theory - SWAT 2010, Bergen, Norway, 2010.
  106. Article
    D1
    “Editorial for the Special Issue on Theoretical Aspects of Evolutionary Multi-Objective Optimization,” Evolutionary Computation, vol. 18, no. 3, 2010.
  107. Conference paper
    D1
    “Vertices of Degree k in Random Maps,” in 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), Austin, USA, 2010.
  108. Thesis
    D1IMPR-CS
    “Random combinatorial structures and randomized search heuristics,” Universität des Saarlandes, Saarbrücken, 2010.
  109. Conference paper
    D1
    “Can Quantum Search Accelerate Evolutionary Algorithms?,” in Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO 2010), Portland, OR, 2010.
  110. Conference paper
    D1
    “Deterministic Polynomial-time Algorithms for Designing Short DNA Words,” in Theory and Applications of Models of Computation (TAMC 2010), Prague, Czech Republic, 2010.
  111. Conference paper
    D1
    “String Extension Learning Using Lattices,” in Language and Automata Theory and Applications (LATA 2010), Trier, Germany, 2010.
  112. Conference paper
    D1
    “Ant Colony Optimization and the Minimum Cut Problem,” in Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO 2010), Portland, USA, 2010.
  113. Conference paper
    D1
    “Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem,” in Swarm Intelligence (ANTS 2010), Brussels, Belgium, 2010.
  114. Conference paper
    D1
    “Fixed Parameter Evolutionary Algorithms and Maximum Leaf Spanning Trees: A Matter of Mutation,” in Parallel Problem Solving from Nature (PPSN 2010), Kraków, Poland, 2010.
  115. Conference paper
    D1
    “Isomorphism for Graphs of Bounded Feedback Vertex Set Number,” in Algorithm Theory - SWAT 2010, Bergen, Norway, 2010.
  116. Conference paper
    D1
    “Preprocessing of Min Ones Problems: A Dichotomy,” in Automata, Languages and Programming (ICALP 2010), Bordeaux, France, 2010.
  117. Conference paper
    D1
    “Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems,” in Mathematical Foundations of Computer Science 2010 (MFCS 2010), Brno, Czech Republic, 2010.
  118. Thesis
    D1IMPR-CS
    “Kernelization of generic problems : upper and lower bounds,” Universität des Saarlandes, Saarbrücken, 2010.
  119. Conference paper
    D1
    “Synchrony and Asynchrony in Neural Networks,” in Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), Austin, USA, 2010.
  120. Thesis
    D1
    “Stochastic Scheduling with Exponential Processing Times: Characterizing Optimal Policies,” Universität des Saarlandes, Saarbrücken, 2010.
  121. Thesis
    D1
    “Covering selfish machines with unit-sized jobs,” Universität des Saarlandes, Saarbrücken, 2010.
  122. Article
    D1
    “Certifying Algorithms,” Computer Science Review, vol. 5, no. 2, 2010.
  123. Book chapter / section
    D1
    “Keller oder Dach zuerst,” in Besser als Mathe, Wiesbaden: Vieweg Teubner, 2010.
  124. Conference paper
    D1
    “Progress on Certifying Algorithms,” in Frontiers in Algorithmics (FAW 2010), Wuhan, China, 2010.
  125. Article
    D1
    “Faster Algorithms for Computing Hong’s Bound on Absolute Positiveness,” Journal of Symbolic Computation, vol. 45, no. 6, 2010.
  126. Conference paper
    D1
    “Reliable and Efficient Geometric Computing,” in Mathematical Software (ICMS 2010), Kobe, Japan, 2010.
  127. Article
    D1
    “Adaptive Local Ratio,” SIAM Journal on Computing, vol. 39, no. 7, 2010.
  128. Book chapter / section
    D1
    “Implementation Aspects,” in Algorithm Engineering, Berlin: Springer, 2010.
  129. Article
    D1
    “Improved Results on Geometric Hitting Set Problems,” Discrete & Computational Geometry, vol. 44, no. 4, 2010.
  130. Book
    D1
    Bioinspired Computation in Combinatorial Optimization : Algorithms and Their Computational Complexity. New York, NY: Springer, 2010.
  131. Article
    D1
    “Ant Colony Optimization and the Minimum Spanning Tree Problem,” Theoretical Computer Science, vol. 411, no. 25, 2010.
  132. Conference paper
    D1
    “Mod/Resc Parsimony Inference,” in Combinatorial Pattern Matching (CPM 2010), New York, USA, 2010.
  133. Article
    D1
    “Maximal Biconnected Subgraphs of Random Planar Graphs,” ACM Transactions on Algorithms, vol. 6, no. 2, 2010.
  134. Conference paper
    D1
    “A Complete Characterization of Group-strategyproof Mechanisms of Cost-sharing,” in Algorithms - ESA 2010, Liverpool, UK, 2010.
  135. Thesis
    D1IMPR-CS
    “Algorithmic Game Theory and Networks,” Universität des Saarlandes, Saarbrücken, 2010.
  136. Thesis
    D1
    “Online Graph Exploration,” Universität des Saarlandes, Saarbrücken, 2010.
  137. Article
    D1
    “Homomorphism–homogeneous Graphs,” Journal of Graph Theory, vol. 65, no. 3, 2010.
  138. Article
    D1
    “A General Approach to Isolating Roots of a Bitstream Polynomial,” Mathematics in Computer Science, vol. 4, no. 4, 2010.
  139. Article
    D1
    “On the Complexity of Real Root Isolation,” CoRR, vol. abs/1011.0344, 2010.
  140. Thesis
    D1
    “Drift Analysis for Generalised Pseudo-Boolean Linear Functions,” Universität des Saarlandes, Saarbrücken, 2010.
  141. Article
    D1
    “Connecting Face Hitting Sets in Planar Graphs,” Information Processing Letters, vol. 111, no. 1, 2010.
  142. Report
    D5D1
    “Bonsai: Growing Interesting Small Trees,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-2010-5-005, 2010.
  143. Conference paper
    D5D1
    “Bonsai: Growing Interesting Small Trees,” in 10th IEEE International Conference on Data Mining (ICDM 2010), Sydney, Australia, 2010.
  144. Article
    BIOD1
    “Towards Optimal Alignment of Protein Structure Distance Matrices,” Bioinformatics, vol. 26, no. 18, 2010.

2009

  1. Conference paper
    D1
    “Fast and Accurate Bounds on Linear Programs,” in Experimental Algorithms (SEA 2009), Dortmund, Germany, 2009.
  2. Conference paper
    D1RG1
    “Superposition Modulo Linear Arithmetic SUP(LA),” in Frontiers of Combining Systems (FroCos 2009), Trento, Italy, 2009.
  3. Conference paper
    D1
    “Breaking the O(m^2n) Barrier for Minimum Cycle Bases,” in Algorithms - ESA 2009, Copenhagen, Denmark, 2009.
  4. Conference paper
    D1
    “Intertruptible Algorithms for Multi Problem Solving,” in 21st International Joint Conference on Artificial Intelligence (IJCAI 2009), Pasadena, CA, USA, 2009.
  5. Article
    D1
    “Tight Bounds for Quasirandom Rumor Spreading,” The Electronic Journal of Combinatorics, vol. 16, no. 1, 2009.
  6. Conference paper
    D1
    “Paging and List Update under Bijective Analysis,” in 20th ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), New York, NY, USA, 2009.
  7. Conference paper
    D1
    “Online Priority Steiner Tree Problems,” in Algorithms and Data Structures (WADS 2009), Banff, Canada, 2009.
  8. Conference paper
    D1
    “Speed Scaling with an Arbitrary Power Function,” in Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), New York, NY, USA, 2009.
  9. Conference paper
    D1
    “Weighted Flow Time does not Admit O(1)-competitive Algorithms,” in Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), New York, NY, USA, 2009.
  10. Book chapter / section
    D1
    “Car or Public Transport - Two Worlds,” in Efficient Algorithms, Berlin: Springer, 2009.
  11. Conference paper
    D1
    “Computing Single Source Shortest Paths using Single-Objective Fitness Functions,” in Proceedings of the 10th International Workshop on Foundations of Genetic Algorithms (FOGA 2009), Orlando, FL, USA, 2009.
  12. Article
    D1
    “A Generic and Flexible Framework for the Geometrical and Topological Analysis of (Algebraic) Surfaces,” Computer Aided Geometric Design, vol. 26, no. 6, 2009.
  13. Conference paper
    D1
    “Equilibria of Atomic Flow Games are not Unique,” in 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), New York, NY, USA, 2009.
  14. Conference paper
    D1
    “A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams,” in Parameterized and Exact Computation (IWPEC 2009), Copenhagen, Denmark, 2009.
  15. Conference paper
    D1
    “Don’t be Greedy when Calculating Hypervolume Contributions,” in Proceedings of the 10th International Workshop on Foundations of Genetic Algorithms (FOGA 2009), Orlando, FL, USA, 2009.
  16. Conference paper
    D1
    “Approximating the Least Hypervolume Contributor: NP-hard in General, but Fast in Practice,” in Evolutionary Multi-Criterion Optimization (EMO 2009), Nantes, France, 2009.
  17. Article
    D1
    “On the Effects of Adding Objectives to Plateau Functions,” IEEE Transactions on Evolutionary Computation, vol. 13, no. 3, 2009.
  18. Article
    D1
    “A Separation Bound for Real Algebraic Expressions,” Algorithmica, vol. 55, 2009.
  19. Conference paper
    D1
    “Fast Single-Pass Construction of a Half-Inverted Index,” in 16th String Processing and Information Retrieval Symposium, Saariselkä, Finland, 2009.
  20. Article
    D1
    “Efficient Index-based Snippet Generation,” ACM Transactions on Information Systems, vol. 32, no. 2, 2009.
  21. Conference paper
    D1
    “Fast Error-Tolerant Search on Very Large Texts,” in The 24th Annual ACM Symposium on Applied Computing (SAC 2009), Honolulu, Hawaii, USA, 2009.
  22. Conference paper
    D1
    “Nonclairvoyant Speed Scaling for Flow and Energy,” in Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS 2009), Freiburg, Germany, 2009.
  23. Article
    D1
    “Small Hop-diameter Sparse Spanners for Doubling Metrics,” Discrete and Computational Geometry, vol. 41, no. 1, 2009.
  24. Article
    D1
    “Mechanism Design for Scheduling,” Bulletin of the European Association for Theoretical Computer Science, vol. 97, 2009.
  25. Article
    D1
    “Coordination Mechanisms,” Theoretical computer science, vol. 410, no. 36, 2009.
  26. Article
    D1
    “A Lower Bound for Scheduling Mechanisms,” Algorithmica, vol. 55, no. 4, 2009.
  27. Article
    D1
    “Embeddings and Ramsey Numbers of Sparse k-uniform Hypergraphs,” Combinatorica, vol. 29, no. 3, 2009.
  28. Conference paper
    D1
    “Cardinality Constrained Graph Partitioning into Cliques with Submodular Costs,” in 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2009), Paris, France, 2009.
  29. Conference paper
    D1
    “Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness,” in Proceedings of the 36th International Colloquium on Automata, Languages and Programming (ICALP 2009), Rhodes, Greece, 2009.
  30. Conference paper
    D1
    “Strong Robustness of Randomized Rumor Spreading Protocols,” in Algorithms and Computation (ISAAC 2009), Honolulu, Hawaii, USA, 2009.
  31. Book chapter / section
    D1
    “Implementation of a Component-by-component Algorithm to Generate Small Low-discrepancy Samples,” in Monte Carlo and Quasi-Monte Carlo Methods 2008, Berlin: Springer, 2009.
  32. Article
    D1
    “Quasirandom Rumor Spreading on Expanders,” Electronic Notes in Discrete Mathematics, vol. 34, 2009.
  33. Article
    D1
    “A Time-Randomness Tradeoff for Quasi-Random Rumour Spreading,” Electronic Notes in Discrete Mathematics, vol. 34, 2009.
  34. Conference paper
    D1
    “Evolutionary Algorithms and Dynamic Programming,” in Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation, Montreal, Canada, 2009.
  35. Conference paper
    D1
    “Improved Analysis Methods for Crossover-based Algorithms,” in Genetic and Evolutionary Computation Conference 2009 (GECCO 2009), Montreal, Canada, 2009.
  36. Book chapter / section
    D1
    “Introducing Quasirandomness to Computer Science,” in Efficient Algorithms, 2009.
  37. Conference paper
    D1
    “Quasirandom Rumor Spreading: An Experimental Analysis,” in Proceedings of the 10th Workshop on Algorithm Engineering and Experiments (ALENEX 2009), New York, NY, USA, 2009.
  38. Conference paper
    D1
    “BBOB: Nelder-Mead with Resize and Halfruns,” in GECCO ’09, 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference, Montreal, Québec, Canada, 2009.
  39. Article
    D1
    “Deterministic Random Walks on the Two-Dimensional Grid,” Combinatorics, Probability and Computing, vol. 18, 2009.
  40. Conference paper
    D1
    “Randomized Rounding in the Presence of a Cardinality Constraint,” in Proceedings of the 10th Workshop on Algorithm Engineering and Experiments (ALENEX 2009), New York, NY, USA, 2009.
  41. Article
    D1
    “How Much Geometry It Takes to Reconstruct a 2-Manifold in R^3,” ACM Journal of Experimental Algorithms, vol. 14, 2009.
  42. Conference paper
    D1
    “Complexity of Approximating the Vertex Centroid of a Polyhedron,” in Algorithms and Computation (ISAAC 2009), Honolulu, Hawaii, USA, 2009.
  43. Conference paper
    D1
    “On the Approximability of the Maximum Feasible Subsystem Problem with 0/1-coefficients,” in Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), New York, NY, USA, 2009.
  44. Conference paper
    D1
    “On Profit-Maximizing Pricing for the Highway and Tollbooth Problems,” in Algorithmic Game Theory, 2009.
  45. Conference paper
    D1
    “On the Readability of Monotone Boolean Formulae,” in Computing and Combinatorics (COCOON 2009), Niagara Falls, NY, USA, 2009.
  46. Article
    D1
    “Algorithms for Dualization over Products of Partially Ordered Sets,” SIAM Journal on Discrete Mathematics, vol. 23, no. 1, 2009.
  47. Conference paper
    D1
    “Improved Approximation Algorithms for 1.5D Terrain Guarding,” in 26th International Symposium on Theoretical Aspects of Computer Science (STACS 2009), Freiburg, Germany, 2009.
  48. Conference paper
    D1
    “Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs,” in Algorithms - ESA 2009, Copenhagen, Denmark, 2009.
  49. Article
    D1
    “Improved Approximations for Guarding 1.5-Dimensional Terrains,” Algorithmica, vol. 60, 2009.
  50. Conference paper
    D1
    “Pairing Heaps with O(log log n) decrease Cost,” in 20th ACM-SIAM Symposium on Discrete Algorithms, New York, NY, USA, 2009.
  51. Conference paper
    D1
    “Efficient Multiplication of Polynomials on Graphics Hardware,” in Advanced Parallel Processing Technologies (APPT 2009), Rapperswil, Switzerland, 2009.
  52. Conference paper
    D1
    “Visualizing Arcs of Implicit Algebraic Curves, Exactly and Fast,” in Advances in Visual Computing, Las Vegas, NV, USA, 2009.
  53. Article
    D1
    “Paging with Request Sets,” Theory of Computing Systems, vol. 44, no. 1, 2009.
  54. Conference paper
    D1
    “Parametric Packing of Selfish Items and the Subset Sum Algorithm,” in Internet and Network Economics (WINE 2009), Rome, Italy, 2009.
  55. Conference paper
    D1
    “Maximizing the Minimum Load: The Cost of Selfishness,” in Internet and Network Economics (WINE 2009), Rome, Italy, 2009.
  56. Conference paper
    D1
    “Brief Announcement: The Speed of Broadcasting in Random Networks - Density Does Not Matter,” in Distributed Computing (DISC 2009), Elche/Elx, Spain, 2009.
  57. Article
    D1
    “Comparison of Simple Diversity Mechanisms on Plateau Functions,” Theoretical computer science, vol. 420, no. 26, 2009.
  58. Article
    D1
    “Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem,” Evolutionary Computation, vol. 17, no. 1, 2009.
  59. Conference paper
    D1
    “Near-Perfect Load Balancing by Randomized Rounding,” in Proceedings of the 41st ACM Symposium on Theory of Computing (STOC 2009), Bethesda, Maryland, USA, 2009.
  60. Conference paper
    D1
    “Multiplicative Approximations and the Hypervolume Indicator,” in Genetic and Evolutionary Computation Conference 2009 (GECCO 2009), Montreal, Canada, 2009.
  61. Article
    D1
    “Analysis of Diversity-Preserving Mechanisms for Global Exploration,” Evolutionary Computation, vol. 17, no. 4, 2009.
  62. Conference paper
    D1
    “Smoothed Analysis of Balancing Networks,” in Automata, Languages and Programming (ICALP 2009), Rhodes, Greece, 2009.
  63. Article
    D1
    “Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting,” IEEE Transactions on Parallel and Distributed Systems, vol. 20, no. 8, 2009.
  64. Conference paper
    D1IMPR-CS
    “Minimizing Absolute Gaussian Curvature over Meshes,” in Computational Geometry, Dagstuhl, Germany, 2009.
  65. Thesis
    D1IMPR-CS
    “Analyses of Evolutionary Algorithms,” Universität des Saarlandes, Saarbrücken, 2009.
  66. Article
    D1
    “Approximation Algorithms for Orthogonal Packing Problems for Hypercubes,” Theoretical computer science, vol. 410, no. 44, 2009.
  67. Conference paper
    D1
    “Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems,” in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, Berkeley, CA, USA, 2009.
  68. Conference paper
    D1
    “Particle Swarm Optimization with Velocity Adaptation,” in International Conference on Adaptive and Intelligent Systems 2009 (ICAIS 2009), Klagenfurt, Austria, 2009.
  69. Paper
    D1
    “Modular Arithmetic, CGAL - Computational Geometry Algorithms Library, release 3.4.” CGAL, [s.l.], 2009.
  70. Conference paper
    D1
    “Continued Work on the Computation of an Exact Arrangement of Quadrics,” in 25th European Workshop on Computational Geometry, Brussels, Belgium, 2009.
  71. Conference paper
    D1
    “Generic implementation of a modular GCD over Algebraic Extension Fields,” in 25th European Workshop on Computational Geometry (EuroCG 2009), Brussels, Belgium, 2009.
  72. Other
    D1
    “Polynomials, CGAL - Computational Geometry Algorithms Library, release 3.4.” 2009.
  73. Conference paper
    D1
    “Experimental Evaluation and Cross-benchmarking of Univariate Real Solvers,” in SNC ’09: Proceedings of the 2009 conference on Symbolic numeric computation, Kyoto, Japan, 2009.
  74. Conference paper
    D1
    “Additive Approximations of Pareto-Optimal Sets by Evolutionary Multi-Objective Algorithms,” in FOGA ’09, Tenth ACM SIGEVO Workshop on Foundations of Genetic Algorithms, Orlando, FL, USA, 2009.
  75. Article
    D1
    “Quasirandom Rumor Spreading on the Complete Graph is as Fast as Randomized Rumor Spreading,” SIAM Journal on Discrete Mathematics, vol. 23, no. 4, 2009.
  76. Conference paper
    D1
    “Solving SAT for CNF formulas with a One-sided Variable Occurrence Restriction,” in Theory and Applications of Satisfiability Testing - SAT 2009, Swansea, Wales, United Kingdom, 2009.
  77. Article
    D1
    “Cycle Bases in Graphs: Characterization, Algorithms, Complexity, and Applications,” Computer Science Review, vol. 3, no. 4, 2009.
  78. Conference paper
    D1
    “Max-coloring Paths: Tight Bounds and Extensions,” in Algorithms and Computation (ISAAC 2009), Hawai, FL, USA, 2009.
  79. Thesis
    D1IMPR-CS
    “Geometric Algorithms for Algebraic Curves and Surfaces,” Universität des Saarlandes, Saarbrücken, 2009.
  80. Article
    D1
    “Division-free Computation of Subresultants Using Bezout Matrices,” International Journal of Computer Mathematics, vol. 86, no. 12, 2009.
  81. Conference paper
    D1
    “On the Complexity of Reliable Root Approximation,” in Computer Algebra in Scientific Computing (CASC 2009), Kobe, Japan, 2009.
  82. Thesis
    D1IMPR-CS
    “Message Passing Algorithms,” Universität des Saarlandes, Saarbrücken, 2009.
  83. Conference paper
    D1
    “Two Edge Modification Problems without Polynomial Kernels,” in Parameterized and Exact Computation (IWPEC 2009), Denmark, Copenhagen, 2009.
  84. Conference paper
    D1
    “Fixed-Parameter Evolutionary Algorithms and the Vertex Cover Problem,” in Genetic and Evolutionary Computation Conference 2009 (GECCO 2009), Montreal, Canada, 2009.
  85. Conference paper
    D1
    “Polynomial Kernelizations For MIN F+Pi1 And MAX NP,” in 26th International Symposium on Theoretical Aspects of Computer Science (STACS 2009), Freiburg, Germany, 2009.
  86. Book chapter / section
    D1
    “Online Job Admissions,” in Fundamental Problems in Computing, New York: Springer, 2009.
  87. Article
    D1
    “Multiword Atomic Read/Write Registers on Multiprocessor Systems,” Journal of Experimental Algorithmics, vol. 13, no. 1, 2009.
  88. Article
    D1
    “Minimum Cycle Bases: Faster and Simpler,” ACM Transactions on Algorithms, vol. 6, no. 1, 2009.
  89. Conference report
    D1
    “Isolating Real Roots of Real Polynomials,” Proceedings of the 2009 International Symposium on Symbolic and Algebraic Computation (ISSAC 2009). ACM, New York, NY, 2009.
  90. Thesis
    D1
    “Zeichnen von Diagrammen - Theorie und Praxis,” Universität des Saarlandes, Saarbrücken, 2009.
  91. Article
    D1
    “Runtime Analysis of a Simple Ant Colony Optimization Algorithm,” Algorithmica, vol. 54, no. 2, 2009.
  92. Book chapter / section
    D1
    “Computational Complexity of Ant Colony Optimization and Its Hybridization with Local Search,” in Innovations in Swarm Intelligence, Berlin: Springer, 2009.
  93. Article
    D1
    “Analysis of Different MMAS ACO Algorithms on Unimodal Functions and Plateaus,” Swarm Intelligence, vol. 3, no. 1, 2009.
  94. Conference paper
    D1
    “Theoretical Analysis of Fitness-Proportional Selection: Landscapes and Efficiency,” in Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), Montreal, Canada, 2009.
  95. Conference paper
    D1
    “Theoretical Analysis of Rank-Based Mutation - Combining Exploration and Exploitation,” in IEEE Congress on Evolutionary Computation 2009 (CEC 2009), Trondheim, Norway, 2009.
  96. Article
    D1
    “Vertices of Degree k in Random Unlabeled Trees,” Electronic Notes in Discrete Mathematics (Proc. EuroComb 2009), vol. 41, no. 1, 2009.
  97. Conference paper
    D1
    “Maximal Biconnected Subgraphs of Random Planar Graphs,” in Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), San Francisco, CA, USA, 2009.
  98. Conference paper
    D1
    “Blocks In Constrained Random Graphs with Fixed Average Degree,” in 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC ’09), Hagenberg, Austria, 2009.
  99. Conference paper
    D1
    “Stochastic Stability in Internet Router Congestion Games,” in Algorithmic Game Theory (SAGT 2009), Paphos, Cyprus, 2009.
  100. Proceedings
    D1
    Eds., GECCO 2009: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation. ACM, 2009.
  101. Thesis
    D1IMPR-CS
    “Weak and Strong ε-Nets for Geometric Range Spaces,” Universität des Saarlandes, Saarbrücken, 2009.
  102. Thesis
    D1IMPR-CS
    “Proof Representations for Higher-Order Logic,” Universität des Saarlandes, Saarbrücken, 2009.
  103. Conference paper
    D1
    “Certified Complex Root Isolation via Adaptive Root Separation Bounds,” in 9th Asian Symposium on Computational Mathematics (ASCM), Fukuoka, Japan, 2009.
  104. Article
    D1
    “Using the Incompressibility Method to obtain Local Lemma results for Ramsey-type Problems,” Information Processing Letters, vol. 109, no. 4, 2009.
  105. Thesis
    D1IMPR-CS
    “Problems of Unknown Complexity: Graph isomorphism and Ramsey theoretic numbers,” Universität des Saarlandes, Saarbrücken, 2009.
  106. Conference paper
    D1
    “Efficient Graphlet Kernels for Large Graph Comparison,” in 12th International Conference on Artificial Intelligence and Statistics (AISTATS 2009), Clearwater Beach, FL, USA, 2009.
  107. Conference paper
    D1
    “The Geometry of Truthfulness,” in Internet and Network Economics (WINE 2009), Rome, Italy, 2009.
  108. Conference paper
    D1
    “New Plain-Exponential Time Classes for Graph Homomorphism,” in Computer Science - Theory and Applications (CSR 2009), Novosibirsk, Russia, 2009.

2008

  1. Article
    D1
    “Matching Edges and Faces in Polygonal Partitions,” Computational Geometry: Theory and Applications, vol. 39, no. 2, 2008.
  2. Report
    D1
    “Characterizing the performance of Flash memory storage devices and its impact on algorithm design,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-2008-1-001, 2008.
  3. Conference paper
    D1
    “Characterizing the Performance of Flash Memory Storage Devices and Its Impact on Algorithm Design,” in Experimental Algorithms (WEA 2008), Provincetown, MA, 2008.
  4. Thesis
    D1IMPR-CS
    “Traversing Large Graphs in Realistic Settings,” Universität des Saarlandes, Saarbrücken, 2008.
  5. Conference paper
    D1
    “A Clipper-free Algorithm for Efficient HW-Implementation of Local Dimming LED-Backlight,” in Proceedings of the 28th International Display Research Conference (IDRC), Orlando, FL, USA, 2008.
  6. Conference paper
    D1
    “Reconstructing Phylogenetic Networks with One Recombination,” in Experimental Algorithms (WEA 2008), Provincetown, MA, 2008.
  7. Conference paper
    D1
    “Computing H/D-exchange Speeds of Single Residues from Data of Peptic Fragments,” in 23rd Annual ACM Symposium on Applied Computing (SAC), Fortaleza, Brazil, 2008.
  8. Conference paper
    D1
    “Approximating the Interval Constrained Coloring Problem,” in Algorithm Theory – SWAT 2008, Gothenburg, Sweden, 2008.
  9. Article
    D1
    “A Lagrangian Relaxation Approach for the Multiple Sequence Alignment Problem,” Journal of Combinatorial Optimization, vol. 16, no. 2, 2008.
  10. Conference paper
    D1
    “A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry,” in Algorithms - ESA 2008, Karlsruhe, Germany, 2008.
  11. Conference paper
    D1
    “List Update with Locality of Reference,” in LATIN 2008: Theoretical Informatics, Buzios, Brasil, 2008.
  12. Article
    D1
    “Output-sensitive Autocompletion Search,” Information Retrieval, vol. 11, no. 4, 2008.
  13. Conference paper
    D1D5
    “Semantic Full-Text Search with ESTER: Scalable, Easy, Fast,” in ICDM Workshops 2008, Pisa, Italy, 2008.
  14. Article
    D1IMPR-CS
    “On Threshold BDDs and the Optimal Variable Ordering Problem,” Journal of Combinatorial Optimization, vol. 16, no. 2, 2008.
  15. Conference paper
    D1
    “Exact Geometric-Topological Analysis of Algebraic Surfaces,” in Proceedings of the Twenty-Fourth Annual Symposium on Computational Geometry (SCG 2008), College Park Maryland, USA, 2008.
  16. Conference paper
    D1
    “Arrangements on Surfaces of Genus One: Tori and Dupin Cyclides,” in 24th European Workshop on Computational Geometry : collection of abstracts/EuroCG’08, Nancy, France, 2008.
  17. Conference paper
    D1
    “Exact Arrangements on Tori and Dupin Cyclides,” in Proceedings SPM 2008 : ACM Solid and Physical Modeling Symposium, Stony Brook, NY, 2008.
  18. Report
    D1
    “Prototype Implementation of the Algebraic Kernel,” University of Groningen, Groningen, ACS-TR-121202-01, 2008.
  19. Conference paper
    D1
    “A Generic and Flexible Framework for the Geometrical and Topological Analysis of (Algebraic) Surfaces,” in SPM ’08, 2008 ACM Symposium on Solid and Physical Modeling, Stony Brook, USA, 2008.
  20. Conference paper
    D1
    “Geometric Analysis of Algebraic Surfaces Based on Planar Arrangements,” in 24th European Workshop on Computational Geometry : collection of abstracts/EuroCG’08, Nancy, France, 2008.
  21. Thesis
    D1IMPR-CS
    “Robust and Efficient Software for Problems in 2.5-Dimensional Non-Linear Geometry - Algorithms and Implementations,” Universität des Saarlandes, Saarbrücken, 2008.
  22. Conference paper
    D1
    “On Berge Multiplication for Monotone Boolean Dualization,” in Automata, Languages and Programming (ICALP 2008), Reykjavik, Iceland, 2008.
  23. Conference paper
    D1
    “A Complete Characterization of Nash-solvability of Bimatrix Games in Terms of the Exclusion of Certain 2x2 subgames,” in Computer Science - Theory and Applications (CSR 2008), Moscow, Russia, 2008.
  24. Paper
    D1
    “Characterization of the Vertices and Extreme Directions of the Negative Cycles Polyhedron and Hardness of Generating Vertices of 0/1-Polyhedra,” 2008. [Online]. Available: http://arxiv.org/abs/0801.3790.
  25. Conference paper
    D1IMPR-CS
    “Approximating the Volume of Unions and Intersections of High-dimensional Geometric Objects,” in Algorithms and Computation (ISAAC 2008), Gold Coast, Australia, 2008.
  26. Conference paper
    D1
    “Analyzing Hypervolume Indicator Based Algorithms,” in Parallel Problem Solving from Nature - PPSN X, Dortmund, Germany, 2008.
  27. Article
    D1
    “Recursive Geometry of the Flow Complex and Topology of the Flow Complex Filtration,” Computational Geometry: Theory and Applications, vol. 40, no. 2, 2008.
  28. Article
    D1
    “Counting Defective Parking Functions,” The Electronic Journal of Combinatorics, vol. 15, no. 1, 2008.
  29. Conference paper
    D1
    “Online and Offline Selling in Limit Order Markets,” in Internet and Network Economics (WINE 2008), Shanghai, China, 2008.
  30. Conference paper
    D1
    “Bayesian Combinatorial Auctions,” in Automata, Languages and Programming (ICALP 2008), Reykjavik, Iceland, 2008.
  31. Conference paper
    D1
    “A Characterization of 2-Player Mechanisms for Scheduling,” in Algorithms - ESA 2008, Karlsruhe, Germany, 2008.
  32. Conference paper
    D1
    “Deterministic Random Walks on Regular Trees,” in Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2008), San Francisco, USA, 2008.
  33. Article
    D1
    “STXXL: Standard Template library for XXL Data Sets,” Software - Practice & Experience, vol. 38, no. 6, 2008.
  34. Article
    D1
    “Critical Points of Distance to an Epsilon-sampling of a Surface and Flow-complex-based Surface Reconstruction,” International Journal of Computational Geometry & Application, vol. 18, no. 1/2, 2008.
  35. Article
    D1
    “Approximation Algorithms for 3D Orthogonal Knapsack,” Journal of Science and Technology, vol. 23, no. 5, 2008.
  36. Conference paper
    D1
    “Multi-objective Problems in Terms of Relational Algebra,” in Relations and Kleene Algebra in Computer Science 2008 (RelMiCS/AKA 2008), Frauenwörth, Germany, 2008.
  37. Conference paper
    D1
    “Comparing Local and Global Mutations on Bit-strings,” in GECCO’08, 10th Annual Conference on Genetic and Evolutionary Computation, Atlanta, USA, 2008.
  38. Conference paper
    D1
    “Directed trees: A Powerful Representation for Sorting and Ordering Problems,” in IEEE Congress on Evolutionary Computation 2008 (CEC 2008), Hong Kong, 2008.
  39. Article
    D1
    “Component-by-Component Construction of Low-discrepancy Point Sets of Small Size,” Monte Carlo Methods and Applications, vol. 14, no. 2, 2008.
  40. Conference paper
    D1
    “Quasirandom Broadcasting,” in Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2008), San Francisco, CA, USA, 2008.
  41. Conference paper
    D1D4
    “Construction of Low-Discrepancy Point Sets of Small Size by Bracketing Covers and Dependent Randomized Rounding,” in Monte Carlo and Quasi-Monte Carlo Methods 2006, 2008, vol. 2.
  42. Conference paper
    D1
    “Crossover Can Provably be Useful in Evolutionary Computation,” in GECCO’08, 10th Annual Conference on Genetic and Evolutionary Computation, Atlanta, USA, 2008.
  43. Conference paper
    D1
    “How much Geometry it takes to Reconstruct a 2-Manifold in R^3,” in Proceedings of the 10th Workshop on Algorithm Engineering and Experiments (ALENEX 2008), San Francisco, CA, USA, 2008.
  44. Conference paper
    D1
    “On the Locality of Extracting a 2-Manifold in IR3,” in Algorithm Theory – SWAT 2008, Göteborg, Sweden, 2008.
  45. Conference paper
    D1
    “On the Locality of Extracting a 2-Manifold in R3,” in 24th European Workshop on Computational Geometry : Collection of Abstracts/EuroCG’08, Nancy, France, 2008.
  46. Conference paper
    D1IMPR-CS
    “The Solution Path of the Slab Support Vector Machine,” in The 20th Canadian Conference on Computational Geometry, Mcgill University, Montreal, Canada, 2008.
  47. Thesis
    D1IMPR-CS
    “Real root isolation for exact and approximate polynomials using Descartes’ rule of signs,” Universität des Saarlandes, Saarbrücken, 2008.
  48. Conference paper
    D1
    “Exact and Efficient 2D-Arrangements of Arbitrary Algebraic Curves,” in Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2008), San Francisco, USA, 2008.
  49. Article
    D1
    “Energy-Aware Stage Illumination,” International Journal of Computational Geometry and Applications, vol. 18, no. 1/2, 2008.
  50. Article
    D1
    “Multiline Addressing by Network Flow,” Algorithmica, vol. 53, no. 4, 2008.
  51. Book chapter / section
    D1
    “Indexing Schemes for Multi-dimensional Moving Objects,” in Encyclopedia of GIS, Berlin: Springer, 2008.
  52. Conference paper
    D1
    “Some Fixed-Parameter Tractable Classes of Hypergraph Duality and Related Problems,” in Parameterized and Exact Computation (IWPEC 2008), Victoria, Canada, 2008.
  53. Conference paper
    D1
    “On a Cone Covering Problem,” in The 20th Canadian Conference on Computational Geometry (CCCG 2008), Montreal, Canada, 2008.
  54. Article
    D1
    “On the Complexity of Monotone Dualization and Generating Minimal Hypergraph Transversals,” Discrete applied mathematics, vol. 156, no. 11, 2008.
  55. Article
    D1
    “A Note on Systems with Max-min and Max-product Constraints,” Fuzzy Sets and Systems, vol. 159, no. 17, 2008.
  56. Article
    D1
    “Two New Methods for Constructing Double-ended Priority Queues from Priority Queues,” Computing, vol. 83, no. 4, 2008.
  57. Paper
    D1
    “The Violation Heap: A Relaxed Fibonacci-Like Heap,” 2008. [Online]. Available: http://arxiv.org/abs/0812.2851.
  58. Article
    D1
    “Multipartite Priority Queues,” ACM Transactions on Algorithms, vol. 5, no. 1, 2008.
  59. Conference paper
    D1
    “Visualizing and Exploring Planar Algebraic Arrangements - a Web Application,” in Proceedings of the Twenty-Fourth Annual Symposium on Computational Geometry (SCG’08), College Park Maryland, USA, 2008.
  60. Conference paper
    BIOD1
    “Visualizing Domain Interaction Networks and the Impact of Alternative Splicing Events,” in MediVis 2008, Fifth International Conference BioMedical Visualization, London, UK, 2008.
  61. Article
    BIOD1
    “Integrative Visual Analysis of the Effects of Alternative Splicing on Protein Domain Interaction Networks,” Journal of Integrative Bioinformatics, vol. 5, no. 2, 2008.
  62. Conference paper
    D1
    “Maximizing the Minimum Load for Selfish Agents,” in LATIN 2008: Theoretical Informatics, Búzios, Brazil, 2008.
  63. Conference paper
    D1
    “The Price of Anarchy on Uniformly Related Machines Revisited,” in Algorithmic Game Theory (SAGT 2008), Paderborn, Germany, 2008.
  64. Article
    D1
    “Two-dimensional Packing with Conflicts,” Acta Informatica, vol. 45, no. 3, 2008.
  65. Conference paper
    D1
    “Approximation Schemes for Packing Splittable Items with Cardinality Constraints,” in Approximation and Online Algorithms (WAOA 2007), Eilat, Israel, 2008.
  66. Article
    D1
    “Online Unit Clustering: Variations on a Theme,” Theoretical computer science, vol. 407, no. 1–3, 2008.
  67. Conference paper
    D1
    “On the Online Unit Clustering Problem,” in Approximation and Online Algorithms (WAOA 2007), Eilat, Israel, 2008.
  68. Article
    D1
    “3-Uniform Hypergraphs of Bounded Degree have Linear Ramsey Numbers,” Journal of Combinatorial Theory, Series B, vol. 98, 2008.
  69. Article
    D1
    “The Order of the Largest Complete Minor in a Random Graph,” Random Structures and Algorithms, vol. 33, 2008.
  70. Article
    D1
    “The Evolution of the Mixing Rate of a Simple Random Walk on the Giant Component of a Random Graph,” Random Structures and Algorithms, vol. 33, 2008.
  71. Conference paper
    D1
    “Theoretical Analysis of Diversity Mechanisms for Global Exploration,” in Genetic and Evolutionary Computation Conference 2008 (GECCO 2008), Atlanta, GA, USA, 2008.
  72. Conference paper
    D1
    “Runtime Analyses for Using Fairness in Evolutionary Multi-Objective Optimization,” in Parallel Problem Solving from Nature – PPSN X, Dortmund, Germany, 2008.
  73. Conference paper
    D1
    “Average Update Times for Fully-Dynamic All-Pairs Shortest Paths.,” in Algorithms and Computation : 19th International Symposium, (ISAAC 2008), Gold Coast, Australia, 2008.
  74. Article
    D1
    “Optimizing the Landside Operation of a Container Terminal,” OR Spectrum, vol. 30, no. 1, 2008.
  75. Conference paper
    D1
    “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 (DCOSS 2008), Santorini Island, Greece, 2008.
  76. Article
    D1
    “The Flow Complex: A Data Structure for Geometric Modeling,” Computational Geometry - Theory and Applications, vol. 39, no. 3, 2008.
  77. Article
    D1D5
    “A Primal-dual Bicriteria Distributed Algorithm for Capacitated Vertex Cover,” SIAM Journal on Computing, vol. 38, no. 3, 2008.
  78. Proceedings
    D1
    Eds., Algorithms - ESA 2008 : 16th Annual European Symposium. Springer, 2008.
  79. Conference paper
    D1
    “Rigorous Analyses of Fitness-Proportional Selection for Optimizing Linear Functions,” in Genetic and Evolutionary Computation Conference 2008 (GECCO 2008), Atlanta, GA, USA, 2008.
  80. Article
    D1
    “Faster Algorithms for Minimum Cycle Basis in Directed Graphs,” SIAM Journal on Computing, vol. 38, no. 4, 2008.
  81. Conference paper
    D1
    “Packing Rectangles into 2 OPT Bins using Rotations,” in Algorithm Theory – SWAT 2008, Gothenburg, Sweden, 2008.
  82. Conference paper
    D1
    “Benefits and Drawbacks for the Use of epsilon-Dominance in Evolutionary Multi-Objective Optimization,” in GECCO’08, 10th Annual Conference on Genetic and Evolutionary Computation, Atlanta, USA, 2008.
  83. Conference paper
    D1
    “How Single Ant ACO Systems Optimize Pseudo-Boolean Functions,” in Parallel Problem Solving from Nature – PPSN X, USA, Atlanta, 2008.
  84. Article
    D1
    “An O˜ (m2n) Algorithm for Minimum Cycle Basis of Graphs,” Algorithmica, vol. 52, no. 3, 2008.
  85. Proceedings
    D1
    Eds., Genetic and Evolutionary Computation Conference 2008 : GECCO 2008. ACM, 2008.
  86. Article
    D1
    “Classroom Examples of Robustness Problems in Geometric Computations,” Computational Geometry: Theory and Applications, vol. 40, no. 1, 2008.
  87. Article
    D1
    “On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction,” Theory of Computing Systems, vol. 43, no. 2, 2008.
  88. Article
    D1
    “Generating All Vertices of a Polyhedron Is Hard,” Discrete & Computational Geometry, vol. 39, no. 1–3, 2008.
  89. Article
    D1
    “Generating Cut Conjunctions in Graphs and Related Problems,” Algorithmica, vol. 51, no. 3, 2008.
  90. Article
    D1
    “Generating all Minimal Integral Solutions to AND-OR systems of Monotone Inequalities: Conjunctions are Simpler than Disjunctions,” Discrete Applied Mathematics, vol. 156, no. 11, 2008.
  91. Conference paper
    D1
    “Learning Fuzzy Rules with Evolutionary Algorithms - An Analytic Approach,” in Parallel Problem Solving from Nature (PPSN X), Dortmund, Germany, 2008.
  92. Article
    D1
    “A Monotone Approximation Algorithm for Scheduling with Precedence Constraints,” Operations Research Letters, vol. 36, no. 2, 2008.
  93. Article
    D1
    “Simultaneous Matchings: Hardness and Approximation,” Journal of Computer and System Sciences, vol. 74, no. 5, 2008.
  94. Article
    D1
    “Traveling Salesman Path Problems,” Mathematical Programming / A, vol. 113, no. 1, 2008.
  95. Article
    D1
    “Approximating k-hop Minimum Spanning Trees in Euclidean Metrics,” Information Processing Letters, vol. 107, no. 3/4, 2008.
  96. Thesis
    D1
    “Continued Work on the Computation of an Exact Arrangement of Quadrics,” Universität des Saarlandes, Saarbrücken, 2008.
  97. Thesis
    D1IMPR-CSD5
    “Index-based Snippet Generation,” Universität des Saarlandes, Saarbrücken, 2008.
  98. Book
    D1
    Algorithms and Data Structures: The Basic Toolbox. Berlin: Springer, 2008.
  99. Article
    D1
    “Faster Deterministic and Randomized Algorithms for Minimum Cycle Basis in Directed Graphs,” SIAM Journal of Computing, vol. 38, no. 4, 2008.
  100. Thesis
    D1IMPR-CS
    “NP-hard Networking Problems : Exact and Approximate Algorithms,” Universität des Saarlandes, Saarbrücken, 2008.
  101. Conference paper
    D1
    “Rigorous Analyses for the Combination of Ant Colony Optimization and Local Search,” in Ant Colony Optimization and Swarm Intelligence (ANTS 2008), Brussels, Belgium, 2008.
  102. Conference paper
    D1
    “Approximating Minimum Multicuts by Evolutionary Multi-Objective Algorithms,” in Parallel Problem Solving from Nature – PPSN X, Dortmund, Germany, 2008.
  103. Conference paper
    D1
    “Computing Minimum Cuts by Randomized Search Heuristics,” in GECCO’08, 10th Annual Conference on Genetic and Evolutionary Computation, Atlanta, GA, USA, 2008.
  104. Article
    D1
    “Expected Runtimes of Evolutionary Algorithms for the Eulerian Cycle Problem,” Computers and Operations Research, vol. 35, no. 9, 2008.
  105. Conference paper
    D1
    “Ant Colony Optimization and the Minimum Spanning Tree Problem,” in Learning and Intelligent Optimization (LION 2007), Trento, Italia, 2008.
  106. Article
    D1
    “Speed Scaling of Tasks with Precedence Constraints,” Theory of Computing Systems, vol. 43, no. 1, 2008.
  107. Article
    D1
    “Complexity of Real Root Isolation Using Continued Fractions,” Theoretical computer science, vol. 409, no. 2, 2008.
  108. Article
    D5D1
    “TopX: Efficient and Versatile Top-k Query Processing for Semistructured Data,” VLDB Journal, vol. 17, no. 1, 2008.
  109. Thesis
    D1IMPR-CS
    “Complexity of Some Polyhedral Enumeration Problems,” Universität des Saarlandes, Saarbrücken, 2008.
  110. Conference paper
    D1
    “On the Complexity of Checking Self-duality of Polytopes and its Relations to Vertex Enumeration and Graph Isomorphism,” in Proceedings of the Twenty-Fourth Annual Symposium on Computational Geometry (SCG’08), College Park, MD, USA,, 2008.
  111. Book chapter / section
    D1
    “Packet Switching in Single Buffer,” in Encyclopedia of Algorithms, Berlin: Springer, 2008.
  112. Book chapter / section
    D1
    “Paging,” in Encyclopedia of Algorithms, Berlin: Springer, 2008.
  113. Conference paper
    D1
    “A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances,” in Parameterized and Exact Computation (IWPEC 2008), Victoria, BC, Canada, 2008.
  114. Article
    D1
    “Consecutive Multiline Addressing: A Scheme for Addressing PMOLEDs,” Journal of the Society for Information Display, vol. 16, no. 2, 2008.
  115. Article
    BIOD1
    “Why Do Hubs in the Yeast Protein Interaction Network Tend To Be Essential: Reexamining the Connection between the Network Topology and Essentiality,” PLoS Computational Biology, vol. 4, no. 8, 2008.

2007

  1. Article
    D1
    “Popular Matchings,” SIAM Journal on Computing, vol. 37, no. 4, 2007.
  2. Article
    D1
    “On the Minimum Load Coloring Problem,” Journal of Discrete Algorithms, vol. 5, 2007.
  3. Conference paper
    D1
    “Conflict-free Coloring for Rectangle Ranges using O(n.382) Colors,” in SPAA’07, 19th Annual ACM Symposium on Parallel Algorithms and Architectures, San Diego, CA, USA, 2007.
  4. Conference paper
    D1
    “On Computing the Centroid of the Vertices of an Arrangement and Related Problems,” in Algorithms and Data Structures (WADS 2007), Halifax, Canada, 2007.
  5. Conference paper
    D1
    “Improved External Memory BFS Implementations,” in Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments and the Fourth Workshop on Analytic Algorithmics and Combinatorics (ALENEX 2007), New Orleans, LA, USA, 2007.
  6. Conference paper
    D1
    “Average-Case Analysis of Online Topological Ordering,” in Algorithms and Computation (ISAAC 2007), Sendai, Japan, 2007.
  7. Conference paper
    D1
    “Trunk Packing Revisited,” in Experimental Algorithms (WEA 2007), Rome, Italy, 2007.
  8. Report
    D1
    “A Lagrangian relaxation approach for the multiple sequence alignment problem,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-2007-1-002, 2007.
  9. Conference paper
    D1
    “A Lagrangian Relaxation Approach for the Multiple Sequence Alignment Problem,” in Combinatorial Optimization and Applications : First International Conference, COCOA 2007, Xi’an, Shaanxi, China, 2007.
  10. Conference paper
    D1
    “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), New Orleans, Louisiana, USA, 2007.
  11. Conference paper
    D1
    “On the Separation and Equivalence of Paging Strategies,” in Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), New Orleans, Louisiana, USA, 2007.
  12. Conference paper
    D1
    “Optimal Triangulation with Steiner Points,” in Algorithms and Computation (ISAAC 2007), Sendai, Japan, 2007.
  13. Article
    D1
    “Optimal Expected-case Planar Point Location,” SIAM Journal on Computing, vol. 37, no. 2, 2007.
  14. Article
    D1
    “A Simple Entropy-based Algorithm for Planar Point Location,” ACM Transactions on Algorithms, vol. 3, no. 2, 2007.
  15. Conference paper
    D1
    “Efficient Interactive Query Expansion with CompleteSearch,” in CIKM’07, 2007 ACM Conference on Information and Knowledge Management, Lisboa, Portugal, 2007.
  16. Article
    D1
    “Fast Routing in Road Networks using Transit Nodes,” Science, vol. 316, no. 5824, 2007.
  17. Conference paper
    D1
    “The CompleteSearch Engine: Interactive, Efficient, and Towards IR & DB integration,” in Third Biennial Conference on Innovative Data Systems Research (CIDR 2007), Asilomar, CA, USA, 2007.
  18. Conference paper
    D1
    “Managing Helpdesk Tasks with CompleteSearch: A Case Study,” in 4th Conference on Professional Knowledge Management (WM’07). - Bd. 2, Potsdam, Germany, 2007.
  19. Conference paper
    D1
    “In Transit to Constant Time Shortest-path Queries in Road Networks,” in Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments and the Fourth Workshop on Analytic Algorithmics and Combinatorics (ALENEX 2007), New Orleans, LA, USA, 2007.
  20. Conference paper
    D1IMPR-CSD5
    “ESTER: efficient search on Text, Entities, and Relations,” in SIGIR’07 : 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2007.
  21. Article
    D1
    “A Simple and Linear Time Randomized Algorithm for Computing Sparse Spanners in Weighted Graphs,” Random Structures & Algorithms, vol. 30, no. 4, 2007.
  22. Conference paper
    D1IMPR-CS
    “On Threshold BDDs and the Optimal Variable Ordering Problem,” in First International Conference on Combinatorial Optimization and Applications (COCOA’07), 2007.
  23. Conference paper
    D1IMPR-CS
    “A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem,” in 6th Workshop on Experimental Algorithms (WEA’07), 2007.
  24. Thesis
    D1IMPR-CS
    “Binary Decision Diagrams and Integer Programming,” Universität des Saarlandes, Saarbrücken, 2007.
  25. Conference paper
    D1
    “0/1 Vertex and Facet Enumeration with BDDs,” in Proceedings of the ninth Workshop on Algorithm Engineering and Experiments (ALENEX’07), New Orleans, LA, 2007.
  26. Conference paper
    D1
    “The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization,” in Integer Programming and Combinatorial Optimization (IPCO 2007), Ithaca, USA, 2007.
  27. Report
    D1
    “Computing Envelopes of Quadrics,” University of Groningen, Groningen, The Netherlands, ACS-TR-241402-03, 2007.
  28. Conference paper
    D1
    “Sweeping and Maintaining two-dimensional Arrangements on Surfaces: A First Step,” in Algorithms - ESA 2007, Eilat, Israel, 2007.
  29. Conference paper
    D1
    “Computing Envelopes of Quadrics,” in Collection of Abstracts of the 23rd European Workshop on Computational Geometry, Graz, Austria, 2007.
  30. Report
    D1
    “Linear-Time Reordering in a Sweep-line Algorithm for Algebraic Curves Intersecting in a Common Point,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-2007-1-001, 2007.
  31. Conference paper
    D1
    “Exact Computation of Arrangements of Rotated Conics,” in Collection of Abstracts of the 23rd European Workshop on Computational Geometry, Graz, Austria, 2007.
  32. Report
    D1
    “Revision of interface specification of algebraic kernel,” University of Groningen, Groningen, The Netherlands, 2007.
  33. Conference paper
    D1
    “Sweeping and Maintaining Two-dimensional Arrangements on Surfaces,” in Collection of Abstracts of the 23rd European Workshop on Computational Geometry, Graz, Austria, 2007.
  34. Report
    D1
    “Sweeping and maintaining two-dimensional arrangements on quadrics,” University of Groningen, Groningen, The Netherlands, ACS-TR-241402-02, 2007.
  35. Report
    D1
    “Definition of the 3D Quadrical Kernel Content,” University of Groningen, Groningen, The Netherlands, ACS-TR-243302-02, 2007.
  36. Report
    D1
    “Exact Computation of Arrangements of Rotated Conics,” University of Groningen, Groningen, The Netherlands, ACS-TR-123104-03, 2007.
  37. Report
    D1
    “Updated Website to include Benchmark Instances for Arrangements of Quadrics and Planar Algebraic Curves,” University of Groningen, Groningen, The Netherlands, ACS-TR-243305-01, 2007.
  38. Article
    D1
    “A Direct Decomposition of 3-connected Planar Graphs,” Séminaire Lotharingien de Combinatoire, vol. 54A, 2007.
  39. Article
    D1
    “Determining the Consistency of Partial Tree Descriptions,” Artificial Intelligence, vol. 171, no. 2/3, 2007.
  40. Conference paper
    D1
    “Generating Minimal k-Vertex Connected Spanning Subgraphs,” in Computing and Combinatorics (COCOON 2007), Banff, Canada, 2007.
  41. Conference paper
    D1
    “Do Additional Objectives Make a Problem Harder?,” in GECCO 2007 : Genetic and Evolutionary Computation Conference. - Vol. 1, London, UK, 2007.
  42. Conference paper
    D1
    “Randomized On-line Algorithms and Lower Bounds for Computing Large Independent Sets in Disk Graphs,” in 29th Symposium on Mathematical Foundations of Computer Science (MFCS 2004), Prague, Czech Republic, 2007.
  43. Article
    D1
    “A Tight Bound for Online Colouring of Disk Graphs,” Theoretical computer science, vol. 384, no. 2/3, 2007.
  44. Thesis
    D1
    “Evaluation of a Generic Method for Analyzing Controlled-Perturbation Algorithms,” Universität des Saarlandes, Saarbrücken, 2007.
  45. Thesis
    D1IMPR-CSD5
    “Efficient Large-Scale Clustering of Spelling Variants, with Applications to Error-Tolerant Text Search,” Universität des Saarlandes, Saarbrücken, 2007.
  46. Conference paper
    D1
    “Multiple Pass Streaming Algorithms for Learning Mixtures of Distributions in Rd,” in Algorithmic Learning Theory (ALT 2007), Sendai, Japan, 2007.
  47. Conference paper
    D1
    “Scheduling Selfish Tasks: About the Performance of Truthful Algorithms,” in Computing and Combinatorics : 13th Annual International Conference, COCOON 2007, 2007.
  48. Conference paper
    D1
    “Mechanism Design for Fractional Scheduling on Unrelated Machines,” in Automata, Languages and Programming, Wrocław, Poland, 2007.
  49. Conference paper
    D1
    “A Lower Bound for Scheduling Mechanisms,” in Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, USA, 2007.
  50. Article
    D1
    “The Wake-up Problem in Multihop Radio Networks,” SIAM Journal on Computing, vol. 36, no. 5, 2007.
  51. Article
    D1
    “A Generalization of Kotzig’s Theorem and Its Application,” SIAM Journal on Discrete Mathematics, vol. 21, no. 1, 2007.
  52. Article
    D1
    “Deterministic Random Walks on Regular Trees,” Electronic Notes in Discrete Mathematics, vol. 29, 2007.
  53. Article
    D1
    “Deterministic Random Walks on the Integers,” European Journal of Combinatorics, vol. 28, no. 8, 2007.
  54. Article
    D1
    “On the Bollobas-Eidrigde Conjecture for Bipartite Graphs,” Combinatorics, Probability and Computing, vol. 16, no. 1, 2007.
  55. Article
    D1
    “Delaunay Triangulation Approximates Anchor Hull,” Computational Geometry: Theory and Applications, vol. 36, 2007.
  56. Conference paper
    D1
    “On the Runtime Analysis of the 1-ANT ACO Algorithm,” in GECCO 2007, London, UK, 2007.
  57. Conference paper
    D1
    “Refined Runtime Analysis of a Basic Ant Colony Optimization Algorithm,” in IEEE Congress on Evolutionary Computation 2007, Singapore, 2007.
  58. Article
    D1
    “Roundings Respecting Hard Constraints,” Theory of Computing Systems, vol. 40, no. 4, 2007.
  59. Conference paper
    D1
    “Faster Evolutionary Algorithms by Superior Graph Representation,” in First IEEE Symposium on Foundations of Computational Intelligence (FOCI-2007), Honolulu, HI, USA, 2007.
  60. Conference paper
    D1
    “A Rigorous View On Neutrality,” in IEEE Congress on Evolutionary Computation 2007, Singapore, 2007.
  61. Conference paper
    D1
    “Adjacency List Matchings --- An Ideal Genotype for Cycle Covers,” in GECCO 2007 : Genetic and Evolutionary Computation Conference. - Vol. 1, London, UK, 2007.
  62. Article
    D1
    “Speeding up Evolutionary Algorithms Through Asymmetric Mutation Operators,” Evolutionary Computation, vol. 15, no. 4, 2007.
  63. Article
    D1
    “Lp Linear Discrepancy of Totally Unimodular Matrices,” Linear Algebra and its Applications, vol. 420, no. 2/3, 2007.
  64. Article
    D1
    “Matrix Approximation and Tusnády’s Problem,” European Journal of Combinatorics, vol. 28, no. 3, 2007.
  65. Article
    D1
    “Partial Colorings of Unimodular Hypergraphs,” Electronic Notes in Discrete Mathematics, vol. 29, 2007.
  66. Conference paper
    D1
    “Randomly Rounding Rationals with Cardinality Constraints and Derandomizations,” in STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, 2007.
  67. Conference paper
    D1
    “A Tight Bound for the (1+1)-EA on the Single Source Shortest Path Problem,” in IEEE Congress on Evolutionary Computation 2007, Singapore, 2007.
  68. Article
    D1
    “Unbiased Matrix Rounding,” Electronic Notes in Discrete Mathematics, vol. 28, 2007.
  69. Thesis
    D1IMPR-CS
    “Graph-based Conservative Surface Reconstruction,” Universität des Saarlandes, Saarbrücken, 2007.
  70. Report
    D1
    “Snap Rounding of Bézier Curves,” Max-Planck-Institut für Informatik, Saarbrücken, Germany, MPI-I-2006-1-005, 2007.
  71. Conference paper
    D1
    “Fast and Exact Geometric Analysis of Real Algebraic Plane Curves,” in ISSAC 2007, Waterloo, Ontario, Canada, 2007.
  72. Article
    D1
    “On Multiple Roots in Descartes’ Rule and Their Distance to Roots of Higher Derivatives,” Journal of Computational and Applied Mathematics, vol. 200, no. 1, 2007.
  73. Conference paper
    D1
    “Snap Rounding of Bézier Curves,” in Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG’07), Gyeongju, South Korea, 2007.
  74. Conference paper
    D1
    “Algorithms for Longer OLED Lifetime,” in Experimental Algorithms (WEA 2007), Rome, Italy, 2007.
  75. Article
    D1
    “Packing a Trunk - Now with a Twist!,” International Journal of Computational Geometry and Applications, vol. 17, no. 5, 2007.
  76. Conference paper
    D1
    “A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs,” in Algorithms - ESA 2007 : 15th Annual European Symposium, 2007.
  77. Manuscript
    D1
    “Polynomial parametrization of nonsingular algebraic curves.” Submitted to Computer Aided Geometric Design, 2007.
  78. Manuscript
    D1
    “Computing with algebraic curves in generic position.” Submitted to Journal of Computation and Mathematics, 2007.
  79. Article
    D1
    “Structure of Groebner Bases with Respect to Block Orders,” Mathematics of Computation, vol. 76, no. 260, 2007.
  80. Thesis
    D1IMPR-CS
    “Visualization of Points and Segments of Real Algebraic Plane Curves,” Universität des Saarlandes, Saarbrücken, 2007.
  81. Book chapter / section
    D1
    “Arrangements,” in Effective Computational Geometry for Curves and Surfaces, Berlin: Springer, 2007.
  82. Paper
    D1
    “Percolation on sparse random graphs with given degree sequence,” 2007. [Online]. Available: http://arxiv.org/abs/math/0703269.
  83. Article
    D1
    “Percolation on Sparse Random Graphs with Given Degree Sequence,” Internet Mathematics, vol. 4, no. 4, 2007.
  84. Conference paper
    D1
    “On Improving Approximate Solutions by Evolutionary Algorithms,” in 14th IEEE Congress on Evolutionary Computation (CEC 2007), Singapore, Singapore, 2007.
  85. Thesis
    D1IMPR-CS
    “Use and Avoidance of Randomness,” Universität des Saarlandes, Saarbrücken, 2007.
  86. Conference paper
    D1
    “Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models,” in GECCO 2007 : Genetic and Evolutionary Computation Conference. - Vol. 1, London, UK, 2007.
  87. Conference paper
    D1
    “Rigorous Analyses of Simple Diversity Mechanisms,” in Genetic and Evolutionary Computation Conference (GECCO 2007), London, UK, 2007.
  88. Conference paper
    D1
    “Plateaus Can Be Harder in Multi-Objective Optimization,” in IEEE Congress on Evolutionary Computation 2007, Singapore, Singapore, 2007.
  89. Article
    D1
    “Improved approximation algorithms for connected sensor cover,” Wireless Networks, vol. 13, no. 2, 2007.
  90. Conference paper
    D1
    “Network Sketching or: ‘How much Geometry hides in Connectivity? - Part II,’” in Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), New Orleans, LA, USA, 2007.
  91. Conference paper
    D1
    “Bounded-hop Energy-efficient Broadcast in Low-dimensional Metrics Via Coresets,” in STACS 2007, 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, 2007.
  92. Conference paper
    D1
    “Minimum Energy Broadcast with Few Senders,” in Distributed Computing in Sensor Systems (DCOSS 2007), Santa Fe, USA, 2007.
  93. Conference paper
    D1
    “Information Brokerage Via Location-Free Double Rulings,” in Ad-Hoc, Mobile, and Wireless Networks (ADHOC-NOW 2007), Morelia, Mexico, 2007.
  94. Conference paper
    D1
    “Guaranteed-delivery Geographic Routing under Uncertain Node Locations,” in INFOCOM 2007 , 26th IEEE Communications Society Conference on Computer Communications, Anchorage, USA, 2007.
  95. Conference paper
    D1
    “LFthreads: A Lock-Free Thread Library,” in Principles of Distributed Systems (OPODIS 2007), Guadeloupe, French West Indies, France, 2007.
  96. Report
    D1
    “LFthreads: a lock-free thread library,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-2007-1-003, 2007.
  97. Book chapter / section
    D1
    “The Combinatorial Structure of Polyhedral Choice Based Conjoint Analysis,” in Conjoint Measurement: Methods and Applications, Berlin: Springer, 2007.
  98. Article
    D1
    “Image-Dependent Gamut Mapping as Optimization Problem,” IEEE Transactions on Image Processing, vol. 16, no. 10, 2007.
  99. Article
    D1
    “Conjoint Analysis for Measuring the Perceived Quality in Volume Rendering,” IEEE Transactions on Visualization and Computer Graphics, vol. 13, no. 6, 2007.
  100. Conference paper
    D1
    “Collaborative Ranking: An Aggregation Algorithm for Individuals’ Preference Estimation,” in Algorithmic Aspects in Information and Management (AAIM 2007), Portland, USA, 2007.
  101. Article
    D1
    “Cycle Bases of Graphs and Sampled Manifolds,” Computer Aided Geometric Design, vol. 24, no. 8/9, 2007.
  102. Article
    D1
    “A Scalable Algorithm for Dispersing Population,” Journal of Intelligent Information Systems, vol. 29, no. 1, 2007.
  103. Article
    D1
    “Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, Optimized Implementation and Experiments,” Computational Geometry: Theory and Applications, vol. 38, no. 1–2, 2007.
  104. Paper
    D1
    “Discrepancy of Sums of two Arithmetic Progressions,” 2007. [Online]. Available: http://arxiv.org/abs/math/0703108.
  105. Article
    D1
    “An Adaptable and Extensible Geometry Kernel,” Computational Geometry: Theory and Applications, vol. 38, no. 1–2, 2007.
  106. Conference paper
    D1D5
    “STAR: A System for Tuple and Attribute Ranking of Query Answers (demo),” in ICDE 2007, Istanbul, Turkey, 2007.
  107. Thesis
    D1IMPR-CS
    “Engineering Combinatorial Optimization Algorithms to Improve the Lifetime of OLED Displays,” Universität des Saarlandes, Saarbrücken, 2007.
  108. Article
    D1
    “Strongly Stable Matchings in Time O(nm) and Extension to the Hospitals-residents Problem,” ACM Transactions on Algorithms, vol. 3, no. 2, 2007.
  109. Conference paper
    D1
    “New Approximation Algorithms for Minimum Cycle Bases of Graphs,” in STACS 2007, Aachen, Germany, 2007.
  110. Article
    D1
    “Algorithms to Compute Minimum Cycle Basis in Directed Graphs,” Theory of Computing Systems, vol. 40, no. 4, 2007.
  111. Article
    D1
    “Dual-bounded Generating Problems: Efficient and Inefficient Points for Discrete Probability Distributions and Sparse Boxes for Multidimensional Data,” Theoretical computer science, vol. 379, no. 3, 2007.
  112. Article
    D1
    “Enumerating Spanning and Connected Subsets in Graphs and Matroids,” Journal of the Operations Research Society of Japan, vol. 50, no. 4, 2007.
  113. Article
    D1
    “A Global Parallel Algorithm for the Hypergraph Transversal Problem,” Information Processing Letters, vol. 101, no. 4, 2007.
  114. Article
    D1
    “Enumerating Disjunctions and Conjunctions of Paths and Cuts in Reliability Theor,” Discrete applied mathematics, vol. 155, no. 2, 2007.
  115. Article
    D1
    “On the Dualization of Hypergraphs with Bounded Edge-intersections and Other Related Classes of Hypergraphs,” Theoretical Computer Science, vol. 382, no. 2, 2007.
  116. Conference paper
    D1
    “Computing Geometric Minimum-Dilation Graphs Is NP-Hard,” in Graph Drawing (GD 2006), Karlsruhe, Germany, 2007.
  117. Thesis
    D1IMPR-CS
    “Fast algorithms for two scheduling problems,” Universität des Saarlandes, Saarbrücken, 2007.
  118. Article
    D1
    “Adjacency Queries in Dynamic Sparse Graphs,” Information Processing Letters, vol. 102, no. 5, 2007.
  119. Conference paper
    D1
    “ScrewBox: a Randomized Certifying Graph Non-Isomorphism Algorithm,” in Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments and the Fourth Workshop on Analytic Algorithmics and Combinatorics (ALENEX 2007), New Orleans, LA, USA, 2007.
  120. Article
    D1
    “The Co-Word Problem for the Higman-Thompson Group is context-free,” Bulletin of the London Mathematical Society, vol. 39, no. 2, 2007.
  121. Thesis
    D1IMPR-CSD5
    “On the Spectral Retrieval and Efficient Top-k Query Processing,” Universität des Saarlandes, Saarbrücken, 2007.
  122. Thesis
    D1IMPR-CS
    “Geometric Optimization and Querying - Exact and Approximate,” Universität des Saarlandes, Saarbrücken, 2007.
  123. Article
    D1
    “Implementing Minimum Cycle Basis Algorithms,” Journal of Experimental Algorithmics, vol. 11, 2007.
  124. Conference paper
    D1
    “Minimum Cycle Bases in Graphs Algorithms and Applications,” in Mathematical Foundations of Computer Science 2007 : 32nd International Symposium, MFCS 2007, 2007.
  125. Conference paper
    D1
    “Matchings in Graphs Variations of the Problem,” in Combinatorial Optimization and Applications : First International Conference, COCOA 2007, 2007.
  126. Article
    D1
    “Reducing Rank-maximal to Maximum Weight Matching,” Theoretical computer science, vol. 389, no. 1–2, 2007.
  127. Conference paper
    D1
    “Medial Axis Approximation from Inner Voronoi Balls: A Demo of the Mesecina Tool,” in Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG’07), Gyeongju, South Korea, 2007.
  128. Book chapter / section
    D1
    “Algebraic Issues in Computational Geometry,” in Effective Computational Geometry for Curves and Surfaces, Berlin, Germany: Springer, 2007.
  129. Conference paper
    D1
    “An Optimal Generalization of the Centerpoint Theorem, and its Extensions,” in Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG’07), Gyeongju, South Korea, 2007.
  130. Conference paper
    D1
    “Comparing Variants of MMAS ACO Algorithms on pseudo-Boolean Functions,” in Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics (SLS 2007), 2007.
  131. Article
    D1
    “Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem,” Theoretical computer science, vol. 378, no. 1, 2007.
  132. Article
    D1
    “Efficient Models for Timetable Information in Public Transportation Systems,” Journal of Experimental Algorithmics, vol. 12, 2007.
  133. Conference paper
    D1
    “Weak ε-nets have basis of size O(1/ε log (1/ε)) in any dimension,” in Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG’07), Gyeongju, South Korea, 2007.
  134. Thesis
    D1IMPR-CSD5
    “Efficient Index Structures for and Applications of the CompleteSearch Engine,” Universität des Saarlandes, Saarbrücken, 2007.
  135. Conference paper
    D1
    “A New Addressing Scheme for PM OLED Display,” in SID Symposium Digist of Technical Papers, Long Beach, CA, USA, 2007, vol. 38, no. 1.

2006

  1. Conference paper
    D1
    “An O(n^2.75) algorithm for online topological ordering,” in Algorithm theory - SWAT 2006 : 10th Scandinavian Workshop on Algorithm Theory, 2006.
  2. Conference paper
    D1
    “A computational study of external memory BFS algorithms,” in Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA’06, 2006.
  3. Article
    D1
    “Aligning Multiple Sequences by Cutting Planes,” Mathematical Programming / A, vol. 2006, 2006.
  4. Article
    D1
    “Power Efficient Range Assignment for Symmetric Connectivity in Static Ad-hoc Wireless Networks,” Wireless Networks, vol. 12, no. 3, 2006.
  5. Conference paper
    D1
    “Computing Steiner Minimal Trees in Hamming Metric,” in Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA’06, 2006.
  6. Article
    D1
    “Polyline Fitting of Planar Points under Min-sum Criteria,” International Journal of Computational Geometry and Applications, vol. 16, 2006.
  7. Conference paper
    D1
    “On the Importance of Idempotence,” in Proceedings of the 38th Annual ACM Symposium on Theory of Computing, STOC’06, 2006.
  8. Conference paper
    D1
    “The Effect of Corners on the Complexity of Approximate Range Searching,” in Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG’06, 2006.
  9. Article
    D1
    “Balanced partitions of vector sequences,” Linear Algebra and its Applications, vol. 414, 2006.
  10. Conference paper
    D1
    “On the value of preemption in scheduling,” in 9th Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX, 2006.
  11. Conference paper
    D1D5
    “IO-Top-k at TREC 2006: Terabyte Track,” in Proceedings of the 15th Text REtrieval Conference (TREC 2006), 2006.
  12. Article
    D1
    “Intelligente Suche mit garantiert schnellen Antwortzeiten,” Jahrbuch der Max-Planck-Gesellschaft, 2006.
  13. Conference paper
    D1D5
    “IO-Top-k: Index-Access Optimized Top-k Query Processing,” in Proceedings of the 32nd International Conference on Very Large Data Bases, VLDB 2006, 2006.
  14. Conference paper
    D1D5
    “IO-Top-k at TREC 2006: Terabyte Track,” in The Fifteenth Text Retrieval Conference Proceedings, TREC 2006, 2006.
  15. Conference paper
    D1
    “When You’re Lost For Words: Faceted Search With Autocompletion,” in SIGIR’06 Workshop on Faceted Search, 2006.
  16. Report
    D1
    “Output-sensitive autocompletion search,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-2006-1-007, 2006.
  17. Conference paper
    D1
    “Output-Sensitive Autocompletion Search,” in String Processing and Information Retrieval : 13th International Conference, SPIRE 2006, 2006.
  18. Report
    D1D5D4
    “IO-Top-k: index-access optimized top-k query processing,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-2006-5-002, 2006.
  19. Conference paper
    D1
    “TRANSIT: Ultrafast Shortest-Path Queries with Linear-Time Preprocessing,” in 9th DIMACS Implementation Challenge --- Shortest Path, 2006.
  20. Article
    D1
    “Matching Algorithms are Fast in Sparse Random Graphs,” Theory of Computing Systems, vol. 39, 2006.
  21. Conference paper
    D1
    “Discovering a Term Taxonomy from Term Similarities Using Principal Component Analysis,” in Semantics, web and mining : Joint International Workshops, EWMF 2005 and KDO 2005, 2006.
  22. Conference paper
    D1
    “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, 2006.
  23. Article
    D1
    “Computing Equilibria for a Service Provider Game with (Im)perfect Information,” ACM Transactions on Algorithms, vol. 2, 2006.
  24. Article
    D1
    “An Experimental Study of Random Knapsack Problems,” Algorithmica, vol. 45, 2006.
  25. Article
    D1
    “Typical Properties of Winners and Losers in Discrete Optimization,” SIAM Journal on Computing, vol. 35, 2006.
  26. Article
    D1
    “Filtering Algorithms for the Same and UsedBy Constraints,” Archives of Control Sciences, vol. 16, no. 2, 2006.
  27. Report
    D1
    “Definition of File Format for Benchmark Instances for Arrangements of Quadrics,” University of Groningen, Groningen, The Netherlands, ACS-TR-123109-01, 2006.
  28. Report
    D1
    “Web-site with Benchmark Instances for Planar Curve Arrangements,” University of Groningen, Groningen, The Netherlands, ACS-TR-123108-01, 2006.
  29. Conference paper
    D1
    “On the minimum corridor connection and other generalized geometric problems,” in 4th Workshop on Approximation and Online Algorithms, WAOA, 2006.
  30. Conference paper
    D1
    “Faster Algorithms for Computing Longest Common Increasing Subsequences,” in Combinatorial Pattern Matching, 17th Annual Symposium, CPM 2006, 2006.
  31. Article
    D1
    “Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm,” SIAM Journal on Computing, vol. 36, no. 3, 2006.
  32. Article
    D1
    “Algorithmic methods for investigating equilibria in epidemic modeling,” Journal of Symbolic Computation, vol. 41, 2006.
  33. Article
    D1
    “The Local C(G,T) Theorem,” Journal of Algebra, vol. 300, 2006.
  34. Conference paper
    D1
    “Shape Distributions and Protein Similarity,” in German Conference on Bioinformatics (GCB 2006), Tübingen, Germany, 2006.
  35. Thesis
    D1
    “Exakte Arrangement-Berechnung gedrehter Quadratischer Kurven,” Universität des Saarlandes, Saarbrücken, 2006.
  36. Conference paper
    D1
    “The Space Complexity of Pass-Efficient Algorithms for Clustering,” in Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA’06, 2006.
  37. Article
    D1D5
    “Probabilistic information retrieval approach for ranking of database query results,” ACM Transactions on Database Systems, vol. 31, 2006.
  38. Article
    D1
    “A Note on Scheduling Equal-Length Jobs to Maximize Throughput,” Journal of Scheduling, vol. 9, 2006.
  39. Paper
    D1
    “Deterministic Random Walks on the Integers,” 2006. [Online]. Available: http://arxiv.org/abs/math/0602300.
  40. Conference paper
    D1
    “Deterministic Random Walks,” in Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments and the Third Workshop on Analytic Algorithmics and Combinatorics (ALENEX’06 / ANALCO'06), 2006.
  41. Article
    D1
    “A randomized on-line algorithm for the k-server problem on the line,” Random Structures and Algorithms, vol. 29, no. 1, 2006.
  42. Thesis
    D1IMPR-CSD5
    “Algorithm Engineering for Large Data Sets,” Universität des Saarlandes, Saarbrücken, 2006.
  43. Conference paper
    D1
    “Unbiased Rounding of Rational Matrices,” in FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science: 26th International Conference, 2006.
  44. Article
    D1
    “Quasirandomness in Graphs,” Electronic Notes in Discrete Mathematics, vol. 25, 2006.
  45. Report
    D1
    “Construction of Low-discrepancy Point Sets of Small Size by Bracketing Covers and Dependent Randomized Rounding,” University Kiel, Kiel, 06-14, 2006.
  46. Article
    D1
    “Improved Bounds and Schemes for the Declustering Problem,” Theoretical Computer Science, vol. 359, 2006.
  47. Conference paper
    D1
    “Generating Randomized Roundings with Cardinality Constraints and Derandomizations,” in STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, 2006.
  48. Article
    D1
    “Discrepancy of Symmetric Products of Hypergraphs,” The Electronic Journal of Combinatorics, vol. 13, 2006.
  49. Conference paper
    D1
    “The Interval Liar Game,” in Algorithms and Computation : 17th International Symposium, ISAAC 2006, 2006.
  50. Conference paper
    D1
    “Deterministic Random Walks on the Two-Dimensional Grid,” in Algorithms and Computation : 17th International Symposium, ISAAC 2006, 2006.
  51. Conference paper
    D1
    “Speeding Up Evolutionary Algorithms Through Restricted Mutation Operators,” in Parallel Problem Solving from Nature - PPSN IX, 9th International Conference, 2006.
  52. Article
    D1
    “Matrix Rounding With Respect to Small Submatrices,” Random Structures & Algorithms, vol. 28, 2006.
  53. Article
    D1
    “Non-independent Randomized Rounding, Linear Discrepancy and an Application to Digital Halftoning,” Eurocomb ’03, vol. 3, 2006.
  54. Article
    D1
    “Error Propagation in Game Trees,” Mathematical Methods of Operations Research, vol. 64, 2006.
  55. Conference paper
    D1
    “Unbiased Matrix Rounding,” in Algorithm theory - SWAT 2006 : 10th Scandinavian Workshop on Algorithm Theory, 2006.
  56. Article
    D1
    “Non-independent randomized rounding and coloring,” Discrete Applied Mathematics, vol. 154, 2006.
  57. Article
    D1
    “Controlled Randomized Rounding,” Electronic Notes in Discrete Mathematics, vol. 25, 2006.
  58. Article
    D1
    “Algorithms and Experiments for the Webgraph,” Journal of Graph Algorithms and Applications, vol. 10, no. 2, 2006.
  59. Article
    D1
    “Exact, Efficient and Complete Arrangement Computation for Cubic Curves,” Computational Geometry, vol. 35, 2006.
  60. Conference paper
    D1
    “Almost Tight Recursion Tree Bounds for the Descartes Method,” in ISSAC ’06: Proceedings of the 2006 international symposium on Symbolic and algebraic computation, 2006.
  61. Conference paper
    D1
    “Provisioning a Virtual Private Network Under the Presence of Non-communicating Groups,” in Algorithms and Complexity (CIAC 2006), Rome, Italy, 2006.
  62. Conference paper
    D1
    “Multiline Addressing by Network Flow,” in Algorithms -- ESA 2006, Zürich, Switzerland, 2006.
  63. Conference paper
    D1
    “On the Complexity of the Multiplication Method for Monotone CNF/DNF Dualization,” in Algorithms - ESA 2006, 14th Annual European Symposium, 2006.
  64. Conference paper
    D1
    “On Approximating the TSP with Intersecting Neighborhoods,” in Algorithms and Computation : 17th International Symposium, ISAAC 2006, 2006.
  65. Conference paper
    D1
    “Finding All Minimal Infrequent Multi-dimensional Intervals,” in LATIN 2006: Theoretical Informatics, 7th Latin American Symposium, 2006.
  66. Report
    D1
    “On the Complexity of Monotone Boolean Duality Testing,” DIMACS, Piscataway, NJ, DIMACS TR: 2006-01, 2006.
  67. Conference paper
    D1
    “Conflict-Free Colorings of Rectangle Ranges,” in STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, 2006.
  68. Article
    D1
    “Multiconsistency and Robustness with Global Constraints,” Constraints, vol. 11, 2006.
  69. Article
    D1
    “Upper bound on the number of vertices of polyhedra with 0, 1-constraint matrices,” Information Processing Letters, vol. 100, 2006.
  70. Article
    D1
    “The geometric generalized minimum spanning tree problem with grid clustering,” 4or: A Quarterly Journal of Operations Research, vol. 4, 2006.
  71. Thesis
    D1
    “Hereditary Discrepancy in Different Numbers of Colors,” Universität des Saarlandes, Saarbrücken, 2006.
  72. Conference paper
    D1
    “Distance-Sensitive Information Brokerage in Sensor Networks,” in Distributed Computing in Sensor Systems, Second IEEE International Conference, DCOSS 2006, 2006.
  73. Conference paper
    D1
    “(Approximate) Conic Nearest Neighbors and the induced Voronoi Diagram,” in 18th Canadian Conference on Computational Geometry, 2006.
  74. Report
    D1
    “Controlled Perturbation for Delaunay Triangulations,” Algorithms for Complex Shapes with certified topology and numerics, Instituut voor Wiskunde en Informatica, Groningen, NETHERLANDS, ACS-TR-121103-03, 2006.
  75. Report
    D1
    “Power assignment problems in wireless communication,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-2006-1-004, 2006.
  76. Conference paper
    D1
    “Hole Detection or: ‘How Much Geometry Hides in Connectivity?,’” in Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG’06, 2006.
  77. Article
    D1
    “A Simple Improved Distributed Algorithm for Minimum CDS in Unit Disk Graphs,” ACM Transactions on Sensor Networks, vol. 2, 2006.
  78. Conference paper
    D1
    “How to Sell a Graph: Guidelines for Graph Retailers,” in Graph-Theoretic Concepts in Computer Science : 32nd International Workshop, WG 2006, 2006.
  79. Thesis
    D1IMPR-CS
    “Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms Optimized Implementation, Experiments and Applications,” Universität des Saarlandes, Saarbrücken, 2006.
  80. Conference paper
    D1
    “A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs,” in Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Part I, 2006.
  81. Conference paper
    D1
    “Approximating the Orthogonal Knapsack Problem for Hypercubes,” in Automata, Languages and Programming (ICALP 2006), Venice, Italy, 2006, no. 1.
  82. Article
    D1
    “Rank-Maximal Matchings,” ACM Transactions on Algorithms, vol. 2, 2006.
  83. Thesis
    D1
    “Sampling Rooted 3-Connected Planar Graphs in Deterministic Polynomial Time,” Humboldt-Universität zu Berlin, Saarbrücken, 2006.
  84. Conference paper
    D1
    “How Branch Mispredictions Affect Quicksort,” in Algorithms - ESA 2006, 14th Annual European Symposium, 2006.
  85. Report
    D1
    “Division-free computation of subresultants using bezout matrices,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-2006-1-006, 2006.
  86. Thesis
    D1
    “Analysis of Real Algebraic Plane Curves,” Universität des Saarlandes, Saarbrücken, 2006.
  87. Conference paper
    D1
    “Reply to ‘Backward Error Analysis ...,’” in Computational Science and Its Applications - ICCSA 2006, I, 2006.
  88. Conference paper
    D1
    “Reference Counting in Library Design - Optionally and with Union-find Optimization,” in Proceedings of the First International Workshop on Library-Centric Software Design, LCSD’05, San Diego, CA, USA, 2006.
  89. Conference paper
    D1
    “Enumerating Spanning and Connected Subsets in Graphs and Matroids,” in Algorithms - ESA 2006, 14th Annual European Symposium, 2006.
  90. Conference paper
    D1
    “Generating All Vertices of a Polyhedron is Hard,” in Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA’06, 2006.
  91. Conference paper
    D1
    “The Density of Iterated Crossing Points and a Gap Result for Triangulations of Finite Point Sets,” in Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG’06, 2006.
  92. Conference paper
    D1
    “Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures,” in Algorithms and Computation : 17th International Symposium, ISAAC 2006, 2006.
  93. Conference paper
    D1
    “Improved Edge Coloring with Three Colors,” in Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, WG 2006, 2006.
  94. Article
    D1
    “New bounds for the Descartes method,” Journal of Symbolic Computation, vol. 41, no. 1, 2006.
  95. Article
    D1
    “Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs,” SIAM Journal on Computing, vol. 36, 2006.
  96. Conference paper
    D1
    “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, 2006.
  97. Conference paper
    D1
    “Sequences Characterizing k-Trees,” in Computing and Combinatorics, 12th Annual International Conference, COCOON 2006, 2006.
  98. Conference paper
    D1
    “Goal Directed Shortest Path Queries Using Precomputed Cluster Distances,” in Experimental Algorithms, 5th International Workshop, WEA 2006, 2006.
  99. Thesis
    D1
    “A Goal-Directed Shortest Path Algorithm Using Precomputed Cluster Distances,” Universität des Saarlandes, Saarbrücken, 2006.
  100. Conference paper
    D1
    “Reliable and Efficient Computational Geometry Via Controlled Perturbation,” in Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Part I, 2006.
  101. Conference paper
    D1
    “Reliable and Efficient Geometric Computing,” in Algorithms and Complexity : 6th Italian Conference, CIAC 2006, 2006.
  102. Article
    D1
    “Implementing Minimum Cycle Basis Algorithms,” ACM Journal of Experimental Algorithmics, vol. 11, 2006.
  103. Conference paper
    D1
    “I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths,” in Algorithms - ESA 2006, 14th Annual European Symposium, 2006.
  104. Conference paper
    D1
    “Introducing History-enriched Security Context Transfer to Enhance the Security of Subsequent Handover,” in PerCom 2006, Pisa, Italy, 2006.
  105. Thesis
    D1IMPR-CS
    “Minimum Cycle Basis, Algorithms & Applications,” Universität des Saarlandes, Saarbrücken, 2006.
  106. Article
    BIOD1
    “Prediction of Percutaneous Drug Absorption,” Journal of Chemical Information and Modeling, vol. 1, no. 46, 2006.
  107. Article
    D1BIO
    “A Fully Computational Model for Predicting Percutaneous Drug Absorption,” Journal of Chemical Information and Modeling, vol. 1, 2006.
  108. Article
    D1
    “Ant Colony Optimization and the Minimum Spanning Tree Problem,” Electronic Colloquium on Computational Complexity (ECCC) : Report Series, vol. 143, 2006.
  109. Conference paper
    D1
    “A New Approximation Algorithm for Multidimensional Rectangle Tiling,” in Algorithms and Computation : 17th International Symposium, ISAAC 2006, 2006.
  110. Thesis
    D1
    “Exact Integer Linear Programming with Bounded Variables in a Branch- and Cut Algorithm,” Universität des Saarlandes, Saarbrücken, 2006.
  111. Thesis
    D1IMPR-CS
    “Combinatorial Approaches to Trunk Packing Problem,” Universität des Saarlandes, Saarbrücken, 2006.
  112. Conference paper
    BIOD1
    “Functional evaluation of domain-domain interactions and human protein interaction networks,” in German Conference on Bioinformatics (GCB 2006), 2006.
  113. Thesis
    D1
    “Dynamics in Large-Scale Peer-to-Peer-Networks,” Universität des Saarlandes, Saarbrücken, 2006.
  114. Article
    D1
    “An Exact and Efficient Approach for Computing a Cell in an Arrangement of Quadrics,” Computational Geometry, vol. 33, 2006.
  115. Article
    D1
    “The general two-server problem,” Journal of the ACM, vol. 53, 2006.
  116. Thesis
    D1
    “Tight Bounds on the Min-Max Boundary Decomposition Cost of Weighted Graphs,” Universität des Saarlandes, Saarbrücken, 2006.
  117. Thesis
    D1
    “An Asymptomic Approximation Scheme for Multigraph Edge Coloring,” Universität des Saarlandes, Saarbrücken, 2006.
  118. Conference paper
    D5D1
    “Combining Linguistic and Statistical Analysis to Extract Relations from Web Documents,” in Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2006), 2006.
  119. Article
    D1
    “Inserting Points Uniformly at Every Instance,” IEICE - Transactions on Information and Systems, vol. E89-D, 2006.
  120. Thesis
    D1
    “Solving large Sparse Linear Systems exactly,” Universität des Saarlandes, Saarbrücken, 2006.

2005

  1. Conference paper
    D1
    “Popular Matchings,” in Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), Vancouver, Canada, 2005.
  2. Conference paper
    D1
    “Pareto Optimality in House Allocation Problems,” in Algorithms and Computation (ISAAC 2004), Hong Kong, China, 2005.
  3. Conference paper
    D1
    “Pareto Optimality in House Allocation Problems,” in Algorithms and computation (ISAAC 2005), Sanya, Hainan, China, 2005.
  4. Conference paper
    D1
    “On the Minimum Load Coloring Problem,” in Approximation and Online Algorithms (WAOA 2005), Palma de Mallorca, Spain, 2005.
  5. Thesis
    D1IMPR-CS
    “Design, Implementation and Experimental Study of External Memory BFS Algorithms,” Universität des Saarlandes, Saarbrücken, 2005.
  6. Article
    D1
    “Approximating k-Hop Minimum-Spanning Trees,” Operations Research Letters, vol. 33, 2005.
  7. Conference paper
    D1
    “Space-Time Tradeoffs for Approximate Spherical Range Counting,” in Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 2005.
  8. Article
    D1
    “Präzisionssuche im homöopathischen Netz,” Homöopathie-Zeitschrift, vol. I/05, 2005.
  9. Conference paper
    D1
    “Don’t Compare Averages,” in 4th International Workshop on Efficient and Experimental Algorithms (WEA’05), 2005.
  10. Conference paper
    D1
    “Insights from Viewing Ranked Retrieval as Rank Aggregation,” in Workshop on Challenges in Web Information Retrieval and Integration (WIRI’05), 2005.
  11. Conference paper
    D1
    “Why Spectral Retrieval Works,” in Proceedings of SIGIR 2005 (SIGIR-05) : the Twenty-Eighth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2005.
  12. Conference paper
    D1
    “New Constructions of (alpha, beta)-Spanners and Purely Additive Spanners,” in Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), Vancouver, Canada, 2005.
  13. Conference paper
    D1
    “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, 2005.
  14. Report
    D1
    “Improved algorithms for all-pairs approximate shortest paths in weighted graphs,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-2005-1-003, 2005.
  15. Conference paper
    D1
    “BDDs in a Branch and Cut Framework,” in 4th International Workshop on Experimental and Efficient Algorithms (WEA’05), Santorini, Greece, 2005.
  16. Conference paper
    D1
    “GCC-like Restrictions on the Same constraint,” in Constraint Satisfaction and Constraint Logic Programming: ERCIM/CoLogNet International Workshop, CSCLP 2004, 2005.
  17. Conference paper
    D1
    “EXACUS: Efficient and Exact Algorithms for Curves and Surfaces,” in Algorithms -- ESA 2005, Palma de Mallorca, Spain, 2005.
  18. Conference paper
    D1
    “An Exact, Complete and Efficient Implementation for Computing Planar Maps of Quadric Intersection Curves,” in 21st Annual Symposium on Computational Geometry (SCG’05), 2005.
  19. Conference paper
    D1
    “An Analysis of Factors Used in Search Engine Ranking,” in 1st International Workshop on Adversarial Information Retrieval on the Web (AIRWeb’05), 2005.
  20. Conference paper
    D1
    “Counting and enumerating pointed pseudo-triangulations with the greedy flip algorithm,” in Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics (ALENEX/ANALCO 2005), 2005.
  21. Article
    D1
    “Girth and Treewidth,” Journal of Combinatorical Theory, Series B, vol. 93, no. 1, 2005.
  22. Conference paper
    D1
    “Cooperative asynchronous update of shared memory,” in Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC 2005), 2005.
  23. Conference paper
    D1
    “Deterministic Random Walks on the Integers,” in 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb ’05), 2005.
  24. Conference paper
    D1
    “Better External Memory Suffix Array Construction,” in Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics (ALENEX/ANALCO 2005), 2005.
  25. Report
    D1
    “STXXL: Standard Template Library for XXL Data Sets,” Fakultät für Informatik, University of Karlsruhe, Karlsruhe, Germany, 2005/18, 2005.
  26. Conference paper
    D1
    “STXXL: Standard Template Library for XXL Data Sets,” in Algorithms - ESA 2005 : 13th Annual European Symposium (ESA 2005), 2005.
  27. Conference paper
    D1
    “Matrix Rounding with Low Error in Small Submatrices,” in Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), Vancouver, Canada, 2005.
  28. Conference paper
    D1
    “Discrepancy of Products of Hypergraphs,” in 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb ’05), 2005.
  29. Article
    D1
    “Bounds and Constructions for the Star-Discrepancy via Delta-Covers,” Journal of Complexity, vol. 21, 2005.
  30. Conference paper
    D1
    “Roundings Respecting Hard Constraints,” in STACS 2005, 22nd Annual Symposium on Theoretical Aspects of Computer Science, Stuttgart, Germany, 2005.
  31. Conference paper
    D1
    “Rounding of Sequences and Matrices, with Applications,” in Approximation and Online Algorithms (WAOA 2005), Palma de Mallorca, Spain, 2005.
  32. Thesis
    D1
    “Benchmark Data Sets for Conic Arrangements,” Universität des Saarlandes, Saarbrücken, 2005.
  33. Conference paper
    D1
    “A Descartes Algorithm for Polynomials with Bit-Stream Coefficients,” in Computer Algebra in Scientific Computing (CASC 2005), Kalamata, Greece, 2005.
  34. Conference paper
    D1
    “New Approaches for Virtual Private Network Designs,” in Automata, Languages and Programming (ICALP 2005), Lisboa, Portugal, 2005.
  35. Article
    D1
    “A Linear Algorithm for Integer Programming in the Plane,” Mathematical Programming / A, vol. 102, no. 2, 2005.
  36. Conference paper
    D1
    “Energy-aware Stage Illumination,” in Proceedings of the 21st Annual Symposium on Computational Geometry (SCG 2005), Pisa, Italy, 2005.
  37. Conference paper
    D1
    “Packing a Trunk - now with a Twist!,” in SPM 2005, 2005 ACM Symposium on Solid and Physical Modeling, Boston, MA, USA, 2005.
  38. Article
    D1
    “An Indexing Method for Answering Queries on Moving Objects,” Distributed and Parallel Databases, vol. 17, 2005.
  39. Conference paper
    D1
    “Simultaneous Matchings,” in Algorithms and Computation (ISAAC 2005), Sanya, Hainan, China, 2005.
  40. Conference paper
    D1
    “Approximation algorithms for Euclidean Group TSP,” in Automata, languages and programming : 32nd International Colloquim, ICALP 2005, 2005.
  41. Conference paper
    D1
    “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, 2005.
  42. Article
    D1
    “D-resultant and subresultants,” Proceedings of the Amercian Mathematical Society, vol. 133, 2005.
  43. Article
    D1
    “UFDs with commuting linearly independent locally nilpotent derivations,” Journal of Algebra, vol. 289, 2005.
  44. Article
    D1
    “Birational properties of the gap subresultant varieties,” Journal of Symbolic Computation, vol. 39, 2005.
  45. Conference paper
    D1
    “Output-Sensitive Algorithms for Enumerating and Counting Simplices Containing a Given Point in th Plane,” in 17th Canadian Conference on Computational Geometry (CCCG’05), Windsor, Canada, 2005.
  46. Article
    D1
    “Space Efficient Hash Tables With Worst Case Constant Access Time,” Theory of Computing Systems, vol. 38, 2005.
  47. Thesis
    D1
    “Deterministic Random Walks on Infinite Grids,” Friedrich-Schiller-Universität Jena, Saarbrücken, 2005.
  48. Conference paper
    D1
    “Infrastructure-Establishment from Scratch in Wireless Sensor Networks,” in Distributed computing in sensor systems : First IEEE International Conference, DCOSS 2005, 2005.
  49. Conference paper
    D1
    “A Simple Improved Distributed Algorithm for Minimum CDS in Unit Disk Graphs,” in 1st IEEE Intern. Conf. on Wireless and Mobile Computing, Networking and Communications (WiMob 2005), 2005.
  50. Article
    D1
    “Structural Filtering: a Paradigm for Efficient and Exact Geometric Programs,” Computational Geometry, vol. 31, no. 3, 2005.
  51. Conference paper
    D1
    “Topological Hole Detection in Wireless Sensor Networks and its Applications,” in 3rd ACM/SIGMOBILE International Workshop on foundations of Mobile Computing (DIAL-M-POMC), 2005.
  52. Conference paper
    D1
    “Controlled Perturbation for Delaunay Triangulations,” in Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), Vancouver, Canada, 2005.
  53. Report
    D1
    “Cycle bases of graphs and sampled manifolds,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-2005-1-008, 2005.
  54. Conference paper
    D4D1
    “Nailing and Pinning: Adding Constraints to Inverse Kinematics,” in The 13-th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision 2005 in co-operation with EUROGRAPHICS W S C G ’ 2005 ; Short Papers, 2005.
  55. Conference paper
    D1
    “Boolean Operations on 3D Selective Nef Complexes: Optimized Implementation and Experiments,” in ACM Symposium on Solid and Physical Modeling (SPM 2005), 2005.
  56. Article
    D1
    “Duality Between Prefetching and Queued Writing with Parallel Disks,” SIAM Journal on Computing, vol. 34, 2005.
  57. Conference paper
    D1
    “Towards Optimal Multiple Selection,” in Automata, Languages and Programming : 32nd International Colloquium, ICALP 2005, 2005.
  58. Thesis
    D1
    “Branch-and-Cut Techniques for Generalized Asymmetric Traveling Salesman Problem,” Universität des Saarlandes, Saarbrücken, 2005.
  59. Thesis
    D1IMPR-CS
    “Constraints and Changes,” Universität des Saarlandes, Saarbrücken, 2005.
  60. Report
    D1
    “Reachability substitutes for planar digraphs,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-2005-1-002, 2005.
  61. Conference paper
    D1
    “Online Topological Ordering,” in Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 2005.
  62. Article
    D1
    “Maintaining Longest Paths Incrementally,” Constraints, vol. 10, 2005.
  63. Article
    D1
    “Complete Bound Consistency for the Global Cardinality Constraint,” Constraints, vol. 10, 2005.
  64. Report
    D1
    “A faster algorithm for computing a longest common increasing subsequence,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-2005-1-007, 2005.
  65. Conference paper
    D1
    “A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs,” in STACS 2005, 22nd Annual Symposium on Theoretical Aspects of Computer Science, Stuttgart, Germany, 2005.
  66. Article
    D1
    “Energy efficient communication in ad hoc networks from user’s and designer's perspective,” ACM SIGMOBILE Mobile Computing and Communications Review, vol. 9, 2005.
  67. Conference paper
    D1
    “Fast Distributed Algorithm for Convergecast in Ad Hoc Geometric Radio Networks,” in Second Annual Conference on Wireless On-demand Network Systems and Services (WONS’05), 2005.
  68. Conference paper
    D1
    “Non-Preemptive Scheduling of Optical Switches,” in 2004 IEEE Global Telecommunications Conference workshops (GLOBECOM’04), 2005.
  69. Conference paper
    D1
    “Reference Counting in Library Design - Optionally and with Union-Find Optimization,” in Library-Centric Software Design (LCSD’05), 2005.
  70. Conference paper
    D1
    “Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs,” in Algorithms and computation (ISAAC 2005), Sanya, Hainan, China, 2005.
  71. Article
    D1
    “On the Complexity of Some Enumeration Problems for Matroids,” SIAM Journal on Discrete Mathematics, vol. 19, 2005.
  72. Conference paper
    D1
    “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, 2005.
  73. Conference paper
    D1
    “A New Algorithm for the Hypergraph Transversal Problem,” in Computing and combinatorics : 11th Annual International Conference, COCOON 2005, 2005.
  74. Conference paper
    D1
    “Fast monotone 3-approximation algorithm for scheduling related machines,” in Algorithms - ESA 2005: 13th Annual European Symposium, 2005.
  75. Conference paper
    D1
    “Polynomial Time Preemptive Sum-Multicoloring on Paths,” in Automata, languages and programming : 32nd International Colloquim, ICALP 2005, 2005.
  76. Conference paper
    D1
    “Weak Positional Games on Hypergraphs of Rank Three,” in 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb ’05), 2005.
  77. Conference paper
    D1
    “Angel, Devil, and King,” in Computing and Combinatorics : 11th Annual International Conference, COCOON 2005, 2005.
  78. Article
    D1
    “Conway’s Angel in three dimensions,” Theoretical Computer Science, vol. 349, 2005.
  79. Proceedings
    D1
    Eds., Cache-Oblivious and Cache-Aware Algorithms. Schloss Dagstuhl, 2005.
  80. Conference paper
    D1
    “Lower Bounds for Expected-case Planar Point Location,” in 17th Canadian Conference on Computational Geometry (CCCG’05), Windsor, Canada, 2005.
  81. Paper
    D1
    “Network Problems with Non-Polynomial Weights And Applications.” 2005.
  82. Conference paper
    D1
    “Implementing Minimum Cycle Basis Algorithms,” in Experimental and Efficient Algorithms, 4th InternationalWorkshop, WEA 2005, 2005.
  83. Conference paper
    D1
    “Minimum Cycle Bases and Surface Reconstruction,” in Graph Drawing (GD 2005), Limerick, Ireland, 2005.
  84. Article
    D1RG1
    “Harald Ganzinger : 31.10.1950 - 3.6.2004,” Jahrbuch der Max-Planck-Gesellschaft, 2005.
  85. Report
    D1
    “Rank-maximal through maximum weight matchings,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-2005-1-001, 2005.
  86. Proceedings
    D1
    Eds., 21st Annual Symposium on Computational Geometry (SCG’05). ACM, 2005.
  87. Conference paper
    D1
    “The complexity of implicit and space-efficient priority queues,” in Algorithms and data structures : 9th International Workshop, WADS 2005, 2005.
  88. Thesis
    D1
    “Understanding LSI Via The Truncated Term-Term Matrix,” Universität des Saarlandes, Saarbrücken, 2005.
  89. Conference paper
    D1
    “Towards a final analysis of pairing heaps,” in 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005.
  90. Conference paper
    D1
    “Sensitivity Analysis of Minimum Spanning Trees in Sub-Inverse-Ackermann Time,” in Algorithms and computation : 16th International Symposium, ISAAC 2005, 2005.
  91. Thesis
    D1IMPR-CS
    “Shortest Paths in Time-Dependent Networks ant their Applications,” Universität des Saarlandes, Saarbrücken, 2005.
  92. Thesis
    D1
    “Shortest Paths in Time-Dependent Networks and their Applications,” Universität des Saarlandes, Saarbrücken, 2005.
  93. Thesis
    D1
    “Earliest Arrival Flows with Multiple Sources,” Universität des Saarlandes, Saarbrücken, 2005.
  94. Thesis
    D1IMPR-CS
    “Counting Straight-Edge Tringulation of Planar Point Sets,” Universität des Saarlandes, Saarbrücken, 2005.
  95. Conference paper
    D1
    “An Asymptotic Approximation Scheme for Multigraph Edge Coloring,” in Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 2005.
  96. Conference paper
    D1
    “An Asymptotic Approximation Scheme for Multigraph Edge Coloring,” in 16th ACM-SIAM Symposium on Discrete Algorithms, 2005.
  97. Conference paper
    D1
    “The diamond operator - Implementation of exact real algebraic numbers,” in Computer Algebra in Scientific Computing, 8th International Workshop, CASC 2005, 2005.
  98. Thesis
    D1
    “Fast and Exact Shortest Path Queries Using Highway Hierachies,” Universität des Saarlandes, Saarbrücken, 2005.
  99. Conference paper
    D1
    “On the Exact Computation of the Topology of Real Algebraic Curves,” in Proceedings of the 21st ACM Symposium on Computational Geometry, 2005.
  100. Article
    D1
    “Complexity of preemptive minsum scheduling on unrelated parallel machines,” Journal of Algorithms, vol. 57, 2005.
  101. Conference paper
    D5D1
    “Towards Peer-to-Peer Web Search,” in Proceedings of ECCS’05 : the European Conference on Complex Systems, 2005.
  102. Conference paper
    D5D1
    “Towards Self-Organizing Query Routing and Processing for Peer-to-Peer Web Search,” in European Conference on Complex Systems (ECCS ’05) Workshop on Peer-to-peer Data Management in the Complex Systems Perspective, 2005.
  103. Thesis
    D1
    “Fill-in Reduction while Solving large, sparse Linear Systems with Graph Theoretical Methods,” Universität des Saarlandes, Saarbrücken, 2005.

2004

  1. Conference paper
    D1
    “Computing Locally Coherent Discourses.,” in Proceedings of the conference and workshops, 42nd annual meeting of the Association for Computational Linguistics, 2004.
  2. Conference paper
    D1
    “Point Containment in the Integer Hull of a Polyhedron,” in Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), New Orleans, USA, 2004.
  3. Conference paper
    D1
    “Polyline Fitting of Planar Points Under Min-sum Criteria,” in Algorithms and Computation: 15th International Symposium, ISAAC 2004, 2004.
  4. Conference paper
    D1
    “External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs,” in Automata, languages and programming : 31st International Colloquium, ICALP 2004, 2004.
  5. Conference paper
    D1
    “Matching Algorithms Are Fast in Sparse Random Graphs,” in 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 2004.
  6. Conference paper
    D1
    “Dimension Reduction: A Powerful Principle for Automatically Finding Concepts in Unstructured Data,” in International Workshop on Self-Star Properties in Complex Information Systems, Bertinoro, Italy, 2004.
  7. Book chapter / section
    D1
    “Randomized graph data-structures for approximate shortest path problem,” in Handbook of Data Structures and Applications, S. Sahni and D. Mehta, Eds. Boca Raton, USA: Chapman & Hall/CRC, 2004.
  8. Conference paper
    D1
    “Approximate distance oracle for unweighted graphs in Õ(n2) time,” in Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 2004.
  9. Conference paper
    D1
    “Approximating Earliest Arrival Flows with Flow-Dependent Transit Times,” in Mathematical foundations of computer science 2004 : 29th International Symposium, MFCS 2004, 2004.
  10. Thesis
    D1
    “Symbolic Constraints in Linear Integer Programming,” Universität des Saarlandes, Saarbrücken, 2004.
  11. Conference paper
    D1
    “Bounded Model Checking and Inductive Verification of Hybrid Discrete-continuous Systems,” in Methoden und Beschreibungssprachen zur Modellierung und Verifikation von Schaltungen und Systemen, Kaiserslautern, Germany, 2004.
  12. Conference paper
    D1
    “Probabilistic Analysis of Knapsack Core Algorithms,” in Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 2004.
  13. Conference paper
    D1
    “Typical Properties of Winners and Losers in Discrete Optimization,” in Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC-04), 2004.
  14. Conference paper
    D1
    “Computing Equilibria for Congestion Games with (Im)perfect Information,” in Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 2004.
  15. Article
    D1
    “Random Knapsack in Expected Polynomial Tme,” Journal of Computer and System Sciences, vol. 69, no. 3, 2004.
  16. Thesis
    D1IMPR-CS
    “Probabilistic Analysis of Discrete Optimization Problems,” Universität des Saarlandes, Saarbrücken, 2004.
  17. Report
    D1
    “Filtering algorithms for the Same and UsedBy constraints,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-2004-1-001, Jan. 2004.
  18. Conference paper
    D1
    “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, 2004.
  19. Report
    D1
    “EXACUS : Efficient and Exact Algorithms for Curves and Surfaces,” INRIA, Sophia Antipolis, ECG-TR-361200-02, 2004.
  20. Thesis
    D1
    “Exact Arrangements of Quadric Intersection Curves,” Universität des Saarlandes, Saarbrücken, 2004.
  21. Report
    D1
    “An empirical comparison of software for constructing arrangements of curved arcs,” INRIA, Sophia Antipolis, ECG-TR-361200-01, 2004.
  22. Conference paper
    D5D1
    “T-Rank: Time-aware Authority Ranking,” in Algorithms and Models for the Web-graph : Third International Workshop, WAW 2004, 2004.
  23. Conference paper
    D1
    “An Efficient Implementation of a Joint Generation Algorithm,” in Experimental and efficient algorithms : Third International Workshop, WEA 2004, 2004.
  24. Conference paper
    D1
    “Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections,” in LATIN 2004: Theoretical Informatics, 6th Latin American Symposium, 2004.
  25. Conference paper
    D1
    “Algorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems,” in Algorithms – ESA 2004: 12th Annual European Symposium, 2004.
  26. Conference paper
    D1
    “Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems,” in Integer programming and combinatorial optimization : 10th International IPCO Conference, 2004.
  27. Conference paper
    D1
    “Generating Paths and Cuts in Multi-pole (Di)graphs,” in Mathematical foundations of computer science 2004 : 29th International Symposium, MFCS 2004, 2004.
  28. Conference paper
    D1
    “Cache-oblivious data structures and algorithms for undirected breadth-first search and shortest paths,” in Algorithm theory, SWAT 2004 : 9th Scandinavian Workshop on Algorithm Theory ; Humlebæk, Denmark, July 8-10, 2004 ; proceedings, 2004.
  29. Report
    D1
    “On the Hadwiger’s Conjecture for Graphs Products,” Max-Planck-Institut für Informatik, Saarbrücken, Germany, MPI-I-2004-1-006, 2004.
  30. Conference paper
    D1
    “On the arrangement of cliques in chordal graphs with respect to the cuts,” in Computing and combinatorics : 10th Annual International Conference, COCOON 2004, 2004.
  31. Report
    D1
    “On the Hadwiger’s conjecture for graph products,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-2004-1-006, 2004.
  32. Conference paper
    D1D5
    “Probabilistic Ranking of Database Query Results,” in Proceedings 2004 VLDB Conference : The 30th International Conference on Very Large Databases (VLDB), 2004.
  33. Conference paper
    D1
    “Collective asynchronous reading with polylogarithmic worst-case overhead,” in Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC-04), 2004.
  34. Article
    D1
    “Randomization helps to perform independent tasks reliably,” Random Structures and Algorithms, vol. 24, 2004.
  35. Conference paper
    D1
    “A better wake-up in radio networks,” in Proceedings of the 23rd Annual ACM Symposium on Principles of Distributed Computing, PODC 2004, 2004.
  36. Conference paper
    D1
    “The Wake-Up problem in multi-hop radio networks,” in Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 2004.
  37. Conference paper
    D1
    “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), 2004.
  38. Conference paper
    D1
    “Engineering an External Memory Minimum Spanning Tree Algorithm,” in 3rd IFIP International Conference on Theoretical Computer Science (TSC2004), 2004.
  39. Conference paper
    D4D1
    “VRML Scene Graphs on an Interactive Ray Tracing Engine,” in IEEE Virtual Reality 2004 : VR 2004, 2004.
  40. Conference paper
    D1
    “Complete, Exact and Efficient Computations with Cubic Curves,” in Proceedings of the Twentieth Annual Symposium on Computational Geometry : (SCG’04), 2004.
  41. Conference paper
    D1
    “Scalable Multimedia Disk Scheduling,” in 20th International Conference on Data Engineering, ICDE 2004, 2004.
  42. Conference paper
    D1
    “Algorithms for recognizing coordinates in two variables over UFD’s,” in Proceedings of the 2004 International Symposium Symbolic and Algebraic Computation (ISSAC-04), 2004.
  43. Article
    D1
    “Subresultants and locally nilpotent derivations,” Linear Algebra and its Applications, vol. 380, 2004.
  44. Article
    D1
    “Contants of derivations in polynomial rings over unique factorization domains,” Proceedings of the Amercian Mathematical Society, vol. 132, 2004.
  45. Conference paper
    D1
    “Incremental Algorithms for Facility Location and k-Median,” in Algorithms – ESA 2004: 12th Annual European Symposium, 2004.
  46. Conference paper
    D1
    “Collective Tree Exploration,” in LATIN 2004: Theoretical informatics, 6th Latin American Symposium, 2004.
  47. Conference paper
    D1
    “Finding Planar Regions in a Terrain,” in 20th European Workshop on Computational Geometry (EWCG), 2004.
  48. Conference paper
    D1
    “Constant Time Queries for Energy Efficient Paths in Multi-Hop Wireless Networks,” in First International Workshop on Algorithms for Wireless and Mobile Networks, 2004.
  49. Conference paper
    D1
    “Finding Planar Regions in a Terrain: In Practice and with a Guarantee,” in Proceedings of the Twentieth Annual Symposium on Computational Geometry : (SCG’04), 2004.
  50. Conference paper
    D1
    “Improved Approximation Algorithms for Connected Sensor Cover,” in Ad-hoc, mobil and wireless networks : Third International Conference, ADHOC-NOW 2004, 2004.
  51. Report
    D1
    “The LEDA class real number - extended version,” INRIA, Sophia Antipolis, ECG-TR-363110-01, 2004.
  52. Article
    D1
    “Cooperative facility location games,” Journal of Algorithms, vol. 50, 2004.
  53. Report
    D1
    “Effects of a modular filter on geometric applications,” INRIA, Sophia Antipolis, ECG-TR-363111-01, 2004.
  54. Article
    D1
    “Global constraints for round robin tournament scheduling,” European Journal of Operational Research, vol. 153, 2004.
  55. Conference paper
    D1
    “Dynamic Heaviest Paths in DAGs with Arbitrary Edge Weights,” in Integration of AI and OR techniques in constraint programming for combinatorial optimization problems : First International Conference, CPAIOR 2004, 2004.
  56. Report
    D1
    “On algorithms for online topological ordering and sorting,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-2004-1-003, Feb. 2004.
  57. Article
    D1
    “On the Algebraic Complexity of Set Equality and Inclusion,” Information Processing Letters, vol. 92, 2004.
  58. Conference paper
    D1
    “Strongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents Problem,” in STACS 2004, 21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, 2004.
  59. Conference paper
    D1
    “Packet-Mode Policies for Input-Queued Switches,” in Sixteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-04), 2004.
  60. Article
    D1
    “Harmonic Buffer Management for Shared-Memory Switches,” Theoretical Computer Science, vol. 324, 2004.
  61. Article
    D1
    “Buffer Overflow Management in QoS Switches,” SIAM Journal on Computing, vol. 33, 2004.
  62. Conference paper
    D1
    “Classroom Examples of Robustness Problems in Geometric Computations,” in Algorithms – ESA 2004, Bergen, Norway, 2004.
  63. Report
    D1
    “Classroom examples of robustness problems in geometric computations,” INRIA, Sophia Antipolis, ECG-TR-363100-01, 2004.
  64. Book chapter / section
    D1
    “Two Computational Geometry Libraries: LEDA and CGAL,” in Handbook of Discrete and Computational Geometry, J. E. Goodman and J. O’Rourke, Eds. Boca Raton, USA: Chapman & Hall/CRC, 2004.
  65. Thesis
    D1
    “Ein Algorithmus zur Konstruktion des Voronoidiagramms von Kreisbögen,” Universität des Saarlandes, Saarbrücken, 2004.
  66. Report
    D1
    “A fast root checking algorithm,” INRIA, Sophia Antipolis, ECG-TR-363109-02, 2004.
  67. Thesis
    D1
    “Controlled Perturbation for Voronoi Diagrams,” Universität des Saarlandes, Saarbrücken, 2004.
  68. Conference paper
    D1
    “Sum-Multicoloring on Paths,” in 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 2004.
  69. Conference paper
    D1
    “Polynomial deterministic rendezvous in arbitrary graphs,” in Algorithms and Computation: 15th International Symposium, ISAAC 2004, 2004.
  70. Conference paper
    D1
    “Centralized deterministic broadcasting in undirected multi-hop radio networks,” in Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques. 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004, and 8th International Workshop on Randomization and Computation, RANDOM 2004, 2004.
  71. Report
    D1
    “New bounds for the Descartes method,” Drexel University, Philadelphia, Pa., DU-CS-04-04, 2004.
  72. Conference paper
    D1
    “Cross-monotonic cost sharing methods for connected facility location games,” in EC’04 : proceedings of the 5th ACM Conference on Electronic Commerce ; New York, New York, USA, May 17-20, 2004, 2004.
  73. Article
    D1
    “Cross-monotonic cost sharing methods for connected facility location games,” Theoretical Computer Science, vol. 326, 2004.
  74. Conference paper
    D1
    “Flows on Few Paths: Algorithms and Lower Bounds,” in Algorithms – ESA 2004: 12th Annual European Symposium, 2004.
  75. Conference paper
    D1
    “A Faster Algorithm for Minimum Cycle Basis of Graphs,” in Automata, languages and programming : 31st International Colloquium, ICALP 2004, 2004.
  76. Conference paper
    D1
    “Rank-Maximal Matchings,” in Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 2004.
  77. Thesis
    D1
    “External Memory Suffix Array Construction,” Universität des Saarlandes, Saarbrücken, 2004.
  78. Article
    D1
    “Scheduling with AND/OR Precedence Constraints,” SIAM Journal on Computing, vol. 33, 2004.
  79. Thesis
    D1
    “A heuristic for solving interior point Methods exactly,” Universität des Saarlandes, Saarbrücken, 2004.
  80. Article
    D1
    “A simpler linear time 2/3 - eps approximation for maximum weight matching,” Information Processing Letters, vol. 91, 2004.
  81. Thesis
    D1IMPR-CS
    “Geometric Algorithms for Object Placement and Planarity in a Terrain,” Universität des Saarlandes, Saarbrücken, 2004.
  82. Thesis
    D1
    “Counting Straight-Edge Triangulations of Planar Point Sets,” Universität des Saarlandes, Saarbrücken, 2004.
  83. Report
    D1
    “A simpler linear time 2/3-epsilon approximation,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-2004-1-002, Jan. 2004.
  84. Conference paper
    D1
    “Online Scheduling with Bounded Migration,” in Automata, languages and programming (ICALP 2004), Turku, Finnland, 2004.
  85. Conference paper
    D1
    “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, 2004.
  86. Conference paper
    D1
    “Super Scalar Sample Sort,” in Algorithms – ESA 2004: 12th Annual European Symposium, 2004.
  87. Report
    D1
    “A simpler linear time 2/3 - epsilon approximation for maximum weight matching,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-2004-1-002, 2004.
  88. Thesis
    D1IMPR-CS
    “Worst Case Instances are Fragile,” Universität des Saarlandes, Saarbrücken, 2004.
  89. Conference paper
    D1
    “Topology matters: Smoothed competitiveness of metrical task systems,” in 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 2004.
  90. Report
    D1
    “Common subexpression search in LEDA_reals : a study of the diamond-operator,” INRIA, Sophia Antipolis, ECG-TR-363109-01, 2004.
  91. Report
    D1
    “Improved separation bounds for the diamond operator,” INRIA, Sophia Antipolis, ECG-TR-363108-01, 2004.
  92. Report
    D1
    “A comparison of polynomial evaluation schemes,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-2004-1-005, Jun. 2004.
  93. Thesis
    D1IMPR-CS
    “Online Problems and Two-Player Games: Algorithms and Analysis,” Universität des Saarlandes, Saarbrücken, 2004.
  94. Report
    D1
    “On scheduling with bounded migration,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-2004-1-004, May 2004.
  95. Report
    D1
    “Online scheduling with bounded migration,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-2004-1-004, 2004.
  96. Article
    D1
    “Computing Large Planar Regions in Terrains, with an Application to Fracture Surface,” Discrete Applied Mathematics, vol. 139, 2004.
  97. Thesis
    D1IMPR-CS
    “Multicommodity Flows Over time with Costs,” Universität des Saarlandes, Saarbrücken, 2004.
  98. Thesis
    D1IMPR-CS
    “Efficient Algorithms for Constraint Propagation and for Processing Tree Descriptions,” Universität des Saarlandes, Saarbrücken, 2004.
  99. Thesis
    D1IMPR-CS
    “Collision detection for Curved Rigid Objects in the Context of Dynamics Simulations,” Universität des Saarlandes, Saarbrücken, 2004.

2003

  1. Article
    D1
    “Randomized Pursuit-Evasion in Graphs,” Combinatorics, Probability and Computing, vol. 12, 2003.
  2. Conference paper
    D1
    “An Experimental Study of k-splittable Scheduling for DNS-based Traffic Allocation,” in Euro-Par 2003 Parallel Processing, Klagenfurt, Austria, 2003.
  3. Article
    D1
    “An Efficient Graph Algorithm for Dominance Constraints,” Journal of Algorithms, vol. 48, no. 1, 2003.
  4. Conference paper
    D1
    “Power Efficient Range Assignment in Ad-hoc Wireless,” in Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC-03), New Orleans, USA, 2003.
  5. Report
    D1
    “Improving linear programming approaches for the Steiner tree problem,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-2003-1-004, 2003.
  6. Conference paper
    D1
    “Improving Linear Programming Approaches for the Steiner Tree Problem,” in Experimental and efficient algorithms : Second International Workshop, WEA 2003, Ascona, Switzerland, 2003.
  7. Article
    D1
    “On external-memory planar depth first search,” Journal of Graph Algorithms and Applications, vol. 7, 2003.
  8. Conference paper
    D1
    “Smoothed Analysis of Three Combinatorial Problems,” in Mathematical foundations of computer science 2003 : 28th International Symposium, MFCS 2003, Bratislava, Slovak Republic, 2003.
  9. Article
    D1
    “A Heuristic for Dijkstra’s Algorithm With Many Targets and its Use in Weighted Matching Algorithms,” Algorithmica, vol. 36, 2003.
  10. Conference paper
    D1
    “Scheduling to minimize flow time metrics,” in International Parallel and Distributed Processing Symposium (IPDPS-03), Nice, France, 2003.
  11. Conference paper
    D1
    “Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm,” in 44th Annual Symposium on Foundations of Computer Science (FOCS-03), Cambridge, USA, 2003.
  12. Conference paper
    D1
    “Random Knapsack in Expected Polynomial Time,” in Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC-03), San Diego, USA, 2003.
  13. Report
    D1
    “Random knapsack in expected polynomial time,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-2003-1-003, 2003.
  14. Conference paper
    D1
    “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, Montreal, Canada, 2003.
  15. Conference paper
    D1
    “Optimizing Misdirection,” in Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), Baltimore, USA, 2003.
  16. Article
    D1
    “An Inequality for Polymatroid Functions and its Applications,” Discrete applied mathematics, vol. 131, 2003.
  17. Article
    D1
    “Extending the Balas-Yu Bounds on the Number of Maximal Independent Sets in Graphs to Hypergraphs and Lattices,” Mathematical Programming, Ser. B, vol. 98, no. 1–3, 2003.
  18. Conference paper
    D1
    “An Intersection Inequality for Discrete Distributions and Related Generation Problems,” in Automata, Languages and Programming (ICALP 2003), Eindhoven, The Netherlands, 2003.
  19. Conference paper
    D1
    “Algorithms for Enumerating Circuits in Matroids.,” in Algorithms and Computation (ISAAC 2003), Kyoto, Japan, 2003.
  20. Conference paper
    D1
    “An Efficient Implementation of a Quasi-polynomial Algorithm for Generating Hypergraph Transversals,” in Algorithms - ESA 2003, Budapest, Hungary, 2003.
  21. Thesis
    D1
    “Zwei Algorithmen zur Bestimmung kostenminimaler Flüsse in Netzwerken,” Universität des Saarlandes, Saarbrücken, 2003.
  22. Conference paper
    D1
    “Fast Lightweight Suffix Array Construction and Checking,” in Combinatorial Pattern Matching: 14th Annual Symposium, CPM 2003, 2003.
  23. Article
    D1
    “Better Filtering with Gapped q-Grams,” Fundamenta Informaticae, vol. 56, 2003.
  24. Article
    D1
    “A spectral lower bound for the treewidth of a graph and its consequences,” Information Processing Letters, vol. 87, 2003.
  25. Conference paper
    D1
    “Isoperimetric Inequalities and the Width parameters of graphs,” in Computing and Combinatorics : 9th Annual International Conference, COCOON 2003, Big Sky, USA, 2003.
  26. Report
    D1
    “Girth and treewidth,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-2003-NWG2-001, 2003.
  27. Conference paper
    D1
    “Curve Reconstruction from Noisy Samples,” in Proceedings of the 19th Annual Symposium on Computational Geometry (SCG-03), San Diego, USA, 2003.
  28. Report
    D1
    “On the Bollob’as -- Eldridge conjecture for bipartite graphs,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-2003-1-009, 2003.
  29. Article
    D1
    “Proof of a conjecture of Bollobas and Eldridge for graphs of maximum degree three,” Combinatorica, vol. 23, 2003.
  30. Conference paper
    D1
    “Asynchronous Parallel Disk Sorting,” in Proceedings of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA-03), San Diego, USA, 2003.
  31. Conference paper
    D1
    “Solving geometric optimization problems using graphics hardware,” in EUROGRAPHICS 2003 : the European Association for Computer Graphics 24th Annual Conference, Granada, Spain, 2003.
  32. Conference paper
    D1
    “Certifying and Repairing Solutions to Large LPs - How Good are LP-Solvers?,” in Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), Baltimore, USA, 2003.
  33. Report
    D1
    “On the probability of rendezvous in graphs,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-2003-1-006, 2003.
  34. Report
    D1
    “Almost random graphs with simple hash functions,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-2003-1-005, 2003.
  35. Thesis
    D1IMPR-CS
    “Geometric Rounding without changing the Topology,” Universität des Saarlandes, Saarbrücken, 2003.
  36. Thesis
    D1
    “Exact Arrangement Computation for Cubic Curves,” Universität des Saarlandes, Saarbrücken, 2003.
  37. Conference paper
    D1
    “A Faster Algorithm for Two-variable Integer Programming,” in Algorithms and Computation (ISAAC 2003), Kyoto, Japan, 2003.
  38. Conference paper
    D1
    “Packing a Trunk,” in Algorithms - ESA 2003, Budapest, Hungary, 2003.
  39. Conference paper
    D1
    “A Combinatorial Algorithm for Computing a Maximum Independent Set in a t-perfect Graph,” in Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), Baltimore, MD, USA, 2003.
  40. Conference paper
    D1
    “An Efficient Indexing Scheme for Multi-dimensional Moving Objects,” in Database Theory - ICDT 2003, Siena, Italy, 2003.
  41. Article
    D1
    “An Elementary Approach to Subresultants Theory,” Journal of Symbolic Computation, vol. 35, no. 3, 2003.
  42. Article
    D1
    “The complexity of economic equilibria for house allocation markets,” Information Processing Letters, vol. 88, 2003.
  43. Conference paper
    D1
    “Minimum Cost Flows Over Time without Intermediate Storage,” in Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 2003.
  44. Report
    D1
    “Specification of the Traits Classes for CGAL Arrangements of Curves,” INRIA, Sophia-Antipolis, ECG-TR-241200-01, 2003.
  45. Thesis
    D1
    “Computing the Filtration Efficiency of Shape-Index-Filters for Approximate String Matching,” Universität des Saarlandes, Saarbrücken, 2003.
  46. Conference paper
    D1
    “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), Berlin, Germany, 2003.
  47. Conference paper
    D1
    “On the Competitive Ratio for Online Facility Location,” in Automata, languages and programming : 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, 2003.
  48. Conference paper
    D1
    “Approximating Energy Efficient Paths in Wireless Multi-hop Networks,” in Algorithms - ESA 2003: 11th Annual European Symposium, Budapest, Hungary, 2003.
  49. Conference paper
    D4IMPR-CSD1
    “Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation,” in Algorithms - ESA 2003: 11th Annual European Symposium, Budapest, Hungary, 2003.
  50. Conference paper
    D1
    “Nearest Neighbors Can Be Found Efficiently If the Dimension Is Small Relative to the Input Size,” in Database Theory - ICDT 2003 : 9th International Conference, Siena, Italy, 2003.
  51. Conference paper
    D1
    “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, Princeton, USA, 2003.
  52. Conference paper
    D1
    “Multicommodity Flows Over Time: Efficient Algorithms and Complexity,” in Automata, languages and programming : 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, 2003.
  53. Article
    D1
    “Scheduling multicasts on unit-capacity trees and meshes,” Journal of Computer and System Sciences, vol. 66, 2003.
  54. Conference paper
    D1
    “Experimental comparison of heuristic and approximation algorithms for uncapacitated facility location,” in Experimental and efficient algorithms : Second International Workshop, WEA 2003, Ascona, Switzerland, 2003.
  55. Article
    D1
    “Preemptive scheduling with rejection,” Mathematical Programming, vol. 94, 2003.
  56. Thesis
    D1
    “Length bounded Network Flows,” Universität des Saarlandes, Saarbrücken, 2003.
  57. Book chapter / section
    D1
    “Full-Text Indexes in External Memory,” in Algorithms for Memory Hierarchies, vol. 2625, U. Meyer, P. Sanders, and J. Sibeyn, Eds. Berlin, Germany: Springer, 2003.
  58. Conference paper
    D1
    “Simple Linear Work Suffix Array Construction,” in Automata, languages and programming : 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, 2003.
  59. Report
    D1
    “Fast bound consistency for the global cardinality constraint,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-2003-1-013, 2003.
  60. Book chapter / section
    D1
    “Elementary Graph Algorithms in External Memory,” in Algorithms for Memory Hierarchies, vol. 2625, U. Meyer, P. Sanders, and J. Sibeyn, Eds. Berlin, Germany: Springer, 2003.
  61. Conference paper
    D1
    “A Practical Minimum Spanning Tree Algorithm Using the Cycle Property,” in Algorithms - ESA 2003: 11th Annual European Symposium, Budapest, Hungary, 2003.
  62. Conference paper
    D1
    “Fast Bound-Consistency for the Global Cardinality Constraint,” in Principles and Practice of Constraint Programming - CP 2003 : 9th International Conference, CP 2003, 2003.
  63. Article
    D1
    “The Safari Interface for Visualizing Time-dependent Volume Data Using Iso-surfaces and Contour Spectra,” Computational Geometry - Theory and Applications, vol. 25, 2003.
  64. Article
    D1
    “Tight Degree Bounds for Pseudo-triangulations of Points,” Computational Geometry - Theory and Applications, vol. 25, 2003.
  65. Book chapter / section
    D1
    “Automatic Layout and Labelling of State Diagrams,” in Mathematics: Key Technology for the Future : Joint Projects Between Universities and Industry, W. Jäger and H.-J. Krebs, Eds. Berlin, Germany: Springer, 2003.
  66. Report
    D1
    “Sum-Multicoloring on paths,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-2003-1-015, 2003.
  67. Conference paper
    D1
    “Certifying algorithms for recognizing interval graphs and permutation graph,” in Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), Baltimore, 2003.
  68. Article
    D1
    “Data Management in Networks: Experimental Evaluation of a Provably Good Strategy,” Theory of Computing Systems, vol. 35, 2003.
  69. Conference paper
    D1
    “Scheduling and Traffic Allocation for Tasks with Bounded Splittability,” in Mathematical foundations of computer science 2003 : 28th International Symposium, MFCS 2003, Bratislava, 2003.
  70. Article
    D1
    “Approximating Minimum Size 1,2-Connected Networks,” Discrete Applied Mathematics, vol. 125, 2003.
  71. Report
    D1
    “Selfish traffic allocation for server farms,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-2003-1-011, 2003.
  72. Report
    D1
    “Scheduling and traffic allocation for tasks with bounded splittability,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-2003-1-002, 2003.
  73. Article
    D1
    “Optimal Search for Rationals,” Information Processing Letters, vol. 86, no. 1, 2003.
  74. Conference paper
    D1
    “Algorithms and Experiments for the Webgraph,” in Algorithms - ESA 2003: 11th Annual European Symposium, Budapest, 2003.
  75. Thesis
    D1IMPR-CS
    “Lower Bounding the Number of Straight-Edge Triangulations of Planar Point Sets,” Universität des Saarlandes, Saarbrücken, 2003.
  76. Conference paper
    D1
    “The Reliable Algorithmic Software Challenge RASC,” in Experimental and efficient algorithms (WEA 2003), Ascona, Switzerland, 2003.
  77. Book chapter / section
    D1
    “The Reliable Algorithmic Software Challenge RASC Dedicated to Thomas Ottmann on the Occasion of His 60th Birthday,” in Computer Science in Perspective, R. Klein, H.-W. Six, and L. Wegner, Eds. Berlin, Germany: Springer, 2003.
  78. Article
    D1
    “Infimaximal frames: A technique for making lines look like segments,” International Journal of Computational Geometry & Applications, vol. 13, 2003.
  79. Article
    D1
    “Scanning Multiple Sequences via Cache Memory,” Algorithmica, vol. 35, no. 1, 2003.
  80. Article
    D1
    “Δ-stepping: a parallelizable shortest path algorithm,” Journal of Algorithms, vol. 49, 2003.
  81. Article
    D1
    “Average-case complexity of single-source shortest-path algorithms: lower and upper bounds,” Journal of Algorithms, vol. 48, 2003.
  82. Book
    D1
    Eds., Algorithms for Memory Hierarchies. Berlin, Germany: Springer, 2003.
  83. Conference paper
    D1
    “I/O-Efficient Undirected Shortest Paths,” in Algorithms - ESA 2003: 11th Annual European Symposium, 2003.
  84. Article
    D1
    “On Steiner trees and minimum spanning trees in hypergraphs,” Operations Research Letters, vol. 31, 2003.
  85. Thesis
    D1IMPR-CS
    “Algorithms for the Steiner Problem in Networks,” Universität des Saarlandes, Saarbrücken, 2003.
  86. Report
    D1
    “Asynchronous parallel disk sorting,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-2003-1-001, 2003.
  87. Book chapter / section
    D1
    “Memory hierarchies - models and lower bounds,” in Algorithms for memory hierarchies, vol. 2625, U. Meyer, P. Sanders, and J. Sibeyn, Eds. Berlin, Germany: Springer, 2003.
  88. Article
    D1
    “Tail bounds and expectations for random arc allocation and applications,” Combinatorics, Probability and Computing, vol. 12, 2003.
  89. Article
    D1
    “A Bandwidth Latency Tradeoff for Broadcast and Reduction,” Information Processing Letters, vol. 86, 2003.
  90. Report
    D1
    “Polynomial time algorithms for network information flow,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-2003-1-008, 2003.
  91. Article
    D1
    “Asynchronous Scheduling of Redundant Disk Arrays,” IEEE Transactions on Computers, vol. 52, 2003.
  92. Conference paper
    D1
    “Polynomial Time Algorithms For Network Information Flow,” in Proceedings of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA-03), San Diego, USA, 2003.
  93. Report
    D1
    “Cross-monotonic cost sharing methods for connected facility location games,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-2003-1-017, 2003.
  94. Report
    D1
    “Topology matters: smoothed competitive analysis of metrical task systems,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-2003-1-016, 2003.
  95. Report
    D1
    “A note on the smoothed complexity of the single-source shortest path problem,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-2003-1-018, 2003.
  96. Report
    D1
    “Average case and smoothed competitive analysis of the multi-level feedback algorithm,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-2003-1-014, 2003.
  97. Report
    D1
    “The Diamond Operator for Real Algebraic Numbers,” Effective Computational Geometry for Curves and Surfaces, Sophia Antipolis, FRANCE, ECG-TR-243107-01, 2003.
  98. Book
    D1
    Elliptic Curves : A Computational Approach. Berlin, Germany: de Gruyter, 2003.
  99. Report
    D1
    “A linear time heuristic for the branch-decomposition of planar graphs,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-2003-1-010, 2003.
  100. Report
    D1
    “Alternating cycles contribution: a strategy of tour-merging for the traveling salesman problem,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-2003-1-007, 2003.
  101. Thesis
    D1
    “Orthogonal Range Searching,” Universität des Saarlandes, Saarbrücken, 2003.
  102. Book chapter / section
    D1
    “Jacobi Curves: Computing the Exact Topology of Arrangements of Non-Singular Algebraic Curves,” in Algorithms - ESA 2003, Berlin: Springer, 2003.

2002

  1. Conference paper
    D1
    “Randomized Pursuit-Evasion in Graphs,” in Automata, Languages and Programming : 29th International Colloquium, ICALP 2002, Málaga, Spain, 2002.
  2. Conference paper
    D1
    “Translating a Planar Object to Maximize Point Containment,” in Algorithms - ESA 2002 : 10th Annual European Symposium, Rome, Italy, 2002.
  3. Article
    D1
    “Exploring unkown environments with obstacles,” Algorithmica, vol. 32, 2002.
  4. Conference paper
    D1BIO
    “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), Saarbrücken, 2002.
  5. Conference paper
    D1
    “A Polyhedral Approach to Surface Reconstruction from Planar Contours.,” in Proceedings of the 9th International Conference on Integer Programming and Combinatorial Optimization, Cambridge, USA, 2002.
  6. Article
    D1
    “A combinatorial approach to protein docking with flexible side chains,” Journal of Computational Biology, vol. 9, 2002.
  7. Conference paper
    D1
    “SCIL - Symbolic Constraints in Integer Linear Programming.,” in Algorithms - ESA 2002 : 10th Annual European Symposium, Rom, Italy, 2002.
  8. Conference paper
    D1
    “On Radiocoloring Hierarchically Specified Planar Graphs: PSPACE-Completeness and Approximations,” in Mathematical Foundations of Computer Science 2002 : 27th International Symposium, MFCS 2002, 2002.
  9. Article
    D1
    “On the competitive theory and practice of online list accessing algorithms,” Algorithmica, vol. 32, 2002.
  10. Book chapter / section
    D1
    “Algorithm Engineering for Parallel Computation,” in Experimental Algorithmics, vol. 2547, R. Fleischer, B. Moret, and E. Meineche Schmidt, Eds. Berlin, Germany: Springer, 2002.
  11. Article
    D1
    “Basic analytic combinatorics of directed lattice paths,” Theoretical Computer Science, vol. 281, 2002.
  12. Article
    D1
    “Generating Functions for Generating Trees,” Discrete Mathematics, vol. 246, 2002.
  13. Thesis
    D1
    “Effiziente Multiplikationsverfahren: ein numerischer Vergleich,” Universität des Saarlandes, Saarbrücken, 2002.
  14. Conference paper
    D1
    “Scheduling at Twilight the Easy Way,” in STACS 2002 : 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes, Juan-Les-Pins, France, 2002.
  15. Conference paper
    D1
    “Energy Optimal Routing in Radio Networks Using Geometric Data Structures,” in Automata, Languages and Programming : 29th International Colloquium, ICALP 2002, Málaga, Spain, 2002.
  16. Report
    D1
    “Cost-filtering Algorithms for the two Sides of the Sum of Weights of Distinct Values Constraint,” Swedish Institute of Computer Science, Kista, SICS-T-2002:14-SE, 2002.
  17. Conference paper
    D1
    “A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons,” in Algorithms - ESA 2002 : 10th Annual European Symposium, Rome, Italy, 2002.
  18. Article
    D1
    “Generating Dual-Bounded Hypergraphs,” Optimization Methods and Software, vol. 17, no. 5, 2002.
  19. Conference paper
    D1
    “Matroid Intersections, Polymatroid Inequalities, and Related Problems,” in Mathematical Foundations of Computer Science 2002 (MFCS 2002), Warsaw, Poland, 2002.
  20. Article
    D1
    “Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities,” SIAM Journal on Computing, vol. 31, 2002.
  21. Article
    D1
    “Computation of the Dual of a Plane Projective Curve,” Journal of Symbolic Computation, vol. 34, no. 2, 2002.
  22. Article
    D1
    “Optimal prefix-free codes for unequal letter costs: Dynamic programming with the Monge property,” Journal of Algorithms, vol. 42, 2002.
  23. Thesis
    D1IMPR-CS
    “Filter Algorithms for Approximate String Matching,” Universität des Saarlandes, Saarbrücken, 2002.
  24. Conference paper
    D1
    “One-Gapped q-Gram Filters for Levenshtein Distance,” in Combinatorial Pattern Matching : 13th Annual Symposium, CPM 2002, Fukuoka, Japan, 2002.
  25. Article
    D1
    “A theoretical and experimental study on the construction of suffix arrays in external memory,” Algorithmica, vol. 32, 2002.
  26. Conference paper
    D1
    “Approximability of Dense and Sparse Instances of Minimum 2-Connectivity, TSP and Path Problems,” in Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-02), San Francisco, CA, USA, 2002.
  27. Conference paper
    D1
    “Tight bounds for worst-case equilibria,” in Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-02), San Francisco, USA, 2002.
  28. Conference paper
    D1
    “Selfish Traffic Allocation for Server Farms,” in Proceedings of the 34th ACM Symposium on Theory of Computing (STOC-02), Montreal, Canada, 2002.
  29. Conference paper
    D1
    “Guest Editors’ Foreword,” in International Journal of Computational Geometry & Applications (Proc. SoCG 2000), Hong Kong, 2002, vol. 12, no. 1/2.
  30. Conference paper
    D1
    “A Theory of Inductive Query Answering,” in Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM’02), Maebashi City, Japan, 2002.
  31. Report
    D1
    “Sweeping Arrangements of Cubic Segments Exactly and Efficiently,” Effective Computational Geometry for Curves and Surfaces, Sophia Antipolis, ECG-TR-182202-01, 2002.
  32. Conference paper
    D1
    “On Dualization in Products of Forests,” in STACS 2002, Antibes - Juan les Pins, France, 2002.
  33. Conference paper
    D1
    “An Algorithm for Dualization in Products of Lattices and Its Applications,” in Algorithms - ESA 2002, Rome, Italy, 2002.
  34. Article
    D1
    “On Plane Polynomial Vector Fields and the Poincaré Problem,” Electronic journal of differential equations, vol. 2002, no. 37, 2002.
  35. Conference paper
    D1
    “More on weighted servers or FIFO is better than LRU,” in Mathematical Foundations of Computer Science 2002 : 27th International Symposium, MFCS 2002, Warsawa-Otwock, Poland, 2002.
  36. Article
    D1
    “Minimum Congestion Redundant Assignments to Tolerate Random Faults,” Algorithmica, vol. 32, 2002.
  37. Conference paper
    D1
    “The Structure and Complexity of Nash Equilibria for a Selfish Routing Game,” in Automata, Languages and Programming : 29th International Colloquium, ICALP 2002, Málaga, Spain, 2002.
  38. Conference paper
    D1
    “Radiocolorings in Periodic Planar Graphs: PSPACE-Completeness and Efficient Approximations for the Optimal Range of Frequencies,” in Graph-Theoretic Concepts in Computer Science : 28th International Workshop, WG 2002, Ceský Krumlov, Czech Republic, 2002.
  39. Article
    D1
    “LOOK - A Lazy Object-Oriented Kernel for Geometric Computation,” Computational Geometry - Theory and Applications, vol. 22, 2002.
  40. Conference paper
    D1
    “Smooth-Surface Reconstruction in Near-Linear Time,” in Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-02), San Francisco, USA, 2002.
  41. Conference paper
    D5D1
    “Workflow management with service quality guarantees.,” in Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data, 2002.
  42. Proceedings
    D4D1
    7th ACM Symposium on Solid Modeling and Applications; Tutorial T1: Geometric Algorithms for Planning and Simulation Tasks in Virtual Prototyping. Max-Planck-Institut für Informatik, 2002.
  43. Thesis
    D1
    “Reliable computation of planar and spatial arrangements of quadrics,” Universität des Saarlandes, Saarbrücken, 2002.
  44. Report
    D1
    “Exp Lab: a tool set for computational experiments,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-2002-1-004, 2002.
  45. Conference paper
    D1
    “Multiple Robot Motion Planning = Parallel Processing + Geometry,” in Sensor Based Intelligent Robots, Schloss Dagstuhl, Wadern, Germany, 2002.
  46. Report
    D1
    “Performance of heuristic and approximation algorithms for the uncapacitated facility location problem,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-2002-1-005, 2002.
  47. Article
    D1
    “Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks,” Algorithmica, vol. 32, 2002.
  48. Conference paper
    D1
    “Computing the threshold for q-gram filters,” in Algorithm theory, SWAT 2002 : 8th Scandinavian Workshop on Algorithm Theory, Turku, Finland, 2002.
  49. Report
    D1
    “A practical minimum spanning tree algorithm using the cycle property,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-2002-1-003, 2002.
  50. Thesis
    D1
    “Robust Computation of Visibility Maps,” Universität des Saarlandes, Saarbrücken, 2002.
  51. Conference paper
    D1
    “Lower Bounds & Competitive Algorithms for Online Scheduling of Unit-Size Tasks to Related Machines,” in Proceedings of the 34th ACM Symposium on Theory of Computing (STOC-02), Montreal, Quebec, Canada, 2002.
  52. Proceedings
    BIOD1
    Eds., Proceedings of the European Conference on Computational Biology (ECCB 2002). Oxford University Press, 2002.
  53. Conference paper
    D1
    “Efficient Distance Computation for Quadratic Curves and Surfaces,” in Proceedings of the 2nd Conference on Geometric Modeling and Processing (GMP 2002), Waiko, Saitama, Japan, 2002.
  54. Book chapter / section
    D1
    “Using Finite Experiments to Study Asymptotic Performance,” in Experimental Algorithmics, vol. 2547, R. Fleischer, B. Moret, and E. Meineche Schmidt, Eds. Berlin, Germany: Springer, 2002.
  55. Article
    D1
    “All-Pairs Shortest-Paths Computation in the Presence of Negative Cycles,” Information Processing Letters, vol. 81, no. 6, 2002.
  56. Conference paper
    D1
    “External-Memory Breadth-First Search with Sublinear I/O,” in Algorithms - ESA 2002 : 10th Annual European Symposium, Rome, Italy, 2002, pp. 723–735.
  57. Article
    D1
    “Implementation of O(nmlog n) Weighted Matchings in General Graphs: The Power of Data Structures,” Journal of Experimental Algorithmics, vol. 7, 2002.
  58. Conference paper
    D1
    “Exact geometric computation,” in HERCMA 2001 : proceedings of the 5th Hellenic-European Conference on Computer Mathematics and its Applications (HERCMA-01), Athen, Griechenland, 2002.
  59. Article
    D1
    “Oblivious Gossiping on Tori,” Journal of Algorithms, vol. 42, 2002.
  60. Thesis
    D1IMPR-CS
    “Design and Analysis of Sequential and Parallel Single-Source Shortest-Paths Algorithms,” Universität des Saarlandes, Saarbrücken, 2002.
  61. Conference paper
    D1
    “Buckets Strike Back: Improved Parallel Shortest-Paths,” in International Parallel and Distributed Processing Symposium (IPDPS-02), Fort Lauderdale, USA, 2002.
  62. Article
    D1
    “Towards Optimal Locality in Mesh-Indexings,” Discrete Applied Mathematics, vol. 117, 2002.
  63. Thesis
    D1
    “TSP Cuts Outside the Template Paradigm,” Universität des Saarlandes, Saarbrücken, 2002.
  64. Report
    D1
    “Using (sub)graphs of small width for solving the Steiner problem,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-2002-1-001, 2002.
  65. Conference paper
    D1
    “Extending Reduction Techniques for the Steiner Tree Problem,” in Algorithms - ESA 2002 : 10th Annual European Symposium, Rom, Italy, 2002.
  66. Conference paper
    D1
    Mi. Smid, K. Lange, and U. Wendt, “Computing Large Planar Regions in Terrains,” in IWCIA 2001, 8th International Workshop on Combinatorial Image Analysis (IWCIA-01), Philadelphia, USA, 2002.
  67. Article
    D1
    “Feasible models of computation: Three-dimensionality and energy consumption,” Fundamenta Informaticae, vol. 52, 2002.
  68. Report
    D1
    “The factor algorithm for all-to-all communication on clusters of SMP nodes,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-2002-1-008, 2002.
  69. Conference paper
    D1
    “The factor algorithm for regular all-to-all communication on clusters of SMP nodes,” in Proceedings of the 8th International Euro-Par Conference, Paderborn, 2002.
  70. Conference paper
    D1
    “Random Arc Allocation and Applications to Disks, Drums and DRAMs,” in Algorithm theory, SWAT 2002 : 8th Scandinavian Workshop on Algorithm Theory, Turku, 2002.
  71. Book chapter / section
    D1
    “Presenting Data from Experiments in Algorithmics,” in Experimental Algorithmics, vol. 2547, R. Fleischer, B. Moret, and E. Meineche Schmidt, Eds. Berlin, Germany: Springer, 2002.
  72. Article
    D1
    “Randomized Receiver Initiated Load Balancing Algorithms for Tree Shaped Computations,” The Computer Journal, vol. 45, 2002.
  73. Article
    D1
    “Reconciling simplicity and realism in parallel disk models,” Parallel Computing, vol. 28, 2002.
  74. Conference paper
    D1
    “Efficient Collision Detection for Curved Solid Objects,” in Proceedings of the Seventh ACM Symposium on Solid Modeling and Applications (SPM 2002), Saarbrücken, Germany, 2002.
  75. Conference paper
    D1
    “Heuristics for Semi-External Depth First Search on Directed Graphs,” in SPAA 2002 : Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, Winnipeg, Canada, 2002.
  76. Thesis
    D1IMPR-CS
    “New Applications of SPQR-Trees in Graph Drawing,” Universität des Saarlandes, Saarbrücken, 2002.
  77. Article
    D1
    “Surface Topography Quantification by Integral and Feature-related Parameters,” Materialwissenschaft und Werkstofftechnik, vol. 33, 2002.
  78. Thesis
    D1IMPR-CS
    “An Exact and Efficient Approach for Computing a Cell in an Arrangement of Quadrics,” Universität des Saarlandes, Saarbrücken, 2002.

2001

  1. Article
    D1
    “Traveling Salesman-Based Curve Reconstruction in Polynomial Time,” SIAM Journal on Computing, vol. 31, no. 1, 2001.
  2. Conference paper
    D1
    “An Efficient Algorithm for the Configuration Problem of Dominance Graphs,” in SODA ’01, 12th Annual ACM-SIAM Symposium on Discrete Algorithms, Washington DC, USA, 2001.
  3. Thesis
    D1IMPR-CS
    “Curve Reconstruction and the Traveling Salesman Problem,” Universität des Saarlandes, Saarbrücken, 2001.
  4. Conference paper
    D1
    “On External-Memory Planar Depth First Search,” in Proceedings of the 7th International Workshop on Algorithms and Data Structures (WADS-01), 2001.
  5. Conference paper
    D1
    “Lattice Basis Reduction with Dynamic Approximation,” in Algorithm Engineering (WAE 2000), Saarbrücken, 2001.
  6. Article
    D1
    “Random Maps, Coalescing Saddles, Singularity Analysis, and Airy Phenomena,” Random Structures & Algorithms, vol. 19, no. 3–4, 2001.
  7. Book
    D1
    CGAL Reference and User Manuals. -: CGAL Consortium, 2001.
  8. Conference paper
    D1
    “Non-overlapping Constraints between Convex Polytopes,” in Proceedings of the 7th International Symposium on Principles and Practice of Constraint Programming (CP-01), 2001.
  9. Conference paper
    D1
    “On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities,” in Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, 2001.
  10. Article
    D1
    “Interval arithmetic yields efficient dynamic filters for computational geometry,” Discrete Applied Mathematics, vol. 109, no. 1/2, 2001.
  11. Conference paper
    D1
    “Better Filtering with Gapped q-Grams,” in Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching, 2001.
  12. Article
    D1
    “Exact geometric computation using Cascading,” International Journal of Computational Geometry & Applications, vol. 11, no. 3, 2001.
  13. Conference paper
    D1
    “A Separation Bound for Real Algebraic Expressions,” in Proceedings of the 9th Annual European Symposium on Algorithms (ESA-01), 2001.
  14. Article
    D1
    “Edge-Coloring Bipartite Multigraphs in O(E log D) Time,” Combinatorica, vol. 21, no. 1, 2001.
  15. Other
    D1
    “An experimental study of priority queues in external memory.” ACM, New York, USA, 2001.
  16. Thesis
    D1IMPR-CS
    “LEDA-SM: External Memory Algorithms and Data Structures in Theory and Practice,” Universität des Saarlandes, Saarbrücken, 2001.
  17. Article
    D1
    “Randomized External-Memory Algorithms for Line Segment Intersection and Other Geometric Problems,” International Journal of Computational Geometry & Applications, vol. 11, 2001.
  18. Report
    D1
    “A Randomized On-line Algorithm for the k-Server Problem on a Line,” DIMACS-Center for Discrete Mathematics & Theoretical Computer Science, Piscataway, NJ, DIMACS TechReport 2001-34, 2001.
  19. Conference paper
    D1
    “Surface Reconstruction in almost Linear Time under Locally Uniform Sampling,” in Proceedings of the 17th European Workshop on Computational Geometry (EWCG-01), 2001.
  20. Article
    D1
    “Multi-Color Discrepancies - Extended Abstract -,” Electronic Notes in Discrete Mathematics, vol. 7, 2001.
  21. Article
    D1
    “Multi-Color Discrepancy of Arithmetic Progressions,” Electronic Notes in Discrete Mathematics, vol. 8, 2001.
  22. Article
    D1
    “Vector Balancing Games with Aging,” Electronic Notes in Discrete Mathematics, vol. 10, 2001.
  23. Conference paper
    D1
    “Theory and Practice of Time-space Trade-offs in Memory Limited Search,” in KI 2001: Advances in Artificial Intelligence, Wien, Österreich, 2001.
  24. Book chapter / section
    D1
    “Orthogonal Graph Drawing,” in Drawing Graphs: Methods and Models, Berlin, Germany: Springer, 2001.
  25. Article
    D1
    “Improved algorithms for linear complementarity problems arising from collision response,” Mathematics and Computers in Simulation, vol. 56, no. 1, 2001.
  26. Thesis
    D1
    “Oberflächenrekonstruktion von planaren Konturen,” Universität des Saarlandes, Saarbrücken, 2001.
  27. Conference paper
    D1
    “A General Method for Computing the Reachable Space of Mechanisms,” in Proceedings of the 2001 ASME Design Engineering Technical Conferences and Computers and Information in Engineering Conference. - Vol. 2, 27th Design Automation Conference (DETC’01), 2001.
  28. Thesis
    D1IMPR-CS
    “Combinatorial Curve Reconstruction and the Efficient Exact Implementation of Geometric Algorithms,” Universität des Saarlandes, Saarbrücken, 2001.
  29. Conference paper
    D1
    “Reconstructing a Collection of Curves with Corners and Endpoints,” in Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), 2001.
  30. Conference paper
    D1
    “Computing a 3-dimensional Cell in an Arrangement of Quadrics: Exactly and Actually!,” in Proceedings of the 17th Annual Symposium on Computational Geometry (SCG-01), 2001.
  31. Conference paper
    D1
    “The Convex Hull of Ellipsoids (Video),” in Proceedings of the 17th Annual Symposium on Computational Geometry (SCG-01), 2001.
  32. Report
    D1
    “An adaptable and extensible geometry kernel,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-2001-1-004, 2001.
  33. Conference paper
    D1
    “Connected Area Partitioning,” in Proceedings of the 17th European Workshop on Computational Geometry (CG-01), 2001.
  34. Conference paper
    D1
    “An Adaptable and Extensible Geometry Kernel,” in Proceedings of the 5th International Workshop on Algorithm Engineering (WAE-01), 2001.
  35. Conference paper
    D1
    “Duality Between Prefetching and Queued Writing with Parallel Disks,” in Proceedings of the 9th Annual European Symposium on Algorithms (ESA-01), 2001.
  36. Conference paper
    D1
    “The Power of Duality for Prefetching and Sorting with Parallel Disks,” in Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-01), 2001.
  37. Thesis
    D1
    “Berechnung der Momente von quadratischen Komplexen,” Universität des Saarlandes, Saarbrücken, 2001.
  38. Thesis
    D1IMPR-CS
    “A Combinatorial Approach to Orthogonal Placement Problems,” Universität des Saarlandes, Saarbrücken, 2001.
  39. Conference paper
    D1
    “An Experimental Comparison of Orthogonal Compaction Algorithms,” in Proceedings of the 8th International Symposium on Graph Drawing (GD-00), 2001.
  40. Conference paper
    D1
    “Approximation Algorithms for Minimum Size 2-connectivity Problems,” in Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science (STACS-01), 2001.
  41. Thesis
    D1IMPR-CS
    “Approximation Algorithms for Combinatorial Optimization Problems in Graph Coloring and Network Design,” Universität des Saarlandes, Saarbrücken, 2001.
  42. Report
    D1
    “Approximating minimum size 1,2-connected networks,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-2001-1-001, 2001.
  43. Article
    D1
    “Approximation Algorithms for Bounded Facility Location,” Journal of Combinatorial Optimization, vol. 5, no. 2, 2001.
  44. Article
    D1
    “Coupling vs. conductance for the Jerrum-Sinclair chain,” Random Structures & Algorithms, vol. 18, 2001.
  45. Thesis
    D1
    “Ein Parametric Search Toolkit,” Universität des Saarlandes, Saarbrücken, 2001.
  46. Conference paper
    D1
    “A Virtual Environment for Interactive Assembly Simulation: From Rigid Bodies to Deformable Cables,” in Proceedings of the 5th World Multiconference on Systemics, Cybernetics and Informatics (SCI-01): Emergent computing and virtual engineering, 2001.
  47. Paper
    D1
    “A Remark on the Sign Variation Method for Real Root Isolation.” 2001.
  48. Conference paper
    D1
    “CNOP - A Package for Constrained Network Optimization,” in Algorithm engineering and experimentation (ALENEX-01) :Third International Workshop ALENEX 2001 ; revised papers, 2001.
  49. Conference paper
    D1
    “A Heuristic for Dijkstra’s Algorithm With Many Targets and its Use in Weighted Matching Algorithms,” in Proceedings of the 9th Annual European Symposium on Algorithms (ESA-01), Arhus, Denmark, 2001.
  50. Book chapter / section
    D1
    “Exact Computation with leda_real - Theory and Geometric Applications,” in Symbolic Algebraic Methods and Verification Methods, Berlin: Springer, 2001.
  51. Article
    D1
    “Furthest Site Abstract Voronoi Diagrams,” International Journal of Computational Geometry & Applications, vol. 11, no. 6, 2001.
  52. Book chapter / section
    D1
    “From Algorithm to Program to Software Library,” in Informatics : 10 years back, 10 years ahead, R. Wilhelm, Ed. Berlin, Germany: Springer, 2001.
  53. Conference paper
    D1
    “Single-Source Shortest-Paths on Arbitrary Directed Graphs in Linear Average-Case Time,” in Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), 2001.
  54. Conference paper
    D1
    “External Memory BFS on Undirected Graphs with Bounded Degree,” in Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), 2001.
  55. Conference paper
    D1
    “Heaps are better than Buckets: Parallel Shortest Paths on Unbalanced Graphs,” in Proceedings of the 7th International Euro-Par Conference on Parallel Processing (Euro-Par-01) :, 2001.
  56. Report
    D1
    “Directed single-source shortest-paths in linear average-case time,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-2001-1-002, 2001.
  57. Article
    D1
    “An alternative method to crossing minimization on hierarchical graphs,” SIAM Journal on Optimization, vol. 11, no. 4, 2001.
  58. Conference paper
    D1
    “Visibility-Based Pursuit-Evasion in a Polygonal Region by a Searcher,” in Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP-01), 2001.
  59. Report
    D1
    “Extending reduction techniques for the Steiner tree problem: a combination of alternative-and bound-based approaches,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-2001-1-007, 2001.
  60. Article
    D1
    “A Comparison of Steiner Tree Relaxations,” Discrete Applied Mathematics, vol. 112, 2001.
  61. Article
    D1
    “Improved Algorithms for the Steiner Problem in Networks,” Discrete Applied Mathematics, vol. 112, 2001.
  62. Report
    D1
    “Partitioning techniques for the Steiner problem,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-2001-1-006, 2001.
  63. Report
    D1
    “On Steiner trees and minimum spanning trees in hypergraphs,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-2001-1-005, 2001.
  64. Thesis
    D1IMPR-CS
    “Average-case Complexity of Shortest-paths Problems,” Universität des Saarlandes, Saarbrücken, 2001.
  65. Conference paper
    D1
    “A Data Tracking Scheme for General Networks,” in Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-01), 2001.
  66. Article
    D1
    “Solving Some Discrepancy Problems in NC,” Algorithmica, vol. 29, no. 3, 2001.
  67. Article
    D1
    “An Optimal Deterministic Algorithm for Computing the Diameter of a Three-Dimensional Point Set,” Discrete and Computational Geometry, vol. 26, no. 2, 2001.
  68. Article
    D1
    “A Randomized Algorithm for Triangulating a Simple Polygon in Linear Time,” Discrete and Computational Geometry, vol. 26, no. 2, 2001.
  69. Thesis
    D1
    “Optimale Hüllkörper für Objekte mit gekrümmten Oberflächen,” Universität des Saarlandes, Saarbrücken, 2001.
  70. Conference paper
    D1
    “Reconciling Simplicity and Realism in Parallel Disk Models,” in Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), 2001.
  71. Article
    D1
    “How Helpers Hasten h-Relations,” Journal of Algorithms, vol. 41, 2001.
  72. Thesis
    D1
    “Visualisierung der Dialektgeographie und Topographie im deutschen Dialektraum,” Universität des Saarlandes, Saarbrücken, 2001.
  73. Thesis
    D1
    “Exaktes Lineares Programmieren,” Universität des Saarlandes, Saarbrücken, 2001.
  74. Report
    D1
    “Implementation of planar Nef polyhedra,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-2001-1-003, 2001.
  75. Thesis
    D1IMPR-CS
    “Planar Nef Polyhedra and Generic Higher-dimensional Geometry,” Universität des Saarlandes, Saarbrücken, 2001.
  76. Conference paper
    D1
    “Almost Optimal Permutation Routing on Hypercubes,” in Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC-01), 2001.
  77. Conference paper
    D1
    “Symmetric vs. Asymmetric Multiple-Choice Algorithms,” in Proceedings of the 2nd International Workshop on Approximation and Randomized Algorithms in Communication Networks (ARACNE), 2001.
  78. Conference paper
    D1
    “Rolling Rigid Objects,” in Proceedings of the 9th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision (WSCG-01), 2001.
  79. Other
    D1
    “Surface Topography Quantification using Computational Geometry.” Poster presentation, 2001.
  80. Thesis
    D1IMPR-CS
    “Constrained Shortest Paths and Related Problems,” Universität des Saarlandes, Saarbrücken, 2001.

2000

  1. Article
    D1
    “Minimizing stall time in single and parallel disk systems,” Journal of the ACM, vol. 47, no. 6, 2000.
  2. Article
    D1
    “Average-Case Analyses of First Fit and Random Fit Bin Packing,” Random Structures & Algorithms, vol. 16, no. 3, 2000.
  3. Conference paper
    D1
    “Experiments on curve reconstruction,” in Proceedings of 2nd Workshop on Algorithm Engineering and Experiments (ALENEX-00), 2000.
  4. Conference paper
    D1
    “TSP-Based Curve Reconstruction in Polynomial Time,” in Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00), 2000.
  5. Conference paper
    D1
    “A Combinatorial Approach to Protein Docking with Flexible Side-Chains,” in Proceedings of the 4th Annual International Conference on Computational Molecular Biology (RECOMB-00), 2000.
  6. Report
    D1
    “A branch and cut algorithm for the optimal solution of the side-chain placement problem,” MPI-I-2000-1-001, 2000.
  7. Conference paper
    D1
    “Linear-Time Triangulation of a Simple Polygon Made Easier Via Randomization,” in Proceedings of the 16th Annual Symposium on Computational Geometry (SCG-00), 2000.
  8. Article
    D1
    “Tight bounds for searching a sorted array of strings,” SIAM Journal on Computing, vol. 30, no. 5, 2000.
  9. Article
    D1
    “Approximate range searching,” Computational Geometry, vol. 17, no. 3/4, 2000.
  10. Article
    D1
    “LEDA + Algorithm = Program,” Communications of the Operations Research Society of Japan, vol. 45, no. 3, 2000.
  11. Conference paper
    D1
    “New Results on Lattice Basis Reduction in Practice,” in Proceedings of the 4th International Algorithmic Number Theory Symposium (ANTS-IV), 2000.
  12. Conference paper
    D1
    “Planar Maps and Airy Phenomena,” in Proceedings of ICALP’00, 2000.
  13. Conference paper
    D1
    “A Generalized Cover Time for Random Walks on Graphs,” in Proceedings of FPSAC’00, 2000.
  14. Article
    D1
    “On Scheduling Parallel Tasks at Twilight,” Theory of Computing Systems, vol. 33, no. 5, 2000.
  15. Thesis
    D1
    “Provably Optimal Scheduling of Similar Tasks,” Universität des Saarlandes, Saarbrücken, 2000.
  16. Conference paper
    D1
    “The Area Partitioning Problem,” in Proceedings of the 12th Annual Canadian Conference on Computational Geometry (CCCG-00), 2000.
  17. Thesis
    D1
    “Solid Modeling durch Boolesche Operationen,” Universität des Saarlandes, Saarbrücken, 2000.
  18. Thesis
    D1
    “Eine Heuristik für das Gossiping-Problem,” Universität des Saarlandes, Saarbrücken, 2000.
  19. Conference paper
    D1
    “A powerful heuristic for telephone gossiping,” in Proceedings of the 7th International Colloquium on Structural Information and Communication Complexity (SIROCCO-00), 2000.
  20. Report
    D1
    “A powerful heuristic for telephone gossiping,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-2000-1-002, 2000.
  21. Article
    D1
    “Limited bookmark randomized online algorithms for the paging problem,” Information Processing Letters, vol. 76, no. 4–6, 2000.
  22. Book chapter / section
    D4D1
    “Migrating to an Object-Oriented Graphics API,” in SIGGRAPH 2000 (SIGGRAPH-00), Course Notes CD-ROM, New York, USA: ACM SIGGRAPH, 2000.
  23. Article
    D1
    “An Efficient Incremental Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension,” Parallel Processing Letters, vol. 10, no. 4, 2000.
  24. Thesis
    D1
    “Entwicklung und Test von für statische Graphen optimierten Datentypen,” Universität des Saarlandes, Saarbrücken, 2000.
  25. Thesis
    D1
    “Externe Prioritätswarteschlangen,” Universität des Saarlandes, Saarbrücken, 2000.
  26. Book chapter / section
    D1
    “Applications of the Generic Programming Paradigm in the Design of CGAL,” in Generic programming - International Seminar on Generic Programming Dagstuhl Castle, Germany, April 27 - May 1, 1998, selected papers, Berlin, Germany: Springer, 2000.
  27. Article
    D1
    “A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Radicals,” Algorithmica, vol. 27, no. 1, 2000.
  28. Article
    D1
    “Computing mimicking networks,” Algorithmica, vol. 26, no. 1, 2000.
  29. Article
    D1
    “Shortest paths in digraphs of small treewidth. Part I, Sequential algorithms,” Algorithmica, vol. 27, no. 3/4, 2000.
  30. Article
    D1
    “An O(n log n) algorithm for the maximum agreement subtree problem for binary trees,” SIAM Journal on Computing, vol. 30, no. 5, 2000.
  31. Article
    D1
    “Average-Case Complexity of Shortest-Paths Problems in the Vertex-Potential Model,” Random Structures & Algorithms, vol. 16, 2000.
  32. Article
    D1
    “Curve reconstruction: Connecting dots with good reason,” Computational Geometry: Theory and Applications, vol. 15, no. 4, 2000.
  33. Thesis
    D1
    “Berechnung von Einfach-und Zweifachzusammenhangskomponenten auf einer PRAM,” Universität des Saarlandes, Saarbrücken, 2000.
  34. Article
    D1
    “Improved algorithms for dynamic shortest paths,” Algorithmica, vol. 28, no. 4, 2000.
  35. Article
    D1
    “Deciding Hopf bifurcations by quantifier elimination in a software-component architecture,” Journal of Symbolic Computation, vol. 30, no. 2, 2000.
  36. Article
    D1
    “On the Design of CGAL, a computational geometry algorithms library,” Software - Practice and Experience, vol. 30, no. 11, 2000.
  37. Report
    D1
    “Low-contention depth-first scheduling of parallel computations with synchronization variables,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-2000-1-003, 2000.
  38. Article
    D1
    “Efficient Scheduling of Strict Multithreaded Computations,” Theory of Computing Systems, vol. 33, no. 3, 2000.
  39. Conference paper
    D1
    “Online scheduling revisited,” in Algorithms - ESA 2000, Proceedings of the 8th Annual European Symposium (ESA-00), 2000.
  40. Thesis
    D1
    “Implementation of a Dynamic Convex Hull Algorithm in Arbitrary Dimension,” Universität des Saarlandes, Saarbrücken, 2000.
  41. Conference paper
    D1
    “LOOK - a Lazy Object-Oriented Kernel for Geometric Computation,” in Proceedings of the 16th Annual Symposium on Computational Geometry (SCG-00), 2000.
  42. Article
    D1
    “Approximation algorithm for the group Steiner tree problem,” Journal of Algorithms, vol. 37, no. 1, 2000.
  43. Thesis
    D1IMPR-CS
    “Algorithms for Interval Coloring, Geometric Packing and Memory Optimization,” Universität des Saarlandes, Saarbrücken, 2000.
  44. Conference paper
    D5D1
    “A Goal-driven Auto-Configuration Tool for the Distributed Workflow Management System Mentor-lite,” in Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, 2000.
  45. Article
    D1
    “Contention resolution with constant expected delay,” Journal of the ACM, vol. 42, no. 6, 2000.
  46. Conference paper
    D1
    “A New Visibility Partition for Affine Pattern Matching,” in Discrete Geometry for Computer Imagery, Proceedings of the 9th International Conference (DGCI-00), 2000.
  47. Article
    D1
    “Parallel preprocessing for path queries without concurrent reading,” Information and Computation, vol. 158, no. 1, 2000.
  48. Article
    D1
    “Dynamic algorithms for graphs of bounded treewidth,” Algorithmica, vol. 27, no. 3/4, 2000.
  49. Book chapter / section
    D1
    “Linear time approximation schemes for shop scheduling problems,” in Approximation and complexity in numerical optimization, Dordrecht, The Netherlands: Kluwer, 2000.
  50. Article
    D1
    “Simulating synthetic polymer chains in parallel,” Future Generation Computer Systems, vol. 16, no. 5, 2000.
  51. Conference paper
    D1
    “Randomized Rumor Spreading,” in 41th Annual Symposium on Foundations of Computer Science (FOCS-00), 2000.
  52. Article
    D1
    “A polyhedral approach to sequence alignment problems,” Discrete Applied Mathematics, vol. 104, 2000.
  53. Thesis
    D1
    “Zwangsbasierte Dynamiksimulation im R2 unter Verwendung von Kreiskanten,” Universität des Saarlandes, Saarbrücken, 2000.
  54. Article
    D1
    “Integer optimization on convex semialgebraic sets,” Discrete & Computational Geometry, vol. 23, no. 2, 2000.
  55. Conference paper
    D1
    “Optimal Labelling of Point Features in the Slider Model,” in Computing and Combinatorics, Proceedings of the 6th Annual International Conference (COCOON-00), 2000.
  56. Thesis
    D1
    “Flußbasierte orthogonale Zeichenverfahren für Graphen mit variablen Knotengrößen,” Universität des Saarlandes, Saarbrücken, 2000.
  57. Thesis
    D1IMPR-CS
    “New Approaches to Protein Docking,” Universität des Saarlandes, Saarbrücken, 2000.
  58. Article
    D1
    “BALL - Rapid Software Prototyping in Computational Molecular Biology,” Bioinformatics, vol. 16, no. 9, 2000.
  59. Conference paper
    D1
    “A Polynomial-Time Fragment of Dominance Constraints,” in Proceedings of the 38th Annual Meeting of the Association of Computational Linguistics (ACL-00), 2000.
  60. Article
    D1
    “Robust Parallel Computations through Randomization,” Theory of Computing Systems, vol. 33, no. 5/6, 2000.
  61. Conference paper
    D1
    “Hardness of Set Cover with Intersection 1,” in Automata, Languages and Programming, Proceedings of the 27th International Colloquium (ICALP-00), 2000.
  62. Thesis
    D1
    “Parallele und externe Implementierung eines Zusammenhangskomponentenalgorithmus,” Universität des Saarlandes, Saarbrücken, 2000.
  63. Article
    D1
    “Optimal Embedding of Multiple Directed Hamiltonian Rings into d-dimensional Meshes,” Journal of Parallel and Distributed Computing, vol. 60, no. 6, 2000.
  64. Conference paper
    D1
    “Approximation of Curvature-constrained Shortest Paths through a Sequence of Points,” in Algorithms - ESA 2000, Proceedings of the 8th Annual European Symposium (ESA-00), 2000.
  65. Article
    D1
    “Searching a polygonal room with one door by a 1-searcher,” International Journal of Computational Geometry and Applications, vol. 10, no. 2, 2000.
  66. Article
    D1
    “The practical use of the A* algorithm for exact multiple sequence alignment,” Journal of Computational Biology, vol. 7, no. 5, 2000.
  67. Thesis
    D1
    “Knickminimales Zeichnen 4-planarer Clustergraphen,” Universität des Saarlandes, Saarbrücken, 2000.
  68. Article
    D1
    “Improved Routing and Sorting on Multibutterflies,” Algorithmica, vol. 28, no. 4, 2000.
  69. Conference paper
    D1
    “Resource Constrained Shortest Paths,” in Algorithms - ESA 2000, Saarbrücken, Germany, 2000.
  70. Conference paper
    D1
    “Faster Algorithms for Bound-Consistency of the Sortedness and the Alldifferent Constraint,” in Principles and practice of constraint programming - CP 2000 (CP-00) : 6th international conference, CP 2000, 2000.
  71. Conference paper
    D1
    “Constraint Programming and Graph Algorithms,” in Automata, Languages and Programming, Proceedings of the 27th International Colloquium (ICALP-00), 2000.
  72. Proceedings
    D1
    Eds., Informatik 2000 : Neue Horizonte im neuen Jahrhundert, 30. Jahrestagung der Gesellschaft für Informatik. Springer, 2000.
  73. Conference paper
    D1
    “Geometric Computing with CGAL and LEDA,” in Curve and Surface Design Volume 1, Saint-Malo, France, 2000.
  74. Conference paper
    D1
    “Implementation of O(nmlog n) Weighted Matchings: The Power of Data Structures,” in Algorithm Engineering (WAE 2000), Saarbrücken, Germany, 2000.
  75. Report
    D1
    “A Generalized and improved constructive separation bound for real algebraic expressions,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-2000-1-004, 2000.
  76. Conference paper
    D1
    “Parallel Shortest Path for Arbitrary Graphs,” in Euro-Par 2000 Parallel Processing, Proceedings of the 6th International Euro-Par Conference (Euro-Par-00), 2000.
  77. Conference paper
    D1
    “The Constrained Crossing Minimization Problem,” in Graph Drawing, Proceedings of the 7th International Symposium (GD-99), 2000.
  78. Conference paper
    D1
    “Modeling the Sugar Lectin Interaction by Computational Chemistry Relevant to Drug Design,” in Proceedings of the 3rd World Meeting on Pharmaceutics, Biopharmaceutics and Pharmaceutical Technology, 2000.
  79. Article
    D1
    “On Integrality, Stability and Composition of Dicycle Packings and Covers,” Journal of Combinatorial Optimization, vol. 4, no. 2, 2000.
  80. Conference paper
    D1
    “Characterization of Rooms Searchable by Two Guards,” in Proceedings of the 11th Conference on Algorithms and Computation, 2000.
  81. Conference paper
    D1
    “Primal-Dual Approaches to the Steiner Problem,” in Approximation Algorithms for Combinatorial Optimization, 2000.
  82. Thesis
    D1
    “ArchEd: Ein interaktives Zeichensystem für die Archäologie,” Universität des Saarlandes, Saarbrücken, 2000.
  83. Conference paper
    D1
    “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), 2000.
  84. Conference paper
    D1
    “Deterministic Algorithms for 3-D Diameter and some 2-D Lower Envelopes,” in Proceedings of the 16th Annual Symposium on Computational Geometry (SCG-00), 2000.
  85. Conference paper
    D1
    “Linear Programming Queries Revisited,” in Proceedings of the 16th Annual Symposium on Computational Geometry (SCG-00), 2000.
  86. Conference paper
    D1
    “Fast Concurrent Access to Parallel Disks,” in Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00), 2000.
  87. Conference paper
    D1
    “Asynchronous Scheduling of Redundant Disk Arrays,” in Proceedings of the 12th Annual ACM Symposium on Parallel Algorithms and Architecture (SPAA-00), 2000.
  88. Article
    D1
    “Fast Priority Queues for Cached Memory,” Journal of Experimental Algorithmics, vol. 5, 2000.
  89. Conference paper
    D1
    “How Helpers Hasten h-Relations,” in Algorithms - ESA 2000, Proceedings of the 8th Annual European Symposium (ESA-00), 2000.
  90. Conference paper
    D1
    “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), 2000.
  91. Thesis
    D1
    “Weighted Matchings in General Graphs,” Universität des Saarlandes, Saarbrücken, 2000.
  92. Thesis
    D1
    “Effiziente Algorithmen für das verteilte Rechnen auf Workstation-Clustern,” Universität des Saarlandes, Saarbrücken, 2000.
  93. Book chapter / section
    D1
    “Robustness and Precision Issues in Geometric Computation,” in Handbook of Computational Geometry, Amsterdam, The Netherlands: Elsevier, 2000.
  94. Report
    D1
    “Infimaximal frames: a technique for making lines look like segments,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-2000-1-005, 2000.
  95. Article
    D1
    “Online randomized multiprocessor scheduling,” Algorithmica, vol. 28, no. 2, 2000.
  96. Thesis
    D1
    “Kürzeste Wege in planare Graphen. Implementierung eines parallelen Algorithmus mithilfe von PAD,” Universität des Saarlandes, Saarbrücken, 2000.
  97. Thesis
    D1
    “Implementierung eines heuristischen und eines exakten Ansatzes zur Berechnung minimaler Steinerbäume in Netzwerken,” Universität des Saarlandes, Saarbrücken, 2000.
  98. Article
    D1
    “Algorithms for Colouring Random k-colourable Graphs,” Combinatorics, Probability and Computing, vol. 9, no. 1, 2000.
  99. Thesis
    D1
    “Erweiterung des hierarchischen Zeichenmodells in ArchEd,” Universität des Saarlandes, Saarbrücken, 2000.
  100. Article
    D1
    “Floats, Integers, and Single Source Shortest Paths,” Journal of Algorithms, vol. 35, 2000.
  101. Article
    D1
    “A simple parallel algorithm for the single-source shortest path problem on planar digraphs,” Journal of Parallel and Distributed Computing, vol. 60, no. 9, 2000.
  102. Thesis
    D1
    “Ein neuer Algorithmus für Online-Scheduling,” Universität des Saarlandes, Saarbrücken, 2000.
  103. Conference paper
    D1D5
    “The Mentor-Lite Prototype: A Light-Weight Workflow Management System,” in Proceedings of the 16th International Conference on Data Engineering, San Diego, U.S.A., 2000.
  104. Thesis
    D1IMPR-CS
    “Crossing Minimization in Automatic Graph Drawing,” Universität des Saarlandes, Saarbrücken, 2000.

1999

  1. Conference paper
    D1
    “I/O-Efficient Dynamic Point Location in Monotone Subdivisions,” in Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), 1999.
  2. Thesis
    D1
    “Online-Algorithmen,” Universität des Saarlandes, Saarbrücken, 1999.
  3. Conference paper
    D1
    “Exploring unknown environments with obstacles,” in Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), 1999.
  4. Conference paper
    D1
    “Page replacement for general caching problems,” in Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), 1999.
  5. Article
    D1
    “Better bounds for online scheduling,” SIAM Journal on Computing, vol. 29, no. 2, 1999.
  6. Article
    D1
    “A Correctness Certificate for the Stoer-Wagner Min-cut Algorithm,” Information Processing Letters, vol. 70, no. 5, 1999.
  7. Article
    D1
    “On the Expected Depth of Random Circuits,” Combinatorics, Probability and Computing, vol. 8, no. 3, 1999.
  8. Article
    D1
    “A 2-approximation algorithm for finding an optimum 3-vertex-connected spanning subgraph,” Journal of Algorithms, vol. 32, no. 1, 1999.
  9. Other
    D1
    “An Introduction to Analytic Number Theory.” Lecture Notes Proceedings, 1999.
  10. Conference paper
    D1
    “On Generating Functions of Generating Trees,” in Proceedings of FPSAC’99, 1999.
  11. Report
    D1
    “BALL: Biochemical Algorithms Library,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1999-1-002, 1999.
  12. Conference paper
    D1
    “BALL: Biochemical Algorithms Library,” in Algorithm engineering (WAE-99) : 3rd International Workshop, WAE’99, 1999.
  13. Conference paper
    D1
    “Graph Drawing Contest Report,” in Proceedings of the 7th International Symposium on Graph Drawing (GD-99), 1999.
  14. Conference paper
    D1
    “An Experimental Study of Priority Queues in External Memory,” in Algorithm engineering (WAE-99) : 3rd International Workshop, WAE’99, 1999.
  15. Thesis
    D1
    “Oberflächenrekonstruktion mithilfe von Voronoi-Diagrammen,” Universität des Saarlandes, Saarbrücken, 1999.
  16. Conference paper
    D1
    “q-gram Based Database Searching Using a Suffix Array (QUASAR),” in Proceedings of the 3rd Annual International Conference on Computational Molecular Biology (RECOMB-99), 1999.
  17. Report
    D1
    “A simple way to recognize a correct Voronoi diagram of line segments,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1999-1-007, 1999.
  18. Conference paper
    D1
    “Efficient exact geometric computation made easy,” in Proceedings of the 15th Annual Symposium on Computational Geometry (SCG-99), 1999.
  19. Article
    D1
    “An Analysis of the Highest-level Selection rule in the Preflow-push Max-flow Algorithm,” Information Processing Letters, vol. 69, no. 5, 1999.
  20. Thesis
    D1
    “Plattformunabhängiges Toolkit für Grafische Benutzerschnittstellen (GUI),” Universität des Saarlandes, Saarbrücken, 1999.
  21. Conference paper
    D1
    “An Easy to Use Implementation of Linear Perturbations within CGAL,” in Algorithm engineering (WAE-99) : 3rd International Workshop, WAE’99, 1999.
  22. Conference paper
    D1
    “I/O-optimal computation of segment intersections,” in Proceedings of the DIMACS Workshop on External Algorithms and Visualization, New Brunswick, New Jersey, 1999.
  23. Conference paper
    D1
    “On Constructing Suffix Arrays in External Memory,” in Proceedings of the 7th Annual European Symposium on Algorithms (ESA-99), 1999.
  24. Report
    D1
    “A theoretical and experimental study on the construction of suffix arrays in external memory,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1999-1-001, 1999.
  25. Conference paper
    D1
    “LEDA-SM : Extending LEDA to Secondary Memory,” in Algorithm engineering (WAE-99) : 3rd International Workshop, WAE’99, 1999.
  26. Conference paper
    D1
    “Curve reconstruction: Connecting dots with good reason,” in Proceedings of the 15th Annual Symposium on Computational Geometry (SCG-99), Miami Beach, Florida, 1999.
  27. Article
    D1
    “On the single-source unsplittable flow problem,” Combinatorica, vol. 19, no. 1, 1999.
  28. Article
    D1
    “A 3-approximation algorithm for finding optimum 4,5-vertex-connected spanning subgraphs,” Journal of Algorithms, vol. 32, no. 1, 1999.
  29. Conference paper
    D1
    “Checking Priority Queues,” in Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), 1999.
  30. Thesis
    D1
    “Effiziente und Online-Algorithmen,” Universität des Saarlandes, Saarbrücken, 1999.
  31. Article
    D1
    “Decision trees: old and new results,” Information and Computation, vol. 152, 1999.
  32. Conference paper
    D1
    “FUN with implementing algorithms,” in Proceedings of the International Conference on FUN with Algorithms (FUN-98), 1999.
  33. Conference paper
    D1
    “Structural Filtering: a Paradigm for Efficient and Exact Geometric Programs,” in Abstracts for the 11th Canadian Conference on Computational Geometry (CCCG-99), 1999.
  34. Article
    D1
    “Efficient algorithms for counting and reporting pairwise intersections between convex polygons,” Information Processing Letters, vol. 69, no. 1, 1999.
  35. Thesis
    D1
    “Design und Implementierung einer Algorithmen-Bibliothek zum Zeichnen von Graphen,” Universität des Saarlandes, Saarbrücken, 1999.
  36. Thesis
    D1
    “Dynamic shortest Path Algorithms for Planar and Outerplanar Graphs,” Universität des Saarlandes, Saarbrücken, 1999.
  37. Thesis
    D1
    “Konzeption und Entwicklung des streng strukturierten und erweiterbaren Datentyps html_page für LEDA,” Universität des Saarlandes, Saarbrücken, 1999.
  38. Thesis
    D1
    “Simulation von Molekül-Docking-Reaktionen,” Universität des Saarlandes, Saarbrücken, 1999.
  39. Article
    D1
    “Motion Planning in R3 for Multiple Tethered Robots,” IEEE Transactions on Robotics and Automation, vol. 15, no. 4, 1999.
  40. Conference paper
    D1
    “Simulating synthetic polymer chains in parallel,” in Proceedings of the 7th International Conference on High-Performance Computing and Networking Europe (HPCN Europe-99), 1999.
  41. Article
    D1
    “Transmissions in a network with capacities and delays,” Networks, vol. 33, no. 3, 1999.
  42. Conference paper
    D1
    “Optimal Compaction of Orthogonal Grid Drawings,” in Proceedings of the 7th International Conference on Integer Programming and Combinatorial Optimization (IPCO-99), 1999.
  43. Conference paper
    D1
    “Combining Graph Labeling and Compaction,” in Proceedings of the 7th International Symposium on Graph Drawing (GD-99), 1999.
  44. Conference paper
    D1
    “Rapid Software Prototyping in Computational Molecular Biology,” in Proceedings of the German Conference on Bioinformatics (GCB’99), 1999.
  45. Thesis
    D1
    “Animation and Analysis of Distributed Algorithms,” Universität des Saarlandes, Saarbrücken, 1999.
  46. Conference paper
    D1
    “Efficient approximation algorithms for the achromatic number,” in Proceedings of the 7th Annual European Symposium on Algorithms (ESA-99), 1999.
  47. Article
    D1
    “The STO problem is NP-complete,” Journal of Symbolic Computation, vol. 27, no. 2, 1999.
  48. Conference paper
    D1
    “Approximation algorithms for bounded facility location,” in Proceedings of the 5th Annual International Conference on Computing and Combinatorics (COCOON-99), 1999.
  49. Conference paper
    D1
    “Markovian Coupling vs. Conductance for the Jerrum-Sinclair Chain,” in Proceedings of the 40th Annual Symposium on Foundations of Computer Science (FOCS-99), 1999.
  50. Conference paper
    D1
    “Covering Rectilinear Polygons with Axis-Parallel Rectangles,” in Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC-99), 1999.
  51. Conference paper
    D1
    “Parallel and External List Ranking and Connected Components on a Cluster of Workstations,” in Proceedings of the 11th International Conference on Parallel and Distributed Computing and Systems (PDCS-99), 1999.
  52. Article
    D1
    “An exact solution for the segment-to-segment multiple sequence alignment problem,” Bioinformatics, vol. 15, no. 3, 1999.
  53. Thesis
    D1
    “Bioinformatik,” Universität des Saarlandes, Saarbrücken, 1999.
  54. Article
    D1
    “Checking geometric programs or verification of geometric structures,” Computational Geometry: Theory and Applications, vol. 12, 1999.
  55. Book
    D1
    LEDA: a platform for combinatorial and geometric computing. Cambridge, MA: Cambridge University Press, 1999.
  56. Conference paper
    D1
    “Ten Years of LEDA Some Thoughts (Abstract),” in Algorithm engineering ({WAE}-99) : 3rd International Workshop, 1999.
  57. Conference paper
    D1
    “The Engineering of Some Bipartite Matching Programs,” in Foundations of software technology and theoretical computer science : 19th conference, 1999.
  58. Conference paper
    D1
    “The Engineering of Some Bipartite Matching Programs,” in Algorithms and computation : 10th International Symposium, ISAAC’99, 1999.
  59. Article
    D1
    “Editorial,” Computational Geometry, vol. 12, 1999.
  60. Thesis
    D1
    “Parallel molecular dynamics simulations for synthetic polymers,” Universität des Saarlandes, Saarbrücken, 1999.
  61. Book chapter / section
    D1
    “Graph Drawing Algorithms,” in Algorithms & Theory of Computation Handbook, Boca Raton, USA: CRC, 1999.
  62. Conference paper
    D1
    “The constrained crossing minimization problem: a first approach,” in Operations Research Proceedings 1998, 1999.
  63. Conference paper
    D1
    “Optimizing Over All Combinatorial Embeddings of a Planar Graph,” in Proceedings of the 7th International Conference on Integer Programming and Combinatorial Optimization (IPCO-99), 1999.
  64. Report
    D1
    “Integration of graph iterators into LEDA,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1999-1-006, 1999.
  65. Report
    D1
    “How generic language extensions enable open-world’' design in Java,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1999-1-004, 1999.
  66. Thesis
    D1
    “Parallele Algorithmen zur Lösung des Single-Source Shortest Path Problems,” Universität des Saarlandes, Saarbrücken, 1999.
  67. Conference paper
    D1
    “On range reporting, ray shooting and $k$-level construction,” in Proceedings of the 15th Annual Symposium on Computational Geometry (SCG-99), 1999.
  68. Article
    D1
    “A case study in scalability: an ADI method for the two-dimensional time-dependent Dirac equation,” Parallel Computing, vol. 25, no. 5, 1999.
  69. Thesis
    D1
    “A polyhedral approach to sequence alignment problems,” Universität des Saarlandes, Saarbrücken, 1999.
  70. Thesis
    D1
    “Polygontriangulierung in Linearzeit,” Universität des Saarlandes, Saarbrücken, 1999.
  71. Thesis
    D1
    “Ein schnelles Verfahren zur exakten Berechnung von Skalarprodukten,” Universität des Saarlandes, Saarbrücken, 1999.
  72. Conference paper
    D1
    “Accessing Multiple Sequences Through Set Associative Caches,” in Proceedings of the 26th International Colloquium on Automata, Languages and Programming (ICALP-99), 1999.
  73. Report
    D1
    “Fast concurrent access to parallel disks,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1999-1-003, 1999.
  74. Article
    D1
    “Analysis of nearest neighbor load balancing algorithms for random loads,” Parallel Computing, vol. 25, 1999.
  75. Conference paper
    D1
    “Fast Priority Queues for Cached Memory,” in Selected papers of the International Workshop on Algorithm Engineering and Experimentation (ALENEX-99), 1999.
  76. Conference paper
    D1
    “Asynchronous Random Polling Dynamic Load Balancing,” in Algorithms and computation : 10th International Symposium, ISAAC’99, 1999.
  77. Conference paper
    D1
    “High performance integer optimization for crew scheduling,” in Proceedings of the 7th International Conference on High-Performance Computing and Networking Europe (HPCN Europe-99), 1999.
  78. Conference paper
    D1
    “A Case Study on the Cost of Geometric Computing,” in Selected papers of the International Workshop on Algorithm Engineering and Experimentation (ALENEX-99), 1999.
  79. Article
    D1
    “Randomized online scheduling with delivery times,” Journal of Combinatorial Optimization, vol. 3, no. 4, 1999.
  80. Thesis
    D1
    “Effiziente parallele Algorithmen,” Universität des Saarlandes, Saarbrücken, 1999.
  81. Report
    D1
    “Ultimate parallel list ranking?,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1999-1-005, 1999.
  82. Article
    D1
    “Practical Parallel List Ranking,” Journal of Parallel and Distributed Computing, vol. 56, no. 2, 1999.
  83. Conference paper
    D1
    “Makespan minimization in job shops: a polynomial time approximation scheme,” in Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC-99), 1999.
  84. Conference paper
    D1
    “A linear time approximation scheme for the job shop scheduling problem,” in Proceedings of the 3rd International Workshop on Randomization and Approximation Techniques in Computer Science, and 2nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (RANDOM-APPROX-99), 1999.
  85. Thesis
    D1
    “Berechnung konvexer Hüllen in erwarteter Linearzeit,” Universität des Saarlandes, Saarbrücken, 1999.
  86. Article
    D1
    “Minimum Coloring k-Colorable Graphs in Polynomial Average Time,” Journal of Algorithms, vol. 33, 1999.
  87. Conference paper
    D1
    “A Generalization of Janson inequalities and its application to finding shortest paths,” in Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), 1999.
  88. Thesis
    D1
    “Persistente Suchbäume,” Universität des Saarlandes, Saarbrücken, 1999.

1998

  1. Article
    D1
    “New on-line algorithms for the page replication problem,” Journal of Algorithms, vol. 27, 1998.
  2. Article
    D1
    “A competitive analysis of the list update problem with lookahead,” Theoretical Computer Science, vol. 197, no. 1/2, 1998.
  3. Article
    D1
    “Average case analyses of list update algorithms, with applications to data compression,” Algorithmica, vol. 21, no. 3, 1998.
  4. Report
    D1
    “Scheduling with unexpected machine breakdowns,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1998-1-021, 1998.
  5. Conference paper
    D1
    “Average-case Analyses of First-fit and Random-fit Bin Packing,” in Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1998), San Francisco, CA, USA, 1998.
  6. Conference paper
    D1
    “On delayed information and action in on-line algorithms,” in Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science (FOCS-98), 1998.
  7. Conference paper
    D1
    “Minimizing stall time in single and parallel disk systems,” in Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC-98), 1998.
  8. Article
    D1
    “Improved randomized on-line algorithms for the list update problem,” SIAM Journal on Computing, vol. 27, no. 3, 1998.
  9. Book chapter / section
    D1
    “Self-organizing data structures,” in Online Algorithms: The State of the Art, Berlin, Germany: Springer, 1998.
  10. Conference paper
    D1
    “A Software Library of Dynamic Graph Algorithms,” in Proceedings of Workshop on Algorithms and Experiments (ALEX-98), 1998.
  11. Conference paper
    D1
    “Parallel Crew Scheduling in PAROS,” in Proceedings of the 4th International Euro-Par Conference (Euro-Par-98), 1998.
  12. Thesis
    D1
    “Berechnung optimaler Steinerbäume in der Ebene,” Universität des Saarlandes, Saarbrücken, 1998.
  13. Article
    D1
    “Maximum Network Flow with Floating Point Arithmetic,” Information Processing Letters, vol. 66, no. 3, 1998.
  14. Article
    D1
    “All-Pairs Min-Cut in Sparse Networks,” Journal of Algorithms, vol. 29, 1998.
  15. Article
    D1
    “Time-Space Lower Bounds for Directed st-Connectivity on Graph Automata Models,” SIAM Journal on Computing, vol. 27, no. 4, 1998.
  16. Conference paper
    D1
    “Dynamic Scheduling with Incomplete Information,” in Proceedings of the 10th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-98), 1998.
  17. Conference paper
    D1
    “Drawing Planar Partitions II: HH-Drawings,” in Proceedings of the 24th Workshop on Graph-Theoretic Concepts in Computer Science (WG-98), 1998.
  18. Article
    D1
    “Ranking of Graphs,” SIAM Journal on Discrete Mathematics, vol. 11, no. 1, 1998.
  19. Article
    D1
    “Parallel Algorithms with Optimal Speedup for Bounded Treewidth,” SIAM Journal on Computing, vol. 27, no. 6, 1998.
  20. Article
    D1
    “Efficient Matrix Chain Ordering in Polylog Time,” SIAM Journal on Computing, vol. 27, no. 2, 1998.
  21. Conference paper
    D1
    “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), 1998.
  22. Article
    D1
    “A Parallel Priority Queue with Constant Time Operations,” Journal of Parallel and Distributed Computing, Special Issue on Parallel Data Structures, vol. 49, no. 1, 1998.
  23. Conference paper
    D1
    “Finger Search Trees with Constant Insertion Time,” in Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1998), San Francisko, CA, USA, 1998.
  24. Report
    D1
    “Comparator networks for binary heap construction,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1998-1-002, 1998.
  25. Conference paper
    D1
    “Comparator Networks for Binary Heap Construction,” in Proceedings of the 6th Scandinavian Workshop on Algorithm Theory (SWAT-98), 1998.
  26. Conference paper
    D1
    “Worst-Case Efficient External-Memory Priority Queues,” in Proceedings of the 6th Scandinavian Workshop on Algorithm Theory (SWAT-98), 1998.
  27. Report
    D1
    “Applications of the generic programming paradigm in the design of CGAL,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1998-1-030, 1998.
  28. Conference paper
    D1
    “Interval analysis yields efficient dynamic filters for computational geometry,” in Proceedings of the 14th International Annual ACM Symposium on Computational Geometry (SCG-98), 1998.
  29. Report
    D1
    “$q$-gram based database searching using a suffix array (QUASAR),” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1998-1-024, 1998.
  30. Report
    D1
    “Rational points on circles,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1998-1-023, 1998.
  31. Report
    D1
    “Delaunay graphs by divide and conquer,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1998-1-027, 1998.
  32. Report
    D1
    “Fast recursive division,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1998-1-022, 1998.
  33. Conference paper
    D1
    “Exact Geometric Predicates using Cascaded Computation,” in Proceedings of the 14th International Annual ACM Symposium on Computational Geometry (SCG-98), 1998.
  34. Article
    D1
    “A Better Approximation Algorithm for Finding Planar Subgraphs,” Journal of Algorithms, vol. 27, no. 2, 1998.
  35. Conference paper
    D1
    “Computing Mimicking Networks,” in Proceedings of the 25th International Colloquium on Automata, Languages and Programming (ICALP-98), 1998.
  36. Article
    D1
    “Shortest paths in digraphs of small treewidth. Part II: Optimal parallel algorithms,” Theoretical Computer Science, vol. 203, no. 2, 1998.
  37. Article
    D1
    “The $p$-neighbor $k$-center problem,” Information Processing Letters, vol. 65, 1998.
  38. Article
    D1
    “Approximating Biconnectivity in Parallel,” Algorithmica, vol. 21, 1998.
  39. Conference paper
    D1
    “Improved deterministic parallel padded sorting,” in Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 1998.
  40. Report
    D1
    “Randomized external-memory algorithms for some geometric problems,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1998-1-017, 1998.
  41. Conference paper
    D1
    “Randomized External-Memory Algorithms for some Geometric Problems,” in Proceedings of the 14th International Annual ACM Symposium on Computational Geometry (SCG 1998), Minneapolis, Minnesota, 1998.
  42. Conference paper
    D1
    “A Parallelization of Dijkstra’s Shortest Path Algorithm,” in Mathematical Foundations of Computer Science 1998 (MFCS 1998), Brno, Czech Republic, 1998.
  43. Report
    D1
    “On the performance of LEDA-SM,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1998-1-028, 1998.
  44. Article
    D1
    “A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching,” SIAM Journal on Computing, vol. 27, no. 3, 1998.
  45. Conference paper
    D1
    “Constant-space string-matching in sublinear average time,” in Compression and Complexity of SEQUENCES 1997, 1998.
  46. Article
    D1
    “Topologically correct subdivision simplification using the bandwidth criterion,” Cartography and Geographic Information Systems, vol. 25, no. 4, 1998.
  47. Article
    D1
    “More general parallel tree contraction: Register allocation and broadcasting in a tree,” Theoretical Computer Science, vol. 203, no. 1, 1998.
  48. Article
    D1
    “Balls and Bins: A Study in Negative Dependence,” Random Structures & Algorithms, vol. 13, no. 5, 1998.
  49. Report
    D1
    “On positive influence and negative dependence,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1998-1-018, 1998.
  50. Book chapter / section
    D1
    “Graph Drawing Algorithms,” in Algorithms and Theory of Computation Handbook, New York, USA: CRC Press, 1998.
  51. Conference paper
    D1
    “Graph Drawing Contest Report,” in Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 1998.
  52. Report
    D1
    “On the Design of CGAL, the Computational Geometry Algorithms Library,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1998-1-007, 1998.
  53. Thesis
    D1
    “Analyse und Implementierung von Algorithmen zum Minimum Cost Circulation Problem,” Universität des Saarlandes, Saarbrücken, 1998.
  54. Article
    D1
    “Optimal On-Line Search and Sublinear Time Update in String Matching,” SIAM Journal on Computing, vol. 27, no. 3, 1998.
  55. Conference paper
    D1
    “A New Approximation Algorithm for the Planar Augmentation Problem,” in Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1998), San Francisco, CA, USA, 1998.
  56. Conference paper
    D1
    “On the Bahncard problem,” in Proceedings of the 4th International Conference on Computing and Combinatorics (COCOON-98), 1998.
  57. Article
    D1
    “Algorithms for Measuring Perturbability in Matroid Optimization,” Combinatorica, vol. 18, no. 4, 1998.
  58. Report
    D1
    “Robustness analysis in combinatorial optimization,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1998-1-011, 1998.
  59. Report
    D1
    “Fully dynamic shortest paths and negative cycle detection on diagraphs with Arbitrary Arc Weights,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1998-1-009, 1998.
  60. Conference paper
    D1
    “An experimental study of dynamic algorithms for directed graphs,” in Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 1998.
  61. Article
    D1
    “Randomized Data Structures for the Dynamic Closest-Pair Problem,” SIAM Journal on Computing, vol. 27, no. 4, 1998.
  62. Conference paper
    D1
    “Planar Polyline Drawings with Good Angular Resolution,” in Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 1998.
  63. Conference paper
    D1
    “Sorting and Searching on the Word RAM,” in Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS-98), 1998.
  64. Report
    D1
    “Simpler and faster static AC$^0$ dictionaries,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1998-1-001, 1998.
  65. Conference paper
    D1
    “Simpler and Faster Dictionaries on the AC° RAM,” in Proceedings of the 25th International Colloquium on Automata, Languages and Programming (ICALP-98), 1998.
  66. Conference paper
    D1
    “An Implementation of the Binary Blocking Flow Algorithm,” in 2nd Workshop on Algorithm Engineering (WAE 1998), Saarbrücken, Germany, 1998.
  67. Report
    D1
    “Scheduling multicasts on unit-capacity trees and meshes,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1998-1-015, 1998.
  68. Report
    D1
    “Improved approximation schemes for scheduling unrelated parallel machines,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1998-1-026, 1998.
  69. Conference paper
    D1
    “The Mutual Exclusion Scheduling Problem for Permutation and Comparability Graphs,” in Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS-98), 1998.
  70. Report
    D1
    “A new characterization for parity graphs and a coloring problem with costs,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1998-1-006, 1998.
  71. Conference paper
    D1
    “A New Characterization for Parity Graphs and a Coloring Problem with Costs,” in Proceedings of the 3rd Latin American Symposium on Theoretical Informatics (Latin-98), 1998.
  72. Report
    D1
    “Linear-time approximation schemes for scheduling malleable parallel tasks,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1998-1-025, 1998.
  73. Report
    D1
    “The mutual exclusion scheduling problem for permutation and comparability graphs,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1998-1-005, 1998.
  74. Article
    D1
    “A Note on Computing a Maximal Planar Subgraph using PQ-Trees,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 17, no. 7, 1998.
  75. Conference paper
    D1
    “Level Planarity Testing in Linear Time,” in Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 1998.
  76. Article
    D1
    “The Thickness of a Minor-excluded Class of Graphs,” Discrete Mathematics, vol. 182, no. 1–3, 1998.
  77. Report
    D1
    “A note on computing a maximal planar subgraph using PQ-trees,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1998-1-008, 1998.
  78. Thesis
    D1
    “Eine Methode zur Berechnung von Vorzeichen ganzzahliger Determinanten,” Universität des Saarlandes, Saarbrücken, 1998.
  79. Thesis
    D1
    “Eine Implementation von k-Server-Algorithmen,” Universität des Saarlandes, Saarbrücken, 1998.
  80. Report
    D1
    “Optimal compaction of orthogonal grid drawings,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1998-1-031, 1998.
  81. Report
    D1
    “Quasi-orthogonal drawing of planar graphs,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1998-1-013, 1998.
  82. Report
    D1
    “New approximation algorithms for the achromatic number,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1998-1-016, 1998.
  83. Thesis
    D1
    “Exploration von geometrischen Umgebungen mit Hindernissen,” Universität des Saarlandes, Saarbrücken, 1998.
  84. Thesis
    D1
    “Exact Linear Programming,” Universität des Saarlandes, Saarbrücken, 1998.
  85. Thesis
    D1
    “Design und Implementierung eines Testmanagers für LiDIA,” Universität des Saarlandes, Saarbrücken, 1998.
  86. Article
    D1
    “A Polyhedral Approach to RNA Sequence Structure Alignment,” Journal of Computational Biology, vol. 5, no. 3, 1998.
  87. Conference paper
    D1
    “A polyhedral approach to RNA sequence structure alignment,” in Proceedings of the 2nd Annual International Conference on Computational Molecular Biology (RECOMB-98), 1998.
  88. Report
    D1
    “Solving some discrepancy problems in NC*,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1998-1-012, 1998.
  89. Book chapter / section
    D1
    “Amortisierte Analyse,” in Prinzipien des Algorithmenentwurfs, T. Ottmann, Ed. Heidelberg, Germany: Spektrum, 1998.
  90. Proceedings
    D1
    Ed., Fundamentals - Foundations of Computer Science. Österreichische Computer Gesellschaft (OCG) / Austrian Computer Society, 1998.
  91. Report
    D1
    Ed., “2nd Workshop on Algorithm Engineering WAE ’98 -- Proceedings,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1998-1-019, 1998.
  92. Conference paper
    D1
    “From Algorithms to Working Programs on the Use of Program Checking in LEDA,” in IFIP World Computer Congress on Fundamentals - Foundations of Computer Science, Vienna, Austria and Budapest, Hungary, 1998.
  93. Article
    D1
    “A computational basis for higher-dimensional computational geometry and applications,” Computational Geometry: Theory and Applications, vol. 10, no. 4, 1998.
  94. Conference paper
    D1
    “From Algorithms to Working Programs: On the Use of Program Checking in LEDA,” in Mathematical Foundations of Computer Science 1998 (MFCS 1998), Brno, Czech Republic, 1998.
  95. Conference paper
    D1
    “Gossiping Large Packets on Full-Port Tori,” in Proceedings of the 4th International Euro-Par Conference (Euro-Par-98), 1998.
  96. Report
    D1
    “Time-independent gossiping on full-port tori,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1998-1-014, 1998.
  97. Conference paper
    D1
    “$\Delta$-Stepping: A Parallel Single Source Shortest Path Algorithm,” in Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 1998.
  98. Thesis
    D1
    “Implementation and Experimental Evaluation of Dynamic Transitive Closure Algorithms,” Universität des Saarlandes, Saarbrücken, 1998.
  99. Thesis
    D1
    “Implementation of Hammock Decomposition with Application to Shortest Path Problems,” Universität des Saarlandes, Saarbrücken, 1998.
  100. Thesis
    D1
    “Ein Simulator für Prozessor-Netzwerke,” Universität des Saarlandes, Saarbrücken, 1998.
  101. Conference paper
    D1
    “Two-Layer Planarization in Graph Drawing,” in Proceedings of the 9th International Symposium on Algorithms and Computation (ISAAC-98), 1998.
  102. Article
    D1
    “The thickness of graphs: A survey,” Graphs and Combinatorics, vol. 14, no. 1, 1998.
  103. Conference paper
    D1
    “AGD: A Library of Algorithms for Graph Drawing,” in Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 1998.
  104. Report
    D1
    “Optimizing over all combinatorial embeddings of a planar graph,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1998-1-029, 1998.
  105. Thesis
    D1
    “Vergleich von praxisnahen seriellen und parallelisierten Verfahren zur Bestimmung der Schnittpunkte von Liniensegmenten in der Ebene,” Universität des Saarlandes, Saarbrücken, 1998.
  106. Conference paper
    D1
    “Investigating the Sugar-Lectin Interaction by Computational Chemistry: Tunneling the Epithelial Barrier,” in Proceedings of the 18th Interlec Meeting, 1998.
  107. Thesis
    D1
    “Graph Iterators: Decoupling Graph Structures from Algorithms,” Universität des Saarlandes, Saarbrücken, 1998.
  108. Article
    D1
    “Randomized Naming Using Wait-Free Shared Variables,” Distributed Computing, vol. 11, no. 3, 1998.
  109. Thesis
    D1
    “Verlustfreie Datenkompression mit selbstorganisierenden Listen,” Universität des Saarlandes, Saarbrücken, 1998.
  110. Thesis
    D1
    “Tree Decomposition: A Feasibility Study,” Universität des Saarlandes, Saarbrücken, 1998.
  111. Conference paper
    D1
    “On Batcher’s Merge Sorts as Parallel Sorting Algorithms,” in Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS-98), 1998.
  112. Report
    D1
    “On Wallace’s method for the generation of normal variates,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1998-1-020, 1998.
  113. Article
    D1
    “Random Permutations on Distributed, External and Hierarchical Memory,” Information Processing Letters, vol. 67, no. 6, 1998.
  114. Article
    D1
    “Randomized Priority Queues for Fast Parallel Access,” Journal Parallel and Distributed Computing, vol. 49, no. 1, 1998.
  115. Conference paper
    D1
    “Tree Shaped Computations as a Model for Parallel Applications,” in Anwendungsbezogene Lastverteilung (ALV), 1998.
  116. Conference paper
    D1
    “SKaMPI: A Detailed, Accurate MPI Benchmark,” in Proceedings of the 5th European PVM/MPI Users’ Group Meeting, 1998.
  117. Article
    D1
    “Random Permutations on Distributed, External and Hierarchical Memory,” PARS-Mitteilungen, vol. 1998, no. 17, 1998.
  118. Report
    D1
    “Robustness and precision issues in geometric computation,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1998-1-004, 1998.
  119. Report
    D1
    “Parameterized implementations of classical planar convex hull algorithms and extreme point compuations,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1998-1-003, 1998.
  120. Thesis
    D1
    “Computational Geometry: Theory and Implementation,” Universität des Saarlandes, Saarbrücken, 1998.
  121. Conference paper
    D1
    “Almost optimal (on the average) algorithms for boolean matrix product witnesses, computing the diameter,” in Proceedings of the 2nd International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM-98), 1998.
  122. Thesis
    D1
    “Upper and Lower Bounds for Basic Scheduling Problems,” Universität des Saarlandes, Saarbrücken, 1998.
  123. Article
    D1
    “Gossiping on Meshes and Tori,” IEEE Transactions on Parallel and Distributed Systems, vol. 9, no. 6, 1998.
  124. Conference paper
    D1
    “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), 1998.
  125. Conference paper
    D1
    “Rooted Spanning Trees with Small Weight and Average Length,” in Theoretical Computer Science, 1998.
  126. Report
    D1
    “2-Approximation algorithm for finding a spanning tree with maximum number of leaves,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1998-1-010, 1998.
  127. Article
    D1
    “Some Properties of Touching Distances for Polygons and Polyhedra,” Applied Mathematics Letters, vol. 11, no. 5, 1998.
  128. Thesis
    D1
    “Ein Programm zum visuellen Erlernen von Graphalgorithmen,” Universität des Saarlandes, Saarbrücken, 1998.
  129. Article
    D1
    “Algorithms for Coloring Semi-random Graphs,” Random Structures & Algorithms, vol. 13, no. 2, 1998.
  130. Thesis
    D1
    “Automatisiertes Zeichnen von Zustandsdiagrammen,” Universität des Saarlandes, Saarbrücken, 1998.

1997

  1. Conference paper
    D1
    “Exploring Unknown Environments,” in Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC-97), 1997.
  2. Conference paper
    D1
    “Better Bounds for Online Scheduling,” in Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC-97), 1997.
  3. Article
    D1
    “Improved Parallel Integer Sorting without Concurrent Writing,” Information and Computation, vol. 136, no. 1, 1997.
  4. Article
    D1
    “On the Influence of Lookahead in Competitive Paging Algorithms,” Algorithmica, vol. 18, no. 1, 1997.
  5. Report
    D1
    “Better bounds for online scheduling,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1997-1-009, 1997.
  6. Article
    D1
    “Revisiting the COUNTER algorithms for list update,” Information Processing Letters, vol. 64, no. 3, 1997.
  7. Report
    D1
    “Exploring unknown environments,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1997-1-017, 1997.
  8. Report
    D1
    “AGD-Library: A Library of Algorithms for Graph Drawing,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1997-1-019, 1997.
  9. Conference paper
    D1
    “AGD-Library: A Library of Algorithms for Graph Drawing,” in Proceedings of the Workshop on Algorithm Engineering (WAE-97), 1997, vol. 1547.
  10. Report
    D1
    “Maximum network flow with floating point arithmetic,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1997-1-022, 1997.
  11. Article
    D1
    “Efficient Computation of Implicit Representations of Spare Graphs,” Discrete applied mathematics, vol. 78, no. 1–3, 1997.
  12. Article
    D1
    “Efficient Computation of implicit representations of sparse graphs,” Discrete Applied Mathematics, vol. 78, no. 1–3, 1997.
  13. Article
    D1
    “Efficient construction of a bounded degree spanner with low weight,” Algorithmica, vol. 17, no. 1, 1997.
  14. Article
    D1
    “Weak epsilon-Nets for Points on a Hypersphere,” Discrete & Computational Geometry, vol. 18, no. 1, 1997.
  15. Article
    D1
    “More Efficient Parallel Totally Monotone Matrix Searching,” Journal of Algorithms, vol. 23, no. 2, 1997.
  16. Conference paper
    D1BIO
    “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, Aachen, Germany, 1997.
  17. Report
    D1
    “Algorithmen zum automatischen Zeichnen von Graphen,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1997-1-007, 1997.
  18. Article
    D1
    “Algorithmen zum automatischen Zeichnen von Graphen,” Informatik Spektrum, vol. 20, no. 4, 1997.
  19. Article
    D1
    “Rotations of Periodic Strings and Short Superstrings,” Journal of Algorithms, vol. 24, no. 1, 1997.
  20. Thesis
    D1
    “Separierung von Kuratowski-Ungleichungen für das größte planare Untergraphenproblem,” Universität des Saarlandes, Saarbrücken, 1997.
  21. Report
    D1
    “A parallel priority queue with constant time operations,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1997-1-011, 1997.
  22. Conference paper
    D1
    “A parallel priority data structure with applications,” in 11th Internatinal Parallel Processing Symposium (IPPS-97), 1997.
  23. Report
    D1
    “Finger search trees with constant insertion time,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1997-1-020, 1997.
  24. Conference paper
    D1
    “Predecessor Queries in Dynamic Integer Sets,” in Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science (STACS-97), 1997.
  25. Thesis
    D1
    “Robuste Implementierung eines Algorithmus zur Berechnung eines Voronoi-Diagramms für Polygone,” Universitaet des Saarlandes, Saarbrücken, 1997.
  26. Article
    D1
    “The Complexity of Parallel Prefix Problems on Small Domains,” Information and Computation, vol. 138, no. 1, 1997.
  27. Article
    D1
    “Probabilistic Recurrence Relations Revisited,” Theoretical computer science, vol. 181, no. 1, 1997.
  28. Conference paper
    D1
    “Routing on the PADAM: Degrees of Optimality,” in Euro-Par’97 Parallel Processing, Passau, Germany, 1997.
  29. Conference paper
    D1
    “A Branch-and-Cut Approach to Physical Mapping with End-probes,” in Proceedings of the 1st Annual International Conference on Computational Molecular Biology (RECOMB 1997), Santa Fe, NM, USA, 1997.
  30. Article
    D1
    “A Branch-And-Cut Approach to Physical Mapping of Chromosomes by Unique End-Probes,” Journal of Computational Biology, vol. 4, no. 4, 1997.
  31. Conference paper
    D1
    “Average-Case Complexity of Shortest-Paths Problems in the Vertex-Potential Model,” in Randomization and Approximation Techniques in Computer Science, Bologna, Italy, 1997.
  32. Conference paper
    D1
    “Kürzeste-Wege-Berechnung bei sehr großen Datenmengen,” in Promotion tut not: Innovationsmotor “Graduiertenkolleg,” Aachen, Germany, 1997.
  33. Article
    D1
    “Constant-time Randomized Parallel String Matching,” SIAM Journal on Computing, vol. 26, no. 4, 1997.
  34. Report
    D1
    “Restricted 2-factor polytopes,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1997-1-006, 1997.
  35. Conference paper
    D1
    “The Architecture of a Software Library for String Processing,” in Proceedings of the Workshop on Algorithm Engineering (WAE-97), 1997.
  36. Conference paper
    D1
    “Episode Matching,” in Combinatorial Pattern Matching (CPM 1997), Aarhus, Denmark, 1997.
  37. Article
    D1
    “On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees,” Algorithmica, vol. 19, 1997.
  38. Article
    D1
    “The Cost of Derandomization: Computability or Competitiveness,” SIAM Journal on Computing, vol. 26, no. 3, 1997.
  39. Article
    D1
    “A Reliable Randomized Algorithm for the Closest-pair Problem,” Journal of Algorithms, vol. 25, no. 1, 1997.
  40. Conference paper
    D1
    “Efficient approximation and optimization algorithms for computational metrology,” in Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-97), 1997.
  41. Article
    D1
    “Inclusion-exclusion complexes for pseudo-disk collections,” Discrete and Computational Geometry, vol. 17, 1997.
  42. Thesis
    D1
    “Das planare Augmentierungsproblem,” Universität des Saarlandes, Saarbrücken, 1997.
  43. Report
    D1
    “On-line network routing - a survey,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-97-1-026, 1997.
  44. Conference paper
    D1
    “Runtime Prediction of Real Programs on Real Machines,” in Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1997), New Orleans, LA, USA, 1997.
  45. Thesis
    D1
    “Design of Efficient and Correct Algorithms: Theoretical Results and Runtime Prediction of Implementations in Practice,” Universität des Saarlandes, Saarbrücken, 1997.
  46. Report
    D1
    “On the Bahncard problem,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1997-1-018, 1997.
  47. Article
    D1
    “Computing the Largest Empty Anchored Cylinder, and Related Problems,” International Journal of Computational Geometry and Applications, vol. 7, no. 6, 1997.
  48. Thesis
    D1
    “Exact Arithmetic using Cascaded Computation,” Universität des Saarlandes, Saarbrücken, 1997.
  49. Report
    D1
    “Faster and simpler algorithms for multicommodity flow and other fractional packing problems,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-97-1-025, 1997.
  50. Report
    D1
    “A polylogarithmic approximation algorithm for group Steiner tree problem,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-97-1-027, 1997.
  51. Report
    D1
    “Evaluating a 2-approximation algorithm for edge-separators in planar graphs,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1997-1-010, 1997.
  52. Report
    D1
    “Approximating sparsest cuts,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1997-1-002, 1997.
  53. Report
    D1
    “Minimizing stall time in single and parallel disk systems,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1997-1-024, 1997.
  54. Conference paper
    D1
    “On the Complexity of Computing Evolutionary Trees,” in Computing and Combinatorics (COCOON 1997), Shanghai, China, 1997.
  55. Conference paper
    D1
    “Efficient Parallel Computing with Memory Faults,” in Fundamentals of Computation Theory (FCT 1997), Krakcw, Poland, 1997.
  56. Article
    D1
    “Broadcasting with a Bounded Fraction of Faulty Nodes,” Journal of Parallel and Distributed Computing, vol. 42, no. 1, 1997.
  57. Conference paper
    D1
    “External Inverse Pattern Matching,” in Combinatorial Pattern Matching (CPM 1997), Aarhus, Denmark, 1997.
  58. Thesis
    D1
    “Das Maximum-Weight-Trace-Problem bei multiplem Sequenz-Alignment,” Universität des Saarlandes, Saarbrücken, 1997.
  59. Article
    D1
    “Bounded-independence derandomization of geometric partitioning with applications to parallel fixed-dimensional linear programming,” Discrete and Computational Geometry, vol. 18, no. -, 1997.
  60. Thesis
    D1
    “Praktisches Paralleles List Ranking,” Universität des Saarlandes, Saarbrücken, 1997.
  61. Conference paper
    D1
    “Discovering All Most Specific Sentences by Randomized Algorithms - Extended Abstract,” in Proceedings of the 6th International Conference on Database Theory (ICDT-97), Delphi, Greece, 1997.
  62. Article
    D1
    “The Rectangle Enclosure and Point-dominance Problems Revisited,” International Journal of Computational Geometry and Applications, vol. 7, no. 5, 1997.
  63. Article
    D1
    “Fast Integer Merging on the EREW PRAM,” Algorithmica, vol. 17, no. 1, 1997.
  64. Article
    D1
    “Allocating Independent Tasks to Parallel Processors: An Experimental Study,” Journal of Parallel and Distributed Computing, vol. 47, no. 2, 1997.
  65. Conference paper
    D1
    “Dynamic Algorithms for Graphs of Bounded Treewidth,” in Automata, Languages, and Programming (ICALP 1997), Bologna, Italy, 1997.
  66. Thesis
    D1
    “Die Berechnung maximaler Flüsse in Netzwerken,” Universität des Saarlandes, Saarbrücken, 1997.
  67. Book chapter / section
    D1
    “Extremal Graph Problems for Graphs with a Color-Critical Vertex,” in Combinatorics, Geometry and Probability, Cambridge: Cambridge University Press, 1997.
  68. Conference paper
    D1
    “ArchE: A Graph Drawing System for Archaeology,” in Graph Drawing (GD 1997), Rome, Italy, 1997.
  69. Report
    D1
    “Parallel algorithms for MD-simulations of synthetic polymers,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1997-1-003, 1997.
  70. Conference paper
    D1
    “Parallel MD-simulations of synthetic polymers,” in Parallel processing for scientific computing (PPSC-97) : 8th SIAM conference, 1997.
  71. Article
    D1
    “Langevin dynamics simulations of macromolecules on parallel computers,” Macromolecular Theory and Simulation, vol. 6, no. -, 1997.
  72. Report
    D1
    “Pitfalls of using PQ-Trees in automatic graph drawing,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-97-1-015, 1997.
  73. Article
    D1
    “2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms,” Journal of Graph Algorithms and Applications, vol. 1, no. 1, 1997.
  74. Conference paper
    D1
    “A Polyhedral Approach to the Multi-layer Crossing Minimization Problem,” in Graph Drawing (GD 1997), Rome, Italy, 1997.
  75. Conference paper
    D1
    “Pitfalls of using PQ-Trees in Automatic graph Drawing,” in Graph Drawing (GD 1997), Rome, Italy, 1997.
  76. Conference paper
    D1
    “A Meticulous Analysis of Mergesort Programs,” in Algorithms and Complexity (CIAC 1997), Rome, Italy, 1997.
  77. Article
    D1
    “Routing on Meshes with Buses,” Algorithmica, vol. 18, no. 3, 1997.
  78. Article
    D1
    “Randomized Multipacket Routing and Sorting on Meshes,” Algorithmica, vol. 17, no. 3, 1997.
  79. Article
    D1
    “Matrix Transpose on Meshes: Theory and Practice,” Computers and Artificial Intelligence, vol. 16, no. 2, 1997.
  80. Conference paper
    D1
    “Matrix Transpose on Meshes: Theory and Practice,” in Proceedings of the 11th International Parallel Processing Symposium (IPPS-97), 1997.
  81. Conference paper
    D1
    “Language and library support for practical PRAM programming,” in Proceedings of the 5th Euromicro Workshop on Parallel and Distributed Processing (PDP-97), 1997.
  82. Thesis
    D1
    “Quasi-orthogonales Zeichnen planarer Graphen mit wenigen Knicken,” Universität des Saarlandes, Saarbrücken, 1997.
  83. Thesis
    D1
    “Fast combinatorial algorithms for packing and covering problems,” Universität des Saarlandes, Saarbrücken, 1997.
  84. Book chapter / section
    D1
    “Parallel Protein Puzzle: A New Suite of Protein Docking Tools,” in Forschung und wissenschaftliches Rechnen: Beiträge zum Heinz-Billing-Preis 1996, Göttingen, Germany: Gesellschaft für wissenschaftliche Datenverarbeitung mbH, 1997.
  85. Conference paper
    D1
    “New Contact Measures for the Protein Docking Problem,” in Proceedings of the 1st Annual International Conference on Computational Molecular Biology (RECOMB 1997), Santa Fe, NM, USA, 1997.
  86. Report
    D1
    “New contact measures for the protein docking problem,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-97-1-004, 1997.
  87. Report
    D1
    “Randomized on-line call control revisited,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-97-1-023, 1997.
  88. Thesis
    D1
    “Multiple Sequence Alignment,” Universität des Saarlandes, Saarbrücken, 1997.
  89. Report
    D1
    “The practical use of the A* algorithm for exact multiple sequence alignment,” MPI-I-97-1-028, 1997.
  90. Conference paper
    D1
    “Solving some discrepancy problems in NC,” in Proceedings of the 17th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS-97), 1997.
  91. Thesis
    D1
    “Separatoren in planaren Graphen: Implementierung einer 2-Approximation,” Universität des Saarlandes, Saarbrücken, 1997.
  92. Thesis
    D1
    “Parallele Berechnung elektrostatischer Wechselwirkungen für synthetische Polymere,” Universität des Saarlandes, Saarbrücken, 1997.
  93. Thesis
    D1
    “Heuristiken für Goldbergs Preflow Push Algorithmus,” Universität des Saarlandes, Saarbrücken, 1997.
  94. Conference paper
    D1
    “The impact of timing on linearizability in counting networks,” in Proceedings of the 11th International Parallel Processing Symposium (IPPS-97), 1997.
  95. Conference paper
    D1
    “A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Square Roots,” in Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1997), New Orleans, LA, USA, 1997.
  96. Article
    D1
    “Maintaining Dynamic Sequences under Equality Tests in Polylogarithmic Time,” Algorithmica, vol. 17, 1997.
  97. Conference paper
    D1
    “A Computational Basis for Higher-dimensional Computational Geometry and Applications,” in Proceedings of the 13th Annual Symposium on Computational Geometry (SCG 1997), Nice, France, 1997.
  98. Article
    D1
    “On the All-Pairs Shortest-Path Algorithm of Moffat and Takaoka,” Random Structures and Algorithms, vol. 10, no. 1–2, 1997.
  99. Conference paper
    D1
    “The LEDA Platform for Combinatorial and Geometric Computing,” in Automata, Languages and Programming (ICALP 1997), Bologna, Italy, 1997.
  100. Conference paper
    D1
    “A Complete Roundness Classification Procedure,” in Proceedings of the 13th Annual Symposium on Computational Geometry (SCG 1997), Nice, France, 1997.
  101. Thesis
    D1
    “Ergebnisüberprüfung bei Graphenalgorithmen,” Universität des Saarlandes, Saarbrücken, 1997.
  102. Conference paper
    D1
    “A First Experimental Study of a Dynamic Transitive Closure Algorithm,” in Proceedings of the Workshop on Algorithm Engineering (WAE-97), 1997.
  103. Report
    D1
    “An alternative method to crossing minimization on hierarchical graphs,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1997-1-008, 1997.
  104. Thesis
    D1
    “Arithmetik der Transduktoren,” Universität des Saarlandes, Saarbrücken, 1997.
  105. Article
    D1
    “Self-Stabilizing Wait-Free Clock Synchronization,” Parallel Processing Letters, vol. 7, no. 3, 1997.
  106. Conference paper
    D1
    “Computing Integral Points in Convex Semi-algebraic Sets,” in Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS-97), 1997.
  107. Conference paper
    D1
    “Construction of 1-d lower envelopes and applications,” in Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 1997.
  108. Article
    D1
    “Intersection of unit-balls and diameter of a point set in R3,” Computational Geometry Theory and Applications, vol. 8, 1997.
  109. Thesis
    D1
    “Ein experimenteller Vergleich von zwei Algorithmen zur Berechnung des maximalen Flusses in einem asymmetrischen Netzwerk mit reellen Kapazitäten,” Universität des Saarlandes, Saarbrücken, 1997.
  110. Conference paper
    D1
    “A Branch-And-Cut Algorithm for Multiple Sequence Alignment,” in RECOMB’97, First Annual International Conference on Computational Molecular Biology, Santa Fe, NM, USA, 1997.
  111. Report
    D1
    “On Batcher’s Merge Sorts as Parallel Sorting Algorithms,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1997-1-012, 1997.
  112. Article
    D1
    “On the Average Running Time of Odd-even Merge Sort,” Journal of Algorithms, vol. 22, no. 2, 1997.
  113. Book chapter / section
    D1
    “Precision and Robustness in Geometric Computations,” in Algorithmic Foundations of Geographic Information Systems, Berlin: Springer, 1997.
  114. Report
    D1
    “Designing a Computational Geometry Algorithms Library,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1997-1-014, 1997.
  115. Conference paper
    D1
    “Computing the Minimum Diameter for Moving Points: An Exact Implementation using Parametric Search,” in Proceedings of the 13th Annual Symposium on Computational Geometry (SCG 1997), Nice, France, 1997.
  116. Thesis
    D1
    “Paralleles List Ranking,” Universität des Saarlandes, Saarbrücken, 1997.
  117. Conference paper
    D1
    “Routing with Finite Speeds of Memory and Network,” in Mathematical Foundations of Computer Science 1997 (MFCS 1997), Bratislava, Slovakia, 1997.
  118. Conference paper
    D1
    “Sample Sort on Meshes,” in Euro-Par’97 Parallel Processing, Passau, Germany, 1997.
  119. Conference paper
    D1
    “BSP-like External-memory Computation,” in Algorithms and Complexity (CIAC 1997), Rome, Italy, 1997.
  120. Article
    D1
    “Deterministic Permutation Routing on Meshes,” Journal of Algorithms, vol. 22, no. 1, 1997.
  121. Report
    D1
    “From parallel to external list ranking,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1997-1-021, 1997.
  122. Report
    D1
    “BSP-like external-memory computation,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1997-1-001, 1997.
  123. Conference paper
    D1
    “Practical Parallel List Ranking,” in Solving Irregularly Structured Problems in Parallel, Paderborn, Germany, 1997.
  124. Report
    D1
    “Faster deterministic sorting and priority queues in linear space,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1997-1-016, 1997.
  125. Book chapter / section
    D1
    “Computational Molecular Biology,” in Annotated Bibliographies in Combinatorial Optimization, New York, USA: Wiley, 1997.
  126. Report
    D1
    “Bicriteria job sequencing with release dates,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1997-1-005, 1997.
  127. Thesis
    D1
    “2-Schicht-Planarisierung bipartiter Graphen,” Universität des Saarlandes, Saarbrücken, 1997.
  128. Article
    D1
    “Simple and Work-Efficient Parallel Algorithms for the Minimum Spanning Tree Problem,” Parallel Processing Letters, vol. 7, no. 1, 1997.
  129. Thesis
    D1
    “Bewertung verschiedener paarweiser Alignment-Methoden, Ersetzungsmatrizen und Gap-Funktionen,” Universität des Saarlandes, Saarbrücken, 1997.
  130. Conference paper
    D1
    “A 2-Approximation Algorithm for the Directed Multiway Cut Problem,” in Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS-97), 1997.

1996

  1. Conference paper
    D1
    “Average Case Analysis of List Update Algorithms, with Applications to Data Compression,” in Automata, Languages and Programming: 23rd International Colloquium (ICALP’96), 1996.
  2. Report
    D1
    “A survey of self-organizing data structures,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1996-1-026, 1996.
  3. Conference paper
    D1
    “Average Case Analyses of List Update Algorithms, with Applications to Data Compression,” in Automata Languages and Programming (ICALP 1996), Paderborn, Germany, 1996.
  4. Article
    D1
    “Coloring 2-colorable Hypergraphs with a Sublinear Number of Colors,” Nordic Journal of Computing, vol. 3, no. 4, 1996.
  5. Article
    D1
    “Matching nuts and bolts faster,” Information Processing Letters, vol. 59, no. 3, 1996.
  6. Article
    D1
    “A Method for Obtaining Randomized Algorithms with Small Tail Probabilities,” Algorithmica, vol. 16, 1996.
  7. Report
    D1
    “All-pairs min-cut in sparse networks,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1996-1-007, 1996.
  8. Article
    D1
    “Realizing degree sequences in parallel,” SIAM Journal of Discrete Mathematics, vol. 9, no. 2, 1996.
  9. Conference paper
    D1
    “Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane,” in Algorithms - ESA ’96, Barcelona, Spain, 1996.
  10. Article
    D1
    “Accounting for boundary effects in nearest neighbor searching,” Discrete & Computational Geometry, vol. 16, no. 2, 1996.
  11. Thesis
    D1
    “Allgemeine approximative Kongruenz zweier Punktmengen im R3,” Universität des Saarlandes, Saarbrücken, 1996.
  12. Thesis
    D1
    “Untersuchung zur Implementierung eines parallelen Algorithmus mit guter asymptotischer Laufzeit auf einem Rechner mit verteiltem Speicher und Message-Passing,” Universität des Saarlandes, Saarbrücken, 1996.
  13. Thesis
    D1
    “Eine parallelisierbare Heuristik für das Min-Cost-Flow Problem,” Universität des Saarlandes, Saarbrücken, 1996.
  14. Conference paper
    D1
    “Lower Bounds for Row Minima Searching,” in Automata Languages and Programming (ICALP 1996), Paderborn, Germany, 1996.
  15. Report
    D1
    “Lower bounds for row minima searching,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1996-1-029, 1996.
  16. Article
    D1
    “Optimal Parallel Construction of Minimal Suffix and Factor Automata,” Parallel Processing Letters, vol. 6, no. 1, 1996.
  17. Report
    D1
    “Rotations of periodic strings and short superstrings,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1996-1-019, 1996.
  18. Article
    D1
    “The Randomized Complexity of Maintaining the Minimum,” Nordic Journal of Computing, vol. 3, no. 4, 1996.
  19. Conference paper
    D1
    “The Randomized Complexity of Maintaining the Minimum,” in Algorithm Theory - SWAT ’96, Reykjavík, Iceland, 1996.
  20. Conference paper
    D1
    “Priority queues on parallel machines,” in 5th Scandinavian Workshop on Algorithm Theory (SWAT96), 1996.
  21. Conference paper
    D1BIO
    “Approximate Dictionary Queries,” in Combinatorial Pattern Matching: 7th Annual Symposium (CPM’96), 1996.
  22. Report
    D1
    “The randomized complexity of maintaining the minimum,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1996-1-014, 1996.
  23. Thesis
    D1
    “Exact Computation of Voronoi Diagrams and Line Segment Intersections,” Universität des Saarlandes, Saarbrücken, 1996.
  24. Report
    D1
    “The LEDA class real number,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1996-1-001, 1996.
  25. Report
    D1
    “High-precision floating point numbers in LEDA,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1996-1-002, 1996.
  26. Conference paper
    D1
    “A Better Approximation Algorithm for Finding Planar Subgraphs,” in Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1996), Georgia, USA, 1996.
  27. Article
    D1
    “Sensitive functions and approximate problems,” Information and Computation, vol. 126, no. 2, 1996.
  28. Conference paper
    D1
    “Deterministic restrictions in circuit complexity,” in Proceedings of the 28th Annual ACM Symposium on the Theory of Computing (STOC 1996), Philadelphia, PA, USA, 1996.
  29. Article
    D1
    “On the Parallel Complexity of Acyclic Logic Programs,” Parallel Processing Letters, vol. 6, no. 2, 1996.
  30. Conference paper
    D1
    “Lower Bounds for Computing Geometric Spanners and Approximate Shortest Paths,” in Proceedings of the 8th Canadian Conference on Computational Geometry (CCCG 1996), Ottawa, Canada, 1996.
  31. Article
    D1
    “An o(n3)-Time Maximum-Flow Algorithm,” SIAM Journal on Computing, vol. 25, no. 6, 1996.
  32. Article
    D1
    “Algorithms for Dense Graphs and Networks on the Random Access Computer,” Algorithmica, vol. 15, no. 6, 1996.
  33. Conference paper
    D1
    “Parallel Alternating-Direction Access Machine,” in Mathematical Foundations of Computer Science 1996 (MFCS 1996), Cracow, Poland, 1996.
  34. Conference paper
    D1
    “Finding minimum spanning trees on the EREW PRAM,” in International Computer Symposium, 1996.
  35. Conference paper
    D1
    “Towards more precise parallel biconnectivity approximation,” in 7th Annual International Symposium on Algorithms and Computation, 1996.
  36. Report
    D1
    “A branch-and-cut approach to physical mapping with end-probes,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1996-1-027, 1996.
  37. Conference paper
    D1
    “An O(n log n) algorithm for the maximum agreement subtree problem for binary trees,” in 7th ACM-SIAM Symposium on Discrete Algorithms (SODA96), 1996.
  38. Report
    D1
    “On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1996-1-006, 1996.
  39. Conference paper
    D1
    “On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees,” in Foundations of software technology and theoretical computer science (FSTTCS 1996), Hyderabad, India, 1996.
  40. Report
    D1
    “Exact ground states of two-dimensional $\pm J$ Ising Spin Glasses,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1996-1-004, 1996.
  41. Article
    D1
    “Exact Ground States of Two-Dimensional +-J Ising Spin Glasses,” Journal of Statistical Physics, vol. 84, no. 5/6, 1996.
  42. Article
    D1
    “Queries on Voronoi Diagrams of Moving Points,” Computational Geometry: Theory and Applications, vol. 6, no. 5, 1996.
  43. Report
    D1
    “More general parallel tree contraction: Register allocation and broadcasting in a tree,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1996-1-024, 1996.
  44. Conference paper
    D1
    “More General Parallel Tree Contraction: Register Allocation and Broadcasting in a Tree,” in Graph-theoretic Concepts in Computer Science (WG 1996), Cadenabbia, Italy, 1996.
  45. Conference paper
    D1
    “Geometric problems in machine learning,” in Applied Computational Geometry: Towards Geometric Engineering (FCRC96 Workshop, WACG96), 1996.
  46. Thesis
    D1
    “An Implementation of a Convex Hull Algorithm Version 2.0,” Universität des Saarlandes, Saarbrücken, 1996.
  47. Report
    D1
    “Negative dependence through the FKG Inequality,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1996-1-020, 1996.
  48. Article
    D1
    “An Improved Upper Complexity Bound for the Topology Computation of a Real Algebraic Plane Curve,” Journal of Complexity, vol. 12, no. 4, 1996.
  49. Conference paper
    D1
    “The CGAL Kernel: A Basis for Geometric Computation,” in Applied Computational Geometry: Towards Geometric Engineering (WACG 1996), Philadelphia, PA, 1996.
  50. Report
    D1
    “Runtime prediction of real programs on real machines,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1996-1-032, 1996.
  51. Article
    D1
    “A Simple Balanced Search Tree with 0(1) Worst-case Update Time,” International Journal of Foundations of Computer Science, vol. 7, no. 2, 1996.
  52. Article
    D1
    “A simple balanced search tree with $O(1)$ worst-case update time,” International Journal of Foundations of Computer Science, vol. 7, no. 2, 1996.
  53. Conference paper
    D1
    “A 3-approximation for the Minimum Tree Spanning with k-vertices,” in Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science (FOCS 1996), Burlington, VT, USA, 1996.
  54. Conference paper
    D1
    “Distributed List Coloring: How to Dynamically Allocate Frequencies to Mobile Base Stations,” in 8th Annual IEEE Symposium on Parallel and Distributed Processing (SPDP ’96), 1996.
  55. Article
    D1
    “Approximate max-flow min-(multi)cut theorems and their applications,” SIAM Journal on Computing, vol. 25, no. 2, 1996.
  56. Report
    D1
    “Generalized $k$-Center Problems,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1996-1-021, 1996.
  57. Report
    D1
    “Distributed list coloring: how to dynamically allocate frequencies to mobile base stations,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1996-1-010, 1996.
  58. Conference paper
    D1
    “Minimizing Congestion of Layouts for ATM Networks with Faulty Links,” in Mathematical Foundations of Computer Science 1996, Cracow, Poland, 1996.
  59. Conference paper
    D1
    “Efficient Algorithms for Lempel-Ziv Encoding,” in Algorithm Theory - SWAT ’96, Reykjavík, Iceland, 1996.
  60. Conference paper
    D1BIO
    “Randomized Efficient Algorithms for Compressed Strings: the Finger-Print Approach,” in Combinatorial Pattern Matching (CPM 1996), Laguna Beach, CA, USA, 1996.
  61. Report
    D1
    “On the complexity of computing evolutionary trees,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1996-1-031, 1996.
  62. Report
    D1
    “External inverse pattern matching,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1996-1-030, 1996.
  63. Article
    D1
    “Adaptive Broadcasting with Faulty Nodes,” Parallel Computing, vol. 22, no. 6, 1996.
  64. Article
    D1
    “Mod-2-OBDDs - a Date Structure that generalizes EXOR-Sum-of-Products and Ordered Binary Decision Diagrams,” Formal Methods in System Design, vol. 8, no. 3, 1996.
  65. Conference paper
    D1
    “Approximation Algorithms for Dynamic Storage Allocation,” in Algorithms - ESA ’96, Barcelona, Spain, 1996.
  66. Report
    D1
    “Discovering all most specific sentences by randomized algorithms,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1996-1-023, 1996.
  67. Conference paper
    D1
    “Vertex Partitioning Problems on Partial k-Trees,” in Algorithm Theory - SWAT ’96, Reykjavík, Iceland, 1996.
  68. Article
    D1
    “Using Amplification to Compute Majority with Small Majority Gates,” Computational Complexity, vol. 6, no. 1, 1996.
  69. Report
    D1
    “Efficient algorithms for counting and reporting pairwise intersections between convex polygons,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1996-1-008, 1996.
  70. Conference paper
    D1
    “Efficient Algorithms for Counting and Reporting Pairwise Intersections Between Convex Polygons,” in Proceedings of the 8th Canadian Conference on Computational Geometry (CCCG 1996), Ottawa, Canada, 1996.
  71. Report
    D1
    “A technique for adding range restrictions to generalized searching problems,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1996-1-017, 1996.
  72. Article
    D1
    “Fast Algorithms for Collision and Proximity Problems Involving Moving Geometric Objects,” Computational Geometry, vol. 6, no. 6, 1996.
  73. Article
    D1
    “Algorithms for Generalized Halfspace Range Searching and other Intersection Searching Problems,” Computational Geometry, vol. 6, no. 1, 1996.
  74. Article
    D1
    “Algorithms for generalized halfspace range searching and other intersection searching problems,” Computational Geometry, vol. 5, no. 6, 1996.
  75. Report
    D1
    “Vorlesungsskript Komplexitätstheorie,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-96-1-005, 1996.
  76. Conference paper
    D1
    “Allocating Independent Tasks to Parallel Processors: An Experimental Study,” in Parallel Algorithms for Irregularly Structured Problems, Santa Barbara, CA, USA, 1996.
  77. Conference paper
    D1
    “Coloring 2-colorable hypergraphs with a sublinear number of colors,” in Scandinavian Workshop on Algorithm Theory (SWAT96), 1996.
  78. Thesis
    D1
    “Heuristiken für das euklidische Travelling Salesman Problem,” Universitat des Saarlandes, Saarbrücken, 1996.
  79. Conference paper
    D1
    “Data Mining as Selective Theory Extraction in Probabilistic Logic,” in Proceedings of the 1996 SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, 1996.
  80. Article
    D1
    “Maximum planar subgraphs and nice embeddings: Practical layout tools,” Algorithmica, vol. 16, no. 1, 1996.
  81. Conference paper
    D1
    “Exact and heuristic algorithms for 2-layer straightline crossing minimization,” in Graph Drawing (GD 1995), Passau, Germany, 1996.
  82. Report
    D1
    “2-Layer straigthline crossing minimization: performance of exact and heuristic algorithms,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1996-1-025, 1996.
  83. Thesis
    D1
    “Die hierarchische Darstellung konvexer Polyeder und einige Anwendungen,” Universität des Saarlandes, Saarbrücken, 1996.
  84. Conference paper
    D1
    “Worm-Hole Gossiping on Meshes,” in Euro-Par ’96, Parallel Processing, Lyon, France, 1996.
  85. Article
    D1
    “New Techniques for Exact and Approximate Dynamic Closest-point Problems,” SIAM Journal on Computing, vol. 25, no. 4, 1996.
  86. Conference paper
    D1
    “On minimum 3-cuts and approximating k-cuts using cut trees,” in Integer Programming and Combinatorial Optimization (IPCO 1996), Vancouver, BC, Canada, 1996.
  87. Article
    D1
    “Hammock-on-ears decomposition : a technique for the efficient parallel solution of shortest paths and other problems,” Theoretical Computer Science, vol. 168, no. 1, 1996.
  88. Conference paper
    D1
    “Neighborhood graphs and distributed ‘^’ + 1-coloring,” in Algorithm Theory - SWAT ’96 (5th Scandinavian Workshop on Algorithm Theory), Reykjavik, Iceland, 1996.
  89. Conference paper
    D1
    “Approximate Hypergraph Coloring,” in Algorithm Theory - SWAT ’96, Reykjavik, Iceland, 1996.
  90. Conference paper
    D1
    “A Library of basic PRAM Algorithms and its Implementation in FORK,” in 8th Annual ACM Symposium on Parallel Algorithms and Architechtures (SPAA’96), Padua, Italy, 1996.
  91. Article
    D1
    “Simple Atomic Snapshots: A Linear Complexity Solution with Unbounded Time-Stamps,” Information Processing Letters, vol. 58, no. 5, 1996.
  92. Conference paper
    D1
    “Velocity Planning for a Robot Moving Along the Shortest Straight Line Path Among Moving Obstacles,” in Proceedings of the 8th Canadian Conference on Computational Geometry (CCCG 1996), Ottawa, Canada, 1996.
  93. Thesis
    D1
    “Approximative Bewegungsplanung für einen rechteckigen Roboter mit Hilfe von Voronoidiagrammen,” Universität des Saarlandes, Saarbrücken, 1996.
  94. Thesis
    D1
    “Ein Bewegungsplanungsalgorithmus für zwei Rechtecke mit einem gemeinsamen Eckpunkt,” Universität des Saarlandes, Saarbrücken, 1996.
  95. Report
    D1
    “Derandomizing semidefinite programming based approximation algorithms,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1996-1-013, 1996.
  96. Report
    D1
    “The impact of timing on linearizability in counting networks,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1996-1-011, 1996.
  97. Conference paper
    D1
    “Position Paper for Panel Discussion,” in Applied Computational Geormetry, Towards Geometric Engineering (WACG 1996), Philadelphia, PA, USA, 1996.
  98. Conference paper
    D1
    “Komplexitätstheorie und Algorithmik,” in Informatik : Grundlagen - Anwendungen - Perspektiven, 1996.
  99. Article
    D1
    “On the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm,” Algorithmica, vol. 16, 1996.
  100. Conference paper
    D1
    “The LEDA Platform for Combinatorial and Geometric Computing,” in Beherrschung von Informationssystemen : Tagungsband der Informatik ’96 ; GI - 26. Jahrestagung, 1996.
  101. Conference paper
    D1
    “Checking Geometric Programs or Verification of Geometric Structures,” in Proceedings of the 12th Annual ACM Symposium on Computational Geometry (SCG 1996), Philadelphia, PA, USA, 1996.
  102. Conference paper
    D1
    “The LEDA Platform of Combinatorial and Geometric Computing,” in Proceedings of Conference on Computing: The Australian Theory Symposium, 1996.
  103. Report
    D1
    “A computational basis for higher-dimensional computational geometry,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1996-1-016, 1996.
  104. Article
    D1
    “A Circuit for Exact Summation of Floating-Point Numbers,” Information Processing Letters, vol. 57, no. 3, 1996.
  105. Conference paper
    D1
    “An Alternative Method to Crossing Minimization on Hierarchical Graphs,” in Graph Drawing (GD 1996), Berkeley, CA, USA, 1996.
  106. Report
    D1
    “The thickness of graphs: a survey,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1996-1-009, 1996.
  107. Conference paper
    D1
    “Parallel algorithm for maximum empty L-shaped polygon,” in 3rd Conference on High-Performance Computing, 1996.
  108. Report
    D1
    “A branch-and-cut algorithm for multiple sequence alignment,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1996-1-028, 1996.
  109. Report
    D1
    “Proximity in arrangements of algebraic sets,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1996-1-003, 1996.
  110. Thesis
    D1
    “Bewegung eines Polygons zwischen polygonalen Hindernisse,” Universität des Saarlandes, Saarbrücken, 1996.
  111. Report
    D1
    “Optimal algorithms for some proximity problems on the Gaussian sphere with applications,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1996-1-022, 1996.
  112. Report
    D1
    “A runtime test of integer arithmetic and linear algebra in LEDA,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1996-1-033, 1996.
  113. Conference paper
    D1
    “Routing on Triangles, Tori and Honeycombs,” in Mathematical Foundations of Computer Science 1996 (MFCS 1996), Cracow, Poland, 1996.
  114. Report
    D1
    “Gossiping on meshes and tori,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1996-1-018, 1996.
  115. Conference paper
    D1
    “An Extension of the Lovász Local Lemma, and its Applications to Integer Programming,” in Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1996), Georgia, USA, 1996.
  116. Thesis
    D1
    “Entwicklung und Implementierung eines Entscheidungsalgorithmus zur Zuordnung von Probleminstanzen an Hierarchieebenen,” Universität des Saarlandes, Saarbrücken, 1996.
  117. Thesis
    D1
    “Effiziente Algorithmen für Probleme der Kollisionserkennung und der geometrischen Optimierung,” Universität des Saarlandes, Saarbrücken, 1996.
  118. Conference paper
    D1
    “A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar Digraphs,” in Parallel Algorithms for Irregularly Structured Problems, Santa Barbara, CA, USA, 1996.
  119. Report
    D1
    “A simple parallel algorithm for the single-source shortest path problem on planar diagraphs,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1996-1-012, 1996.
  120. Article
    D1
    “A Heuristic for Blocking Flow Algorithms,” European Journal of Operational Research, vol. 89, no. 3, 1996.
  121. Report
    D1
    “Computational Molecular Biology,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1996-1-015, 1996.

1995

  1. Conference paper
    D1
    “Page migration with limited local memory capacity,” in Algorithms and Data Structures (WADS 1995), Kingston, Canada, 1995.
  2. Conference paper
    D1
    “Improved randomized on-line algorithms for the list update problem,” in Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95), San Francisco, California, USA, 1995.
  3. Article
    D1
    “A Combined BIT and TIMESTAMP Algorithm for the List Update Problem,” Information Processing Letters, vol. 56, no. 3, 1995.
  4. Report
    D1
    “Sorting in linear time?,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1995-1-024, 1995.
  5. Conference paper
    D1
    “Sorting in Linear Time?,” in Proceedings of the 27th Annual ACM Symposium on Theory of Computing (STOC 1995), Las Vegas, Nevada, USA, 1995.
  6. Report
    D1
    “Efficient computation of implicit representations of sparse graphs (revised version),” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1995-1-013, 1995.
  7. Conference paper
    D1
    “All-Pairs Min-Cut in Sparse Networks,” in Proceedings of the 15th conference of the foundations of software technology and theoretical computer science (FSTTCS-95), Bangalore, India, 1995.
  8. Conference paper
    D1
    “Approximate Range Searching,” in Proceedings of the 11th Annual ACM Symposium on Computational Geometry (SCG 1995), Vancouver, British Columbia, USA, 1995.
  9. Conference paper
    D1
    “Accounting for Boundary Effects in Nearest Neighbor Searching,” in Proceedings of the Eleventh Annual Symposium on Computational Geometry (SCG 1995), Vancouver, British Columbia, Canada, 1995.
  10. Conference paper
    D1
    “Euclidean Spanners: Short, Thin, and Lanky,” in Proceedings of the 27th Annual ACM Symposium on Theory of Computing (STOC95), Las Vegas, Nevada, USA, 1995.
  11. Conference paper
    D1
    “Load Balancing in the Euclidean Norm,” in Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS 1995), Milwaukee, Wisconsin, USA, 1995.
  12. Conference paper
    D1D4
    “Semidefinite programming and its applications to NP problems,” in Computing and Combinatorics (COCOON 1995), Xi’an, China, 1995.
  13. Conference paper
    D1
    “An Application-Controlled Paging Algorithm for a Shared Cache,” in Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS 1995), Milwaukee, Wisconsin, USA, 1995.
  14. Article
    D1
    “Fast Parallel Space Allocation, Estimation, and Integer Sorting,” Information and Computation, vol. 123, no. 1, 1995.
  15. Conference paper
    D1
    “A new approach to subdivision simplification,” in ACSM/ASPRS Annual Convention & Exposition Technical Papers, 1995.
  16. Conference paper
    D1
    “Self-Simulation for the Passive Optical Star Model,” in Algorithms - ESA ’95, Corfu, Greece, 1995.
  17. Conference paper
    D1
    “Parallel Algorithms with Optimal Speedup for Bounded Treewidth,” in Automata, Languages, and Programming (ICALP 1995), Szeged, Hungary, 1995.
  18. Report
    D1
    “Parallel Algorithms with Optimal Speedup for Bounded Treewidth,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-95-1-017, 1995.
  19. Report
    D1
    “Matching nuts and bolts optimally,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1995-1-025, 1995.
  20. Report
    D1
    “Weak epsilon-nets for points on a hypersphere,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1995-1-029, 1995.
  21. Report
    D1
    “A polylog-time and $O(n\sqrt\lg n)$-work parallel algorithm for finding the row minima in totally monotone matrices,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1995-1-006, 1995.
  22. Conference paper
    D1
    “Matching nuts and bolts faster,” in Algorithms and Computation (ISAAC 1995), Cairns, Australia, 1995.
  23. Report
    D1
    “Matching nuts and bolts faster,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1995-1-003, 1995.
  24. Conference paper
    D1
    “Lower Bounds for the Matrix Chain Ordering Problem,” in LATIN ’95: Theoretical Informatics, Valparaiso, Chile, 1995.
  25. Thesis
    D1
    “Analyse und Simulation eines Maximum-Flow Algorithmus für das Gitter,” Universität des Saarlandes, Saarbrücken, 1995.
  26. Conference paper
    D1
    “Exact Geometric Computation in LEDA,” in Proceedings of the 11th ACM Symposium on Computational Geometry (SCG 1995), Vancouver, British Columbia, Canada, 1995.
  27. Report
    D1
    “Shortest paths in digraphs of small treewidth. Part I: Sequential algorithms,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1995-1-020, 1995.
  28. Conference paper
    D1
    “Shortest Path Queries in Digraphs of Small Treewidth,” in Automata, Languages, and Programming (ICALP 1995), Szeged, Hungary, 1995.
  29. Conference paper
    D1
    “Optimal Parallel Shortest Paths in Small Treewidth Digraphs,” in Algorithms - ESA ’95, Corfu, Greece, 1995.
  30. Conference paper
    D1
    “Prefix Graphs and their Applications,” in Graph-theoretic Concepts in Computer Science (WG 1994), Hersching, Germany, 1995.
  31. Report
    D1
    “Shortest paths in digraphs of small treewidth part II: optimal parallel algirithms,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1995-1-021, 1995.
  32. Conference paper
    D1
    “(Probabilistic) Recurrence Relations Revisited,” in LATIN’ 95: Theoretical Informatics, Valparaiso, Chile, 1995.
  33. Article
    D1
    “A Randomized Maximum-Flow Algorithm,” SIAM Journal on Computing, vol. 24, no. 2, 1995.
  34. Conference paper
    D1
    “External-Memory Graph Algorithms,” in Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1995), San Francisco, California, USA, 1995.
  35. Article
    D1
    “Tighter Lower Bounds on the Exact Complexity of String Matching,” SIAM Journal on Computing, vol. 24, no. 1, 1995.
  36. Article
    D1
    “Static and Dynamic Algorithms for k-point Clustering Problems,” Journal of Algorithms, vol. 19, no. 3, 1995.
  37. Conference paper
    D1
    “More Efficient Parallel Flow Algorithms,” in Algorithms and Computation (ISAAC 1995), Cairns, Australia, 1995.
  38. Article
    D1
    “Exact Ground States of Ising Spin Glasses: New Experimental Results With a Branch and Cut Algorithm,” Journal of Statistical Physics, vol. 80, no. 1–2, 1995.
  39. Report
    D1
    “Exact ground states of Ising spin classes: new experimental results with a branch and cut algorithm,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1995-1-004, 1995.
  40. Article
    D1
    “Lower Bounds for Set Intersection Queries,” Algorithmica, vol. 14, no. 2, 1995.
  41. Conference paper
    D1
    “On-line and Dynamic Algorithms for Shortest Path Problems,” in STACS95: 12th Annual Symposium on Theoretical Aspects of Computer Science, 1995.
  42. Conference paper
    D1
    “Fast Algorithms for Maintaining Shortest Paths in Outerplanar and Planar Digraphs,” in Fundamentals of Computation Theory (FCT 1995), Dresden, Germany, 1995.
  43. Conference paper
    D1
    “On-line and Dynamic Algorithms for Shortest Path Problems,” in STACS 95, 12th Annual Symposium on Theoretical Aspects of Computer Science, Munich, Germany, 1995.
  44. Article
    D1
    “The Fourth Moment in Luby’s Distribution,” Theoretical computer science, vol. 148, no. 1, 1995.
  45. Report
    D1
    “The fourth moment in Luby`s distribution,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1995-1-019, 1995.
  46. Conference paper
    D1
    “Minimal enclosing parallelogram with application,” in Proceedings of the 11th Annual ACM Symposium on Computational Geometry (SCG95), Vancouver, British Columbia, Canada, 1995.
  47. Article
    D1
    “A Communication-randomness Tradeoff for Two-processor Systems,” Information and Computation, vol. 116, no. 2, 1995.
  48. Conference paper
    D1
    “Computing a largest empty anchored cylinder, and related problems,” in Proceedings of the 15th Conference of the Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1995), Bangalore, India, 1995.
  49. Article
    D1
    “A Polyhedron with all s-t Cuts as Vertices, and Adjacency of Cuts,” Mathematical Programming / A, vol. 70, no. 1, 1995.
  50. Article
    D1
    “Simple Randomized Algorithms for Closest Pair Problems,” Nordic Journal of Computing, vol. 2, no. 1, 1995.
  51. Conference paper
    D1
    “On-line Bin Packing with Lookahead,” in Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1995), San Francisco, California, USA, 1995.
  52. Conference paper
    D1
    “Online Perfect Matching and Mobile Computing,” in Algorithms and Data Structures (WADS 1995), Kingston, Canada, 1995.
  53. Conference paper
    D1
    “The rectangle enclosure and point-dominance problems revisited,” in 11th Annual !CM Symposium on Computational Geometry, 1995.
  54. Conference paper
    D1
    “The Rectangle Enclosure and Point-dominance Problems Revisited,” in Proceedings of the 11th Annual ACM Symposium on Computing Geometry (SCG 1995), Vancouver, BC, USA, 1995.
  55. Article
    D1
    “Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization,” Journal of Algorithms, vol. 19, no. 2, 1995.
  56. Article
    D1
    “The Parallel Complexity of Integer Prefix Summation,” Information Processing Letters, vol. 56, no. 1, 1995.
  57. Conference paper
    D1
    “Characterizations of k-Terminal Flow Networks and Computing Network Flows in Partial k-Trees,” in Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1995), San Francisco, California, USA, 1995.
  58. Article
    D1
    “Fast Parallel Permutation Algorithms,” Parallel Processing Letters, vol. 5, no. 2, 1995.
  59. Article
    D1
    “A Lower Bound for the Emulation of PRAM Memories on Processor Networks,” Information and Computation, vol. 119, no. 1, 1995.
  60. Article
    D1
    “Fast Deterministic Processor Allocation,” Journal of Algorithms, vol. 18, no. 3, 1995.
  61. Article
    D1
    “Computing Minimal Spanning Subgraphs in Linear Time,” SIAM Journal on Computing, vol. 24, no. 6, 1995.
  62. Article
    D1
    “String Matching under a General Matching Relation,” Information and Computation, vol. 122, no. 1, 1995.
  63. Conference paper
    D1
    “Derandomizing Semidefinite Programming Based Approximation Algorithms,” in Proceedings of the 36th IEEE Annual Symposium on Foundations of Computer Science (FOCS 1995), Milwaukee, WI, USA, 1995.
  64. Article
    D1
    “Algorithms for Enumerating all Spanning Trees of Undirected and Weighted Graphs,” SIAM Journal on Computing, vol. 24, no. 2, 1995.
  65. Conference paper
    D1
    “Self-Stabilization of Wait-Free Shared Memory Objects,” in Proceedings of the 9th International Workshop on distributed algorithms (WDAG95), Le Mont-Saint-Michel, France, 1995.
  66. Report
    D1
    “Towards self-stabilizing wait-free shared memory objects,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1995-1-005, 1995.
  67. Conference paper
    D1
    “On the Width and Roundness of a Set of Points in the Plane,” in Proceedings of the 7th Canadian Conference on Computational Geometry (CCCG 1995), Quebec, Canada, 1995.
  68. Report
    D1
    “The thickness of a minor-excluded class of graphs,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1995-1-027, 1995.
  69. Report
    D1
    “Exact and heuristic algorithms for 2-layer straightline crossing minimization,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1995-1-028, 1995.
  70. Conference paper
    D1
    “Quickest Paths: Parallelization and Dynamization,” in Proceedings of the 28th Annual Hawaii International Conference on System Sciences (HICSS-28), Wailea, Hawaii, USA, 1995.
  71. Conference paper
    D1
    “On the Computation of Fast Data Transmissions in Networks with Capacities and Delays,” in Algorithms and Data Structures (WADS 1995), Kingston, Canada, 1995.
  72. Report
    D1
    “Dynamic maintenance of 2-d convex hulls and order decomposable problems,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1995-1-015, 1995.
  73. Conference paper
    D1
    “Beyond the Worst-Case Bisection Bound: Fast Sorting and Ranking on Meshes,” in Algorithms - ESA ’95, Corfu, Greece, 1995.
  74. Article
    D1
    “Routing and Sorting on Reconfigurable Meshes,” Parallel Processing Letters, vol. 5, no. 1, 1995.
  75. Conference paper
    D1
    “Solving Cheap Graph Problems on Meshes,” in Mathematical Foundations of Computer Science 1995 (MFCS 1995), Prague, Czech Republic, 1995.
  76. Report
    D1
    “Radix heaps an efficient implementation for priority queues,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1995-1-009, 1995.
  77. Thesis
    D1
    “Eine effiziente Datenstruktur für allgemeine Polyeder,” Universität des Saarlandes, Saarbrücken, 1995.
  78. Book chapter / section
    D1
    “An Algorithm for the Protein Docking Problem,” in Bioinformatics: From Nucleic Acids and Proteins to Cell Metabolism, Weinheim, Germany: VCH, 1995.
  79. Report
    D1
    “An algorithm for the protein docking problem,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1995-1-023, 1995.
  80. Article
    D1
    “Maintaining the Visibility Map of Spheres while Moving the Viewpoint on a Circle at Infinity,” Algorithmica, vol. 13, no. 3, 1995.
  81. Article
    D1
    “Sequential and Parallel Algorithms for the k Closest Pairs Problem,” International Journal of Computational Geometry and Applications, vol. 5, no. 3, 1995.
  82. Conference paper
    D1
    “Experiences with the Implementation of Geometric Algorithms,” in Algorithms and Data Structures (WADS 1995), Kingston, Canada, 1995.
  83. Report
    D1
    “LEDA : A Platform for Combinatorial and Geometric Computing,” Universität Halle, Halle, 1995.
  84. Conference paper
    D1
    “On the All-Pairs Shortest Path Algorithm of Moffat and Takaoka,” in Algorithms - ESA ’95, Corfu, Greece, 1995.
  85. Article
    D1
    “Guest Editor’s Foreword,” Discrete and Computational Geometry, vol. 14, 1995.
  86. Article
    D1
    “LEDA: A Platform for Combinatorial and Geometric Computing,” Communications of the ACM, vol. 38, no. 1, 1995.
  87. Thesis
    D1
    “Deterministische Simulation einer PRAM auf Gitterrechnern,” Universität des Saarlandes, Saarbrücken, 1995.
  88. Conference paper
    D1
    “Simulating the Simulator: Deterministic PRAM Simulation on a Mesh Simulator,” in Eurosim ’95, 1995 EUROSIM Conference, Vienna, Austria, 1995.
  89. Thesis
    D1
    “Ein effizienter paralleler Molekulardynamik-Simulationsalgorithmus für synthetische Polymere,” Universität des Saarlandes, Saarbrücken, 1995.
  90. Report
    D1
    “Automatisiertes Zeichnen von Diagrammen,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1995-1-011, 1995.
  91. Conference paper
    D1
    “A Polyhedral Approach to Planar Augmentation and Related Problems,” in Algorithms - ESA ’95, Corfu, Greece, 1995.
  92. Report
    D1
    “A polyhedral approach to planar augmentation and related problems,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1995-1-014, 1995.
  93. Report
    D1
    “LEDA user manual (version R 3.2),” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1995-1-002, 1995.
  94. Conference paper
    D1
    “Splitters and Near-optimal Derandomization,” in Proceedings of the 36th IEEE Annual Symposium on Foundations of Computer Science (FOCS 1995), Milwaukee, WI, USA, 1995.
  95. Thesis
    D1
    “Algorithmen für das Kantenfärbungsproblem,” Universität des Saarlandes, Saarbrücken, 1995.
  96. Conference paper
    D1
    “Wait-Free Consensus in "In-Phase’' Multiprocessor Systems,” in Proceedings of the Seventh IEEE Symposium on Parallel and Distributed Processing (SPDP 1995), San Antonio, TX, USA, 1995.
  97. Report
    D1
    “Wait-free consensus in ‘in-phase’ multiprocessor systems,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1995-1-016, 1995.
  98. Report
    D1
    “Interactive Proof Systems,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1995-1-007, 1995.
  99. Article
    D1
    “Generic Evolutions of Edges on Families of Diffused Greyvalue Surfaces,” Journal of Mathematical Imaging and Vision, vol. 5, no. 3, 1995.
  100. Report
    D1
    “On the average running time of odd-even merge sort,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1995-1-010, 1995.
  101. Conference paper
    D1
    “On the Average Running Time of Odd-Even Merge Sort,” in STACS 95, 12th Annual Symposium on Theoretical Aspects of Computer Science, Munich, Germany, 1995.
  102. Thesis
    D1
    “Analyse von Branch-and-Bound Algorithmen zum Problem des Handlungsreisenden,” Universität des Saarlandes, Saarbrücken, 1995.
  103. Conference paper
    D1
    “Efficient Collision Detection for Moving Polyhedra,” in 11th Annual ACM Symposium on Computational Geometry (SCG95), 1995.
  104. Thesis
    D1
    “Ein NP-schweres Plazierungsproblem,” Universität des Saarlandes, Saarbrücken, 1995.
  105. Report
    D1
    “Sample sort on meshes,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1995-1-012, 1995.
  106. Report
    D1
    “Overview of mesh results,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1995-1-018, 1995.
  107. Report
    D1
    “Computing a largest empty anchored cylinder, and related problems,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1995-1-001, 1995.
  108. Report
    D1
    “Closest point problems in computational geometry,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1995-1-026, 1995.
  109. Article
    D1
    “Dynamic Rectangular Point Location, with an Application to the Closest Pair Problem,” Information and Computation, vol. 116, no. 1, 1995.
  110. Article
    D1
    “An Experimental Comparison of two Distributed Singel-Source Shortest Path Algorithm,” Parallel Computing, vol. 21, no. 9, 1995.
  111. Thesis
    D1
    “Erzeugung von Pseudozufallszahlen gemäß einer veränderbaren Verteilung,” Universität des Saarlandes, Saarbrücken, 1995.
  112. Thesis
    D1
    “Max-Weighted-Matching auf allgemeinen Graphen,” Universität des Saarlandes, Saarbrücken, 1995.

1994

  1. Thesis
    D1
    “Verdrahtung von Kanälen mit Seitenanschlüssen,” Universität des Saarlandes, Saarbrücken, 1994.
  2. Report
    D1
    “New on-line algorithms for the page replication problem,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-94-106, 1994.
  3. Report
    D1
    “Improved parallel integer sorting without concurrent writing,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-94-137, 1994.
  4. Conference paper
    D1
    “A Competitive Analysis of the List Update Problem with Lookahead,” in Mathematical Foundations of Computer Science 1994 (MFCS 1994), Kosice, Slovakia, 1994.
  5. Conference paper
    D1
    “New On-line Algorithms for the Page Replication Problem,” in Algorithms Theory - SWAT’ 94, Aarhus, Denmark, 1994.
  6. Conference paper
    D1
    “Saving Bits Made Easy,” in Proceedings of the 6th Canadian Conference on Computational Geometry (CCCG 1994), Saskatoon, Canada, 1994.
  7. Report
    D1
    “On the parallel complexity of degree sequence problems,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1994-162, 1994.
  8. Report
    D1
    “Realizing degree sequences in parallel,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-1994-122, 1994.
  9. Conference paper
    D1
    “Realizing Degree Sequences in Parallel,” in Algorithms and Computation (ISAAC 1994), Beijing, China, 1994.
  10. Conference paper
    D1
    “An O(n) Algorithm for Realizing Degree Sequences,” in Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1995), Madras, India, 1994.
  11. Report
    D1
    “Efficient computation of compact representations of sparse graphs,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-94-148, 1994.
  12. Report
    D1
    “Accounting for Boundary Effects in Nearest Neighbor Searching,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-94-159, 1994.
  13. Report
    D1
    “Dynamic algorithms for geometric spanners of small diameter: randomized solutions,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-94-156, 1994.
  14. Report
    D1
    “Efficient construction of a bounded degree spanner with low weight,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-94-115, 1994.
  15. Conference paper
    D1
    “Randomized and Deterministic Algorithms for Geometric Spanners of Small Diameter,” in Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science (FOCS 1994), Santa Fe, NM, USA, 1994.
  16. Conference paper
    D1
    “An Optimal Algorithm for Approximate Nearest Neighbor Searching,” in Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1994), Arlington, VA, USA, 1994.
  17. Conference paper
    D1
    “Efficient Construction of a Bounded Degree Spanner with Low Weight,” in Algorithms - ESA ’94, Utrecht, The Netherlands, 1994.
  18. Report
    D1
    “Short random walks on graphs,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-94-121, 1994.
  19. Report
    D1
    “A method for implementing lock-free shared data structures,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-94-120, 1994.
  20. Report
    D1
    “Time-space lower bounds for directed s-t connectivity on JAG models,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-94-119, 1994.
  21. Thesis
    D1
    “Fast Parallel Space Allocation, Estimation and Integer Sorting,” Universität des Saarlandes, Saarbrücken, 1994.
  22. Article
    D1
    “Dynamic Point Location in General Subdivisions,” Journal of Algorithms, vol. 17, no. 3, 1994.
  23. Article
    D1
    “A lower bound for area-universal graphs,” Information Processing Letters, vol. 51, 1994.
  24. Article
    D1
    Eds., “Special issue on algorithms: implementation, libraries and use,” 1994.
  25. Conference paper
    D1
    “On degeneracy in geometric computations,” in Discrete algorithms (SODA-94) : 5th annual ACM-SIAM symposium, 1994.
  26. Conference paper
    D1
    “How to Compute the Voronoi Diagram of Line Segments: Theoretical and Experimental Results,” in Algorithms (ESA-94) : 2nd annual European symposium, 1994.
  27. Report
    D1
    “On the intellectual terrain around NP,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-94-103, 1994.
  28. Report
    D1
    “Prefix graphs and their applications,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-94-145, 1994.
  29. Article
    D1
    “Tight Bounds on Oblivious Chaining,” SIAM Journal on Computing, vol. 23, no. 6, 1994.
  30. Report
    D1
    “On characteristic points and approximate decision algorithms for the minimum Hausdorff distance,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-94-150, 1994.
  31. Conference paper
    D1
    “Efficient Parallel Algorithms for Geometric k-clustering Problems,” in STACS 94, 11th Annual Symposium on Theoretical Aspects of Computer Science, Caen, France, 1994.
  32. Conference paper
    D1
    “Revenge of the Dog: Queries on Voronoi Diagrams of Moving Points,” in Proceedings of the 6th Canadian Conference on Computational Geometry (CCCG 1994), Saskatoon, Canada, 1994.
  33. Report
    D1
    “Revenge of the dog: queries on Voronoi diagrams of moving points,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-94-149, 1994.
  34. Article
    D1
    “Dynamic Perfect Hashing: Upper and Lower Bounds,” SIAM Journal on Computing, vol. 23, no. 4, 1994.
  35. Report
    D1
    “On-line and Dynamic Shortest Paths through Graph Decompositions (Preliminary Version),” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-94-112, 1994.
  36. Report
    D1
    “On-line and dynamic algorithms for shortest path problems,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-94-114, 1994.
  37. Report
    D1
    “Some correlation inequalities for probabilistic analysis of algorithms,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-94-143, 1994.
  38. Report
    D1
    “Near-optimal distributed edge coloring,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-94-136, 1994.
  39. Report
    D1
    “Stochastic majorisation: exploding some myths,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-94-144, 1994.
  40. Thesis
    D1
    “Effiziente Sortieralgorithmen für den d-dimensionalen Würfel (Hypercube),” Universität des Saarlandes, Saarbrücken, 1994.
  41. Conference paper
    D1
    “Automated Design of Two-dimensional Rational Decimation Systems,” in Proceedings of the 28th IEEE Asilomar Conference on Signals, Systems, and Computers (ACSSC 1994), Pacific Grove, California, USA, 1994.
  42. Report
    D1
    “22. Workshop Komplexitätstheorie und effiziente Algorithmen,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-94-104, 1994.
  43. Article
    D1
    “A Tight Lower Bound for the Worst Case of Bottom-Up-Heapsort,” Algorithmica, vol. 11, no. 2, 1994.
  44. Conference paper
    D1
    “On Intersection Searching Problems Involving Curved Objects,” in Algorithms Theory - SWAT’ 94, Aarhus, Denmark, 1994.
  45. Report
    D1
    “The rectangle enclosure and point-dominance problems revisited,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-94-142, 1994.
  46. Report
    D1
    “Fast algorithms for collision and proximity problems involving moving geometric objects,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-94-113, 1994.
  47. Conference paper
    D1
    “Efficient Algorithms for Generalized Intersection Searching on Non-iso-oriented Objects,” in Proceedings of the 10th Symposium on Computational Geometry (SCG 1994), Stony Brook, NY, USA, 1994.
  48. Conference paper
    D1
    “Fast Algorithms for Collision and Proximity Problems Involving Moving Geometric Objects,” in Algorithms - ESA ’94, Utrecht, The Netherlands, 1994.
  49. Conference paper
    D1
    “Optimal Parallel String Algorithms: Merging, Sorting and Computing the Minimum,” in Proceedings of the 26th Annual ACM Symposium on the Theory of Computing (STOC 1994), Montréal, Canada, 1994.
  50. Conference paper
    D1
    “The Complexity of Searching a Sorted Array of Strings,” in Proceedings of the 26th Annual ACM Symposium on the Theory of Computing (STOC 1994), Montréal, Canada, 1994.
  51. Article
    D1
    “Generalized Topological Sorting in Linear Time,” Nordic Journal of Computing, vol. 1, no. 1, 1994.
  52. Conference paper
    D1
    “On the Intellectual Terrain around NP,” in Algorithms and Complexity (CIAC 1994), Rome, Italy, 1994.
  53. Conference paper
    D1
    “The Structure of the Complexity of Computations: A Guided Tour Through Complexity Classes,” in Technology and Foundations (IFIP 1994), Hamburg, Germany, 1994.
  54. Conference paper
    D1
    “The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems,” in Graph Drawing (GD 1994), Princeton, New Jersey, USA, 1994.
  55. Conference paper
    D1
    “New Techniques for Exact and Approximate Dynamic Closest-point Problems,” in Proceedings of the 10th Symposium on Computational Geometry (SCG 1994), Stony Brook, NY, USA, 1994.
  56. Report
    D1
    “Quickest paths: faster algorithms and dynamization,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-94-110, 1994.
  57. Report
    D1
    “Further improvements of Steiner tree approximations,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-94-158, 1994.
  58. Thesis
    D1
    “Die Beschreibung der Design Features für die rechnerunterstützte Konstruktion und ihre formale Repräsentation,” Universität des Saarlandes, Saarbrücken, 1994.
  59. Conference paper
    D1
    “Derandomizing Algorithms for Routing and Sorting on Meshes,” in Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1994), Arlington, VA, USA, 1994.
  60. Article
    D1
    “A Linear-time Algorithm for the Homotopic Routing Problem in Grid Graphs,” SIAM Journal on Computing, vol. 23, no. 2, 1994.
  61. Report
    D1
    “Towards practical permutation routing on meshes,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-94-153, 1994.
  62. Conference paper
    D1
    “Towards Practical Permutation Routing on Meshes,” in Proceedings of the 6th IEEE Symposium on Parallel and Distributed Processing (SPDP 1994), Dallas, Texas, 1994.
  63. Conference paper
    D1
    “Efficient Sequential and Parallel Algorithms for the Negative Cycle Problem,” in Algorithms and Computation (ISAAC 1994), Beijing, China, 1994.
  64. Conference paper
    D1
    “Hammock-on-ears Decomposition: A Technique for the Efficient Parallel Solution of Shortest Paths and other Problems,” in Mathematical Foundations of Computer Science 1994 (MFCS 1994), Kosice, Slovakia, 1994.
  65. Report
    D1
    “Hammock-on-ears decomposition: a technique for the efficient parallel solution of shortest paths and other problems,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-94-131, 1994.
  66. Conference paper
    D1
    “An animation of a fixed-radius all-nearest neighbors algorithm,” in Proceedings of the 10th Symposium on Computational Geometry (SCG94), Stony Brook, New York, USA, 1994.
  67. Article
    D1
    “Using persistent data structures for adding range restrictions to searching problems,” RAIRO Theoretical Informatics and Applications, vol. 28, no. -, 1994.
  68. Article
    D1
    “Introduction,” Journal of Symbolic Computation, vol. 17, 1994.
  69. Report
    D1
    “Implementation of a sweep line algorithm for the Straight \& Line Segment Intersection Problem,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-94-160, 1994.
  70. Report
    D1
    “On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-94-117, 1994.
  71. Conference paper
    D1
    “Maintaining Dynamic Sequences under Equality-tests in Polylogarithmic Time,” in Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1994), Arlington, VA, USA, 1994.
  72. Conference paper
    D1
    “The Implementation of Geometric Algorithms,” in Technology and foundations : Information Processing ’94 ; proceedings of the IFIP 13th World Computer Congress, 1994.
  73. Report
    D1
    “An implementation of a Convex Hull Algorithm, Version 1.0,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-94-105, 1994.
  74. Conference paper
    D1
    “Constructive Deterministic PRAM Simulation on a Mesh-connected Computer,” in Proceedings of the 6th Symposium on Parallel Algorithms and Architectures (SPAA 1994), Cape May, NJ, USA, 1994.
  75. Thesis
    D1
    “Parallele Graphenalgorithmen für den Hypercube,” Universität des Saarlandes, Saarbrücken, 1994.
  76. Article
    D1
    “Solvability of the Navier-Stokes equations on manifolds with boundary,” Manuscripta Mathematica, vol. 83, 1994.
  77. Conference paper
    D1
    “Lower Bounds for Merging on the Hypercube,” in Algorithms and Complexity (CIAC 1994), Rome, Italy, 1994.
  78. Article
    D1
    “Approximate Decision Algorithms for Point Set Congruence,” Computational Geometry, vol. 4, no. 3, 1994.
  79. Report
    D1
    “Efficient collision detection for moving polyhedra,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-94-147, 1994.
  80. Article
    D1
    “An Optimal Algorithm for the On-line Closest-pair Problem,” Algorithmica, vol. 12, no. 1, 1994.
  81. Conference paper
    D1
    “Shorter Queues for Permutation Routing on Meshes,” in Mathematical Foundations of Computer Science 1994 (MFCS 1994), Kosice, Slovakia, 1994.
  82. Conference paper
    D1
    “Deterministic 1 -k Routing on Meshes with Applications to Worm-hole Routing,” in STACS 94, 11th Annual Symposium on Theoretical Aspects of Computer Science, Caen, France, 1994.
  83. Conference paper
    D1
    “Exploiting Locality in LT-RAM Computations,” in Algorithms Theory - SWAT’ 94, Aarhus, Denmark, 1994.
  84. Conference paper
    D1
    “Desnakification of Mesh Sorting Algorithms,” in Algorithms - ESA ’94, Utrecht, The Netherlands, 1994.
  85. Conference paper
    D1
    “Deterministic Routing and Sorting on Rings,” in Proceedings of the 8th International Parallel Processing Symposium (IPPS 1994), Cancún, Mexico, 1994.
  86. Report
    D1
    “Desnakification of mesh sorting algorithms,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-94-102, 1994.
  87. Report
    D1
    “Lecture notes selected topics in data structures,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-94-155, 1994.
  88. Report
    D1
    “On the Width and Roundness of a Set of Points in the Plane,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-94-111, 1994.
  89. Proceedings
    D1
    Eds., Report on the Dagstuhl-Seminar on Incremental Computation and Dynamic Algorithms. Schloss Dagstuhl, 1994.

1993

  1. Conference paper
    D1
    “A Method for Implementing Lock-free Shared Data Structures,” in Proceedings of the Fifth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 1993), Velen, Germany, 1993.
  2. Conference paper
    D1
    “Short Random Walks on Graphs,” in Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing (STOC 1993), San Diego, CA, USA, 1993.
  3. Conference paper
    D1
    “Time-space Lower Bounds for Directed s-t Connectivity on JAG Models,” in 34th Annual Symposium on Foundations of Computer Science (FOCS 1993), Palo Alto, CA, USA, 1993.
  4. Report
    D1
    “Fast parallel space allocation, estimation and integer sorting (revised),” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-93-123, 1993.
  5. Report
    D1
    “A lower bound for area-universal graphs,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-93-144, 1993.
  6. Report
    D1
    “The circuit subfunction relations are $sum^P_2$-complete,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-93-121, 1993.
  7. Report
    D1
    “A lower bound for linear approximate compaction,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-93-146, 1993.
  8. Conference paper
    D1
    “Approximate and Exact Deterministic Parallel Selection,” in Mathematical Foundations of Computer Science 1993 (MFCS 1993), Gdańsk, Poland, 1993.
  9. Conference paper
    D1
    “A Lower Bound for Linear Approximate Compaction,” in Proceedings of the 2nd Israel Symposium on Theory and Computing Systems (ISTCS 1993), Natanya, Israel, 1993.
  10. Report
    D1
    “Sensitive functions and approximate problems,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-93-145, 1993.
  11. Report
    D1
    “Approximate and exact deterministic parallel selection,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-93-118, 1993.
  12. Report
    D1
    “The complexity of parallel prefix problems on small domains,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-93-147, 1993.
  13. Conference paper
    D1
    “Sensitive Functions and Approximate Problems,” in 34th Annual Symposium on Foundations of Computer Science (FOCS 1993), Palo Alto, CA, USA, 1993.
  14. Article
    D1
    “Four Results on Randomized Incremental Constructions,” Computational Geometry: Theory and Applications, vol. 3, no. 4, 1993.
  15. Conference paper
    D1
    “Static and Dynamic Algorithms for k-point Clustering Problems,” in Algorithms and Data Structures (WADS 1993), Montréal, Canada, 1993.
  16. Conference paper
    D1
    “Lower Bounds for Set Intersection Queries,” in Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1993), Austin, TX, USA, 1993.
  17. Report
    D1
    “A Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-93-140, 1993.
  18. Other
    D1
    “A Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron.” 1993.
  19. Conference paper
    D1
    “A Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron,” in Algorithms and data structures (WADS-93) : 3rd workshop, 1993.
  20. Report
    D1
    “Searching, sorting and randomised algorithms for central elements and ideal counting in posets,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-93-154, 1993.
  21. Article
    D1
    “Quantifier Elimination in p-adic Fields,” The Computer Journal, vol. 36, no. 5, 1993.
  22. Conference paper
    D1
    “Searching, Sorting and Randomised Algorithms for Central Elements and Ideal Counting in Posets,” in Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1993), Bombay, India, 1993.
  23. Report
    D1
    “Quantifier elimination in p-adic fields,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-93-155, 1993.
  24. Conference paper
    D1
    “Decision Trees: Old and New Results,” in Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing (STOC 1993), San Diego, CA, USA, 1993.
  25. Conference paper
    D1
    “Randomized Data Structures for the Dynamic Closest-pair Problem,” in Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1993), Austin, TX, USA, 1993.
  26. Report
    D1
    “Randomized Data Structures for the Dynamic Closest-Pair Problem,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-93-102, 1993.
  27. Conference paper
    D1
    “Simple Randomized Algorithms for Closest Pair Problems - Extended Abstract -,” in Proceedings of the Fifth Canadian Conference on Computational Geometry (CCCG 1993), Waterloo, Canada, 1993.
  28. Report
    D1
    “On multi-party communication complexity of random functions,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-93-162, 1993.
  29. Report
    D1
    “Multi-party protocols and spectral norms,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-93-132, 1993.
  30. Report
    D1
    “Harmonic analysis, real approximation, and the communication complexity of Boolean functions,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-93-161, 1993.
  31. Report
    D1
    “MOD m gates do not help on the ground floor,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-93-142, 1993.
  32. Conference paper
    D1
    “Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization,” in Algorithms and Data Structures (WADS 1993), Montréal, Canada, 1993.
  33. Report
    D1
    “On Intersection Searching Problems Involving Curved Objects,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-93-124, 1993.
  34. Report
    D1
    “Efficient algorithms for generalized intersection searching on non-iso-oriented objects,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-93-166, 1993.
  35. Report
    D1
    “Optimal parallel string algorithms: sorting, merching and computing the minimum,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-93-152, 1993.
  36. Conference paper
    D1
    “Maintaining Discrete Probability Distributions Optimally,” in Automata, Languages and Programming (ICALP 1993), Lund, Sweden, 1993.
  37. Conference paper
    D1
    “Generalized Topological Sorting in Linear Time,” in Fundamentals of Computation Theory (FCT 1993), Szeged, Hungary, 1993.
  38. Conference paper
    D1
    “Fast Deterministic Approximate and Exact Parallel Sorting,” in Proceedings of the Fifth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 1993), Velen, Germany, 1993.
  39. Report
    D1
    “Generalized topological sorting in linear time,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-93-119, 1993.
  40. Conference paper
    D1
    “Fast Deterministic Processor Allocation,” in Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1993), Austin, TX, USA, 1993.
  41. Report
    D1
    “New techniques for exact and approximate dynamic closest-point problems,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-93-159, 1993.
  42. Article
    D1
    “Randomized incremental construction of abstract Voronoi diagrams,” Computational Geometry: Theory and Applications, vol. 3, 1993.
  43. Conference paper
    D1
    “Exact Algorithms for a Geometric Packing Problem (Extended Abstract),” in STACS 93, 10th Annual Symposium on Theoretical Aspects of Computer Science, Würzburg, Germany, 1993.
  44. Conference paper
    D1
    “Coloring k-colorable Graphs in Constant Expected Parallel Time,” in Graph-theoretic Concepts in Computer Science (WG 1993), Utrecht, The Netherlands, 1993.
  45. Report
    D1
    “Expected complexity of graph partitioning problems,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-93-107, 1993.
  46. Report
    D1
    “Coloring k-colorable graphs in constant expected parallel time,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-93-110, 1993.
  47. Report
    D1
    “Randomized incremental construction of abstract Voronoi diagrams,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-93-105, 1993.
  48. Report
    D1
    “Broadcasting through a noisy one-dimensional network,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-93-106, 1993.
  49. Article
    D1
    “An Optimal Construction Method for Generalized Convex Layers,” International Journal of Computational Geometry and Applications, vol. 3, no. 3, 1993.
  50. Report
    D1
    “Tail estimates for the efficiency of randomized incremental algorithms for line segment intersection,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-93-103, 1993.
  51. Report
    D1
    “A Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron,” Institut National de Recherche en Informatique et en Automatique, Sophia Antipolis, France, RR-2023, 1993.
  52. Report
    D1
    “Maintaining dynamic sequences under equality-tests in polylogorithmic time,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-93-128, 1993.
  53. Article
    D1
    “Dynamic Interpolation Search,” Journal of the ACM, vol. 40, 1993.
  54. Article
    D1
    “Tail Estimates for the Efficiency of Randomized Incremental Algorithms for Line Segment Intersection,” Computational Geometry: Theory and Applications, vol. 3, no. 4, 1993.
  55. Report
    D1
    “An implementation of the Hopcroft and Tarjan planarity test and embedding algorithm,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-93-151, 1993.
  56. Report
    D1
    “LEDA-Manual Version 3.0,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-93-109, 1993.
  57. Report
    D1
    “Constructive Deterministic PRAM Simulation on a Mesh-connected Computer,” International Computer Science Institute, Berkeley, TR-93-059, 1993.
  58. Conference paper
    D1
    “Maintaining the Approximate Width of a Set of Points in the Plane,” in Proceedings of the 5th Canadian Conference on Computational Geometry (CCCG 1993), Waterloo, Canada, 1993.
  59. Report
    D1
    “Lower bounds for merging on the hypercube,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-93-148, 1993.
  60. Article
    D1
    “A New Method for Hierarchical Compaction,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 12, no. 2, 1993.
  61. Conference paper
    D1
    “Moving a Disc between Polygons,” in Proceedings of the 9th Annual Symposium on Computational Geometry (SCG 1993), San Diego, CA, USA, 1993.
  62. Conference paper
    D1
    “Semi-dynamic Maintenance of the Width of a Planar Point Set,” in 9th European Workshop on Computational Geometry CG ’93 : Abstracts, Hagen, Germany, 1993.
  63. Report
    D1
    “Tight bounds for some problems in computational geometry: the complete sub-logarithmic parallel time range,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-93-129, 1993.
  64. Report
    D1
    “Deterministic 1-k routing on meshes with applications to worm-hole routing,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-93-163, 1993.
  65. Conference paper
    D1
    “Randomized Routing on Meshes with Buses,” in Algorithms - ESA ’93, Bad Honnef, Germany, 1993.
  66. Report
    D1
    “Deterministic Permutation Routing on Meshes,” Universität Passau, Passau, Germany, MIP-9301, 1993.
  67. Report
    D1
    “Routing and sorting on circular arrays,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-93-138, 1993.
  68. Report
    D1
    “An O(n log n) algorithm for finding a k-point subset with minimal L∞-diameter,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-93-116, 1993.
  69. Report
    D1
    “Static and dynamic algorithms for k-point clustering problems,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-93-108, 1993.

1992

  1. Report
    D1
    “The influence of lookahead in competitive on-line algorithms,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-92-143, 1992.
  2. Article
    D1
    “Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures,” Algorithmica, vol. 8, no. 5–6, 1992.
  3. Article
    D1
    “A Lower Bound for the Nondeterministic Space Complexity of Context-free Recognition,” Information Processing Letters, vol. 42, no. 1, 1992.
  4. Report
    D1
    “A Method for Obtaining Randomized Algorithms with Small Tail Probabilities,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-92-110, 1992.
  5. Conference paper
    D1
    “A Perfect Parallel Dictionary,” in Mathematical Foundations of Computer Science 1992 (MFCS 1992), Prague, Czechoslovakia, 1992.
  6. Report
    D1
    “Dynamic point location in general subdivisions,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-92-126, 1992.
  7. Conference paper
    D1
    “Dynamic Point Location in General Subdivisions,” in Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1992), Orlando, FL, USA, 1992.
  8. Report
    D1
    “Four results on randomized incremental constructions,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-92-112, 1992.
  9. Conference paper
    D1
    “Four Results on Randomized Incremental Constructions,” in STACS 92, 9th Annual Symposium on Theoretical Aspects of Computer Science, Cachan, France, 1992.
  10. Article
    D1
    “Simultaneous Inner and Outer Approximation of Shapes,” Algorithmica, vol. 8, no. 5–6, 1992.
  11. Book chapter / section
    D1
    “Selected Topics from Computational Geometry, Data Structures and Motion Planning,” in Data Structures and Efficient Algorithms, Final Report on the DFG Special Joint Initiative, B. Monien and T. Ottmann, Eds. Berlin, Germany: Springer, 1992.
  12. Report
    D1
    “A new lower bound technique for decision trees,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-92-125, 1992.
  13. Report
    D1
    “A simple balanced search tree with 0(1) worst-case update time,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-92-101, 1992.
  14. Report
    D1
    “Simple randomized algorithms for closest pair problems,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-92-155, 1992.
  15. Report
    D1
    “Circuits and multi-party protocols,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-92-104, 1992.
  16. Report
    D1
    “Separating the communication complexities of MOD m and MOD p circuits,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-92-120, 1992.
  17. Article
    D1
    “FORK: A High-level Language for PRAMs,” Future Generation Computer Systems, vol. 8, no. 4, 1992.
  18. Conference paper
    D1
    “Waste Makes Haste: Tight Bounds for Loose Parallel Sorting,” in Proceedings of the 33th Annual IEEE Symposium on Foundations of Computer Science (FOCS 1992), Pittsburgh, PA, USA, 1992.
  19. Conference paper
    D1
    “Fast and Optimal Simulations between CRCW PRAMs,” in STACS 92, 9th Annual Symposium on Theoretical Aspects of Computer Science, Cachan, France, 1992.
  20. Article
    D1
    “On a Compaction Theorem of Ragde,” Information Processing Letters, vol. 43, no. 6, 1992.
  21. Conference paper
    D1
    “The Log-star Revolution,” in STACS 92, 9th Annual Symposium on Theoretical Aspects of Computer Science, Cachan, France, 1992.
  22. Report
    D1
    “Fast integer merging on the EREW PRAM,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-92-115, 1992.
  23. Report
    D1
    “Fast deterministic processor allocation,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-92-149, 1992.
  24. Conference paper
    D1
    “Fast Integer Merging on the EREW PRAM,” in Automata, Languages, and Programming (ICALP 1992), Wien, Austria, 1992.
  25. Conference paper
    D1
    “Improved Parallel Integer Sorting without Concurrent Writing,” in Proceedings of the Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1992), Orlando, FL, USA, 1992.
  26. Report
    D1
    “Waste makes haste: tight bounds for loose parallel sorting,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-92-141, 1992.
  27. Conference paper
    D1
    “Optimal Multi-packet Routing on the Torus,” in Algorithms Theory - SWAT’ 92, Helsinki, Finland, 1992.
  28. Article
    D1
    “On Local Routing of Two-terminal Nets,” Journal of Combinatorial Theory. Series B, vol. 55, no. 1, 1992.
  29. Book chapter / section
    D1
    “Randomized incremental construction of abstract Voronoi diagrams,” in Informatik---Festschrift zum 60.~Geburtstag von Günter Hotz, vol. 1, J. Buchmann, H. Ganzinger, and W. J. Paul, Eds. Stuttgart, Germany: Teubner, 1992.
  30. Report
    D1
    “The largest hyper-rectangle in a three dimensional orthogonal polyhedron,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-92-123, 1992.
  31. Report
    D1
    “Sequential and parallel algorithms for the k closest pairs problem,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-92-134, 1992.
  32. Report
    D1
    “Maintaining the visibility map of spheres while moving the viewpoint on a circle at infinity,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-92-102, 1992.
  33. Conference paper
    D1
    “Maintaining the visibility map of spheres while moving the viewpoint on a circle at infinity,” in Algorithms Theory - SWAT’92: Third Scandinavian Workshop on Algorithm Theory, Helsinki, Finland, 1992.
  34. Conference paper
    D1
    “Enumerating the k closest pairs optimally,” in 33rd Annual Symposium on Foundations of Computer Science (FOCS92), 1992.
  35. Report
    D1
    “Furthest Site Abstract Voronoi Diagrams,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-92-135, 1992.
  36. Report
    D1
    “Lower bound for set intersection queries,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-92-127, 1992.
  37. Conference paper
    D1
    “Recent Developments in Algorithms for the Maximum Flow Problem (Abstract),” in Proceedings of Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1992), 1992.
  38. Conference paper
    D1
    “Tail Estimates for the Space Complexity of Randomised Incremental Algorithms,” in Discrete algorithms (SODA-92) : 3rd annual ACM-SIAM symposium, 1992.
  39. Conference paper
    D1
    “Algorithm Design and Software Libraries: Recent Developments in the LEDA Project,” in Information Processing ’92, Volume 1 (IFIP 1992), Madrid, Spain, 1992.
  40. Article
    D1
    “k versus k+1 Index Registers and Modifiable versus Non-modifiable Programs,” Information and Computation, vol. 101, no. 1, 1992.
  41. Report
    D1
    “Computing intersections and arrangements for red-blue curve segments in parallel,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-92-108, 1992.
  42. Conference paper
    D1
    “An O(n log n log log n) Algorithm for the On-line Closes Pair Problem,” in Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1992), Orlando, FL, USA, 1992.
  43. Conference paper
    D1
    “An Optimal Algorithm for the On-line Closest-pair Problem,” in Proceedings of the 8th Annual Symposium on Computational Geometry (SCG 1992), Berlin, Germany, 1992.
  44. Report
    D1
    “Semi-dynamic maintenance of the width of a planar point set,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-92-153, 1992.
  45. Article
    D1
    “Maintaining the Minimal Distance of a Point Set in Polylogarithmic Time,” Discrete & Computational Geometry, vol. 7, 1992.
  46. Report
    D1
    “Further results on generalized intersection searching problems: counting, reporting, and dynamization,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-92-154, 1992.
  47. Report
    D1
    “Enumerating the k closest pairs mechanically,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-92-118, 1992.
  48. Report
    D1
    “Finding k points with a smallest enclosing square,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-92-152, 1992.
  49. Report
    D1
    “Minimum base of weighted k polymatroid and Steiner tree problem,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-92-121, 1992.
  50. Report
    D1
    “A faster 11/6-approximation algorithm for the Steiner tree problem in graphs,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-92-122, 1992.

1991

  1. Article
    D1
    “Computing a Maximum Cardinality Matching in a Bipartite Graph in Time O(n^1.5 sqrt(m/log n)),” Information Processing Letters, vol. 37, no. 4, 1991.
  2. Other
    D1
    “A Method for Obtaining Randomized Algorithms with Small Tail Probabilities.” 1991.
  3. Conference paper
    D1
    “Fast and Reliable Parallel Hashing,” in 3rd Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA’91), Hilton Head Island, South Carolina, USA, 1991.
  4. Report
    D1
    “An o(n3)-time maximum-flow algorithm,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-91-120, 1991.
  5. Report
    D1
    “A lower bound for the nondeterministic space complexity of contextfree recognition,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-91-115, 1991.
  6. Report
    D1
    “Algorithms for dense graphs and networks,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-91-114, 1991.
  7. Other
    D1
    “Dynamic Perfect Hashing: Upper and Lower Bounds.” 1991.
  8. Conference paper
    D1
    “A Time-Randomness Tradeoff for Communication Complexity,” in Distributed Algorithms, 4th International Workshop, 1991.
  9. Report
    D1
    “Simultaneous inner and outer aproximation of shapes,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-91-105, 1991.
  10. Report
    D1
    “A tight lower bound for the worst case of bottom-up-heapsort,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-91-104, 1991.
  11. Report
    D1
    “Fast parallel space allocation, estimation an integer sorting,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-91-106, 1991.
  12. Report
    D1
    “On a compaction theorem of ragde,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-91-121, 1991.
  13. Report
    D1
    “Approximate decision algorithms for point set congruence,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-91-110, 1991.
  14. Report
    D1
    “On embeddings in cycles,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-91-122, 1991.
  15. Report
    D1
    “An optimal construction method for generalized convex layers,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-91-112, 1991.
  16. Conference paper
    D1
    “An optimal construction method for generalized convex layers,” in ISA’91 Algorithms: 2nd International Symposium on Algorithms, 1991.
  17. Article
    D1
    “Constructive Whitney-Graustein Theorem: Or How to Untangle Closed Planar Curves,” SIAM Journal on Computing, vol. 20, no. 4, 1991.
  18. Article
    D1
    “On the construction of abstract Voronoi diagrams,” Discrete & Computational Geometry, vol. 6, 1991.
  19. Report
    D1
    “Tail estimates for the space complexity of randomized incremantal algorithms,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-91-113, 1991.
  20. Proceedings
    D1
    Eds., Effiziente Algorithmen. Mathematisches Forschungsinstitut, 1991.
  21. Report
    D1
    “An optimal algorithm for the on-line closest-pair problem,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-91-123, 1991.
  22. Report
    D1
    “An O(n log n log log n) algorithm for the on-line closes pair problem,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-91-107, 1991.
  23. Report
    D1
    “Range trees with slack parameter,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-91-102, 1991.
  24. Report
    D1
    “Maintaining the minimal distance of a point set in polylogarithmic time (revised version),” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-91-103, 1991.
  25. Report
    D1
    “Dynamic rectangular point location, with an application to the closest pair problem,” Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-91-101, 1991.

1990

  1. Article
    D1
    “Faster Algorithms for the Shortest Path Problem,” Journal of the ACM, vol. 37, no. 2, 1990.
  2. Conference paper
    D1
    “Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures,” in Computational geometry (SCG-90) : 6th annual symposium, 1990.
  3. Other
    D1
    “Can a maximum flow be computed in $o(nm)$ time?” Teubner, Saarbrücken, Germany, 1990.
  4. Conference paper
    D1
    “Can A Maximum Flow be Computed in o(nm) Time?,” in Automata, languages and programming (ICALP-90) : 17th international colloquium, 1990.
  5. Article
    D1
    “Dynamic Deferred Data Structuring,” Information Processing Letters, vol. 35, no. 1, 1990.
  6. Conference paper
    D1
    “On Simultaneous Inner and Outer Approximation of Shapes,” in Computational geometry (SCG-90) : 6th annual symposium, 1990.
  7. Book chapter / section
    D1
    “Routing Problems in Grid Graphs,” in Paths, Flows, and VLSI-Layout, Berlin, Germany: Springer, 1990.
  8. Conference paper
    D1
    “On the Construction of Abstract Voronoi Diagrams, II,” in Algorithms (ISA-90) : 1st international symposium (SIGAL-90), 1990.
  9. Article
    D1
    “On the Complexity of a Game Related to the Dictionary Problem,” SIAM Journal on Computing, vol. 19, no. 5, 1990.
  10. Article
    D1
    “Compaction on the Torus,” IEEE Transactions on CAD of Integrated Circuits and Systems, vol. 9, 1990.
  11. Article
    D1
    “A faster compaction algorithm with automatic jog insertion,” IEEE Transactions on CAD of Integrated Circuits and Systems, vol. 9, 1990.
  12. Article
    D1
    “Hidden Line Elimination for Isooriented Rectangles,” Information Processing Letters, vol. 35, no. 3, 1990.
  13. Article
    D1
    “Dynamic Fractional Cascading,” Algorithmica, vol. 5, no. 2, 1990.
  14. Article
    D1
    “Bounded Ordered Dictionaries in O(log log N) Time and O(n) Space,” Information Processing Letters, vol. 35, no. 4, 1990.
  15. Report
    D1
    “Hidden line elimination for isooriented rectangles,” Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, 1990.
  16. Book chapter / section
    D1
    “Data Structures,” in Handbook of Theoretical Computer Science, Amsterdam, The Netherlands: Elsevier/MIT, 1990.
  17. Conference paper
    D1BIO
    “On the Construction of Abstract Voronoi Diagrams,” in Theoretical aspects of computer science (STACS-90) : 7th annual symposium, 1990.
  18. Conference paper
    D1
    “LEDA - A Library of Efficient Data Types and Algorithms,” in GI - 20. Jahrestagung I, Informatik auf dem Weg zum Anwender, 1990.
  19. Conference paper
    D1
    “LEDA: A Library of Efficient Data Types and Algorithms,” in Automata, languages and programming (ICALP-90) : 17th international colloquium, 1990.

1989

  1. Article
    D1
    “AT^2-Optimal Galois Field Multiplier for VLSI,” IEEE Transactions on Computers, vol. 38, no. 9, 1989.
  2. Report
    D1
    “Routing Problems in Grid Graphs,” Institut für Ökonometrie und Operations Research, Bonn, 1989.
  3. Report
    D1
    “Routing Problems in Grid Graphs,” SFB Sonderforschungsbereich 124, Universität des Saarlandes, Saarbrücken, 1989.
  4. Report
    D1
    “On the Construction of Abstract Voronoi Diagrams, II,” Universtität des Saarlandes / Fachbereich Informatik, Saarbrücken, A 03/89, 1989.
  5. Book
    D1
    Foundations of Programming Languages. New York, USA: Wiley, 1989.
  6. Report
    D1
    “Data structures,” Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, A 89/02, 1989.
  7. Conference paper
    D1
    “A library of efficient data types and algorithms,” in Mathematical foundations of computer science (MFCS-89) : 14th international symposium, 1989.
  8. Proceedings
    D1
    Ed., Proceedings of the Fifth Annual Symposium on Computational Geometry 1989 (SCG ’89). ACM, 1989.
  9. Conference paper
    D1
    “Two Versus One Index Register and Modifiable Versus Non-modifiable Programs,” in Automata, languages and programming (ICALP-89) : 16th international colloquium, 1989.
  10. Report
    D1
    “On the construction of abstract Voronoi diagrams,” Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, A 89/01, 1989.
  11. Conference paper
    D1
    “LEDA: A library of efficient data types and algorithms,” in Mathematical foundations of computer science (MFCS-89) : 14th international symposium, 1989.
  12. Conference paper
    D1
    “On the Complexity of a Game Related to the Dictionary Problem,” in 30th Annual Symposium on Foundations of Computer Science (FOCS 1989), 1989.

1988

  1. Report
    D1
    “Faster Algorithms for the Shortest Path Problem,” Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, A 88/04, 1988.
  2. Report
    D1
    “Faster Algorithms for the Shortest Path Problem,” MIT Operations Research Center, Cambridge, TR-193, 1988.
  3. Article
    D1
    “Congruence, Similarity, and Symmetries of Geometric Objects,” Discrete and Computational Geometry, vol. 3, 1988.
  4. Conference paper
    D1
    “Upper and Lower Bounds for the Dictionary Problem,” in Algorithm theory (SWAT-88) : 1st Scandinavian workshop, 1988.
  5. Conference paper
    D1
    “Dynamic Perfect Hashing: Upper and Lower Bounds,” in 29th Annual Symposium on Foundations of Computer Science (FOCS 1988), 1988.
  6. Proceedings
    D1
    VLSI Algorithms and Architectures. Springer, 1988.
  7. Conference paper
    D1
    “On Continuous Homotopic One Layer Routing (Extended Abstract),” in Computational geometry and its applications (CG-88) : international workshop, 1988.
  8. Conference paper
    D1
    “On Continuous Homotopic One Layer Routing,” in Computational geometry (SCG-88) : 4th symposium, 1988.
  9. Article
    D1
    “Parallel Algorithms for Computing Maximal Independent Sets in Trees and for Updating Minimum Spanning Trees,” Information Processing Letters, vol. 27, no. 5, 1988.
  10. Report
    D1
    “A Linear-Time Algorithm for the Homotopic Routing Problem in Grid Graphs,” SFB Sonderforschungsbereich 124, Universität des Saarlandes, Saarbrücken, 1988.
  11. Conference paper
    D1
    “Constructive Hopf’s Theorem: Or How to Untangle Closed Planar Curves,” in Automata, languages and programming (ICALP-88) : 15th international colloquium, 1988.
  12. Article
    D1
    “A Lower Bound on the Complexity of the Union-Split-Find Problem,” SIAM Journal on Computing, vol. 17, no. 6, 1988.
  13. Report
    D1
    “Compaction on the Torus,” Facgbereich 10, Informatik, Universität des Saarlandes, Saarbrücken, 08/1988, 1988.
  14. Other
    D1
    “Constructive Hopf’s theorem: or how to untangle closed planar curves.” 1988.
  15. Conference paper
    D1
    “SFB 124: VLSI-Entwurfsmethoden und Parallelität,” in GI - 18. Jahrestagung II, Vernetzte and komplexe Informatik-Systems, 1988.
  16. Conference paper
    D1
    “Compaction on the Torus,” in {VLSI} algorithms and architectures : 3rd {A}egean Workshop on Computing, AWOC 88, 1988.
  17. Book
    D1
    Datenstrukturen und effiziente Algorithmen, Band 1: Sortieren und Suchen. Stuttgart, Germany: Teubner, 1988.
  18. Article
    D1
    “A Faster Approximation Algorithm for the Steiner Problem in Graphs,” Information Processing Letters, vol. 27, no. 3, 1988.

1987

  1. Proceedings
    D1
    Eds., Parallel Algorithms and Architectures. Springer, 1987.
  2. Article
    D1
    “Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones,” SIAM Journal on Computing, vol. 16, no. 5, 1987.
  3. Report
    D1
    “Congruence, Similarity and Symmetries of Geometric Objects,” Universität des Saarlandes / Fachbereich Informatik, Saarbrücken, A 02/87, 1987.
  4. Conference paper
    D1
    “Deterministic Simulation of Idealized Parallel Computers on more Realistic Ones,” in Parallel Algorithms and Architectures (GDR 1987), Suhl, FRG, 1987.
  5. Conference paper
    D1
    “Convergence, Similarity and Symmetries of Geometric Objects,” in Computational geometry (SCG-87) : 3rd symposium, 1987.
  6. Article
    D1
    “A log log n Data Structure for Three-sided Range Queries,” Information Processing Letters, vol. 25, no. 4, 1987.
  7. Report
    D1
    “Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees,” SFB Sonderforschungsbereich 124, Universität des Saarlandes, Saarbrücken, SFB 87/01, 1987.
  8. Conference paper
    D1
    “On Local Routing of Two-Terminal Nets,” in STACS 87, 4th Annual Symposium on Theoretical Aspects of Computer Science, Passau, FRG, 1987.
  9. Conference paper
    D1
    “A Lower Bound for the Complexity of the Union-Split-Find Problem,” in Automata, Languages and Programming (ICALP-87) : 14th International Colloquium, 1987.
  10. Report
    D1
    “A Faster Compaction Algorithm with Automatic Jog Insertion,” Fachbereich 10, Informatik, Universität des Saarlandes, Saarbrücken, 15/1987, 1987.
  11. Article
    D1
    “Area-Time Optimal Division for T=Omega((log n)^1+epsilon),” Information and Computation, vol. 72, no. 3, 1987.
  12. Other
    D1
    “A Faster Approximation Algorithm for the Steiner Problem in Graphs.” 1987.

1986

  1. Conference paper
    D1
    “Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones,” in Mathematical Foundations of Computer Science, 12th Symposium (MFCS 1986), 1986.
  2. Article
    D1
    “Algorithms for Routing in Planar Graphs,” Acta Informatica, vol. 23, no. 2, 1986.
  3. Proceedings
    D1
    VLSI Algorithms and Architectures. Springer, 1986.
  4. Conference paper
    D1
    “AT$^2$-Optimal Galois Field Multiplier for VLSI,” in VLSI Algorithms and Architectures, Aegean Workshop on Computing, 1986.
  5. Article
    D1
    “Sorting Jordan Sequences in Linear Time Using Level-Linked Search Trees,” Information and Control, vol. 68, no. 1–3, 1986.
  6. Report
    D1
    “On Local Routing of Two-Terminal Nets,” Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, A 84/12, 1986.
  7. Article
    D1
    “Routing through a Generalized Switchbox,” Journal of Algorithms, vol. 7, no. 4, 1986.
  8. Book chapter / section
    BIOD1
    “VLSI complexity, efficient VLSI algorithms and the HILL design system,” in Algorithmics for VLSI, C. Trullemans, Ed. London ; Orlando: Academic Press, 1986.
  9. Book
    D1
    Grundlagen der Programmiersprachen. Stuttgart, Germany: Teubner, 1986.
  10. Article
    D1
    “Routing through a Rectangle,” Journal of the ACM, vol. 33, no. 1, 1986.
  11. Article
    D1
    “On BF-orderable Graphs,” Discrete applied mathematics, vol. 15, no. 2–3, 1986.
  12. Article
    D1
    “Channel Routing in Knock-Knee Mode: Simplified Algorithms and Proofs,” Algorithmica, vol. 1, no. 2, 1986.
  13. Book
    D1
    Datenstrukturen und effiziente Algorithmen, Band 1: Sortieren und Suchen. Stuttgart, Germany: Teubner, 1986.
  14. Conference paper
    D1
    “Area-time Optimal Division for T=Omega(log n)$^1+epsilon$",” in STACS 86, 3rd Annual Symposium on Theoretical Aspects of Computer Science, 1986.
  15. Article
    D1
    “An Amortized Analysis of Insertions into AVL-Trees,” SIAM Journal on Computing, vol. 15, no. 1, 1986.
  16. Report
    D1
    “Dynamic fractional cascading,” Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, A 86/06, 1986.
  17. Article
    D1
    “Über Verdrahtungsalgorithmen,” Informatik Spektrum, vol. 9, no. 4, 1986.
  18. Other
    D1
    “A Lower Bound for the Complexity of the Union-Split-Find Problem.” 1986.

1985

  1. Article
    D1
    “Searching Semisorted Tables,” SIAM Journal on Computing, vol. 14, no. 4, 1985.
  2. Report
    D1
    “Deterministic simulation of idealized parallel computers on more realistic ones,” Sonderforschungsbereich 124, Universität des Saarlandes, Saarbrücken, SFB 85/36, 1985.
  3. Report
    D1
    “Dynamization of geometric data structures,” SFB Sonderforschungsbereich 124, Universität des Saarlandes, Saarbrücken, SFB 85/02, 1985.
  4. Conference paper
    D1
    “Dynamization of geometric data structures,” in Computational geometry (SCG-85) : 1st symposium, 1985.
  5. Article
    D1
    “Fast Triangulation of the Plane with Respect to Simple Polygons,” Information and Control, vol. 64, no. 1–3, 1985.
  6. Conference paper
    D1
    “Sorting Jordan sequences in linear time,” in Computational geometry (SCG-85) : 1st symposium, 1985.
  7. Article
    D1
    “A Fast Algorithm for Renaming a Set of Clauses as a Horn Set,” Information Processing Letters, vol. 21, no. 5, 1985.
  8. Conference paper
    D1
    “Intersecting Two Polyhedra One of which is Convex,” in Fundamentals of Computation Theory (FCT 1985), Cottbus, GDR, 1985.
  9. Other
    D1
    “Area-time optimal division for T=omega((logn)1+epsilon).” 1985.
  10. Conference paper
    D1
    “Dynamic Interpolation Search,” in Automata, languages and programming (ICALP-85) : 12th international colloquium, 1985.
  11. Other
    D1
    “On BF-perfect graphs.” 1985.
  12. Proceedings
    D1
    Ed., STACS 85. Springer, 1985.
  13. Conference paper
    D1
    “Routing Through a Generalized Switchbox,” in Automata, languages and programming (ICALP-85) : 12th international colloquium, 1985.

1984

  1. Article
    D1
    “On the complexity of partial match retrieval,” Information Processing Letters, vol. 19, 1984.
  2. Article
    D1
    “Partial Match Retrieval in Implicit Data Structures,” Information Processing Letters, vol. 19, no. 2, 1984.
  3. Other
    D1
    “Algorithms for routing in planar graphs.” 1984.
  4. Proceedings
    D1
    Eds., STACS 84. Springer, 1984.
  5. Article
    D1
    “Space Sweep Solves Intersection of Convex Polyhedra,” Acta Informatica, vol. 21, 1984.
  6. Article
    D1
    “Intersecting a line and a simple polygon,” Eatcs Bulletin, vol. 22, 1984.
  7. Report
    D1
    “Sorting Jordan Sequences in Linear Time,” Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, A 84/09, 1984.
  8. Other
    D1
    “Routing through a generalized switchbox.” 1984.
  9. Report
    D1
    “Local Routing of Two-terminal Nets is Easy,” Universität des Saarlandes / Fachbereich Informatik, Saarbrücken, A 84/12, 1984.
  10. Article
    BIOD1
    “Four Results on the Complexity of VLSI Computation,” Advances in Computing Research, vol. 2, 1984.
  11. Book
    D1
    Data structures and algorithms. Volume 1 : Sorting and searching. Berlin, Germany: Springer, 1984.
  12. Article
    D1
    “Randomized and Deterministic Simulations of PRAMs by Parallel Machines with Restricted Granularity of Parallel Memories,” Acta Informatica, vol. 21, 1984.
  13. Book
    D1
    Data structures and algorithms. Volume 3 : Multi-dimensional searching and computational geometry. Berlin, Germany: Springer, 1984.
  14. Conference paper
    D1
    “Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time,” in Automata, languages and programming (ICALP-84) : 11th colloquium, 1984.
  15. Article
    D1
    “AT2-optimal VLSI for Integer Division and Integer Square Rooting,” Integration, the VLSI Journal, vol. 2, no. 2, 1984.
  16. Conference paper
    D1
    “On Optimal VLSI-Circuits for the Basic Arithmetic Functions,” in 9. Colloquium on Trees in Algebra and Programming (CAAP’84), 1984.
  17. Book
    D1
    Data structures and algorithms. Volume 2 : Graph algorithms and NP-completeness. Berlin, Germany: Springer, 1984.
  18. Other
    D1
    “Channel Routing in Knock-Knee Mode: Simplified Algorithms and Proof.” 1984.
  19. Conference paper
    D1
    “Über Verdrahtungsalgorithmen,” in GI Jahrestagung (Fachgespräche), 1984.

1983

  1. Conference paper
    D1
    “Fast Triangulation of Simple Polygons,” in Fundamentals of Computation Theory, Proceedings of the 1983 International FCT-Conference (FCT 1983), 1983.
  2. Article
    D1
    “Cost Trade-offs in Graph Embeddings, with Applications,” Journal of the ACM, vol. 30, no. 4, 1983.
  3. Other
    BIOD1
    “Four results on the complexity of VLSI computations.” 1983.
  4. Other
    BIOD1
    “VLSI Complexity, Efficient VLSI Algorithms and the HILL Design System.” 1983.
  5. Article
    D1
    “$AT^2$-optimal VLSI multipliers with minimum computation time,” Information & Control, vol. 58, 1983.
  6. Other
    D1
    “Routing through a Rectangle.” 1983.
  7. Report
    D1
    “VLSI Complexity, Efficient VLSI Algorithms and the HILL Design System,” Fachbereich 10 - Angewandte Mathematik und Informatik, Universität des Saarlandes, Saarbrücken, A 83/03, 1983.
  8. Conference paper
    D1
    “A Single Shortest Path Algorithm for Graphs with Separators,” in Fundamentals of Computation Theory, Proceedings of the 1983 International FCT-Conference (FCT 1983), 1983.
  9. Article
    D1
    “Area-Time Optimal VLSI Integer Mutliplier with Minimum Computation Time,” Information and Control, vol. 58, no. 1–3, 1983.
  10. Other
    D1
    “Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time.” 1983.
  11. Other
    D1
    “Granularity of parallel memories.” 1983.
  12. Report
    D1
    “AT2-optimal VLSI for Integer Division and Integer Square Rooting,” Universität des Saarlandes, Saarbrücken, 83/02, 1983.
  13. Article
    D1
    “The Recognition of Deterministic CFL’s in Small Time and Space,” Information and Control, vol. 56, no. 1–2, 1983.

1982

  1. Article
    D1
    “A Probabilistic Algorithm for Vertex Connectivity of Graphs,” Information Processing Letters, vol. 15, no. 3, 1982.
  2. Article
    D1
    “The Theory of Fringe Analysis and Its Application to 2-3 Trees and B-Trees,” Information and Control, vol. 55, no. 1–3, 1982.
  3. Other
    D1
    “Cost tradeoffs in graph embeddings, with applications.” 1982.
  4. Article
    D1
    “A New Data Structure for Representing Sorted Lists,” Acta Informatica, vol. 17, 1982.
  5. Conference paper
    D1
    “On the Program Size of Perfect and Universal Hash Functions,” in Proceedings of the 23th Annual IEEE Symposium on Foundations of Computer Science (FOCS 1982), Chicago, IL, USA, 1982.
  6. Conference paper
    D1
    “Balanced Trees as a Datastructure for Representing Sorted Lists,” in Colloquium Complexiteit en Algoritmen, Amsterdam, The Netherlands, 1982.
  7. Article
    D1
    “A Partial Analysis of Height-Balanced Trees Under Random Insertions and Deletions,” SIAM Journal on Computing, vol. 11, no. 4, 1982.
  8. Conference paper
    D1
    “Las Vegas Is better than Determinism in VLSI and Distributed Computing,” in Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing (STOC 1982), 1982.

1981

  1. Conference paper
    D1
    “Partial Match Retrieval in Implicit Data Structures,” in Mathematical foundations of computer science (MFCS-81) : 10th symposium, ,, 1981.
  2. Conference paper
    D1
    “Cost Tradeoffs in Graph Embeddings, with Applications (Preliminary Version),” in Automata, languages and programming (ICALP-81) : 8th international colloquium, 1981.
  3. Conference paper
    D1
    “Robust balancing in B-trees,” in Theoretical computer science : 5th GI-conference, 1981.
  4. Article
    BIOD1
    “On the Complexity of VLSI-Computations,” VLSI Systems and Computations, vol. ??, 1981.
  5. Article
    D1
    “Optimal Dynamization of Decomposable Searching Problems,” Information Processing Letters, vol. 12, no. 2, 1981.
  6. Article
    D1
    “Lower Bounds on the Efficiency of Transforming Static Data Structures into Dynamic Structures,” Mathematical Systems Theory, vol. 15, no. 1, 1981.
  7. Article
    D1
    “Arbitrary Weight Changes in Dynamic Trees,” Revue Française d’Automatique, d'Informatique et de Recherche Opérationnelle : RAIRO, vol. 15, no. 3, 1981.

1980

  1. Article
    D1
    “Codes: Unequal Probabilities, Unequal Letter Cost,” Journal of the ACM, vol. 27, no. 3, 1980.
  2. Article
    D1
    “On the Average Number of Rebalancing Operations in Weight-Balanced Trees,” Theoretical Computer Science, vol. 11, no. 3, 1980.
  3. Article
    D1
    “Binary Search Trees: Average and Worst Case Behavior,” Elektronische Informationsverarbeitung und Kybernetik, vol. 16, no. 1–3, 1980.
  4. Other
    D1
    “Optimal dynamization of decomposable searching problems.” Teubner, Saarbrücken, Germany, 1980.
  5. Conference paper
    D1
    “Pebbling Mountain Ranges and its Application of DCFL-Recognition,” in Automata, languages and programming (ICALP-80) : 7th annual international colloquium, 1980.
  6. Conference paper
    D1
    “A New Data Structure for Representing Sorted Lists,” in Graph-theoretic concepts in computer science (WG-80) : 6th international workshop, 1980.
  7. Article
    D1
    “An Efficient Algorithm for Constructing Nearly Optimal Prefix Codes,” IEEE Transactions on Information Theory, vol. 26, no. 5, 1980.
  8. Report
    D1
    “Lower bounds on the efficiency of transforming static data structures into dynamic structures,” Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, A 80/05, 1980.

1979

  1. Article
    D1
    “Complexity Arguments in Algebraic Language Theory,” Revue Française d’Automatique, d'Informatique et de Recherche Opérationnelle : RAIRO / Association Française pour la Cybernétique Economique et Technique, vol. 13, no. 3, 1979.
  2. Conference paper
    D1
    “Searching, Sorting and Information Theory,” in Mathematical Foundations of Computer Science 1979 (MFCS 1979), Olomouc, Czechoslovakia, 1979.
  3. Article
    D1
    “On the isomorphism of two algorithms: Hu/Tucker and Garsia/Wachs,” Colloque de Lille “les Arbres en Algebre et en Programmation,” vol. ??, 1979.
  4. Report
    D1
    “On the Isomorphism of two Algorithms: Hu/Tucker and Garsia/Wachs,” Fachbereich 10 - Angewandte Mathematik und Informatik, Universität des Saarlandes, Saarbrücken, A 79/01, 1979.
  5. Article
    D1
    “Some Remarks on Boolean Sums,” Acta Informatica, vol. 12, 1979.
  6. Article
    D1
    “Dynamic Data Structures,” Mathematical Centre Tracts, vol. 108, 1979.
  7. Article
    D1
    “Dynamic Binary Search,” SIAM Journal on Computing, vol. 8, no. 2, 1979.
  8. Conference paper
    D1
    “Konzepte der Komplexitätstheorie illustriert am Beispiel des Sortierens,” in GI - 9. Jahrestagung, Bonn, Germany, 1979.
  9. Conference paper
    D1
    “Some Remarks on Boolean Sums,” in Mathematical foundations of computer science (MFCS-79) : 8th symposium, 1979.
  10. Article
    D1
    “Parsing Macro Grammars Top Down,” Information and Control, vol. 40, no. 2, 1979.

1978

  1. Report
    D1
    “Codes: Unequal Probabilities, Unequal Letter Cost,” Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, A 78/18, 1978.
  2. Conference paper
    D1
    “Codes: Unequal Probabilities, Unequal Letter Cost,” in Automata, languages and programming (ICALP-78): 5th international colloquium, 1978.
  3. Report
    D1
    “Complexity Arguments in Algebraic Language Theory,” Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, A 78/10, 1978.
  4. Report
    D1
    “On the Average Number of Rebalancing Operations in Weight-Balanced Trees,” Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, A 78/06, 1978.
  5. Report
    D1
    “Effiziente Algorithmen: Ein Beispiel,” Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, A 78/02, 1978.
  6. Report
    D1
    “Sorting Presorted Files,” Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, A 78/12, 1978.
  7. Report
    D1
    “An efficient algorithm for constructing nearly optimal prefix codes,” Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, A 13/78, 1978.
  8. Article
    D1
    “Effiziente Algorithmen: Ein Beispiel,” Informatik-Spektrum, vol. 1, 1978.
  9. Report
    D1
    “Arbitrary Weight Changes in Dynamic Trees,” Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, A 78/04, 1978.

1977

  1. Article
    D1
    “Van Wijngaarden Grammars and Space Complexity Class EXSPACE,” Acta Informatica, vol. 8, 1977.
  2. Article
    D1
    “A best possible bound for the weighted path length of binary search trees,” SIAM Journal on Computing, vol. 6, 1977.
  3. Conference paper
    D1
    “Dynamic Binary Search,” in Automata, Languages and Programming : Fourth Colloquium (ICALP-77), 1977.
  4. Book
    D1
    Effiziente Algorithmen. Stuttgart, Germany: Teubner, 1977.

1976

  1. Conference paper
    D1
    “Lower Bounds for the Space Complexity of Context-Free Recognition,” in Third International Colloquium on Automata, Languages and Programming, 1976.
  2. Conference paper
    D1
    “Binary Search Trees: Average and Worst Case Behavior,” in GI - 6. Jahrestagung, 1976.
  3. Report
    D1
    “Binary Search Trees: Average and Worst Case Behavior,” Fachbereich Informatik, Universiät des Saarlandes, Saarbrücken, A 76/01, 1976.
  4. Conference paper
    D1
    “Top Down Parsing of Macro Grammars,” in GI - 6. Jahrestagung, 1976.
  5. Report
    D1
    “Top down parsing of macro grammars (preliminary report),” Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, A 76/03, 1976.
  6. Article
    D1
    “Bracket-languages are recognizable in logarithmic space,” Information Processing Letters, vol. 5, 1976.
  7. Article
    D1
    “Polynomial and abstract subrecursive classes,” Journal of Computer and System Sciences, vol. 12, 1976.
  8. Article
    D1
    “Monotone Switching Circuits and Boolean Matrix Product,” Computing, vol. 16, 1976.
  9. Report
    D1
    “Dynamic Binary Search Trees : Extended Abstracts,” Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, A 76/11, 1976.
  10. Report
    D1
    “Dynamic Binary Search,” Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, A 76/02, 1976.
  11. Article
    D1
    “An Improved Lower Bound on the Formula Complexity of Context-Free Recognition,” Elektronische Informationsverarbeitung und Kybernetik, vol. 12, 1976.
  12. Report
    D1
    “An improved lower bound on the formula complexity of context-free recognition,” Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, 1976.
  13. Other
    D1
    “An O(n log n) lower bound for the synchronous circuit size of integer multiplication.” 1976.

1975

  1. Report
    D1
    “Untere Schranken für den Platzbedarf bei der kontext-freien Analyse,” Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, A 75/13, 1975.
  2. Article
    D1
    “A Language over a One Symbol Alphabet Requiring only O(log log n) Space,” SIGACT News, vol. 7, 1975.
  3. Other
    D1
    “A game on graphs.” 1975.
  4. Conference paper
    D1
    “Monotone Switching Circuits and Boolean Matrix Product,” in Mathematical foundations of computer science (MFCS-75) : 4th symposium, 1975.
  5. Article
    D1
    “Nearly Optimal Binary Search Trees,” Acta Informatica, vol. 5, 1975.
  6. Conference paper
    D1
    “Best possible bounds for the weighted path length of optimum binary search trees,” in Automata Theory and Formal Languages, 2nd GI Conference, 1975.
  7. Report
    D1
    “Bracket-Languages are Recognizable in Logarithmic Space,” Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, A 75/12, 1975.

1974

  1. Thesis
    D1
    “Polynomial and abstract subrecursive classes,” Cornell University, New York, NY, 1974.
  2. Conference paper
    D1
    “Polynomial and Abstract Subrecursive Classes,” in Conference Record of Sixth Annual ACM Symposium on Theory of computing (STOC-74), 1974.
  3. Conference paper
    D1
    “The ‘almost all’ theory of subrecursive degrees is decidable,” in Automata, languages and programming : 2nd colloquium (ICALP-74), 1974.
  4. Other
    D1
    “Polynomial and abstract subrecursive classes.” IEEE, Ithaca, NY, USA, 1974.

1973

  1. Conference paper
    D1
    “On the Size of Sets of Computable Functions,” in 14th Annual Symposium on Switching & Automata Theory (SSAT-73) (SWAT 1973), Iowa City, Iowa, USA, 1973.
  2. Other
    D1
    “The ‘almost all’ theory of subrecursive degrees is decidable.”IEEE, Ithaca, NY, USA, 1973.
  3. Other
    D1
    “On the Size of Sets of Computable Functions.” IEEE, Ithaca, NY, USA, 1973.