| BibTeX cite key | Author/Editor | Year | | Title | Type |
|---|
| Oberhauser97 | Oberhauser, Fred | 1997 | | Arithmetik der Transduktoren
Universität des Saarlandes | Thesis - Masters thesis |
| OssamyDipl02 | Ossamy, Rodrigue | 2002 | | TSP Cuts Outside the Template Paradigm
Universität des Saarlandes | Thesis - Masters thesis |
| Ost95 | Ost, Kirstin | 1995 | | Algorithmen für das Kantenfärbungsproblem
Universität des Saarlandes | Thesis - Masters thesis |
| OTO_ISAAC_2007 | Ajwani, Deepak
Friedrich, Tobias | 2007 | | Average-Case Analysis of Online Topological Ordering
In: Algorithms and Computation : 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007. Proceedings, 464-475 | Proceedings Article |
| Ott2013 | Antoniadis, Antonios
Huang, Chien-Chung
Ott, Sebastian
Verschae, José | 2013 | | How to Pack Your Items When You Have to Buy Your Knapsack
In: Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, 62-73 | Proceedings Article |
| OttMaster2012 | Ott, Sebastian | 2012 | | Thou shalt not lie : on truthfully maximizing the minimum load on selfish related machines
Universität des Saarlandes | Thesis - Masters thesis |
| Paluch2006 | Paluch, Katarzyna | 2006 |  | A New Approximation Algorithm for Multidimensional Rectangle Tiling
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 712-721 | Proceedings Article |
| Panagiotou2008 | Panagiotou, Konstantinos | 2009 | | Blocks In Constrained Random Graphs with Fixed Average Degree
In: 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009), 733-744 | Electronic Proceedings Article |
| Panagiotou2012b | Panagiotou, Konstantinos
Sinha, Makrand | 2012 | | Vertices of degree k in random unlabeled trees
In: Journal of Graph Theory [69], 114-130 | Journal Article |
| PanagiotouSinhaProc2009 | Panagiotou, Konstantinos | 2009 | | Vertices of Degree k in Random Unlabeled Trees
In: European Conference on Combinatorics, Graph Theory and Applications (EuroComb '09), 41-45 | Proceedings Article |
| PanagiotouSteger2008 | Panagiotou, Konstantinos
Steger, Angelika | 2009 | | Maximal Biconnected Subgraphs of Random Planar Graphs
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 432-440 | Proceedings Article |
| PanagiotouSteger2011 | Panagiotou, Konstantinos
Steger, Angelika | 2011 | | On the Degree Sequence of Random Planar Graphs
In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), 1198-1210 | Proceedings Article |
| PanagiotouStegerJournal2010 | Panagiotou, Konstantinos
Steger, Angelika | 2010 | | Maximal Biconnected Subgraphs of Random Planar Graphs
In: ACM Transactions on Algorithms [6], 31,1-31,21 | Journal Article |
| Papatr-Tsigas95 | Papatriantafilou, Marina
Tsigas, Philippas | 1995 | | Wait-Free Consensus in ``In-Phase'' Multiprocessor Systems
In: Seventh IEEE Symposium on Parallel and Distributed Processing, 312-319 | Proceedings Article |
| Parreira03 | Parreira, Josiane | 2003 | | On the Role of the Singular Values in Latent Semantic Indexing
Universität des Saarlandes | Thesis - Masters thesis |
| patent2005 | Xu, Chihao
Wahl, Jürgen
Eeisenbrand, Friedrich
Karrenbauer, Andreas
Soh, Kian Min
Hitzelberger, Christoph | 2005 | | Verfahren zur Ansteuerung von Matrixanzeigen | Miscellaneous |
| Paterson2000 | Fleischer, Rudolf
Wahl, Michaela | 2000 | | Online scheduling revisited
In: Algorithms - ESA 2000, Proceedings of the 8th Annual European Symposium (ESA-00), 202-210 | Proceedings Article |
| Pemmaraju2011 | Pemmaraju, Sriram V.
Raman, Rajiv
Varadarajan, Kasturi | 2011 | | Max-coloring and online coloring with bandwidths on interval graphs
In: ACM Transactions on Algorithms [7], 35:1-35:21 | Journal Article |
| PerezGimenez2011 | Müller, Tobias
Perez-Gimenez, Xavier
Wormald, Nicholas | 2011 | | Disjoint Hamilton cycles in the random geometric graph
In: Journal of Graph Theory [68], 299-322 | Journal Article |
| Pettie-sensitivity2005 | Pettie, Seth | 2005 | | Sensitivity Analysis of Minimum Spanning Trees in Sub-Inverse-Ackermann Time
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 964-973 | Proceedings Article |
| Pettie2005 | Pettie, Seth | 2005 | | Towards a final analysis of pairing heaps
In: 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 174-183 | Proceedings Article |
| PettieSanders2004 | Pettie, Seth
Sanders, Peter | 2004 | | A simpler linear time 2/3 - eps approximation for maximum weight matching
In: Information Processing Letters [91], 271-276 | Journal Article |
| PettieSanders2005 | Pettie, Seth
Sanders, Peter | 2005 | | Computing Approximate Matchings in External Memory, Streaming, Parallel, and Distributed Network Models | Unpublished/Draft |
| PhDEmeliyanenko12 | Emeliyanenko, Pavel | 2012 | | Harnessing the Power of GPUs for Problems in Real Algebraic Geometry
Universität des Saarlandes | Thesis - PhD thesis |
| PhilipMScThesis2008 | Philip, Geevarghese | 2008 | | Fixed-Parameter Algorithms for Graph Problems Using Graph Minor Theory
Homi Bhabha National Institute | Thesis - Masters thesis |
| PhilipPhDThesis | Philip, Geevarghese | 2011 | | The Kernelization Complexity of some Domination and Covering Problems
Homi Bhabha National Institute | Thesis - PhD thesis |
| PhilipRamanSikdar2009 | Philip, Geevarghese
Raman, Venkatesh
Sikdar, Somnath | 2009 | | Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels
In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, 694-705 | Proceedings Article |
| PhilipRamanSikdar2012 | Philip, Geevarghese
Raman, Venkatesh
Sikdar, Somnath | 2012 | | Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond
In: ACM Transactions on Algorithms [9], 23 | Journal Article |
| PhilipRamanVillanger2010 | Philip, Geevarghese
Raman, Venkatesh
Villanger, Yngve | 2010 | | A Quartic Kernel for Pathwidth-One Vertex Deletion
In: Graph Theoretic Concepts in Computer Science - 36th International Workshop, WG 2010, Zar\'os, Crete, Greece, June 28-30, 2010 Revised Papers, 196-207 | Proceedings Article |
| Piskorski94 | Piskorski, Jakub | 1994 | | Parallele Graphenalgorithmen für den Hypercube
Universität des Saarlandes | Thesis - Masters thesis |
| poly-hemmer-2009 | Hemmer, Michael | 2009 | | Polynomials, CGAL - Computational Geometry Algorithms Library, release 3.4 | Manual |
| Polzin2002-ESA | Polzin, Tobias
Vahdati Daneshmand, Siavash | 2002 | | Extending Reduction Techniques for the Steiner Tree Problem
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 795-807 | Proceedings Article |
| Polzin2002-MSTH | Polzin, Tobias
Vahdati Daneshmand, Siavash | 2003 | | On Steiner trees and minimum spanning trees in hypergraphs
In: Operations Research Letters [31], 12-20 | Journal Article |
| PolzinPhD03 | Polzin, Tobias | 2003 | | Algorithms for the Steiner Problem in Networks
Universität des Saarlandes | Thesis - PhD thesis |
| PolzinVahdati2000 | Polzin, Tobias
Vahdati Daneshmand, Siavash | 2000 | | Primal-Dual Approaches to the Steiner Problem
In: Approximation Algorithms for Combinatorial Optimization, 214-225 | Proceedings Article |
| PolzinVahdati2001a | Polzin, Tobias
Vahdati Daneshmand, Siavash | 2001 | | A Comparison of Steiner Tree Relaxations
In: Discrete Applied Mathematics [112], 241-261 | Journal Article |
| PolzinVahdati2001b | Polzin, Tobias
Vahdati Daneshmand, Siavash | 2001 | | Improved Algorithms for the Steiner Problem in Networks
In: Discrete Applied Mathematics [112], 263-300 | Journal Article |
| Porkolab97a | Porkolab, Lorant
Khachiyan, Leonid | 1997 | | Computing Integral Points in Convex Semi-algebraic Sets
In: Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS-97), 162-171 | Proceedings Article |
| Portz94 | Portz, Sascha | 1994 | | Darstellung und Implementierung polynomieller und streng polynomieller Algorithmen für das Minimum-Cost-Flow-Problem
Universität des Saarlandes | Thesis - Masters thesis |
| Potikoglou99 | Potikoglou, Ioannis | 1999 | | Parallele Algorithmen zur Lösung des Single-Source Shortest Path Problems
Universität des Saarlandes | Thesis - Masters thesis |
| Pouchkarev2000 | Pouchkarev, Igor | 2000 | | ArchEd: Ein interaktives Zeichensystem für die Archäologie
Universität des Saarlandes | Thesis - Masters thesis |
| Pourmiri2013 | Panagiotou, Konstantinos
Pourmiri, Ali
Sauerwald, Thomas | 2013 | | Faster Rumor Spreading with Multiple Calls
In: 24th International Symposium on Algorithms and Computation (ISAAC-13), 446-456 | Proceedings Article |
| PriebeDiss01 | Priebe, Volker | 2001 | | Average-case complexity of shortest-paths problems
Universität des Saarlandes | Thesis - PhD thesis |
| PS03 | Sanders, Peter | 2003 | | Memory hierarchies - models and lower bounds
In: Algorithms for memory hierarchies, 1-10 | Part of a Book |
| ptrianta-tsigas97-1 | Papatriantafilou, Marina
Tsigas, Philippas | 1997 | | Self-Stabilizing Wait-Free Clock Synchronization
In: Parallel Processing Letters [7], 321-328 | Journal Article |
| ptrianta-tsigas98-1 | Panconesi, Alessandro
Papatriantafilou, Marina
Tsigas, Philippas
Vitanyi, Paul | 1998 | | Randomized Naming Using Wait-Free Shared Variables
In: Distributed Computing [11], 113-124 | Journal Article |
| Pyrga2007 | Pyrga, Evangelia
Schulz, Frank
Wagner, Dorothea
Zaroliagis, Christos | 2007 | | Efficient models for timetable information in public transportation systems
In: ACM Journal of Experimental Algorithmics [12], 1-39 | Journal Article |
| Pyrga2008 | Pyrga, Evangelia
Ray, Saurabh | 2008 | | New existence Proofs for epsilon-nets
In: Proceedings of the twenty-fourth annual symposium on Computational geometry, 199-207 | Proceedings Article |
| Pyrga2009 | Pyrga, Evangelia
Chung, Christine | 2009 | | Stochastic Stability in Internet Router Congestion Games
In: Algorithmic Game Theory : Second International Symposium, SAGT 2009, 183-195 | Proceedings Article |
| PyrgaDipl05 | Pyrga, Evangelia | 2005 | | Shortest Paths in Time-Dependent Networks and their Applications
Universität des Saarlandes | Thesis - Masters thesis |
| PyrgaPhD2010 | Pyrga, Evangelia | 2010 | | Algorithmic Game Theory and Networks
Universität des Saarlandes | Thesis - PhD thesis |
| QianSWvZ12 | Qian, Jiawei
Schalekamp, Frans
Williamson, David P.
van Zuylen, Anke | 2012 | | On the Integrality Gap of the Subtour LP for the 1,2-TSP
In: LATIN 2012: Theoretical Informatics ; 10th Latin American Symposium, 606-617 | Proceedings Article |
| Rahul2001 | Ray, Rahul
Smid, MIchiel
Lange, Katharina
Wendt, Ulrich | 2002 | | Computing Large Planar Regions in Terrains
In: IWCIA 2001, 8th International Workshop on Combinatorial Image Analysis (IWCIA-01), 139-152 | Proceedings Article |
| Rahul2002a | Wendt, Ulrich
Lange, Katharina
Smid, Michiel
Ray, Rahul
Tönnies, Klaus-Dietz | 2002 | | Surface Topography Quantification by Integral and Feature-related Parameters
In: Materialwissenschaft und Werkstofftechnik [33], 621-627 | Journal Article |
| Rahul2002b | Agarwal, Pankaj
Hagerup, Torben
Ray, Rahul
Sharir, Micha
Smid, Michiel
Welzl, Emo | 2002 | | Translating a Planar Object to Maximize Point Containment
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 42-53 | Proceedings Article |
| Rahul2002c | Wendt, Ulrich
Lange, Katharina
Ray, Rahul
Smid, Michiel | 2001 | | Surface Topography Quantification using Computational Geometry | Miscellaneous |
| Rahul2002d | Ray, Rahul | 2002 | | An O(nlogn) Algorithm for Classifying Identical Curves | Miscellaneous |
| Rahul2003 | Smid, Michiel
Ray, Rahul
Wendt, Ulrich
Lange, Katharina | 2004 | | Computing Large Planar Regions in Terrains, with an Application to Fracture Surface
In: Discrete Applied Mathematics [139], 253-264 | Journal Article |
| Raman2009 | Elbassioni, Khaled
Raman, Rajiv
Ray, Saurabh
Sitters, Rene | 2009 | | On Profit-Maximizing Pricing for the Highway and Tollbooth Problems
In: Algorithmic Game Theory : Second International Symposium, SAGT 2009, 275-286
In: ArXiv.org [5814], 275-286 | Proceedings Article |
| Ramezani2010 | Iacono, G.
Ramezani, Fahimeh
Soranzo, N.
Altafani, C. | 2010 | | Determining the distance to monotonicity of a biological network: a graph-theoretical approach
In: IET Systems Biology [4], 223-235 | Journal Article |
| Ramezani2011 | Soranzo, Nicola
Ramezani, Fahimeh
Iacono, Giovanni
Altafini, Claudio | 2012 | | Decompositions of large-scale biological systems based on dynamical properties
In: Bioinformatics [28], 76-83 | Journal Article |
| Ramezani2013 | Elbassioni, Khaled M.
Makino, Kazuhisa
Mehlhorn, Kurt
Ramezani, Fahimeh | 2013 | | On Randomized Fictitious Play for Approximating Saddle Points over Convex Sets
In: 19th Annual International Computing and Combinatorics Conference (COCOON-13), 65-76 | Proceedings Article |
| Ramos00 | Ramos, Edgar A. | 2001 | | An Optimal Deterministic Algorithm for Computing the Diameter of a Three-Dimensional Point Set
In: Discrete and Computational Geometry [26], 233-244 | Journal Article |
| Ramos1999 | Ramos, Edgar A. | 1999 | | On range reporting, ray shooting and $k$-level construction
In: Proceedings of the 15th Annual Symposium on Computational Geometry (SCG-99), 390-399 | Proceedings Article |
| Ramos2000a | Amato, Nancy M.
Goodrich, Michael T.
Ramos, Edgar A. | 2000 | | Linear-Time Triangulation of a Simple Polygon Made Easier Via Randomization
In: Proceedings of the 16th Annual Symposium on Computational Geometry (SCG-00), 201-212 | Proceedings Article |
| Ramos2000b | Dey, Tamal K.
Mehlhorn, Kurt
Ramos, Edgar A. | 2000 | | Curve reconstruction: Connecting dots with good reason
In: Computational Geometry [15], 229-244 | Journal Article |
| Ramos2000c | Ramos, Edgar A. | 2000 | | Deterministic Algorithms for 3-D Diameter and some 2-D Lower Envelopes
In: Proceedings of the 16th Annual Symposium on Computational Geometry (SCG-00), 290-299 | Proceedings Article |
| Ramos2000d | Ramos, Edgar A. | 2000 | | Linear Programming Queries Revisited
In: Proceedings of the 16th Annual Symposium on Computational Geometry (SCG-00), 176-181 | Proceedings Article |
| Ramos2000e | Ramos, Edgar A.
Amato, Nancy M.
Goodrich, Michael T. | 2000 | | Computing the arrangement of curve segments: Divide-and-conquer algorithms via sampling
In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00), 705-706 | Proceedings Article |
| Ramos97 | Ramos, Edgar A. | 1997 | | Construction of 1-d lower envelopes and applications
In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 57-66 | Proceedings Article |
| Ramos97a | Ramos, Edgar A. | 1997 | | Intersection of unit-balls and diameter of a point set in R³
In: Computational Geometry Theory and Applications [8], 57-65 | Journal Article |
| RandCol2006 | Doerr, Benjamin | 2006 | | Non-independent randomized rounding and coloring
In: Discrete Applied Mathematics [154], 650-659 | Journal Article |
| Rasch94 | Rasch, Ronald | 1994 | | Furthest Site Abstract Voronoi Diagrams
Universität des Saarlandes | Thesis - PhD thesis |
| RatSanKni99 | Rathe, Ulrich
Sanders, Peter
Knight, Peter | 1999 | | A case study in scalability: an ADI method for the two-dimensional time-dependent Dirac equation
In: Parallel Computing [25], 525-534 | Journal Article |
| Rau97 | Rau, Stephan | 1997 | | Ein experimenteller Vergleich von zwei Algorithmen zur Berechnung des maximalen Flusses in einem asymmetrischen Netzwerk mit reellen Kapazitäten
Universität des Saarlandes | Thesis - Masters thesis |
| RaufDiss04 | Rauf, Imran | 2005 | | Earliest Arrival Flows with Multiple Sources
Universität des Saarlandes | Thesis - Masters thesis |
| RayDiss04 | Ray, Rahul | 2004 | | Geometric Algorithms for Object Placement and Planarity in a Terrain
Universität des Saarlandes | Thesis - PhD thesis |
| Ray/Diploma04 | Ray, Saurabh | 2004 | | Counting Straight-Edge Triangulations of Planar Point Sets
Universität des Saarlandes | Thesis - Masters thesis |
| Reichel2003 | Eisenbrand, Friedrich
Funke, Stefan
Reichel, Joachim
Schömer, Elmar | 2003 | | Packing a Trunk
In: Algorithms - ESA 2003: 11th Annual European Symposium, 618-629 | Proceedings Article |
| Reichel2005 | Eisenbrand, Friedrich
Funke, Stefan
Karrenbauer, Andreas
Reichel, Joachim
Schömer, Elmar | 2005 | | Packing a Trunk - now with a Twist!
In: Proceedings SPM 2005 ACM Symposium on Solid and Physical Modeling, 197-206 | Proceedings Article |
| ReichelDipl01 | Reichel, Joachim | 2001 | | Optimale Hüllkörper für Objekte mit gekrümmten Oberflächen
Universität des Saarlandes | Thesis - Masters thesis |
| Reinert94 | Reinert, Knut | 1994 | | Deferred Data Structuring
Universität des Saarlandes | Thesis - Masters thesis |
| ReinertDiss99 | Reinert, Knut | 1999 | | A polyhedral approach to sequence alignment problems
Universität des Saarlandes | Thesis - PhD thesis |
| Reinstaedtler-Dipl98 | Reinstädtler, Martin | 1998 | | Verlustfreie Datenkompression mit selbstorganisierenden Listen
Universität des Saarlandes | Thesis - Masters thesis |
| res_2010 | Emeliyanenko, Pavel | 2010 | | A complete modular resultant algorithm targeted for realization on graphics hardware
In: PASCO '10 : Proceedings of the 4th International Workshop on Parallel and Symbolic Computation, 35-43 | Proceedings Article |
| Rieger95 | Rieger, Joachim | 1995 | | Generic Evolutions of Edges on Families of Diffused Greyvalue Surfaces
In: Journal of Mathematical Imaging and Vision [5], 207-217 | Journal Article |
| rizkallah:2011:matching | Rizkallah, Christine | 2011 | | Maximum Cardinality Matching
In: Archive of Formal Proofs, | Electronic Journal Article |
| Roehrig1998Diplom | Röhrig, Hein | 1998 | | Tree Decomposition: A Feasibility Study
Universität des Saarlandes | Thesis - Masters thesis |
| Rottmann96 | Rottmann, Klaus-Dieter | 1996 | | Bewegung eines Polygons zwischen polygonalen Hindernisse
Universität des Saarlandes | Thesis - Masters thesis |
| RoundSmSub2006 | Doerr, Benjamin | 2006 | | Matrix Rounding With Respect to Small Submatrices
In: Random Structures & Algorithms [28], 107-112 | Journal Article |
| RSPM98 | Sanders, Peter
Reussner, Ralf
Prechelt, Lutz
Müller, Matthias | 1998 | | SKaMPI: A Detailed, Accurate MPI Benchmark
In: Proceedings of the 5th European PVM/MPI Users' Group Meeting, 52-59 | Proceedings Article |
| Rüb98 | Rüb, Christine | 1998 | | On Batcher's Merge Sorts as Parallel Sorting Algorithms
In: Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS-98), 410-420 | Proceedings Article |
| Rueb-1-97 | Rüb, Christine | 1997 | | On the average running time of odd-even merge sort
In: Journal of Algorithms [22], 329-346 | Journal Article |
| Rueb95 | Rüb, Christine | 1995 | | On the Average Running Time of Odd-Even Merge Sort
In: STACS95: 12th Annual Symposium on Theoretical Aspects of Computer Science, 491-501 | Proceedings Article |
| Ruppert1999 | Ruppert, Barbara | 1999 | | Polygontriangulierung in Linearzeit
Universität des Saarlandes | Thesis - Masters thesis |
| RusinovSchweitzer2010 | Rusinov, Momchil
Schweitzer, Pascal | 2010 | | Homomorphism -- homogeneous graphs
In: Journal of Graph Theory [65], 253-262 | Journal Article |
| s-cssl-03 | Schmitt, Susanne | 2003 | | Common Subexpression Search in LEDA_reals | Report |
| s-doran-03 | Schmitt, Susanne | 2003 | | The Diamond Operator for Real Algebraic Numbers | Report |
| Sabo1999 | Sabo, Holger | 1999 | | Ein schnelles Verfahren zur exakten Berechnung von Skalarprodukten
Universität des Saarlandes | Thesis - Masters thesis |
| Sagraloff-BitstreamComplexity2010a | Sagraloff, Michael | 2010 | | On the Complexity of Real Root Isolation
In: CoRR [abs/1011.0344], 1-33 | Electronic Journal Article |
| Sagraloff-BitstreamPrecision2011 | Sagraloff, Michael | 2010 | | A General Approach to Isolating Roots of a Bitstream Polynomial
In: Mathematics in Computer Science [4], 481-506 | Journal Article |
| SagraloffMPGJahrbuch2012 | Sagraloff, Michael | 2012 | | Exaktes geometrisches Rechnen | Miscellaneous |
| SagraloffYap:CEVAL:2011 | Sagraloff, Michael
Yap, Chee | 2011 | | A Simple But Exact and Efficient Algorithm for Complex Root Isolation
In: ISSAC 2011 : Proceedings of the 36th International Symposium on Symbolic and Algebraic Computation, 353-360 | Proceedings Article |
| Sagraloff_ISSAC_2012 | Sagraloff, Michael | 2012 | | When Newton meets Descartes: A Simple and Fast Algorithm to Isolate the Real Roots of a Polynomial
In: ISSAC 2012 : Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, 297-304 | Proceedings Article |
| Same2005 | Beldiceanu, Nicolas
Katriel, Irit
Thiel, Sven | 2007 | | Filtering Algorithms for the Same and UsedBy Constraints
In: Archives of Control Sciences [to appear], to appear | Journal Article |
| SameCPAIOR2004 | Beldiceanu, Nicolas
Katriel, Irit
Thiel, Sven | 2004 | | Filtering algorithms for the Same constraint
In: Integration of AI and OR techniques in constraint programming for combinatorial optimization problems : First International Conference, CPAIOR 2004, 65-79 | Proceedings Article |
| San2001a | Sanders, Peter | 2001 | | Reconciling Simplicity and Realism in Parallel Disk Models
In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), 67-76 | Proceedings Article |
| San98b | Sanders, Peter | 1998 | | Tree Shaped Computations as a Model for Parallel Applications
In: Anwendungsbezogene Lastverteilung (ALV), 123-132 | Proceedings Article |
| San98c | Sanders, Peter | 1998 | | Random Permutations on Distributed, External and Hierarchical Memory
In: Information Processing Letters [67], 305-309 | Journal Article |
| San98d | Sanders, Peter | 1998 | | Random Permutations on Distributed, External and Hierarchical Memory
In: PARS-Mitteilungen, 160-165
In: PARS-Mitteilungen [1998], 160-165 | Journal Article |
| San99a | Sanders, Peter | 1999 | | Fast Priority Queues for Cached Memory
In: Selected papers of the International Workshop on Algorithm Engineering and Experimentation (ALENEX-99), 312-327 | Proceedings Article |
| San99b | Sanders, Peter
Takkula, Tuomo
Wedelin, Dag | 1999 | | High performance integer optimization for crew scheduling
In: Proceedings of the 7th International Conference on High-Performance Computing and Networking Europe (HPCN Europe-99), 3-12 | Proceedings Article |
| San99c | Sanders, Peter | 1999 | | Accessing Multiple Sequences Through Set Associative Caches
In: Proceedings of the 26th International Colloquium on Automata, Languages and Programming (ICALP-99), 655-664 | Proceedings Article |
| San99d | Sanders, Peter | 1999 | | Asynchronous Random Polling Dynamic Load Balancing
In: Algorithms and computation : 10th International Symposium, ISAAC'99, 37-48 | Proceedings Article |
| San99e | Sanders, Peter | 1999 | | Berechnungen mit großen Datenmengen
In: Jahrbuch der Max-Planck-Gesellschaft 1999, 534-540 | Part of a Book |
| Sand98a | Sanders, Peter | 1998 | | Randomized Priority Queues for Fast Parallel Access
In: Journal Parallel and Distributed Computing [49], 86-97 | Journal Article |
| Sanders1999 | Sanders, Peter | 1999 | | Analysis of nearest neighbor load balancing algorithms for random loads
In: Parallel Computing [25], 1013-1033 | Journal Article |
| Sanders2000 | Sanders, Peter | 2000 | | Fast Priority Queues for Cached Memory
In: Journal of Experimental Algorithmics [5], 1-25 | Electronic Journal Article |
| Sanders2000a | Sanders, Peter
Solis-Oba, Roberto | 2000 | | How Helpers Hasten h-Relations
In: Algorithms - ESA 2000, Proceedings of the 8th Annual European Symposium (ESA-00), 392-402 | Proceedings Article |
| Sanders2000b | Sanders, Peter | 2000 | | Asynchronous Scheduling of Redundant Disk Arrays
In: Proceedings of the 12th Annual ACM Symposium on Parallel Algorithms and Architecture (SPAA-00), 89-98 | Proceedings Article |
| Sanders2002 | Sanders, Peter
Träff, Jesper Larsson | 2002 | | The factor algorithm for regular all-to-all communication on clusters of SMP nodes
In: Proceedings of the 8th International Euro-Par Conference, 799-803 | Proceedings Article |
| Sanders2002a | Bader, David
Moret, Bernard
Sanders, Peter | 2002 | | Algorithm Engineering for Parallel Computation
In: Experimental Algorithmics, 1-23 | Part of a Book |
| Sanders2002b | McGeoch, Catherine
Sanders, Peter
Fleischer, Rudolf
Cohen, Paul R.
Precup, Doina | 2002 | | Using Finite Experiments to Study Asymptotic Performance
In: Experimental Algorithmics, 93-126 | Part of a Book |
| Sanders2002c | Sanders, Peter | 2002 | | Presenting Data from Experiments in Algorithmics
In: Experimental Algorithmics, 181-196 | Part of a Book |
| Sanders2002d | Sanders, Peter | 2002 | | Randomized Receiver Initiated Load Balancing Algorithms for Tree Shaped Computations
In: The Computer Journal [45], 561-573 | Journal Article |
| Sanders2002e | Sanders, Peter
Vollmar, R.
Worsch, T. | 2002 | | Feasible models of computation: Three-dimensionality and energy consumption
In: Fundamenta Informaticae [52], 233-248 | Journal Article |
| Sanders2002f | Niedermeier, Rolf
Reinhard, Klaus
Sanders, Peter | 2002 | | Towards Optimal Locality in Mesh-Indexings
In: Discrete Applied Mathematics [117], 211-237 | Journal Article |
| Sanders2002g | Sanders, Peter
Vöcking, Berthold | 2002 | | Random Arc Allocation and Applications to Disks, Drums and DRAMs
In: Algorithm theory, SWAT 2002 : 8th Scandinavian Workshop on Algorithm Theory, 121-130 | Proceedings Article |
| Sanders2002h | Beier, Rene
Sanders, Peter
Sivadasan, Naveen | 2002 | | Energy Optimal Routing in Radio Networks Using Geometric Data Structures
In: Automata, Languages and Programming : 29th International Colloquium, ICALP 2002, 366-376 | Proceedings Article |
| Sanders2002i | Sanders, Peter | 2002 | | Reconciling simplicity and realism in parallel disk models
In: Parallel Computing [28], 705-723 | Journal Article |
| Sanders2003 | Sanders, Peter | 2003 | | Asynchronous Scheduling of Redundant Disk Arrays
In: IEEE Transactions on Computers [52], 1170-1184 | Journal Article |
| Sanders2004a | Sanders, Peter | 2004 | | Algorithms for Scalable Storage Servers
In: SOFSEM 2004 : theory and practice of computer science ; 30th Conference on Current Trends in Theory and Practice of Computer Science, 82-101 | Proceedings Article |
| Sanders2005 | Hutchinson, David A.
Sanders, Peter
Vitter, Jeffrey Scott | 2005 | | Duality Between Prefetching and Queued Writing with Parallel Disks
In: SIAM Journal on Computing [34], 1443-1463 | Journal Article |
| Sanders2005b | Fotakis, Dimitris
Pagh, Rasmus
Sanders, Peter
Spirakis, Paul G. | 2005 | | Space Efficient Hash Tables With Worst Case Constant Access Time
In: Theory of Computing Systems [38], 229-248 | Journal Article |
| SandersPettie2004 | Sanders, Peter
Pettie, Seth | 2004 | | A Simpler Linear Time 2/3 - epsilon Approximation for Maximum
Weight Matching
| Report |
| SandersWinkel2004 | Sanders, Peter | 2004 | | Super Scalar Sample Sort
In: Algorithms – ESA 2004: 12th Annual European Symposium, 784-796 | Proceedings Article |
| SanEgnKor2000 | Sanders, Peter
Egner, Sebastian
Korst, Jan | 2000 | | Fast Concurrent Access to Parallel Disks
In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00), 849-858 | Proceedings Article |
| SanSib03 | Sanders, Peter
Sibeyn, Jop F. | 2003 | | A Bandwidth Latency Tradeoff for Broadcast and Reduction
In: Information Processing Letters [86], 33-38 | Journal Article |
| SanSib2000 | Sanders, Peter
Sibeyn, Jop F. | 2000 | | A Bandwidth Latency Tradeoff for Broadcast and Reduction
In: Euro-Par 2000 Parallel Processing, Proceedings of the 6th International Euro-Par Conference (Euro-Par-00), 918-926 | Proceedings Article |
| SanSol2001 | Sanders, Peter
Solis-Oba, Roberto | 2001 | | How Helpers Hasten h-Relations
In: Journal of Algorithms [41], 86-98 | Journal Article |
| SanSte2005 | Sanders, Peter
Steurer, David | 2005 | | An Asymptotic Approximation Scheme for Multigraph Edge Coloring
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 897-906 | Proceedings Article |
| SanVoe03 | Sanders, Peter
Vöcking, Berthold | 2003 | | Tail bounds and expectations for random arc allocation and applications
In: Combinatorics, Probability and Computing [12], 225-244 | Journal Article |
| SaSiSt13 | Sanders, Peter
Singler, Johannes
van Stee, Rob | 2013 | | Real-time prefetching and caching
In: Journal of Scheduling [16], 47-58 | Journal Article |
| Sauerwald2010 | Sauerwald, Thomas
Stauffer, Alexandre | 2011 | | Rumor Spreading and Vertex Expansion on Regular Graphs
In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 462-475 | Proceedings Article |
| scg89 | Mehlhorn (ed.) | 1989 | | Proceedings of the fifth annual symposium on Computational geometry
1989 (SCG '89) | Proceedings |
| SCG90*216 | Fleischer, Rudolf
Mehlhorn, Kurt
Rote, Günter
Welzl, Emo
Yap, Chee-Keng | 1990 | | On Simultaneous Inner and Outer Approximation of Shapes
In: Computational geometry (SCG-90) : 6th annual symposium, 216-224 | Proceedings Article |
| SCG90*281 | Alt, Helmut
Fleischer, Rudolf
Kaufmann, Michael
Mehlhorn, Kurt
Näher, Stefan
Schirra, Stefan
Uhrig, Christian | 1990 | | Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures
In: Computational geometry (SCG-90) : 6th annual symposium, 281-289 | Proceedings Article |
| Schaefer2000 | Schäfer, Guido | 2000 | | Weighted Matchings in General Graphs
Universität des Saarlandes | Thesis - Masters thesis |
| Schäfer04 | Schäfer, Guido | 2004 | | Worst case instances are fragile: average case and smoothed competitive analysis of algorithms
Universität des Saarlandes | Thesis - PhD thesis |
| Schäfer2003 | Becchetti, Luca
Leonardi, Stefano
Marchetti-Spaccamela, Alberto
Schäfer, Guido
Vredeveld, Tjark | 2003 | | Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm
In: 44th Annual Symposium on Foundations of Computer Science (FOCS-03), 462-471 | Proceedings Article |
| SchalekampWvZ12 | Schalekamp, Frans
Williamson, David P.
van Zuylen, Anke | 2012 | | A proof of the Boyd-Carr conjecture
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 1477-1486 | Proceedings Article |
| SchanneDipl01 | Schanne, Thomas | 2001 | | Visualisierung der Dialektgeographie und Topographie im deutschen Dialektraum
Universität des Saarlandes | Thesis - Masters thesis |
| SchilzPhD2000 | Schilz, Thomas | 2000 | | Effiziente Algorithmen für das verteilte Rechnen auf Workstation-Clustern
Universität des Saarlandes | Thesis - PhD thesis |
| Schirra-et-al-1-96 | Devillers, Olivier
Golin, Mordecai J.
Kedem, Klara
Schirra, Stefan | 1996 | | Queries on Voronoi Diagrams of Moving Points
In: Computational Geometry. Theory and Applications [5], 315-327 | Journal Article |
| Schirra-et-al-2-96 | Fabri, Andreas
Giezeman, Geert-Jan
Kettner, Lutz
Schirra, Stefan
Schönherr, Sven | 1996 | | The CGAL Kernel: A Basis for Geometric Computation
In: Applied Computational Geometry: Towards Geometric Engineering Proceedings (WACG'96), 191-202 | Proceedings Article |
| Schirra-et-al-3-96 | Krithivasan, Kamala
Rema, Anna
Schirra, Stefan
Vijaykumar, P.I. | 1996 | | Velocity planning for a robot moving along the shortest straight line path among moving obstacles
In: Canadian Conference on Computational Geometry (CCCG '96), 149-154 | Proceedings Article |
| Schirra1999 | Mehlhorn, Kurt
Schirra, Stefan | 2000 | | Geometric Computing with CGAL and LEDA
In: Curve and surface design, Saint-Malo 1999, 277-286 | Proceedings Article |
| Schirra1999a | Schirra, Stefan | 1999 | | A Case Study on the Cost of Geometric Computing
In: Selected papers of the International Workshop on Algorithm Engineering and Experimentation (ALENEX-99), 156-176 | Proceedings Article |
| Schirra2000 | Schirra, Stefan | 2000 | | Robustness and Precision Issues in Geometric Computation
In: Handbook of Computational Geometry, 597-632 | Part of a Book |
| Schirra2000DesignCGAL | Fabri, Andreas
Giezeman, Geert-Jan
Kettner, Lutz
Schirra, Stefan
Schönherr, Sven | 2000 | | On the Design of CGAL, a computational geometry algorithms library
In: Software - Practice and Experience [30], 1167-1202 | Journal Article |
| Schirra2000GenericProgramming | Brönnimann, Hervé
Kettner, Lutz
Schirra, Stefan
Veltkamp, Remco | 2000 | | Applications of the Generic Programming Paradigm in the Design of CGAL
In: Generic programming - International Seminar on Generic Programming Dagstuhl Castle, Germany, April 27 - May 1, 1998, selected papers, 206-216 | Part of a Book |
| Schirra2001EdgeColoring | Cole, Richard
Ost, Kirstin
Schirra, Stefan | 2001 | | Edge-Coloring Bipartite Multigraphs in O(E log D) Time
In: Combinatorica [21], 5-12 | Journal Article |
| Schirra97a | Schirra, Stefan | 1997 | | Precision and Robustness in Geometric Computations
In: Algorithmic Foundations of Geographic Information Systems, 255-287 | Part of a Book |
| Schirra97b | Schwerdt, Jörg
Smid, Michiel
Schirra, Stefan | 1997 | | Computing the Minimum Diameter for Moving Points: An Exact Implementation using Parametric Search
In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 466-468 | Proceedings Article |
| Schirra97c | Schwerdt, Jörg
Smid, Michiel
Schirra, Stefan | 1997 | | Computing the Minimum Diameter for Moving Points: An Exact Implementation using Parametric Search
In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 466-468 | Proceedings Article |
| Schirra_habil | Schirra, Stefan | 1998 | | Computational Geometry: Theory and Implementation
Universität des Saarlandes | Thesis - Habilitation thesis |
| Schmidt2012 | Schmidt, Jens M. | 2012 | | Construction Sequences and Certifying 3-Connectivity
In: Algorithmica [62], 192-208 | Journal Article |
| Schmidt2012a | Schmidt, Jens M.
Valtr, Pavel | 2012 | | Cubic Plane Graphs on a Given Point Set
In: Proceedings of the Twenty-Eighth Annual Symposium on Computational Geometry (SCG'12), 201-208 | Proceedings Article |
| Schmidt2012b | Schmidt, Jens M. | 2012 | | Certifying 3-Connectivity in Linear Time
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 786-797 | Proceedings Article |
| Schmidt2013 | Schmidt, Jens M. | 2013 | | Contractions, Removals and Certifying 3-Connectivity in Linear Time
In: SIAM Journal on Computing [42], 494-535 | Journal Article |
| Schmidt2013 | Schmidt, Jens M. | 2013 | | Contractions, Removals and How to Certify 3-Connectivity in Linear Time | Unpublished/Draft |
| Schmidt2013a | Schmidt, Jens M. | 2013 | | A Simple Test on 2-Vertex- and 2-Edge-Connectivity
In: Information Processing Letters [113], 241-244 | Journal Article |
| Schmidt2013b | Schmidt, Jens M. | 2013 | | A Planarity Test via Construction Sequences
In: 38th International Symposium on Mathematical Foundations of Computer Science (MFCS'13), 765-776 | Proceedings Article |
| Schmitt04a | Schmitt, Susanne | 2004 | | Improved separation bounds for the diamond operator | Report |
| Schmitt04b | Schmitt, Susanne | 2004 | | Common Subexpression Search in LEDA_reals -- a study of the diamond-operator | Report |
| Schmitt2003 | Schmitt, Susanne
Zimmer, Horst G. | 2003 | | Elliptic Curves : A Computational Approach | Book |
| Schmitt2005 | Schmitt, Susanne | 2005 | | The diamond operator - Implementation of exact real algebraic numbers
In: Computer Algebra in Scientific Computing, 8th International Workshop, CASC 2005, 355-366 | Proceedings Article |
| SchmittFoussee2004 | Schmitt, Susanne
Fousse, Laurent | 2004 | | A comparison of polynomial evaluation schemes | Report |
| Schmitz95 | Schmitz, Christoph | 1995 | | Analyse von Branch-and-Bound Algorithmen zum Problem des Handlungsreisenden
Universität des Saarlandes | Thesis - Masters thesis |
| Schoemer-Thiel95 | Schömer, Elmar
Thiel, Christian | 1995 | | Efficient Collision Detection for Moving Polyhedra
In: 11th Annual ACM Symposium on Computational Geometry (SCG95), 51-60 | Proceedings Article |
| Schröder98 | Schröder, Bianca | 1998 | | Upper and Lower Bounds for Basic Scheduling Problems
Universität des Saarlandes | Thesis - Masters thesis |
| SchulteDipl01 | Schulte, Ralph | 2001 | | Exaktes Lösen von Linearen Programmen
Universität des Saarlandes | Thesis - Masters thesis |
| SchultesDipl05 | Schultes, Dominik | 2005 | | Fast and Exact Shortest Path Queries Using Highway Hierachies
Universität des Saarlandes | Thesis - Masters thesis |
| Schwarz-et-al95a | Evans, B.L.
Schwarz, Christian
Teich, Jürgen | 1995 | | Automated design of two-dimensional rational decimation systems
In: Proceedings of IEEE Asilomar Conference on Signals, Systems, and Computers, 498-502 | Proceedings Article |
| Schwarz-et-al95b | Evans, Brian
Schwarz, Christian
Teich, Jürgen
Vainshtein, Alek
Welzl, Emo | 1995 | | Minimal enclosing parallelogram with application
In: 11th Annual ACM Symposium on Computational Geometry (SCG95), C34-C35 | Proceedings Article |
| Schwarz-Smid-et-al95 | Golin, Mordecai J.
Raman, Rajeev
Schwarz, Christian
Smid, Michiel | 1995 | | Simple randomized algorithms for closest pair problems
In: Nordic Journal of Computing [2], 3-27 | Journal Article |
| Schwarzenecker95 | Schwarzenecker, Erik | 1995 | | Ein NP-schweres Plazierungsproblem
Universität des Saarlandes | Thesis - PhD thesis |
| Schwarzetal2009 | Schwarz, Karsten
Karrenbauer, Andreas
Schehr, Gregory
Rieger, H. | 2009 | | Domain walls and chaos in the disordered SOS model
In: Journal of statistical mechanics : theory and experiment [P08022], 1-23 | Electronic Journal Article |
| Schweitzer2008 | Schweitzer, Pascal | 2009 | | Using the Incompressibility Method to obtain Local Lemma results for Ramsey-type Problems
In: Information Processing Letters [109], 229-232 | Journal Article |
| SchweitzerPhD2009 | Schweitzer, Pascal | 2009 | | Problems of Unknown Complexity: Graph isomorphism and Ramsey theoretic numbers
Universität des Saarlandes | Thesis - PhD thesis |
| SchweitzerSchweitzer2010 | Schweitzer, Pascal
Schweitzer, Patrick | 2010 | | Connecting face hitting sets in planar graphs
In: Information Processing Letters [111], 11-15 | Journal Article |
| Seel94 | Seel, Michael | 1994 | | Eine Implementierung abstrakter Voronoidiagramme
Universität des Saarlandes | Thesis - Masters thesis |
| SeelDiss01 | Seel, Michael | 2001 | | Planar Nef Polyhedra and Generic Higher-dimensional Geometry
Universität des Saarlandes | Thesis - PhD thesis |
| Seiden1999 | Seiden, Steve S. | 1999 | | Randomized online scheduling with delivery times
In: Journal of Combinatorial Optimization [3], 399-416 | Journal Article |
| Seiden2000 | Seiden, Steve S. | 2000 | | Online randomized multiprocessor scheduling
In: Algorithmica [28], 173-216 | Journal Article |
| selection07 | Friedrich, Tobias
Hebbinghaus, Nils
Neumann, Frank | 2007 | | Rigorous Analyses of Simple Diversity Mechanisms
In: Genetic and Evolutionary Computation Conference 2007, 1219-1225 | Proceedings Article |
| Semeloglou2000 | Semeloglou, Anastasios | 2000 | | Kürzeste Wege in planare Graphen. Implementierung eines parallelen Algorithmus mithilfe von PAD
Universität des Saarlandes | Thesis - Masters thesis |
| SemKiel | Doerr, Benjamin
Gnewuch, Michael | 2006 | | Construction of low-discrepancy point sets of small size by bracketing covers and dependent randomized rounding | Report |
| SET03 | Sanders, Peter
Egner, Sebastian
Tolhuizen, Ludo | 2003 | | Polynomial Time Algorithms For Network Information Flow
In: Proceedings of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA-03), 286-294 | Proceedings Article |
| setcover07 | Friedrich, Tobias
Hebbinghaus, Nils
Neumann, Frank | 2007 | | Plateaus Can Be Harder in Multi-Objective Optimization
In: IEEE Congress on Evolutionary Computation 2007, 2622-2629 | Proceedings Article |
| Sharma2008 | Sharma, Vikram | 2008 | | Complexity of real root isolation using continued fractions
In: Theoretical Computer Science [409], 292-310 | Electronic Journal Article |
| Shervashidze2011 | Shervashidze, Nino
Schweitzer, Pascal
van Leeuwen, Erik Jan
Mehlhorn, Kurt
Borgwardt, Karsten M. | 2011 | | Weisfeiler-Lehman graph kernels
In: Journal of Machine Learning Research [12], 2539-2561 | Journal Article |
| Shiva-Dubhashi95 | Chaudhuri, Shiva
Dubhashi, Devdatt | 1995 | | Probabilistic Recurrence Relations Revisited
In: LATIN'95: Theoretical Informatics, Second Latin American Symposium, 207-219 | Proceedings Article |
| Shiva-Hagerup95 | Chaudhuri, Shiva
Hagerup, Torben | 1995 | | Prefix Graphs and their Applications
In: Graph-theoretic Concepts in Computer Science: 20th International Workshop (WG94), 206-218 | Proceedings Article |
| Shiva-Zaro-1-95 | Chaudhuri, Shiva
Zaroliagis, Christos | 1995 | | Shortest Path Queries in Digraphs of Small Treewidth
In: Automata, Languages, and Programming: 22nd International Colloquium (ICALP95), 244-255 | Proceedings Article |
| Shiva-Zaro-2-95 | Chaudhuri, Shiva
Zaroliagis, Christos | 1995 | | Optimal Parallel Shortest Paths in Small Treewidth Digraphs
In: Algorithms - ESA'95: 3rd Annual European Symposium, 31-45 | Proceedings Article |
| SiAbMe02 | Sibeyn, Jop F.
Abello, James
Meyer, Ulrich | 2002 | | Heuristics for Semi-External Depth First Search on Directed Graphs
In: SPAA 2002 : Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 282-292 | Proceedings Article |
| Sibeyn-et-al-1-96 | Sibeyn, Jop F. | 1996 | | List Ranking on Interconnection Networks
In: 2nd Euro-Par Conference, 529-541 | Proceedings Article |
| Sibeyn-et-al-1-97 | Sibeyn, Jop F.
Kaufmann, Michael
Chlebus, Bogdan S. | 1997 | | Deterministic Permutation Routing on Meshes
In: Journal of Algorithms [22], 111-141 | Journal Article |
| Sibeyn-et-al-2-96 | Sibeyn, Jop F. | 1996 | | Routing on Triangles, Tori and Honeycombs
In: Mathematical Foundations of Computer Science 1996: 21st International Symposium (MFCS'96), 529-541 | Proceedings Article |
| Sibeyn-et-al-3-96 | Juurlink, Ben
Sibeyn, Jop F.
Rao, P. Srinivasa | 1996 | | Worm-Hole Gossiping on Meshes and Tori
In: 2nd Euro-Par Conference, 361-369 | Proceedings Article |
| Sibeyn-et-al96 | Preetham, A. J.
Krithivasan, Kamala
Rangan, C. Pandu
Sibeyn, Jop F. | 1996 | | Parallel algorithm for maximum empty L-shaped polygon
In: 3rd Conference on High-Performance Computing, - | Proceedings Article |
| Sibeyn-Kaufmann97 | Kaufmann, Michael
Sibeyn, Jop F. | 1997 | | Randomized Multipacket Routing and Sorting on Meshes
In: Algorithmica [17], 224-244 | Journal Article |
| Sibeyn2000 | Sibeyn, Jop F. | 2000 | | Solving fundamental problems on sparse-meshes
In: IEEE Transactions on Parallel & Distributed Systems [11], 1324-1332 | Journal Article |
| Sibeyn95 | Sibeyn, Jop F. | 1995 | | Sample Sort on Meshes
In: Proceedings of Computing Science in the Netherlands, SION, 217-228 | Proceedings Article |
| Sibeyn97a | Sibeyn, Jop F. | 1997 | | Better Trade-offs for Parallel List Ranking
In: Proceedings of the 9th Symposium on Parallel Algorithms and Architectures (SPAA-97), 221-230 | Proceedings Article |
| Sibeyn97b | Sibeyn, Jop F. | 1997 | | Routing on Triangles, Tori and Honeycombs
In: International Journal on the Foundations of Computer Science [8], 269-287 | Journal Article |
| Sibeyn97c | Sibeyn, Jop F. | 1997 | | Routing with Finite Speeds of Memory and Network
In: Proceedings of the 22nd Symposium on the Mathematical Foundations of Computer Science (MFCS-97), 488-497 | Proceedings Article |
| Sibeyn97d | Sibeyn, Jop F. | 1997 | | Sample Sort on Meshes
In: Proceedings of the 3rd International Euro-Par Conference on Parallel Processing (Euro-Par-97), 389-398 | Proceedings Article |
| Sibeyn97e | Sibeyn, Jop F.
Kaufmann, Michael | 1997 | | Randomized Multipacket Routing and Sorting on Meshes
In: Algorithmica [17], 224-244 | Journal Article |
| SibeynGuillaumeSeidel1997 | Sibeyn, Jop F.
Guillaume, Frank
Seidel, Tillmann | 1997 | | Practical Parallel List Ranking
In: Proceedings of the 4th Symposium on Solving Irregularly Structured Problems in Parallel (IRREGULAR-97), 25-36 | Proceedings Article |
| SibeynGuillaumeSeidel99 | Sibeyn, Jop F.
Guillaume, Frank
Seidel, Tillmann | 1999 | | Practical Parallel List Ranking
In: Journal of Parallel and Distributed Computing [56], 156-180 | Journal Article |
| SibeynKaufmann1997 | Sibeyn, Jop F.
Kaufmann, Michael | 1997 | | BSP-Like External-Memory Computation
In: Proceedings of the 3rd Italian Conference on Algorithms and Complexity (CIAC-97), 229-240 | Proceedings Article |
| SICOMP::AltHMP1987 | Alt, Helmut
Hagerup, Torben
Mehlhorn, Kurt
Preparata, Franco P. | 1987 | | Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
In: SIAM Journal on Computing [16], 808-835 | Journal Article |
| SICOMP::MehlhornNA1988 | Mehlhorn, Kurt
Näher, Stefan
Alt, Helmut | 1988 | | A Lower Bound on the Complexity of the Union-Split-Find Problem
In: SIAM Journal on Computing [17], 1093-1102 | Journal Article |
| SICOMP::MehlhornT1986 | Mehlhorn, Kurt
Tsakalidis, Athanasios K. | 1986 | | An Amortized Analysis of Insertions into AVL-Trees
In: SIAM Journal on Computing [15], 22-33 | Journal Article |
| Sitters2005 | Sitters, Rene | 2005 | | Complexity of preemptive minsum scheduling on unrelated parallel machines
In: Journal of Algorithms [57], 37-48 | Journal Article |
| Sitters2005b | Elbassioni, Khaled M.
Fishkin, Aleksei V.
Mustafa, Nabil H.
Sitters, Rene | 2005 | | Approximation algorithms for Euclidean Group TSP
In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, 1115-1126 | Proceedings Article |
| Sitters2006 | Bodlaender, Hans L.
Feremans, Corinne
Grigoriev, Alexander
Penninkx, Eelko
Sitters, Rene
Wolle, Thomas | 2006 | | On the minimum corridor connection and other generalized geometric problems
In: 4th Workshop on Approximation and Online Algorithms, WAOA, 69-82 | Proceedings Article |
| Sitters2006a | Feremans, Corinne
Grigoriev, Alexander
Sitters, Rene | 2006 | | The geometric generalized minimum spanning tree problem with grid clustering
In: 4OR: A Quarterly Journal of Operations Research [4], 319-329 | Journal Article |
| Sitters2006b | Sitters, Rene
Stougie, Leen | 2006 | | The general two-server problem
In: Journal of the ACM [53], 437-458 | Journal Article |
| Sitters2006c | Grigoriev, Alexander
van Loon, Joyce
Sitters, Rene
Uetz, Marc | 2006 | | How to Sell a Graph: Guidelines for Graph Retailers
In: Graph-Theoretic Concepts in Computer Science : 32nd International Workshop, WG 2006, 125-136 | Proceedings Article |
| Sitters2006d | Bartal, Yair
Leonardi, Stefano
Shallom, Gill
Sitters, Rene | 2006 | | On the value of preemption in scheduling
In: 9th Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX, 39-48 | Proceedings Article |
| Sivadas2003 | Adler, Micah
Räcke, Harald
Sivadasan, Naveen
Sohler, Christian
Vöcking, Berthold | 2003 | | Randomized Pursuit-Evasion in Graphs
In: Combinatorics, Probability and Computing [12], 225-244 | Journal Article |
| Sivadasan2004 | Schäfer, Guido
Sivadasan, Naveen | 2004 | | Topology matters: Smoothed competitiveness of metrical task systems
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 489-500 | Proceedings Article |
| Sivadasan2004-2 | Sanders, Peter
Sivadasan, Naveen
Skutella, Martin | 2004 | | Online scheduling with bounded migration
In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, 1111-1122 | Proceedings Article |
| Sivadasan2009 | Sanders, Peter
Sivadasan, Naveen
Skutella, Martin | 2009 | | Online scheduling with bounded migration
In: Mathematics of Operations Research [34], 481-498 | Journal Article |
| SivadasanDiss04 | Sivadasan, Naveen | 2004 | | Online Problems and Two-Player Games: Algorithms and Analysis
Universität des Saarlandes | Thesis - PhD thesis |
| SivadasanSandersSkutella2004 | Sivadasan, Naveen
Sanders, Peter
Skutella, Martin | 2004 | | Online Scheduling with Bounded Migration | Report |
| SKH-CCRI-2009 | Sagraloff, Michael
Kerber, Michael
Hemmer, Michael | 2009 | | Certified Complex Root Isolation via Adaptive Root Separation Bounds
In: The Joint Conference of ASCM 2009 and MACIS 2009, 151-166 | Proceedings Article |
| Skutella2003 | Fekete, Sandor P.
Skutella, Martin
Woeginger, Gerhard J. | 2003 | | The complexity of economic equilibria for house allocation markets
In: Information Processing Letters [88], 219-223 | Journal Article |
| Smid-et-al-1-95 | Follert, Frank
Schömer, Elmar
Sellen, Jürgen
Smid, Michiel
Thiel, Christian | 1995 | | Computing a largest empty anchored cylinder, and related problems
In: Foundations of Software Technology and Theoretical Computer Science: 15th Conference, 428-442 | Proceedings Article |
| Smid95 | Smid, Michiel | 1995 | | Dynamic rectangular point location, with an application to the closest pair problem
In: Information and Computation [16], 1-9 | Journal Article |
| SODATO2004 | Katriel, Irit
Bodlaender, Hans L. | 2005 | | Online Topological Ordering
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 443-450 | Proceedings Article |
| Solis-Oba1998a | Solis-Oba, Roberto | 1998 | | 2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 441-452 | Proceedings Article |
| Solis-Oba1998b | Solis-Oba, Roberto
Frederickson, Greg N. | 1998 | | Rooted Spanning Trees with Small Weight and Average Length
In: Theoretical Computer Science, 114-125 | Proceedings Article |
| Solis-Oba1999a | Solis-Oba, Roberto
Jansen, Klaus
Sviridenko, Maxim | 1999 | | Makespan minimization in job shops: a polynomial time approximation scheme
In: Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC-99), 394-399 | Proceedings Article |
| Solis-Oba1999f | Solis-Oba, Roberto
Jansen, Klaus
Sviridenko, Maxim | 1999 | | 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), 177-188 | Proceedings Article |
| Solis-Oba1999h | Krysta, Piotr
Solis-Oba, Roberto | 1999 | | Approximation algorithms for bounded facility location
In: Proceedings of the 5th Annual International Conference on Computing and Combinatorics (COCOON-99), 241-250 | Proceedings Article |
| Son1999 | Son, Jung-Bae | 1999 | | Berechnung konvexer Hüllen in erwarteter Linearzeit
Universität des Saarlandes | Thesis - Masters thesis |
| Spoehel2011 | Mütze, Torsten
Rast, Thomas
Spöhel, Reto | 2011 | | Coloring random graphs online without creating monochromatic subgraphs
In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), 145-158 | Proceedings Article |
| Spoehel2011a | Gugelmann, Luca
Spöhel, Reto | 2011 | | On balanced coloring games in random graphs
In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 425-430 | Electronic Proceedings Article |
| Spoehel2011b | Mütze, Torsten
Spöhel, Reto | 2011 | | On the path-avoidance vertex-coloring game
In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 657-662 | Electronic Proceedings Article |
| Spoehel2011c | Panagiotou, Konstantinos
Spöhel, Reto
Steger, Angelika
Thomas, Henning | 2011 | | Explosive percolation in Erdős-Rényi-like random graph processes
In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 699-704 | Electronic Proceedings Article |
| Spoehel2011d | Mütze, Torsten
Spöhel, Reto | 2011 | | On the path-avoidance vertex-coloring game
In: The Electronic Journal of Combinatorics [18], 1-33 | Electronic Journal Article |
| SpoehelBM2012 | Belfrage, Michael
Mütze, Torsten
Spöhel, Reto | 2012 | | Probabilistic one-player Ramsey games via deterministic two-player games
In: SIAM Journal on Discrete Mathematics [26], 1031-1049 | Journal Article |
| SpoehelK2012 | Krivelevich, Michael
Spöhel, Reto | 2012 | | Creating small subgraphs in Achlioptas processes with growing parameter
In: SIAM Journal on Discrete Mathematics [26], 670-686 | Journal Article |
| SpoehelPST2013 | Panagiotou, Konstantinos
Spöhel, Reto
Steger, Angelika
Thomas, Henning | 2013 | | Explosive percolation in Erdös-Rényi-like random graph processes
In: Combinatorics, Probability and Computing [22], 133-145 | Journal Article |
| Srivastava96 | Srivastava, Satanand | 1996 | | Entwicklung und Implementierung eines Entscheidungsalgorithmus zur Zuordnung von Probleminstanzen an Hierarchieebenen
Universität des Saarlandes | Thesis - Masters thesis |
| SRWLSM02 | Schömer, Elmar
Reichel, Joachim
Warken, Thomas
Lennerz, Christian | 2002 | | Efficient Collision Detection for Curved Solid Objects
In: Proceedings of the Seventh ACM Symposium on Solid Modeling and Applications, 321-328 | Proceedings Article |
| SSS12 | Saha, Chandan
Saptharishi, Ramprasad
Saxena, Nitin | 2013 | | A Case of Depth-3 Identity Testing, Sparse Factorization and Duality
In: Computational Complexity [22], 39-69 | Electronic Journal Article |
| SSS13 | Agrawal, Manindra
Saha, Chandan
Saxena, Nitin | 2013 | | A Case of Depth-3 Identity Testing, Sparse Factorization and Duality
In: 45th ACM Symposium on the Theory of Computing (STOC-13), toappear | Proceedings Article |
| stacs07_rand | Doerr, Benjamin | 2007 | | Randomly Rounding Rationals with Cardinality Constraints and Derandomizations
In: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, 441-452 | Proceedings Article |
| STACS::KaufmannM1987 | Kaufmann, Michael
Mehlhorn, Kurt | 1987 | | On Local Routing of Two-Terminal Nets
In: STACS '87 : 4th Annual Symposium on Theoretical Aspects of Computer Science, 40-52 | Proceedings Article |
| Stee12 | van Stee, Rob | 2012 | | An improved algorithm for online rectangle filling
In: Theoretical Computer Science [423], 59-74 | Journal Article |
| Stee12a | van Stee, Rob | 2012 | | SIGACT News Online Algorithms Column 20: The Power of Harmony
In: SIGACT News [43], 127-136 | Journal Article |
| Stee12b | van Stee, Rob | 2012 | | SIGACT News Online Algorithms Column 21: APPROX and ALGO
In: SIGACT News [43], 123-129 | Journal Article |
| Stephan2000 | Stephan, Anne | 2000 | | Implementierung eines heuristischen und eines exakten Ansatzes zur Berechnung minimaler Steinerbäume in Netzwerken
Universität des Saarlandes | Thesis - Masters thesis |
| Stormer98 | Stormer, Henrik | 1998 | | Ein Programm zum visuellen Erlernen von Graphalgorithmen
Universität des Saarlandes | Thesis - Masters thesis |
| Sun2010 | Kao, Ming-Yang
Leung, Henry C. M.
Sun, He
Zhang, Yong | 2010 | | Deterministic Polynomial-Time Algorithms for Designing Short DNA Words
In: Theory and Applications of Models of Computation : 7th Annual Conference, TAMC 2010, 308-319 | Proceedings Article |
| Sun2011 | Manjunath, Madhusudan
Mehlhorn, Kurt
Panagiotou, Konstantinos
Sun, He | 2011 | | Approximate Counting of Cycles in Streams
In: 19th Annual European Symposium on Algorithms (ESA-11), 677-688 | Proceedings Article |
| Sun2011b | Chin, Francis Y. L.
Guo, Zeyu
Sun, He | 2011 | | Minimum Manhattan Network is NP-Complete
In: Discrete & Computational Geometry [45], 701-722 | Journal Article |
| Sun2011c | Guo, Zeyu
Sun, He
Zhu, Hong | 2011 | | Greedy Construction of 2-Approximate Minimum Manhattan Networks
In: International Journal of Computational Geometry and Applications [21], 331-350 | Journal Article |
| Sun2012a | Giakkoupis, George
Sauerwald, Thomas
Sun, He
Woelfel, Philipp | 2012 | | Low Randomness Rumor Spreading via Hashing
In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 314-325 | Electronic Proceedings Article |
| Sun2012b | Kane, Daniel
Mehlhorn, Kurt
Sauerwald, Thomas
Sun, He | 2012 | | Counting Arbitrary Subgraphs in Data Streams
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 598-609 | Proceedings Article |
| Sun2012c | Sauerwald, Thomas
Sun, He | 2012 | | Tight Bounds For Randomized Load Balancing on Arbitrary Network Topologies
In: IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS-12), 341-350 | Proceedings Article |
| SurveyCycleBases | Kavitha, T.
Liebchen, Ch.
Mehlhorn, K.
Michail, D.
Rizzi, R.
Ueckerdt, T.
Zweig, K. | 2009 | | Cycle Bases in Graphs: Characterization, Algorithms, Complexity, and Applications
In: Computer Science Review [3], 199-243 | Journal Article |
| SviridenkoWiese2013 | Sviridenko, Maxim
Wiese, Andreas | 2013 | | Approximating the Configuration-LP for Minimizing Weighted Sum of Completion Times on Unrelated Machines
In: Proceedings of the 16th Conference on Integer Programming and Combinatorial Optimization (IPCO 2013), | Proceedings Article |
| sw-ectrac-05 | Seidel, Raimund
Wolpert, Nicola | 2005 | | On the Exact Computation of the Topology of Real Algebraic Curves
In: Proceedings of the 21st ACM Symposium on Computational Geometry, 107-115 | Proceedings Article |
| sw-eeaccaq-05 | Schömer, Elmar
Wolpert, Nicola | 2006 | | An Exact and Efficient Approach for Computing a Cell in an Arrangement of Quadrics
In: Computational Geometry [33], 65 - 97 | Journal Article |
| SWAT::DietzfelbingerMHR1988 | Dietzfelbinger, Martin
Mehlhorn, Kurt
Meyer auf der Heide, Friedhelm
Rohnert, H. | 1988 | | Upper and Lower Bounds for the Dictionary Problem
In: Algorithm theory (SWAT-88) : 1st Scandinavian workshop, 214-215 | Proceedings Article |
| SymHyp2006 | Doerr, Benjamin
Gnewuch, Michael
Hebbinghaus, Nils | 2006 | | Discrepancy of Symmetric Products of Hypergraphs
In: The Electronic Journal of Combinatorics [13], 1-12 | Electronic Journal Article |
| S:NEWDSC:2011 | Sagraloff, Michael | 2011 | | When Newton meets Descartes: A Simple and Fast Algorithm to Isolate the Real Roots of a Polynomial
In: arXiv [abs/1109.6279v1], 1-21 | Electronic Journal Article |
| TechReportGDF2006 | Bast, Holger
Majumdar, Debapriyo
Schenkel, Ralf
Theobald, Martin
Weikum, Gerhard | 2006 | | IO-Top-k: Index-Access Optimized Top-k Query Processing | Report |
| Telikepalli2003a | Telikepalli, Kavitha | 2003 | | Efficient Algorithms for Abelian group isomorphism and related problems
In: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science : 23rd Conference, 277-288 | Proceedings Article |
| Telikepalli2003b | Telikepalli, Kavitha
Varadarajan, Kasturi | 2003 | | On Shortest Paths in Line Arrangements
In: 15th Canadian Conference in Computational Geometry (CCCG-03), 170-173 | Proceedings Article |
| Telikepalli2003c | Telikepalli, Kavitha
Chandran, Sunil
Subramanian, C. R. | 2003 | | Isoperimetric Inequalities and Width Parameters of Graphs
In: Computing and Combinatorics : 9th Annual International Conference, COCOON 2003, 385-393 | Proceedings Article |
| TF_CGTA1 | Bringmann, Karl
Friedrich, Tobias | 2010 | | Approximating the volume of unions and intersections of high-dimensional geometric objects
In: Computational Geometry [43], 601-610 | Journal Article |
| TF_ECJ4 | Bringmann, Karl
Friedrich, Tobias | 2010 | | An Efficient Algorithm for Computing Hypervolume Contributions
In: Evolutionary Computation [18], 383-402 | Journal Article |
| TF_RSA2 | Friedrich, Tobias
Sauerwald, Thomas
Vilenchik, Dan | 2010 | | Smoothed Analysis of Balancing Networks
In: Random Structures and Algorithms [Early View], 1-24 | Electronic Journal Article |
| Thiel-Diss96 | Thiel, Christian | 1996 | | Effiziente Algorithmen für Probleme der Kollisionserkennung und der geometrischen Optimierung
Universität des Saarlandes | Thesis - PhD thesis |
| ThielDiss04 | Thiel, Sven | 2004 | | Efficient Algorithms for Constraint Propagation and for Processing Tree Descriptions
Universität des Saarlandes | Thesis - PhD thesis |
| ThielMasterThesis99 | Thiel, Sven | 1999 | | Persistente Suchbäume
Universität des Saarlandes | Thesis - Masters thesis |
| Thome2000 | Thome, Stefan | 2000 | | Erweiterung des hierarchischen Zeichenmodells in ArchEd
Universität des Saarlandes | Thesis - Masters thesis |
| Thorup/2000 | Thorup, Mikkel | 2000 | | Floats, Integers, and Single Source Shortest Paths
In: Journal of Algorithms [35], 189 -201 | Journal Article |
| Traeff-Kessler96 | Keßler, Christoph W.
Träff, Jesper Larsson | 1996 | | A Library of basic PRAM Algorithms and its Implementation in FORK
In: 8th Annual ACM Symposium on Parallel Algorithms and Architechtures (SPAA'96), 193-195 | Proceedings Article |
| Traeff-Zaroliagis96 | Träff, Jesper Larsson
Zaroliagis, Christos | 1996 | | A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar Digraphs
In: Parallel Algorithms for Irregularly Structured Problems: 3rd International Workshop (IRREGULAR'96), 183-194 | Proceedings Article |
| Traeff95 | Träff, Jesper Larsson | 1995 | | An Experimental Comparison of two Distributed Singel-Source Shortest Path Algorithm
In: Parallel Computing [21], 1505-1532 | Journal Article |
| Traeff96 | Träff, Jesper Larsson | 1996 | | A Heuristic for Blocking Flow Algorithms
In: European Journal of Operational Research [89], 564-569 | Journal Article |
| TraeffZaroliagis2000 | Träff, Jesper Larsson
Zaroliagis, Christos | 2000 | | A simple parallel algorithm for the single-source shortest path problem on planar digraphs
In: Journal of Parallel and Distributed Computing [60], 1103-1124 | Journal Article |
| Traff97:string | Czumaj, Artur
Ferragina, Paolo
Gasieniec, Leszek
Muthukrishnan, S.
Träff, Jesper Larsson | 1997 | | The Architecture of a Software Library for String Processing
In: Proceedings of the Workshop on Algorithm Engineering (WAE-97), 166-176 | Proceedings Article |
| TSeidel97 | Seidel, Tillmann | 1997 | | Paralleles List Ranking
Universität des Saarlandes | Thesis - Masters thesis |
| Tsigas-et-al96 | Kirousis, Lefteris
Spirakis, Paul G.
Tsigas, Philippas | 1996 | | Simple Atomic Snapshots: A Linear Complexity Solution with Unbounded Time-Stamps
In: Information Processing Letters [58], 47-53 | Journal Article |
| unbiasmatr2006 | Doerr, Benjamin
Klein, Christian | 2006 | | Unbiased Rounding of Rational Matrices
In: FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science: 26th International Conference, 200-211 | Proceedings Article |
| vanStee2008 | Epstein, Leah
van Stee, Rob | 2008 | | The price of anarchy on uniformly related machines revisited
In: Algorithmic Game Theory, First International Symposium, SAGT 2008, 46-57 | Proceedings Article |
| vanStee2008a | Epstein, Leah
van Stee, Rob | 2008 | | Maximizing the minimum load for selfish agents
In: LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, 264-275 | Proceedings Article |
| vanStee2008b | van Stee, Rob | 2008 | | Packet Switching in Single Buffer
In: Encyclopedia of Algorithms, 1-99 | Part of a Book |
| vanStee2008d | van Stee, Rob | 2008 | | Paging
In: Encyclopedia of Algorithms, 1-99 | Part of a Book |
| vanStee2008e | Epstein, Leah
Levin, Asaf
van Stee, Rob | 2008 | | Two-dimensional packing with conflicts
In: Acta Informatica [45], 155-175 | Journal Article |
| vanStee2008f | Krumke, Sven Oliver
Schwahn, Anne
van Stee, Rob
Westphal, Stephan | 2008 | | A monotone approximation algorithm for scheduling with precedence constraints
In: Operations Research Letters [36], 247-249 | Journal Article |
| vanStee2008g | Epstein, Leah
Levin, Asaf
van Stee, Rob | 2008 | | Online unit clustering: Variations on a theme
In: Theoretical Computer Science [407], 85-96 | Journal Article |
| vanStee2008h | Pruhs, Kirk
van Stee, Rob
Uthaisombut, Patchrawat | 2008 | | Speed Scaling of Tasks with Precedence Constraints
In: Theory of Computing Systems [43], 67-80 | Journal Article |
| vanStee2008i | van Stee, Rob | 2008 | | Combinatorial algorithms for packing and scheduling problems
Universität Karlsruhe | Thesis - Habilitation thesis |
| vanStee2008j | Epstein, Leah
van Stee, Rob | 2008 | | Approximation schemes for packing splittable items with cardinality constraints
In: Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, 232-245 | Proceedings Article |
| vanStee2008k | Epstein, Leah
van Stee, Rob | 2008 | | On the Online Unit Clustering Problem
In: Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, 193-206 | Proceedings Article |
| vanStee2009a | Epstein, Leah
van Stee, Rob | 2010 | | On the online unit clustering problem
In: ACM Transactions on Algorithms [7], 1-18 | Journal Article |
| vanStee2010 | van Stee, Rob | 2011 | | An improved algorithm for online rectangle filling
In: Approximation and Online Algorithms : 8th International Workshop, WAOA 2010, 249-260 | Proceedings Article |
| vanStee2013 | van Stee, Rob | 2013 | | SIGACT News Online Algorithms Column 22
In: SIGACT News [44], 125 | Journal Article |
| vanSteeTALG2011 | Epstein, Leah
van Stee, Rob | 2011 | | On the online unit clustering problem
In: ACM Transactions on Algorithms [7], 7:1-7:1 | Journal Article |
| vanZuylenALG2011 | van Zuylen, Anke | 2011 | | Deterministic Sampling Algorithms for Network Design
In: Algorithmica [60], 110-151 | Journal Article |
| vanZuylenCTW2011 | van Zuylen, Anke
Schalekamp, Frans
Williamson, David P. | 2011 | | Popular Ranking
In: 10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2011, 267-270 | Electronic Proceedings Article |
| vanZuylenORL2011 | van Zuylen, Anke | 2011 | | An improved monotone algorithm for scheduling related machines with precedence constraints
In: Operations Research Letters [39], 423-427 | Journal Article |
| vanZuylenTCS2011 | van Zuylen, Anke | 2011 | | Linear programming based approximation algorithms for feedback set problems in bipartite tournaments.
In: Theoretical Computer Science [412], 2556-2561 | Journal Article |
| vanZuylenWAOA2011 | van Zuylen, Anke | 2012 | | Simpler 3/4-approximation algorithms for MAX SAT
In: Approximation and Online Algorithms : 9th International Workshop, WAOA 2011, 188-197 | Proceedings Article |
| VAT2013 | Jurkiewicz, Tomasz
Mehlhorn, Kurt | 2013 | | The cost of address translation
In: Proceedings of the Meeting on Algorithm Engineering & Experiments, | Proceedings Article |
| VerificationCertComp12 | Alkassar, Eyad
Böhme, Sascha
Mehlhorn, Kurt
Rizkallah, Christine | 2013 | | A Framework for the Verification of Certifying Computations | Unpublished/Draft |
| Vidali2009 | Vidali, Angelina | 2009 | | The Geometry of Truthfulness
In: Internet and Network Economics : 5th International Workshop, WINE 2009, 340-350 | Proceedings Article |
| Vidali2010 | Pountourakis, Emmanouil
Vidali, Angelina | 2010 | | A complete characterization of group-strategyproof mechanisms of cost-sharing.
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. I, 146-157 | Proceedings Article |
| VLM97 | Vingron, Martin
Lenhof, Hans-Peter
Mutzel, Petra | 1997 | | Computational Molecular Biology
In: Annotated Bibliographies in Combinatorial Optimization, 445-471 | Part of a Book |
| Vocking2000 | Maggs, Bruce M.
Vöcking, Berthold | 2000 | | Improved Routing and Sorting on Multibutterflies
In: Algorithmica [28], 438-464 | Journal Article |
| Vöcking2003 | Krick, Christof
Meyer auf der Heide, Friedhelm
Räcke, Harald
Vöcking, Berthold
Westermann, Matthias | 2003 | | Data Management in Networks: Experimental Evaluation of a Provably Good Strategy
In: Theory of Computing Systems [35], 217-245 | Journal Article |
| Voecking2000 | Karp, Richard
Schindelhauer, Christian
Shenker, Scott
Vöcking, Berthold | 2000 | | Randomized Rumor Spreading
In: 41th Annual Symposium on Foundations of Computer Science (FOCS-00), 565-574 | Proceedings Article |
| Voecking2001a | Rajaraman, Rajmohan
Richa, Andrea W.
Vöcking, Berthold
Vuppuluri, Gayathri | 2001 | | A Data Tracking Scheme for General Networks
In: Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-01), 247-254 | Proceedings Article |
| Voecking2001b | Vöcking, Berthold | 2001 | | Almost Optimal Permutation Routing on Hypercubes
In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC-01), 530-539 | Proceedings Article |
| Voecking2001c | Vöcking, Berthold | 2001 | | Symmetric vs. Asymmetric Multiple-Choice Algorithms
In: Proceedings of the 2nd International Workshop on Approximation and Randomized Algorithms in Communication Networks (ARACNE), 1-10 | Proceedings Article |
| w-jccetansal-03 | Wolpert, Nicola | 2003 | | Jacobi Curves: Computing the Exact Topology of Arrangements of Non-Singular Algebraic Curves | Report |
| WadsCentroid07 | Ajwani, Deepak
Ray, Saurabh
Seidel, Raimund
Tiwary, Hans Raj | 2007 | | On Computing the Centroid of the Vertices of an Arrangement and Related Problems
In: 10th Workshop on Algorithms and Data Structures (WADS), 519-528 | Proceedings Article |
| Wagner2011EWEA | Wagner, Markus
Veeramachaneni, Kalyan
Neumann, Frank
O'Reilly, Una-May | 2011 | | Optimizing the Layout of 1000 Wind Turbines
In: European Wind Energy Association Annual Event, 1-10 | Proceedings Article |
| Wahl2000 | Wahl, Michaela | 2000 | | Ein neuer Algorithmus für Online-Scheduling
Universität des Saarlandes | Thesis - Masters thesis |
| Wahl2010 | Wahlström, Magnus | 2011 | | New Plain-Exponential Time Classes for Graph Homomorphism
In: Theory of Computing Systems [49], 273-282 | Journal Article |
| Wahlstroem2008 | Wahlström, Magnus | 2008 | | A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances
In: 3rd International Workshop on Parameterized and Exact Computation (IWPEC 2008), 202-213 | Proceedings Article |
| Wahlstroem2009 | Wahlström, Magnus | 2009 | | New Plain-Exponential Time Classes for Graph Homomorphism
In: Computer Science – Theory and Applications : 4th International Computer Science Symposium in Russia, CSR 2009, 346-355 | Proceedings Article |
| Wahlstroem2013a | Wahlström, Magnus | 2013 | | Abusing the Tutte Matrix: An Algebraic Instance Compression for the K-set-cycle Problem
In: 29th International Symposium on Theoretical Aspects of Computer Science (STACS-13), | Electronic Proceedings Article |
| Warken2001 | Warken, Thomas
Schömer, Elmar | 2001 | | Rolling Rigid Objects
In: Proceedings of the 9th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision (WSCG-01), 57-62 | Proceedings Article |
| Warken2004 | Warken, Thomas | 2004 | | Collision detection for Curved Rigid Objects in the Context of Dynamics Simulations
Universität des Saarlandes | Thesis - PhD thesis |
| weberetal05airweb | Bifet, Albert
Castillo, Carlos
Chirita, Paul-Elexandru
Weber, Ingmar | 2005 | | An Analysis of Factors Used in Search Engine Ranking
In: 1st International Workshop on Adversarial Information Retrieval on the Web (AIRWeb'05), 1-10 | Electronic Proceedings Article |
| WeberPhD | Weber, Ingmar | 2007 | | Efficient Index Structures for and Applications of the CompleteSearch Engine
Universität des Saarlandes | Thesis - PhD thesis |
| WeikumBCHST05 | Weikum, Gerhard
Bast, Holger
Canright, Geoffrey
Hales, David
Schindelhauer, Christian
Triantafillou, Peter | 2007 | | Towards Peer-to-Peer Web Search
In: 1st European Conference on Complex Systems, ECCS'05, ? | Proceedings Article |
| WeikumBCHST05b | Weikum, Gerhard
Bast, Holger
Canright, Geoffrey
Hales, David
Schindelhauer, Christian
Triantafillou, Peter | 2005 | | Towards Self-Organizing Query Routing and Processing for Peer-to-Peer Web Search
In: Workshop on Peer-to-peer Data Management in the Complex Systems Perspective, 7-24 | Proceedings Article |
| WeinandDipl05 | Weinand, Caroline | 2005 | | Fill-in Reduction while Solving large, sparse Linear Systems with Graph Theoretical Methods
Universität des Saarlandes | Thesis - Masters thesis |
| Weiskircher1998 | Mutzel, Petra
Weiskircher, René | 1998 | | Two-Layer Planarization in Graph Drawing
In: Proceedings of the 9th International Symposium on Algorithms and Computation (ISAAC-98), 69-78 | Proceedings Article |
| Weiskircher1999 | Mutzel, Petra
Weiskircher, René | 1999 | | Optimizing Over All Combinatorial Embeddings of a Planar Graph
In: Proceedings of the 7th International Conference on Integer Programming and Combinatorial Optimization (IPCO-99), 361-376 | Proceedings Article |
| Weiskircher97 | Weiskircher, Rene | 1997 | | 2-Schicht-Planarisierung bipartiter Graphen
Universität des Saarlandes | Thesis - Masters thesis |
| WeiskircherDiss02 | Weiskircher, Rene | 2002 | | New Applications of SPQR-Trees in Graph Drawing
Universität des Saarlandes | Thesis - PhD thesis |
| Welzl87a | Alt, Helmut
Mehlhorn, Kurt
Wagener, Hubert
Welzl, Emo | 1987 | | Convergence, Similarity and Symmetries of Geometric Objects
In: Computational geometry (SCG-87) : 3rd symposium, 308-315 | Proceedings Article |
| Wilhelmi95 | Wilhelmi, Harald | 1995 | | Erzeugung von Pseudozufallszahlen gemäß einer veränderbaren Verteilung
Universität des Saarlandes | Thesis - Masters thesis |
| Winzen2011b | Winzen, Carola | 2011 | | Direction-Reversing Quasi-Random Rumor Spreading with Restarts | Unpublished/Draft |
| Winzen2013 | Winzen, Carola | 2013 | | Direction-Reversing Quasi-Random Rumor Spreading with Restarts
In: Information Processing Letters [113], 921-926 | Journal Article |
| Winzen2013z | Clementi, Andrea
Crescenzi, Pierluigi
Doerr, Carola
Fraigniaud, Pierre
Isopi, Marc
Panconesi, Alessandro
Pasquale, Francesco
Silvestri, Riccardo | 2013 | | Rumor Spreading in Random Evolving Graphs
In: Proc. of the 21st European Symposium on Algorithms (ESA 2013), 325-336 | Proceedings Article |
| WinzenDiss2011 | Winzen, Carola | 2011 | | Toward a complexity theory for randomized search heuristics : black box models
Universität des Saarlandes | Thesis - PhD thesis |
| Wissen98 | Wissen, Michael | 1998 | | Automatisiertes Zeichnen von Zustandsdiagrammen
Universität des Saarlandes | Thesis - Masters thesis |
| WolpertDiss2002 | Wolpert, Nicola | 2002 | | An Exact and Efficient Approach for Computing a Cell in an Arrangement of Quadrics
Universität des Saarlandes | Thesis - PhD thesis |
| Xia2013-soda-clx | Cai, Jin-Yi
Lu, Pinyan
Xia, Mingji | 2013 | | Dichotomy for Holant* Problems with a Function on Domain Size 3
In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 1278-1295 | Proceedings Article |
| XKSC2008 | Xu, Chihao
Karrenbauer, Andreas
Soh, Kian Min
Codrea, Cosmin | 2008 | | Consecutive multiline addressing: A scheme for addressing PMOLEDs
In: Journal of the Society for Information Display [16], 211-219 | Journal Article |
| XKSW2007 | Xu, Chihao
Karrenbauer, Andreas
Soh, Kian Min
Wahl, Jürgen | 2007 | | A New Addressing Scheme for PM OLED Display
In: SID 2007 International Symposium Digest of Technical Papers, 97-100 | Proceedings Article |
| YSSSoftpredicates2013 | Yap, Chee
Sagraloff, Michael
Sharma, Vikram | 2013 | | Analytic Root Clustering: A Complete Algorithm using Soft Zero Tests | Unpublished/Draft |
| Zaro-et-al-1-95 | Dubhashi, Devdatt
Pantziou, Grammati E.
Spirakis, Paul G.
Zaroliagis, Christos | 1995 | | The Fourth Moment in Luby's Distribution
In: Theoretical Computer Science [148], 133-140 | Journal Article |
| Zaro-et-al-1-97 | Kagaris, Dimitrios
Pantziou, Grammati E.
Tragoudas, Spyros
Zaroliagis, Christos | 1999 | | Transmissions in a network with capacities and delays
In: Networks [33
], 167-174 | Journal Article |
| Zaro-et-al-2-95 | Kagaris, Dimitrios
Pantziou, Grammati E.
Tragoudas, Spyros
Zaroliagis, Christos | 1995 | | Quickest Paths: Parallelization and Dynamization
In: 28th Annual Hawaii International Conference on System Sciences (HICSS-28), 39-44 | Proceedings Article |
| Zaro-et-al-3-95 | Kagaris, Dimitrios
Pantziou, Grammati E.
Tragoudas, Spyros
Zaroliagis, Christos | 1995 | | On the Computation of Fast Data Transmissions in Networks
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 291-302 | Proceedings Article |
| Zaroliagis96 | Arikati, Srinivasa Rao
Chen, Danny Z.
Chew, L. Paul
Das, Gautam
Smid, Michiel
Zaroliagis, Christos | 1996 | | Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane
In: Algorithms - ESA '96: 4th Annual European Symposium, 514-528 | Proceedings Article |
| Zaroliagis97PPL | Zaroliagis, Christos | 1997 | | Simple and Work-Efficient Parallel Algorithms for the Minimum Spanning Tree Problem
In: Parallel Processing Letters [7], 25-37 | Journal Article |
| Ziad94 | Abo-Hasna, Ziad | 1994 | | Verdrahtung von Kanälen mit Seitenanschlüssen
Universität des Saarlandes | Thesis - Masters thesis |
| Ziegelmann1999 | Comes, Jochen
Ziegelmann, Mark | 1999 | | An Easy to Use Implementation of Linear Perturbations within CGAL
In: Algorithm engineering (WAE-99) : 3rd International Workshop, WAE'99, 169-182 | Proceedings Article |
| Ziegelmann2001 | Ziegelmann, Mark | 2001 | | Constrained Shortest Paths and Related Problems
Universität des Saarlandes | Thesis - PhD thesis |
| Ziegenbein97 | Ziegenbein, Kurt | 1997 | | Bewertung verschiedener paarweiser Alignment-Methoden, Ersetzungsmatrizen und Gap-Funktionen
Universität des Saarlandes | Thesis - Masters thesis |
| Ziegler95 | Ziegler, Thomas | 1995 | | Max-Weighted-Matching auf allgemeinen Graphen
Universität des Saarlandes | Thesis - Masters thesis |
| ZieglerDiss00 | Ziegler, Thomas | 2000 | | Crossing Minimization in Automatic Graph Drawing
Universität des Saarlandes | Thesis - PhD thesis |
| Zuelow94 | von Zülow, Max Henning | 1994 | | Das k-Closest-Pair-Problem
Universität des Saarlandes | Thesis - Masters thesis |
