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

MPI-INF D1 Publications

MPI-INF D1 Publications

Entries sorted by: 4. BibTeX Citation Keys

Login to this database


 

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

BibTeX cite keyAuthor/EditorYearTitleType
Rahul2001Ray, Rahul
Smid, MIchiel
Lange, Katharina
Wendt, Ulrich
2002Attachment IconComputing Large Planar Regions in Terrains
In: IWCIA 2001, 8th International Workshop on Combinatorial Image Analysis (IWCIA-01), 139-152
Proceedings Article
Rahul2002aWendt, Ulrich
Lange, Katharina
Smid, Michiel
Ray, Rahul
Tönnies, Klaus-Dietz
2002Surface Topography Quantification by Integral and Feature-related Parameters
In: Materialwissenschaft und Werkstofftechnik [33], 621-627
Journal Article
Rahul2002bAgarwal, Pankaj
Hagerup, Torben
Ray, Rahul
Sharir, Micha
Smid, Michiel
Welzl, Emo
2002Translating a Planar Object to Maximize Point Containment
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 42-53
Proceedings Article
Rahul2002cWendt, Ulrich
Lange, Katharina
Ray, Rahul
Smid, Michiel
2001Surface Topography Quantification using Computational GeometryMiscellaneous
Rahul2002dRay, Rahul2002An O(nlogn) Algorithm for Classifying Identical CurvesMiscellaneous
Rahul2003Smid, Michiel
Ray, Rahul
Wendt, Ulrich
Lange, Katharina
2004Computing Large Planar Regions in Terrains, with an Application to Fracture Surface
In: Discrete Applied Mathematics [139], 253-264
Journal Article
Raman2009Elbassioni, Khaled
Raman, Rajiv
Ray, Saurabh
Sitters, Rene
2009Attachment IconOn 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
Ramezani2010Iacono, G.
Ramezani, Fahimeh
Soranzo, N.
Altafani, C.
2010Determining the distance to monotonicity of a biological network: a graph-theoretical approach
In: IET Systems Biology [4], 223-235
Journal Article
Ramezani2011Soranzo, Nicola
Ramezani, Fahimeh
Iacono, Giovanni
Altafini, Claudio
2012Decompositions of large-scale biological systems based on dynamical properties
In: Bioinformatics [28], 76-83
Journal Article
Ramezani2013Elbassioni, Khaled M.
Makino, Kazuhisa
Mehlhorn, Kurt
Ramezani, Fahimeh
2013On Randomized Fictitious Play for Approximating Saddle Points over Convex Sets
In: 19th Annual International Computing and Combinatorics Conference (COCOON-13), 65-76
Proceedings Article
Ramos00Ramos, Edgar A.2001An Optimal Deterministic Algorithm for Computing the Diameter of a Three-Dimensional Point Set
In: Discrete and Computational Geometry [26], 233-244
Journal Article
Ramos1999Ramos, Edgar A.1999On range reporting, ray shooting and $k$-level construction
In: Proceedings of the 15th Annual Symposium on Computational Geometry (SCG-99), 390-399
Proceedings Article
Ramos2000aAmato, Nancy M.
Goodrich, Michael T.
Ramos, Edgar A.
2000Linear-Time Triangulation of a Simple Polygon Made Easier Via Randomization
In: Proceedings of the 16th Annual Symposium on Computational Geometry (SCG-00), 201-212
Proceedings Article
Ramos2000bDey, Tamal K.
Mehlhorn, Kurt
Ramos, Edgar A.
2000Attachment IconCurve reconstruction: Connecting dots with good reason
In: Computational Geometry [15], 229-244
Journal Article
Ramos2000cRamos, Edgar A.2000Deterministic 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
Ramos2000dRamos, Edgar A.2000Linear Programming Queries Revisited
In: Proceedings of the 16th Annual Symposium on Computational Geometry (SCG-00), 176-181
Proceedings Article
Ramos2000eRamos, Edgar A.
Amato, Nancy M.
Goodrich, Michael T.
2000Computing 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
Ramos97Ramos, Edgar A.1997Construction of 1-d lower envelopes and applications
In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 57-66
Proceedings Article
Ramos97aRamos, Edgar A.1997Intersection of unit-balls and diameter of a point set in R³
In: Computational Geometry Theory and Applications [8], 57-65
Journal Article
RandCol2006Doerr, Benjamin2006Attachment IconNon-independent randomized rounding and coloring
In: Discrete Applied Mathematics [154], 650-659
Journal Article
Rasch94Rasch, Ronald1994Furthest Site Abstract Voronoi Diagrams
Universität des Saarlandes
Thesis - PhD thesis
RatSanKni99Rathe, Ulrich
Sanders, Peter
Knight, Peter
1999A case study in scalability: an ADI method for the two-dimensional time-dependent Dirac equation
In: Parallel Computing [25], 525-534
Journal Article
Rau97Rau, Stephan1997Ein 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
RaufDiss04Rauf, Imran2005Attachment IconEarliest Arrival Flows with Multiple Sources
Universität des Saarlandes
Thesis - Masters thesis
RayDiss04Ray, Rahul2004Geometric Algorithms for Object Placement and Planarity in a Terrain
Universität des Saarlandes
Thesis - PhD thesis
Ray/Diploma04Ray, Saurabh2004Counting Straight-Edge Triangulations of Planar Point Sets
Universität des Saarlandes
Thesis - Masters thesis
Reichel2003Eisenbrand, Friedrich
Funke, Stefan
Reichel, Joachim
Schömer, Elmar
2003Attachment IconPacking a Trunk
In: Algorithms - ESA 2003: 11th Annual European Symposium, 618-629
Proceedings Article
Reichel2005Eisenbrand, Friedrich
Funke, Stefan
Karrenbauer, Andreas
Reichel, Joachim
Schömer, Elmar
2005Packing a Trunk - now with a Twist!
In: Proceedings SPM 2005 ACM Symposium on Solid and Physical Modeling, 197-206
Proceedings Article
ReichelDipl01Reichel, Joachim2001Attachment IconOptimale Hüllkörper für Objekte mit gekrümmten Oberflächen
Universität des Saarlandes
Thesis - Masters thesis
Reinert94Reinert, Knut1994Deferred Data Structuring
Universität des Saarlandes
Thesis - Masters thesis
ReinertDiss99Reinert, Knut1999A polyhedral approach to sequence alignment problems
Universität des Saarlandes
Thesis - PhD thesis
Reinstaedtler-Dipl98Reinstädtler, Martin1998Verlustfreie Datenkompression mit selbstorganisierenden Listen
Universität des Saarlandes
Thesis - Masters thesis
res_2010Emeliyanenko, Pavel2010Attachment IconA 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
Rieger95Rieger, Joachim1995Generic Evolutions of Edges on Families of Diffused Greyvalue Surfaces
In: Journal of Mathematical Imaging and Vision [5], 207-217
Journal Article
rizkallah:2011:matchingRizkallah, Christine2011Maximum Cardinality Matching
In: Archive of Formal Proofs,
Electronic Journal Article
Roehrig1998DiplomRöhrig, Hein1998Tree Decomposition: A Feasibility Study
Universität des Saarlandes
Thesis - Masters thesis
Rottmann96Rottmann, Klaus-Dieter1996Bewegung eines Polygons zwischen polygonalen Hindernisse
Universität des Saarlandes
Thesis - Masters thesis
RoundSmSub2006Doerr, Benjamin2006Attachment IconMatrix Rounding With Respect to Small Submatrices
In: Random Structures & Algorithms [28], 107-112
Journal Article
RSPM98Sanders, Peter
Reussner, Ralf
Prechelt, Lutz
Müller, Matthias
1998SKaMPI: A Detailed, Accurate MPI Benchmark
In: Proceedings of the 5th European PVM/MPI Users' Group Meeting, 52-59
Proceedings Article
Rueb-1-97Rüb, Christine1997On the average running time of odd-even merge sort
In: Journal of Algorithms [22], 329-346
Journal Article
Rueb95Rüb, Christine1995On the Average Running Time of Odd-Even Merge Sort
In: STACS95: 12th Annual Symposium on Theoretical Aspects of Computer Science, 491-501
Proceedings Article
Rüb98Rüb, Christine1998On 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
Ruppert1999Ruppert, Barbara1999Polygontriangulierung in Linearzeit
Universität des Saarlandes
Thesis - Masters thesis
RusinovSchweitzer2010Rusinov, Momchil
Schweitzer, Pascal
2010Homomorphism -- homogeneous graphs
In: Journal of Graph Theory [65], 253-262
Journal Article
s-cssl-03Schmitt, Susanne2003Common Subexpression Search in LEDA_realsReport
s-doran-03Schmitt, Susanne2003The Diamond Operator for Real Algebraic NumbersReport
Sabo1999Sabo, Holger1999Ein schnelles Verfahren zur exakten Berechnung von Skalarprodukten
Universität des Saarlandes
Thesis - Masters thesis
Sagraloff-BitstreamComplexity2010aSagraloff, Michael2010On the Complexity of Real Root Isolation
In: CoRR [abs/1011.0344], 1-33
Electronic Journal Article
Sagraloff-BitstreamPrecision2011Sagraloff, Michael2010A General Approach to Isolating Roots of a Bitstream Polynomial
In: Mathematics in Computer Science [4], 481-506
Journal Article
SagraloffMPGJahrbuch2012Sagraloff, Michael2012Exaktes geometrisches RechnenMiscellaneous
SagraloffYap:CEVAL:2011Sagraloff, Michael
Yap, Chee
2011A 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_2012Sagraloff, Michael2012When 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
Same2005Beldiceanu, Nicolas
Katriel, Irit
Thiel, Sven
2007Filtering Algorithms for the Same and UsedBy Constraints
In: Archives of Control Sciences [to appear], to appear
Journal Article
SameCPAIOR2004Beldiceanu, Nicolas
Katriel, Irit
Thiel, Sven
2004Filtering algorithms for the Same constraint
In: Integration of AI and OR techniques in constraint programming for combinatorial optimization problems : First International Conference, CPAIOR 2004, 65-79
Proceedings Article
San2001aSanders, Peter2001Reconciling 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
San98bSanders, Peter1998Tree Shaped Computations as a Model for Parallel Applications
In: Anwendungsbezogene Lastverteilung (ALV), 123-132
Proceedings Article
San98cSanders, Peter1998Random Permutations on Distributed, External and Hierarchical Memory
In: Information Processing Letters [67], 305-309
Journal Article
San98dSanders, Peter1998Random Permutations on Distributed, External and Hierarchical Memory
In: PARS-Mitteilungen, 160-165
In: PARS-Mitteilungen [1998], 160-165
Journal Article
San99aSanders, Peter1999Fast Priority Queues for Cached Memory
In: Selected papers of the International Workshop on Algorithm Engineering and Experimentation (ALENEX-99), 312-327
Proceedings Article
San99bSanders, Peter
Takkula, Tuomo
Wedelin, Dag
1999High 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
San99cSanders, Peter1999Accessing Multiple Sequences Through Set Associative Caches
In: Proceedings of the 26th International Colloquium on Automata, Languages and Programming (ICALP-99), 655-664
Proceedings Article
San99dSanders, Peter1999Asynchronous Random Polling Dynamic Load Balancing
In: Algorithms and computation : 10th International Symposium, ISAAC'99, 37-48
Proceedings Article
San99eSanders, Peter1999Berechnungen mit großen Datenmengen
In: Jahrbuch der Max-Planck-Gesellschaft 1999, 534-540
Part of a Book
Sand98aSanders, Peter1998Randomized Priority Queues for Fast Parallel Access
In: Journal Parallel and Distributed Computing [49], 86-97
Journal Article
Sanders1999Sanders, Peter1999Analysis of nearest neighbor load balancing algorithms for random loads
In: Parallel Computing [25], 1013-1033
Journal Article
Sanders2000Sanders, Peter2000Fast Priority Queues for Cached Memory
In: Journal of Experimental Algorithmics [5], 1-25
Electronic Journal Article
Sanders2000aSanders, Peter
Solis-Oba, Roberto
2000How Helpers Hasten h-Relations
In: Algorithms - ESA 2000, Proceedings of the 8th Annual European Symposium (ESA-00), 392-402
Proceedings Article
Sanders2000bSanders, Peter2000Asynchronous Scheduling of Redundant Disk Arrays
In: Proceedings of the 12th Annual ACM Symposium on Parallel Algorithms and Architecture (SPAA-00), 89-98
Proceedings Article
Sanders2002Sanders, Peter
Träff, Jesper Larsson
2002The 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
Sanders2002aBader, David
Moret, Bernard
Sanders, Peter
2002Algorithm Engineering for Parallel Computation
In: Experimental Algorithmics, 1-23
Part of a Book
Sanders2002bMcGeoch, Catherine
Sanders, Peter
Fleischer, Rudolf
Cohen, Paul R.
Precup, Doina
2002Using Finite Experiments to Study Asymptotic Performance
In: Experimental Algorithmics, 93-126
Part of a Book
Sanders2002cSanders, Peter2002Presenting Data from Experiments in Algorithmics
In: Experimental Algorithmics, 181-196
Part of a Book
Sanders2002dSanders, Peter2002Randomized Receiver Initiated Load Balancing Algorithms for Tree Shaped Computations
In: The Computer Journal [45], 561-573
Journal Article
Sanders2002eSanders, Peter
Vollmar, R.
Worsch, T.
2002Feasible models of computation: Three-dimensionality and energy consumption
In: Fundamenta Informaticae [52], 233-248
Journal Article
Sanders2002fNiedermeier, Rolf
Reinhard, Klaus
Sanders, Peter
2002Towards Optimal Locality in Mesh-Indexings
In: Discrete Applied Mathematics [117], 211-237
Journal Article
Sanders2002gSanders, Peter
Vöcking, Berthold
2002Random Arc Allocation and Applications to Disks, Drums and DRAMs
In: Algorithm theory, SWAT 2002 : 8th Scandinavian Workshop on Algorithm Theory, 121-130
Proceedings Article
Sanders2002hBeier, Rene
Sanders, Peter
Sivadasan, Naveen
2002Energy Optimal Routing in Radio Networks Using Geometric Data Structures
In: Automata, Languages and Programming : 29th International Colloquium, ICALP 2002, 366-376
Proceedings Article
Sanders2002iSanders, Peter2002Reconciling simplicity and realism in parallel disk models
In: Parallel Computing [28], 705-723
Journal Article
Sanders2003Sanders, Peter2003Asynchronous Scheduling of Redundant Disk Arrays
In: IEEE Transactions on Computers [52], 1170-1184
Journal Article
Sanders2004aSanders, Peter2004Algorithms 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
Sanders2005Hutchinson, David A.
Sanders, Peter
Vitter, Jeffrey Scott
2005Duality Between Prefetching and Queued Writing with Parallel Disks
In: SIAM Journal on Computing [34], 1443-1463
Journal Article
Sanders2005bFotakis, Dimitris
Pagh, Rasmus
Sanders, Peter
Spirakis, Paul G.
2005Space Efficient Hash Tables With Worst Case Constant Access Time
In: Theory of Computing Systems [38], 229-248
Journal Article
SandersPettie2004Sanders, Peter
Pettie, Seth
2004Attachment IconA Simpler Linear Time 2/3 - epsilon Approximation for Maximum
Weight Matching
Report
SandersWinkel2004Sanders, Peter2004Super Scalar Sample Sort
In: Algorithms – ESA 2004: 12th Annual European Symposium, 784-796
Proceedings Article
SanEgnKor2000Sanders, Peter
Egner, Sebastian
Korst, Jan
2000Fast Concurrent Access to Parallel Disks
In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00), 849-858
Proceedings Article
SanSib03Sanders, Peter
Sibeyn, Jop F.
2003A Bandwidth Latency Tradeoff for Broadcast and Reduction
In: Information Processing Letters [86], 33-38
Journal Article
SanSib2000Sanders, Peter
Sibeyn, Jop F.
2000A 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
SanSol2001Sanders, Peter
Solis-Oba, Roberto
2001How Helpers Hasten h-Relations
In: Journal of Algorithms [41], 86-98
Journal Article
SanSte2005Sanders, Peter
Steurer, David
2005An 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
SanVoe03Sanders, Peter
Vöcking, Berthold
2003Tail bounds and expectations for random arc allocation and applications
In: Combinatorics, Probability and Computing [12], 225-244
Journal Article
SaSiSt13Sanders, Peter
Singler, Johannes
van Stee, Rob
2013Attachment IconReal-time prefetching and caching
In: Journal of Scheduling [16], 47-58
Journal Article
Sauerwald2010Sauerwald, Thomas
Stauffer, Alexandre
2011Rumor Spreading and Vertex Expansion on Regular Graphs
In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 462-475
Proceedings Article
scg89Mehlhorn (ed.)1989Proceedings of the fifth annual symposium on Computational geometry
1989 (SCG '89)
Proceedings
SCG90*216Fleischer, Rudolf
Mehlhorn, Kurt
Rote, Günter
Welzl, Emo
Yap, Chee-Keng
1990On Simultaneous Inner and Outer Approximation of Shapes
In: Computational geometry (SCG-90) : 6th annual symposium, 216-224
Proceedings Article
SCG90*281Alt, Helmut
Fleischer, Rudolf
Kaufmann, Michael
Mehlhorn, Kurt
Näher, Stefan
Schirra, Stefan
Uhrig, Christian
1990Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures
In: Computational geometry (SCG-90) : 6th annual symposium, 281-289
Proceedings Article
Schäfer04Schäfer, Guido2004Worst case instances are fragile: average case and smoothed competitive analysis of algorithms
Universität des Saarlandes
Thesis - PhD thesis
Schaefer2000Schäfer, Guido2000Weighted Matchings in General Graphs
Universität des Saarlandes
Thesis - Masters thesis
Schäfer2003Becchetti, Luca
Leonardi, Stefano
Marchetti-Spaccamela, Alberto
Schäfer, Guido
Vredeveld, Tjark
2003Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm
In: 44th Annual Symposium on Foundations of Computer Science (FOCS-03), 462-471
Proceedings Article
SchalekampWvZ12Schalekamp, Frans
Williamson, David P.
van Zuylen, Anke
2012A 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
SchanneDipl01Schanne, Thomas2001Visualisierung der Dialektgeographie und Topographie im deutschen Dialektraum
Universität des Saarlandes
Thesis - Masters thesis
SchilzPhD2000Schilz, Thomas2000Effiziente Algorithmen für das verteilte Rechnen auf Workstation-Clustern
Universität des Saarlandes
Thesis - PhD thesis
Schirra-et-al-1-96Devillers, Olivier
Golin, Mordecai J.
Kedem, Klara
Schirra, Stefan
1996Queries on Voronoi Diagrams of Moving Points
In: Computational Geometry. Theory and Applications [5], 315-327
Journal Article
Schirra-et-al-2-96Fabri, Andreas
Giezeman, Geert-Jan
Kettner, Lutz
Schirra, Stefan
Schönherr, Sven
1996The 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-96Krithivasan, Kamala
Rema, Anna
Schirra, Stefan
Vijaykumar, P.I.
1996Velocity 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
Schirra1999Mehlhorn, Kurt
Schirra, Stefan
2000Attachment IconGeometric Computing with CGAL and LEDA
In: Curve and surface design, Saint-Malo 1999, 277-286
Proceedings Article
Schirra1999aSchirra, Stefan1999A 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
Schirra2000Schirra, Stefan2000Robustness and Precision Issues in Geometric Computation
In: Handbook of Computational Geometry, 597-632
Part of a Book
Schirra2000DesignCGALFabri, Andreas
Giezeman, Geert-Jan
Kettner, Lutz
Schirra, Stefan
Schönherr, Sven
2000On the Design of CGAL, a computational geometry algorithms library
In: Software - Practice and Experience [30], 1167-1202
Journal Article
Schirra2000GenericProgrammingBrönnimann, Hervé
Kettner, Lutz
Schirra, Stefan
Veltkamp, Remco
2000Applications of the Generic Programming Paradigm in the Design of CGAL
In: Generic programming - International Seminar on Generic Programming Dagstuhl Castle, Germany, April 27 - May 1, 1998, selected papers, 206-216
Part of a Book
Schirra2001EdgeColoringCole, Richard
Ost, Kirstin
Schirra, Stefan
2001Edge-Coloring Bipartite Multigraphs in O(E log D) Time
In: Combinatorica [21], 5-12
Journal Article
Schirra97aSchirra, Stefan1997Precision and Robustness in Geometric Computations
In: Algorithmic Foundations of Geographic Information Systems, 255-287
Part of a Book
Schirra97bSchwerdt, Jörg
Smid, Michiel
Schirra, Stefan
1997Computing 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
Schirra97cSchwerdt, Jörg
Smid, Michiel
Schirra, Stefan
1997Computing 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_habilSchirra, Stefan1998Computational Geometry: Theory and Implementation
Universität des Saarlandes
Thesis - Habilitation thesis
Schmidt2012Schmidt, Jens M.2012Construction Sequences and Certifying 3-Connectivity
In: Algorithmica [62], 192-208
Journal Article
Schmidt2012aSchmidt, Jens M.
Valtr, Pavel
2012Cubic Plane Graphs on a Given Point Set
In: Proceedings of the Twenty-Eighth Annual Symposium on Computational Geometry (SCG'12), 201-208
Proceedings Article
Schmidt2012bSchmidt, Jens M.2012Certifying 3-Connectivity in Linear Time
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 786-797
Proceedings Article
Schmidt2013Schmidt, Jens M.2013Contractions, Removals and Certifying 3-Connectivity in Linear Time
In: SIAM Journal on Computing [42], 494-535
Journal Article
Schmidt2013Schmidt, Jens M.2013Contractions, Removals and How to Certify 3-Connectivity in Linear TimeUnpublished/Draft
Schmidt2013aSchmidt, Jens M.2013A Simple Test on 2-Vertex- and 2-Edge-Connectivity
In: Information Processing Letters [113], 241-244
Journal Article
Schmidt2013bSchmidt, Jens M.2013A Planarity Test via Construction Sequences
In: 38th International Symposium on Mathematical Foundations of Computer Science (MFCS'13), 765-776
Proceedings Article
Schmitt04aSchmitt, Susanne2004Improved separation bounds for the diamond operatorReport
Schmitt04bSchmitt, Susanne2004Common Subexpression Search in LEDA_reals -- a study of the diamond-operatorReport
Schmitt2003Schmitt, Susanne
Zimmer, Horst G.
2003Elliptic Curves : A Computational ApproachBook
Schmitt2005Schmitt, Susanne2005Attachment IconThe diamond operator - Implementation of exact real algebraic numbers
In: Computer Algebra in Scientific Computing, 8th International Workshop, CASC 2005, 355-366
Proceedings Article
SchmittFoussee2004Schmitt, Susanne
Fousse, Laurent
2004Attachment IconA comparison of polynomial evaluation schemesReport
Schmitz95Schmitz, Christoph1995Analyse von Branch-and-Bound Algorithmen zum Problem des Handlungsreisenden
Universität des Saarlandes
Thesis - Masters thesis
Schoemer-Thiel95Schömer, Elmar
Thiel, Christian
1995Efficient Collision Detection for Moving Polyhedra
In: 11th Annual ACM Symposium on Computational Geometry (SCG95), 51-60
Proceedings Article
Schröder98Schröder, Bianca1998Upper and Lower Bounds for Basic Scheduling Problems
Universität des Saarlandes
Thesis - Masters thesis
SchulteDipl01Schulte, Ralph2001Exaktes Lösen von Linearen Programmen
Universität des Saarlandes
Thesis - Masters thesis
SchultesDipl05Schultes, Dominik2005Fast and Exact Shortest Path Queries Using Highway Hierachies
Universität des Saarlandes
Thesis - Masters thesis
Schwarz-et-al95aEvans, B.L.
Schwarz, Christian
Teich, Jürgen
1995Automated design of two-dimensional rational decimation systems
In: Proceedings of IEEE Asilomar Conference on Signals, Systems, and Computers, 498-502
Proceedings Article
Schwarz-et-al95bEvans, Brian
Schwarz, Christian
Teich, Jürgen
Vainshtein, Alek
Welzl, Emo
1995Minimal enclosing parallelogram with application
In: 11th Annual ACM Symposium on Computational Geometry (SCG95), C34-C35
Proceedings Article
Schwarz-Smid-et-al95Golin, Mordecai J.
Raman, Rajeev
Schwarz, Christian
Smid, Michiel
1995Simple randomized algorithms for closest pair problems
In: Nordic Journal of Computing [2], 3-27
Journal Article
Schwarzenecker95Schwarzenecker, Erik1995Ein NP-schweres Plazierungsproblem
Universität des Saarlandes
Thesis - PhD thesis
Schwarzetal2009Schwarz, Karsten
Karrenbauer, Andreas
Schehr, Gregory
Rieger, H.
2009Domain walls and chaos in the disordered SOS model
In: Journal of statistical mechanics : theory and experiment [P08022], 1-23
Electronic Journal Article
Schweitzer2008Schweitzer, Pascal2009Using the Incompressibility Method to obtain Local Lemma results for Ramsey-type Problems
In: Information Processing Letters [109], 229-232
Journal Article
SchweitzerPhD2009Schweitzer, Pascal2009Problems of Unknown Complexity: Graph isomorphism and Ramsey theoretic numbers
Universität des Saarlandes
Thesis - PhD thesis
SchweitzerSchweitzer2010Schweitzer, Pascal
Schweitzer, Patrick
2010Connecting face hitting sets in planar graphs
In: Information Processing Letters [111], 11-15
Journal Article
Seel94Seel, Michael1994Eine Implementierung abstrakter Voronoidiagramme
Universität des Saarlandes
Thesis - Masters thesis
SeelDiss01Seel, Michael2001Planar Nef Polyhedra and Generic Higher-dimensional Geometry
Universität des Saarlandes
Thesis - PhD thesis
Seiden1999Seiden, Steve S.1999Randomized online scheduling with delivery times
In: Journal of Combinatorial Optimization [3], 399-416
Journal Article
Seiden2000Seiden, Steve S.2000Online randomized multiprocessor scheduling
In: Algorithmica [28], 173-216
Journal Article
selection07Friedrich, Tobias
Hebbinghaus, Nils
Neumann, Frank
2007Rigorous Analyses of Simple Diversity Mechanisms
In: Genetic and Evolutionary Computation Conference 2007, 1219-1225
Proceedings Article
Semeloglou2000Semeloglou, Anastasios2000Kürzeste Wege in planare Graphen. Implementierung eines parallelen Algorithmus mithilfe von PAD
Universität des Saarlandes
Thesis - Masters thesis
SemKielDoerr, Benjamin
Gnewuch, Michael
2006Construction of low-discrepancy point sets of small size by bracketing covers and dependent randomized roundingReport
SET03Sanders, Peter
Egner, Sebastian
Tolhuizen, Ludo
2003Polynomial Time Algorithms For Network Information Flow
In: Proceedings of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA-03), 286-294
Proceedings Article
setcover07Friedrich, Tobias
Hebbinghaus, Nils
Neumann, Frank
2007Plateaus Can Be Harder in Multi-Objective Optimization
In: IEEE Congress on Evolutionary Computation 2007, 2622-2629
Proceedings Article
Sharma2008Sharma, Vikram2008Complexity of real root isolation using continued fractions
In: Theoretical Computer Science [409], 292-310
Electronic Journal Article
Shervashidze2011Shervashidze, Nino
Schweitzer, Pascal
van Leeuwen, Erik Jan
Mehlhorn, Kurt
Borgwardt, Karsten M.
2011Weisfeiler-Lehman graph kernels
In: Journal of Machine Learning Research [12], 2539-2561
Journal Article
Shiva-Dubhashi95Chaudhuri, Shiva
Dubhashi, Devdatt
1995Probabilistic Recurrence Relations Revisited
In: LATIN'95: Theoretical Informatics, Second Latin American Symposium, 207-219
Proceedings Article
Shiva-Hagerup95Chaudhuri, Shiva
Hagerup, Torben
1995Prefix Graphs and their Applications
In: Graph-theoretic Concepts in Computer Science: 20th International Workshop (WG94), 206-218
Proceedings Article
Shiva-Zaro-1-95Chaudhuri, Shiva
Zaroliagis, Christos
1995Shortest Path Queries in Digraphs of Small Treewidth
In: Automata, Languages, and Programming: 22nd International Colloquium (ICALP95), 244-255
Proceedings Article
Shiva-Zaro-2-95Chaudhuri, Shiva
Zaroliagis, Christos
1995Optimal Parallel Shortest Paths in Small Treewidth Digraphs
In: Algorithms - ESA'95: 3rd Annual European Symposium, 31-45
Proceedings Article
SiAbMe02Sibeyn, Jop F.
Abello, James
Meyer, Ulrich
2002Heuristics 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-96Sibeyn, Jop F.1996List Ranking on Interconnection Networks
In: 2nd Euro-Par Conference, 529-541
Proceedings Article
Sibeyn-et-al-1-97Sibeyn, Jop F.
Kaufmann, Michael
Chlebus, Bogdan S.
1997Deterministic Permutation Routing on Meshes
In: Journal of Algorithms [22], 111-141
Journal Article
Sibeyn-et-al-2-96Sibeyn, Jop F.1996Routing 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-96Juurlink, Ben
Sibeyn, Jop F.
Rao, P. Srinivasa
1996Worm-Hole Gossiping on Meshes and Tori
In: 2nd Euro-Par Conference, 361-369
Proceedings Article
Sibeyn-et-al96Preetham, A. J.
Krithivasan, Kamala
Rangan, C. Pandu
Sibeyn, Jop F.
1996Parallel algorithm for maximum empty L-shaped polygon
In: 3rd Conference on High-Performance Computing, -
Proceedings Article
Sibeyn-Kaufmann97Kaufmann, Michael
Sibeyn, Jop F.
1997Randomized Multipacket Routing and Sorting on Meshes
In: Algorithmica [17], 224-244
Journal Article
Sibeyn2000Sibeyn, Jop F.2000Solving fundamental problems on sparse-meshes
In: IEEE Transactions on Parallel & Distributed Systems [11], 1324-1332
Journal Article
Sibeyn95Sibeyn, Jop F.1995Sample Sort on Meshes
In: Proceedings of Computing Science in the Netherlands, SION, 217-228
Proceedings Article
Sibeyn97aSibeyn, Jop F.1997Better Trade-offs for Parallel List Ranking
In: Proceedings of the 9th Symposium on Parallel Algorithms and Architectures (SPAA-97), 221-230
Proceedings Article
Sibeyn97bSibeyn, Jop F.1997Routing on Triangles, Tori and Honeycombs
In: International Journal on the Foundations of Computer Science [8], 269-287
Journal Article
Sibeyn97cSibeyn, Jop F.1997Routing 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
Sibeyn97dSibeyn, Jop F.1997Sample Sort on Meshes
In: Proceedings of the 3rd International Euro-Par Conference on Parallel Processing (Euro-Par-97), 389-398
Proceedings Article
Sibeyn97eSibeyn, Jop F.
Kaufmann, Michael
1997Randomized Multipacket Routing and Sorting on Meshes
In: Algorithmica [17], 224-244
Journal Article
SibeynGuillaumeSeidel1997Sibeyn, Jop F.
Guillaume, Frank
Seidel, Tillmann
1997Practical Parallel List Ranking
In: Proceedings of the 4th Symposium on Solving Irregularly Structured Problems in Parallel (IRREGULAR-97), 25-36
Proceedings Article
SibeynGuillaumeSeidel99Sibeyn, Jop F.
Guillaume, Frank
Seidel, Tillmann
1999Practical Parallel List Ranking
In: Journal of Parallel and Distributed Computing [56], 156-180
Journal Article
SibeynKaufmann1997Sibeyn, Jop F.
Kaufmann, Michael
1997BSP-Like External-Memory Computation
In: Proceedings of the 3rd Italian Conference on Algorithms and Complexity (CIAC-97), 229-240
Proceedings Article
SICOMP::AltHMP1987Alt, Helmut
Hagerup, Torben
Mehlhorn, Kurt
Preparata, Franco P.
1987Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
In: SIAM Journal on Computing [16], 808-835
Journal Article
SICOMP::MehlhornNA1988Mehlhorn, Kurt
Näher, Stefan
Alt, Helmut
1988A Lower Bound on the Complexity of the Union-Split-Find Problem
In: SIAM Journal on Computing [17], 1093-1102
Journal Article
SICOMP::MehlhornT1986Mehlhorn, Kurt
Tsakalidis, Athanasios K.
1986Attachment IconAn Amortized Analysis of Insertions into AVL-Trees
In: SIAM Journal on Computing [15], 22-33
Journal Article
Sitters2005Sitters, Rene2005Complexity of preemptive minsum scheduling on unrelated parallel machines
In: Journal of Algorithms [57], 37-48
Journal Article
Sitters2005bElbassioni, Khaled M.
Fishkin, Aleksei V.
Mustafa, Nabil H.
Sitters, Rene
2005Approximation algorithms for Euclidean Group TSP
In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, 1115-1126
Proceedings Article
Sitters2006Bodlaender, Hans L.
Feremans, Corinne
Grigoriev, Alexander
Penninkx, Eelko
Sitters, Rene
Wolle, Thomas
2006On the minimum corridor connection and other generalized geometric problems
In: 4th Workshop on Approximation and Online Algorithms, WAOA, 69-82
Proceedings Article
Sitters2006aFeremans, Corinne
Grigoriev, Alexander
Sitters, Rene
2006The geometric generalized minimum spanning tree problem with grid clustering
In: 4OR: A Quarterly Journal of Operations Research [4], 319-329
Journal Article
Sitters2006bSitters, Rene
Stougie, Leen
2006The general two-server problem
In: Journal of the ACM [53], 437-458
Journal Article
Sitters2006cGrigoriev, Alexander
van Loon, Joyce
Sitters, Rene
Uetz, Marc
2006How to Sell a Graph: Guidelines for Graph Retailers
In: Graph-Theoretic Concepts in Computer Science : 32nd International Workshop, WG 2006, 125-136
Proceedings Article
Sitters2006dBartal, Yair
Leonardi, Stefano
Shallom, Gill
Sitters, Rene
2006On the value of preemption in scheduling
In: 9th Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX, 39-48
Proceedings Article
Sivadas2003Adler, Micah
Räcke, Harald
Sivadasan, Naveen
Sohler, Christian
Vöcking, Berthold
2003Attachment IconRandomized Pursuit-Evasion in Graphs
In: Combinatorics, Probability and Computing [12], 225-244
Journal Article
Sivadasan2004Schäfer, Guido
Sivadasan, Naveen
2004Attachment IconTopology matters: Smoothed competitiveness of metrical task systems
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 489-500
Proceedings Article
Sivadasan2004-2Sanders, Peter
Sivadasan, Naveen
Skutella, Martin
2004Attachment IconOnline scheduling with bounded migration
In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, 1111-1122
Proceedings Article
Sivadasan2009Sanders, Peter
Sivadasan, Naveen
Skutella, Martin
2009Online scheduling with bounded migration
In: Mathematics of Operations Research [34], 481-498
Journal Article
SivadasanDiss04Sivadasan, Naveen2004Online Problems and Two-Player Games: Algorithms and Analysis
Universität des Saarlandes
Thesis - PhD thesis
SivadasanSandersSkutella2004Sivadasan, Naveen
Sanders, Peter
Skutella, Martin
2004Attachment IconOnline Scheduling with Bounded MigrationReport
SKH-CCRI-2009Sagraloff, Michael
Kerber, Michael
Hemmer, Michael
2009Certified Complex Root Isolation via Adaptive Root Separation Bounds
In: The Joint Conference of ASCM 2009 and MACIS 2009, 151-166
Proceedings Article
Skutella2003Fekete, Sandor P.
Skutella, Martin
Woeginger, Gerhard J.
2003Attachment IconThe complexity of economic equilibria for house allocation markets
In: Information Processing Letters [88], 219-223
Journal Article
Smid-et-al-1-95Follert, Frank
Schömer, Elmar
Sellen, Jürgen
Smid, Michiel
Thiel, Christian
1995Computing a largest empty anchored cylinder, and related problems
In: Foundations of Software Technology and Theoretical Computer Science: 15th Conference, 428-442
Proceedings Article
Smid95Smid, Michiel1995Dynamic rectangular point location, with an application to the closest pair problem
In: Information and Computation [16], 1-9
Journal Article
SODATO2004Katriel, Irit
Bodlaender, Hans L.
2005Online Topological Ordering
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 443-450
Proceedings Article
Solis-Oba1998aSolis-Oba, Roberto19982-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-Oba1998bSolis-Oba, Roberto
Frederickson, Greg N.
1998Rooted Spanning Trees with Small Weight and Average Length
In: Theoretical Computer Science, 114-125
Proceedings Article
Solis-Oba1999aSolis-Oba, Roberto
Jansen, Klaus
Sviridenko, Maxim
1999Makespan 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-Oba1999fSolis-Oba, Roberto
Jansen, Klaus
Sviridenko, Maxim
1999A 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-Oba1999hKrysta, Piotr
Solis-Oba, Roberto
1999Approximation algorithms for bounded facility location
In: Proceedings of the 5th Annual International Conference on Computing and Combinatorics (COCOON-99), 241-250
Proceedings Article
Son1999Son, Jung-Bae1999Berechnung konvexer Hüllen in erwarteter Linearzeit
Universität des Saarlandes
Thesis - Masters thesis
Spoehel2011Mütze, Torsten
Rast, Thomas
Spöhel, Reto
2011Coloring 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
Spoehel2011aGugelmann, Luca
Spöhel, Reto
2011On balanced coloring games in random graphs
In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 425-430
Electronic Proceedings Article
Spoehel2011bMütze, Torsten
Spöhel, Reto
2011On the path-avoidance vertex-coloring game
In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 657-662
Electronic Proceedings Article
Spoehel2011cPanagiotou, Konstantinos
Spöhel, Reto
Steger, Angelika
Thomas, Henning
2011Explosive 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
Spoehel2011dMütze, Torsten
Spöhel, Reto
2011On the path-avoidance vertex-coloring game
In: The Electronic Journal of Combinatorics [18], 1-33
Electronic Journal Article
SpoehelBM2012Belfrage, Michael
Mütze, Torsten
Spöhel, Reto
2012Probabilistic one-player Ramsey games via deterministic two-player games
In: SIAM Journal on Discrete Mathematics [26], 1031-1049
Journal Article
SpoehelK2012Krivelevich, Michael
Spöhel, Reto
2012Creating small subgraphs in Achlioptas processes with growing parameter
In: SIAM Journal on Discrete Mathematics [26], 670-686
Journal Article
SpoehelPST2013Panagiotou, Konstantinos
Spöhel, Reto
Steger, Angelika
Thomas, Henning
2013Explosive percolation in Erdös-Rényi-like random graph processes
In: Combinatorics, Probability and Computing [22], 133-145
Journal Article
Srivastava96Srivastava, Satanand1996Entwicklung und Implementierung eines Entscheidungsalgorithmus zur Zuordnung von Probleminstanzen an Hierarchieebenen
Universität des Saarlandes
Thesis - Masters thesis
SRWLSM02Schömer, Elmar
Reichel, Joachim
Warken, Thomas
Lennerz, Christian
2002Efficient Collision Detection for Curved Solid Objects
In: Proceedings of the Seventh ACM Symposium on Solid Modeling and Applications, 321-328
Proceedings Article
SSS12Saha, Chandan
Saptharishi, Ramprasad
Saxena, Nitin
2013Attachment IconA Case of Depth-3 Identity Testing, Sparse Factorization and Duality
In: Computational Complexity [22], 39-69
Electronic Journal Article
SSS13Agrawal, Manindra
Saha, Chandan
Saxena, Nitin
2013A Case of Depth-3 Identity Testing, Sparse Factorization and Duality
In: 45th ACM Symposium on the Theory of Computing (STOC-13), toappear
Proceedings Article
stacs07_randDoerr, Benjamin2007Attachment IconRandomly Rounding Rationals with Cardinality Constraints and Derandomizations
In: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, 441-452
Proceedings Article
STACS::KaufmannM1987Kaufmann, Michael
Mehlhorn, Kurt
1987On Local Routing of Two-Terminal Nets
In: STACS '87 : 4th Annual Symposium on Theoretical Aspects of Computer Science, 40-52
Proceedings Article
Stee12van Stee, Rob2012Attachment IconAn improved algorithm for online rectangle filling
In: Theoretical Computer Science [423], 59-74
Journal Article
Stee12avan Stee, Rob2012Attachment IconSIGACT News Online Algorithms Column 20: The Power of Harmony
In: SIGACT News [43], 127-136
Journal Article
Stee12bvan Stee, Rob2012Attachment IconSIGACT News Online Algorithms Column 21: APPROX and ALGO
In: SIGACT News [43], 123-129
Journal Article
Stephan2000Stephan, Anne2000Implementierung eines heuristischen und eines exakten Ansatzes zur Berechnung minimaler Steinerbäume in Netzwerken
Universität des Saarlandes
Thesis - Masters thesis
Stormer98Stormer, Henrik1998Ein Programm zum visuellen Erlernen von Graphalgorithmen
Universität des Saarlandes
Thesis - Masters thesis
Sun2010Kao, Ming-Yang
Leung, Henry C. M.
Sun, He
Zhang, Yong
2010Deterministic 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
Sun2011Manjunath, Madhusudan
Mehlhorn, Kurt
Panagiotou, Konstantinos
Sun, He
2011Approximate Counting of Cycles in Streams
In: 19th Annual European Symposium on Algorithms (ESA-11), 677-688
Proceedings Article
Sun2011bChin, Francis Y. L.
Guo, Zeyu
Sun, He
2011Minimum Manhattan Network is NP-Complete
In: Discrete & Computational Geometry [45], 701-722
Journal Article
Sun2011cGuo, Zeyu
Sun, He
Zhu, Hong
2011Greedy Construction of 2-Approximate Minimum Manhattan Networks
In: International Journal of Computational Geometry and Applications [21], 331-350
Journal Article
Sun2012aGiakkoupis, George
Sauerwald, Thomas
Sun, He
Woelfel, Philipp
2012Low Randomness Rumor Spreading via Hashing
In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 314-325
Electronic Proceedings Article
Sun2012bKane, Daniel
Mehlhorn, Kurt
Sauerwald, Thomas
Sun, He
2012Counting Arbitrary Subgraphs in Data Streams
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 598-609
Proceedings Article
Sun2012cSauerwald, Thomas
Sun, He
2012Tight 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
SurveyCycleBasesKavitha, T.
Liebchen, Ch.
Mehlhorn, K.
Michail, D.
Rizzi, R.
Ueckerdt, T.
Zweig, K.
2009Attachment IconCycle Bases in Graphs: Characterization, Algorithms, Complexity, and Applications
In: Computer Science Review [3], 199-243
Journal Article
SviridenkoWiese2013Sviridenko, Maxim
Wiese, Andreas
2013Approximating 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-05Seidel, Raimund
Wolpert, Nicola
2005On 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-05Schömer, Elmar
Wolpert, Nicola
2006An Exact and Efficient Approach for Computing a Cell in an Arrangement of Quadrics
In: Computational Geometry [33], 65 - 97
Journal Article
SWAT::DietzfelbingerMHR1988Dietzfelbinger, Martin
Mehlhorn, Kurt
Meyer auf der Heide, Friedhelm
Rohnert, H.
1988Upper and Lower Bounds for the Dictionary Problem
In: Algorithm theory (SWAT-88) : 1st Scandinavian workshop, 214-215
Proceedings Article
SymHyp2006Doerr, Benjamin
Gnewuch, Michael
Hebbinghaus, Nils
2006Attachment IconDiscrepancy of Symmetric Products of Hypergraphs
In: The Electronic Journal of Combinatorics [13], 1-12
Electronic Journal Article
S:NEWDSC:2011Sagraloff, Michael2011When 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
TechReportGDF2006Bast, Holger
Majumdar, Debapriyo
Schenkel, Ralf
Theobald, Martin
Weikum, Gerhard
2006Attachment IconIO-Top-k: Index-Access Optimized Top-k Query ProcessingReport
Telikepalli2003aTelikepalli, Kavitha2003Efficient 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
Telikepalli2003bTelikepalli, Kavitha
Varadarajan, Kasturi
2003On Shortest Paths in Line Arrangements
In: 15th Canadian Conference in Computational Geometry (CCCG-03), 170-173
Proceedings Article
Telikepalli2003cTelikepalli, Kavitha
Chandran, Sunil
Subramanian, C. R.
2003Isoperimetric Inequalities and Width Parameters of Graphs
In: Computing and Combinatorics : 9th Annual International Conference, COCOON 2003, 385-393
Proceedings Article
TF_CGTA1Bringmann, Karl
Friedrich, Tobias
2010Approximating the volume of unions and intersections of high-dimensional geometric objects
In: Computational Geometry [43], 601-610
Journal Article
TF_ECJ4Bringmann, Karl
Friedrich, Tobias
2010An Efficient Algorithm for Computing Hypervolume Contributions
In: Evolutionary Computation [18], 383-402
Journal Article
TF_RSA2Friedrich, Tobias
Sauerwald, Thomas
Vilenchik, Dan
2010Smoothed Analysis of Balancing Networks
In: Random Structures and Algorithms [Early View], 1-24
Electronic Journal Article
Thiel-Diss96Thiel, Christian1996Effiziente Algorithmen für Probleme der Kollisionserkennung und der geometrischen Optimierung
Universität des Saarlandes
Thesis - PhD thesis
ThielDiss04Thiel, Sven2004Efficient Algorithms for Constraint Propagation and for Processing Tree Descriptions
Universität des Saarlandes
Thesis - PhD thesis
ThielMasterThesis99Thiel, Sven1999Attachment IconPersistente Suchbäume
Universität des Saarlandes
Thesis - Masters thesis
Thome2000Thome, Stefan2000Erweiterung des hierarchischen Zeichenmodells in ArchEd
Universität des Saarlandes
Thesis - Masters thesis
Thorup/2000Thorup, Mikkel2000Floats, Integers, and Single Source Shortest Paths
In: Journal of Algorithms [35], 189 -201
Journal Article
Traeff-Kessler96Keßler, Christoph W.
Träff, Jesper Larsson
1996A 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-Zaroliagis96Träff, Jesper Larsson
Zaroliagis, Christos
1996A 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
Traeff95Träff, Jesper Larsson1995An Experimental Comparison of two Distributed Singel-Source Shortest Path Algorithm
In: Parallel Computing [21], 1505-1532
Journal Article
Traeff96Träff, Jesper Larsson1996A Heuristic for Blocking Flow Algorithms
In: European Journal of Operational Research [89], 564-569
Journal Article
TraeffZaroliagis2000Träff, Jesper Larsson
Zaroliagis, Christos
2000A 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:stringCzumaj, Artur
Ferragina, Paolo
Gasieniec, Leszek
Muthukrishnan, S.
Träff, Jesper Larsson
1997The Architecture of a Software Library for String Processing
In: Proceedings of the Workshop on Algorithm Engineering (WAE-97), 166-176
Proceedings Article
TSeidel97Seidel, Tillmann1997Paralleles List Ranking
Universität des Saarlandes
Thesis - Masters thesis
Tsigas-et-al96Kirousis, Lefteris
Spirakis, Paul G.
Tsigas, Philippas
1996Simple Atomic Snapshots: A Linear Complexity Solution with Unbounded Time-Stamps
In: Information Processing Letters [58], 47-53
Journal Article
unbiasmatr2006Doerr, Benjamin
Klein, Christian
2006Attachment IconUnbiased Rounding of Rational Matrices
In: FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science: 26th International Conference, 200-211
Proceedings Article
vanStee2008Epstein, Leah
van Stee, Rob
2008Attachment IconThe price of anarchy on uniformly related machines revisited
In: Algorithmic Game Theory, First International Symposium, SAGT 2008, 46-57
Proceedings Article
vanStee2008aEpstein, Leah
van Stee, Rob
2008Attachment IconMaximizing the minimum load for selfish agents
In: LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, 264-275
Proceedings Article
vanStee2008bvan Stee, Rob2008Attachment IconPacket Switching in Single Buffer
In: Encyclopedia of Algorithms, 1-99
Part of a Book
vanStee2008dvan Stee, Rob2008Attachment IconPaging
In: Encyclopedia of Algorithms, 1-99
Part of a Book
vanStee2008eEpstein, Leah
Levin, Asaf
van Stee, Rob
2008Attachment IconTwo-dimensional packing with conflicts
In: Acta Informatica [45], 155-175
Journal Article
vanStee2008fKrumke, Sven Oliver
Schwahn, Anne
van Stee, Rob
Westphal, Stephan
2008Attachment IconA monotone approximation algorithm for scheduling with precedence constraints
In: Operations Research Letters [36], 247-249
Journal Article
vanStee2008gEpstein, Leah
Levin, Asaf
van Stee, Rob
2008Attachment IconOnline unit clustering: Variations on a theme
In: Theoretical Computer Science [407], 85-96
Journal Article
vanStee2008hPruhs, Kirk
van Stee, Rob
Uthaisombut, Patchrawat
2008Attachment IconSpeed Scaling of Tasks with Precedence Constraints
In: Theory of Computing Systems [43], 67-80
Journal Article
vanStee2008ivan Stee, Rob2008Attachment IconCombinatorial algorithms for packing and scheduling problems
Universität Karlsruhe
Thesis - Habilitation thesis
vanStee2008jEpstein, Leah
van Stee, Rob
2008Attachment IconApproximation schemes for packing splittable items with cardinality constraints
In: Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, 232-245
Proceedings Article
vanStee2008kEpstein, Leah
van Stee, Rob
2008Attachment IconOn the Online Unit Clustering Problem
In: Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, 193-206
Proceedings Article
vanStee2009aEpstein, Leah
van Stee, Rob
2010Attachment IconOn the online unit clustering problem
In: ACM Transactions on Algorithms [7], 1-18
Journal Article
vanStee2010van Stee, Rob2011Attachment IconAn improved algorithm for online rectangle filling
In: Approximation and Online Algorithms : 8th International Workshop, WAOA 2010, 249-260
Proceedings Article
vanStee2013van Stee, Rob2013SIGACT News Online Algorithms Column 22
In: SIGACT News [44], 125
Journal Article
vanSteeTALG2011Epstein, Leah
van Stee, Rob
2011On the online unit clustering problem
In: ACM Transactions on Algorithms [7], 7:1-7:1
Journal Article
vanZuylenALG2011van Zuylen, Anke2011Deterministic Sampling Algorithms for Network Design
In: Algorithmica [60], 110-151
Journal Article
vanZuylenCTW2011van Zuylen, Anke
Schalekamp, Frans
Williamson, David P.
2011Popular Ranking
In: 10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2011, 267-270
Electronic Proceedings Article
vanZuylenORL2011van Zuylen, Anke2011An improved monotone algorithm for scheduling related machines with precedence constraints
In: Operations Research Letters [39], 423-427
Journal Article
vanZuylenTCS2011van Zuylen, Anke2011Linear programming based approximation algorithms for feedback set problems in bipartite tournaments.
In: Theoretical Computer Science [412], 2556-2561
Journal Article
vanZuylenWAOA2011van Zuylen, Anke2012Simpler 3/4-approximation algorithms for MAX SAT
In: Approximation and Online Algorithms : 9th International Workshop, WAOA 2011, 188-197
Proceedings Article
VAT2013Jurkiewicz, Tomasz
Mehlhorn, Kurt
2013The cost of address translation
In: Proceedings of the Meeting on Algorithm Engineering & Experiments,
Proceedings Article
VerificationCertComp12Alkassar, Eyad
Böhme, Sascha
Mehlhorn, Kurt
Rizkallah, Christine
2013A Framework for the Verification of Certifying ComputationsUnpublished/Draft
Vidali2009Vidali, Angelina2009The Geometry of Truthfulness
In: Internet and Network Economics : 5th International Workshop, WINE 2009, 340-350
Proceedings Article
Vidali2010Pountourakis, Emmanouil
Vidali, Angelina
2010A complete characterization of group-strategyproof mechanisms of cost-sharing.
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. I, 146-157
Proceedings Article
VLM97Vingron, Martin
Lenhof, Hans-Peter
Mutzel, Petra
1997Computational Molecular Biology
In: Annotated Bibliographies in Combinatorial Optimization, 445-471
Part of a Book
Vocking2000Maggs, Bruce M.
Vöcking, Berthold
2000Improved Routing and Sorting on Multibutterflies
In: Algorithmica [28], 438-464
Journal Article
Voecking2000Karp, Richard
Schindelhauer, Christian
Shenker, Scott
Vöcking, Berthold
2000Randomized Rumor Spreading
In: 41th Annual Symposium on Foundations of Computer Science (FOCS-00), 565-574
Proceedings Article
Voecking2001aRajaraman, Rajmohan
Richa, Andrea W.
Vöcking, Berthold
Vuppuluri, Gayathri
2001A 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
Voecking2001bVöcking, Berthold2001Almost Optimal Permutation Routing on Hypercubes
In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC-01), 530-539
Proceedings Article
Voecking2001cVöcking, Berthold2001Symmetric 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
Vöcking2003Krick, Christof
Meyer auf der Heide, Friedhelm
Räcke, Harald
Vöcking, Berthold
Westermann, Matthias
2003Data Management in Networks: Experimental Evaluation of a Provably Good Strategy
In: Theory of Computing Systems [35], 217-245
Journal Article
w-jccetansal-03Wolpert, Nicola2003Jacobi Curves: Computing the Exact Topology of Arrangements of Non-Singular Algebraic CurvesReport
WadsCentroid07Ajwani, Deepak
Ray, Saurabh
Seidel, Raimund
Tiwary, Hans Raj
2007On Computing the Centroid of the Vertices of an Arrangement and Related Problems
In: 10th Workshop on Algorithms and Data Structures (WADS), 519-528
Proceedings Article
Wagner2011EWEAWagner, Markus
Veeramachaneni, Kalyan
Neumann, Frank
O'Reilly, Una-May
2011Attachment IconOptimizing the Layout of 1000 Wind Turbines
In: European Wind Energy Association Annual Event, 1-10
Proceedings Article
Wahl2000Wahl, Michaela2000Ein neuer Algorithmus für Online-Scheduling
Universität des Saarlandes
Thesis - Masters thesis
Wahl2010Wahlström, Magnus2011New Plain-Exponential Time Classes for Graph Homomorphism
In: Theory of Computing Systems [49], 273-282
Journal Article
Wahlstroem2008Wahlström, Magnus2008A 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
Wahlstroem2009Wahlström, Magnus2009New 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
Wahlstroem2013aWahlström, Magnus2013Abusing 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
Warken2001Warken, Thomas
Schömer, Elmar
2001Rolling 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
Warken2004Warken, Thomas2004Collision detection for Curved Rigid Objects in the Context of Dynamics Simulations
Universität des Saarlandes
Thesis - PhD thesis
weberetal05airwebBifet, Albert
Castillo, Carlos
Chirita, Paul-Elexandru
Weber, Ingmar
2005An Analysis of Factors Used in Search Engine Ranking
In: 1st International Workshop on Adversarial Information Retrieval on the Web (AIRWeb'05), 1-10
Electronic Proceedings Article
WeberPhDWeber, Ingmar2007Attachment IconEfficient Index Structures for and Applications of the CompleteSearch Engine
Universität des Saarlandes
Thesis - PhD thesis
WeikumBCHST05Weikum, Gerhard
Bast, Holger
Canright, Geoffrey
Hales, David
Schindelhauer, Christian
Triantafillou, Peter
2007Towards Peer-to-Peer Web Search
In: 1st European Conference on Complex Systems, ECCS'05, ?
Proceedings Article
WeikumBCHST05bWeikum, Gerhard
Bast, Holger
Canright, Geoffrey
Hales, David
Schindelhauer, Christian
Triantafillou, Peter
2005Towards 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
WeinandDipl05Weinand, Caroline2005Fill-in Reduction while Solving large, sparse Linear Systems with Graph Theoretical Methods
Universität des Saarlandes
Thesis - Masters thesis
Weiskircher1998Mutzel, Petra
Weiskircher, René
1998Attachment IconTwo-Layer Planarization in Graph Drawing
In: Proceedings of the 9th International Symposium on Algorithms and Computation (ISAAC-98), 69-78
Proceedings Article
Weiskircher1999Mutzel, Petra
Weiskircher, René
1999Optimizing 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
Weiskircher97Weiskircher, Rene1997Attachment Icon2-Schicht-Planarisierung bipartiter Graphen
Universität des Saarlandes
Thesis - Masters thesis
WeiskircherDiss02Weiskircher, Rene2002New Applications of SPQR-Trees in Graph Drawing
Universität des Saarlandes
Thesis - PhD thesis
Welzl87aAlt, Helmut
Mehlhorn, Kurt
Wagener, Hubert
Welzl, Emo
1987Convergence, Similarity and Symmetries of Geometric Objects
In: Computational geometry (SCG-87) : 3rd symposium, 308-315
Proceedings Article
Wilhelmi95Wilhelmi, Harald1995Erzeugung von Pseudozufallszahlen gemäß einer veränderbaren Verteilung
Universität des Saarlandes
Thesis - Masters thesis
Winzen2011bWinzen, Carola2011Direction-Reversing Quasi-Random Rumor Spreading with RestartsUnpublished/Draft
Winzen2013Winzen, Carola2013Direction-Reversing Quasi-Random Rumor Spreading with Restarts
In: Information Processing Letters [113], 921-926
Journal Article
Winzen2013zClementi, Andrea
Crescenzi, Pierluigi
Doerr, Carola
Fraigniaud, Pierre
Isopi, Marc
Panconesi, Alessandro
Pasquale, Francesco
Silvestri, Riccardo
2013Rumor Spreading in Random Evolving Graphs
In: Proc. of the 21st European Symposium on Algorithms (ESA 2013), 325-336
Proceedings Article
WinzenDiss2011Winzen, Carola2011Toward a complexity theory for randomized search heuristics : black box models
Universität des Saarlandes
Thesis - PhD thesis
Wissen98Wissen, Michael1998Automatisiertes Zeichnen von Zustandsdiagrammen
Universität des Saarlandes
Thesis - Masters thesis
WolpertDiss2002Wolpert, Nicola2002An Exact and Efficient Approach for Computing a Cell in an Arrangement of Quadrics
Universität des Saarlandes
Thesis - PhD thesis
Xia2013-soda-clxCai, Jin-Yi
Lu, Pinyan
Xia, Mingji
2013Dichotomy for Holant* Problems with a Function on Domain Size 3
In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 1278-1295
Proceedings Article
XKSC2008Xu, Chihao
Karrenbauer, Andreas
Soh, Kian Min
Codrea, Cosmin
2008Consecutive multiline addressing: A scheme for addressing PMOLEDs
In: Journal of the Society for Information Display [16], 211-219
Journal Article
XKSW2007Xu, Chihao
Karrenbauer, Andreas
Soh, Kian Min
Wahl, Jürgen
2007A New Addressing Scheme for PM OLED Display
In: SID 2007 International Symposium Digest of Technical Papers, 97-100
Proceedings Article
YSSSoftpredicates2013Yap, Chee
Sagraloff, Michael
Sharma, Vikram
2013Analytic Root Clustering: A Complete Algorithm using Soft Zero TestsUnpublished/Draft
Zaro-et-al-1-95Dubhashi, Devdatt
Pantziou, Grammati E.
Spirakis, Paul G.
Zaroliagis, Christos
1995The Fourth Moment in Luby's Distribution
In: Theoretical Computer Science [148], 133-140
Journal Article
Zaro-et-al-1-97Kagaris, Dimitrios
Pantziou, Grammati E.
Tragoudas, Spyros
Zaroliagis, Christos
1999Transmissions in a network with capacities and delays
In: Networks [33
], 167-174
Journal Article
Zaro-et-al-2-95Kagaris, Dimitrios
Pantziou, Grammati E.
Tragoudas, Spyros
Zaroliagis, Christos
1995Quickest Paths: Parallelization and Dynamization
In: 28th Annual Hawaii International Conference on System Sciences (HICSS-28), 39-44
Proceedings Article
Zaro-et-al-3-95Kagaris, Dimitrios
Pantziou, Grammati E.
Tragoudas, Spyros
Zaroliagis, Christos
1995On the Computation of Fast Data Transmissions in Networks
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 291-302
Proceedings Article
Zaroliagis96Arikati, Srinivasa Rao
Chen, Danny Z.
Chew, L. Paul
Das, Gautam
Smid, Michiel
Zaroliagis, Christos
1996Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane
In: Algorithms - ESA '96: 4th Annual European Symposium, 514-528
Proceedings Article
Zaroliagis97PPLZaroliagis, Christos1997Simple and Work-Efficient Parallel Algorithms for the Minimum Spanning Tree Problem
In: Parallel Processing Letters [7], 25-37
Journal Article
Ziad94Abo-Hasna, Ziad1994Verdrahtung von Kanälen mit Seitenanschlüssen
Universität des Saarlandes
Thesis - Masters thesis
Ziegelmann1999Comes, Jochen
Ziegelmann, Mark
1999An Easy to Use Implementation of Linear Perturbations within CGAL
In: Algorithm engineering (WAE-99) : 3rd International Workshop, WAE'99, 169-182
Proceedings Article
Ziegelmann2001Ziegelmann, Mark2001Constrained Shortest Paths and Related Problems
Universität des Saarlandes
Thesis - PhD thesis
Ziegenbein97Ziegenbein, Kurt1997Bewertung verschiedener paarweiser Alignment-Methoden, Ersetzungsmatrizen und Gap-Funktionen
Universität des Saarlandes
Thesis - Masters thesis
Ziegler95Ziegler, Thomas1995Max-Weighted-Matching auf allgemeinen Graphen
Universität des Saarlandes
Thesis - Masters thesis
ZieglerDiss00Ziegler, Thomas2000Crossing Minimization in Automatic Graph Drawing
Universität des Saarlandes
Thesis - PhD thesis
Zuelow94von Zülow, Max Henning1994Das k-Closest-Pair-Problem
Universität des Saarlandes
Thesis - Masters thesis

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