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

MPI-INF D1 Publications

MPI-INF D1 Publications

Entries sorted by: 1. Author,Editor - 1. by Individual - 1. by Names

Login to this database


 

Viewing:

1. Author,Editor - 1. by Individual - 1. by Names
Next Page
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
#YearAuthor(s) [non member]TitleType
2
Hide details for Saad, Youssef (ed.)Saad, Youssef (ed.)
1996Träff, Jesper Larsson
Zaroliagis, Christos
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
1996Hagerup, TorbenAllocating Independent Tasks to Parallel Processors: An Experimental Study
In: Parallel Algorithms for Irregularly Structured Problems: 3rd International Workshop (IRREGULAR'96), 1-33
Proceedings Article
3
Hide details for Saberi, Amin (ed.)Saberi, Amin (ed.)
2010[Christodoulou, George]
[Kovacs, Annamaria]
van Stee, Rob
A truthful constant approximation for maximizing the minimum load on related machines
In: Internet and Network Economics : 6th International Workshop, WINE 2010, 182-193
Proceedings Article
2010Elbassioni, Khaled
[Fouz, Mahmoud]
[Swamy, Chaitanya]
Approximation Algorithms for Non-single-minded Profit-Maximization Problems with Limited Supply
In: Internet and Network Economics : 6th International Workshop, WINE 2010, 462-472
Proceedings Article
2010[Christodoulou, George]
Elbassioni, Khaled
[Fouz, Mahmoud]
Truthful Mechanisms for Exhibitions
In: Internet and Network Economics : 6th International Workshop, WINE 2010, 170-181
Proceedings Article
1
Hide details for Sablonnière, Paul (ed.)Sablonnière, Paul (ed.)
2000Mehlhorn, Kurt
Schirra, Stefan
Attachment IconGeometric Computing with CGAL and LEDA
In: Curve and surface design, Saint-Malo 1999, 277-286
Proceedings Article
1
Hide details for Sabo, HolgerSabo, Holger
1999Sabo, HolgerEin schnelles Verfahren zur exakten Berechnung von Skalarprodukten
Universität des Saarlandes
Thesis - Masters thesis
2
Hide details for Sack, Jörg-RüdigerSack, Jörg-Rüdiger
2000Mehlhorn, Kurt
[Sack, Jörg-Rüdiger]
Editorial
In: Computational Geometry [17], 1-2
Journal Article
1999Mehlhorn, Kurt
Sack, Jörg-Rüdiger
Urrutia, Jorg
Editorial
In: Computational Geometry [12], 153-154
Journal Article
12
Hide details for Sack, Jörg-Rüdiger (ed.)Sack, Jörg-Rüdiger (ed.)
2011Harren, Rolf
[Jansen, Klaus]
[Prädel, Lars]
van Stee, Rob
Attachment IconA (5/3 + ε)-Approximation for Strip Packing
In: Algorithms and Data Structures : 12th International Symposium, WADS 2011, 475-487
Proceedings Article
2009Angelopoulos, SpyrosOnline Priority Steiner Tree Problems
In: Algorithms and Data Structures : 11th International Symposium, WADS 2009, 37-48
Proceedings Article
2007Ajwani, Deepak
[Ray, Saurabh]
[Seidel, Raimund]
[Tiwary, Hans Raj]
On Computing the Centroid of the Vertices of an Arrangement and Related Problems
In: 10th Workshop on Algorithms and Data Structures (WADS), 519-528
Proceedings Article
2005[Mortensen, Christian Worm]
Pettie, Seth
The complexity of implicit and space-efficient priority queues
In: Algorithms and data structures : 9th International Workshop, WADS 2005, 49-60
Proceedings Article
2001[Arge, Lars]
Meyer, Ulrich
[Toma, Laura]
[Zeh, Norbert]
On External-Memory Planar Depth First Search
In: Proceedings of the 7th International Workshop on Algorithms and Data Structures (WADS-01), 471-482
Proceedings Article
2000Schirra, StefanRobustness and Precision Issues in Geometric Computation
In: Handbook of Computational Geometry, 597-632
Part of a Book
1996[Krithivasan, Kamala]
[Rema, Anna]
Schirra, Stefan
[Vijaykumar, P.I.]
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
1995Mehlhorn, KurtExperiences with the implementation of geometric algorithms
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 518-518
Proceedings Article
1995[Kagaris, Dimitrios]
[Pantziou, Grammati E.]
[Tragoudas, Spyros]
Zaroliagis, Christos
On the Computation of Fast Data Transmissions in Networks
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 291-302
Proceedings Article
1995Grove, Edward
[Kao, Ming-Yang]
[Krishnan, P.]
[Vitter, Jeffrey Scott]
Online Perfect Matching and Mobile Computing
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 194-205
Proceedings Article
1995Albers, Susanne
[Koga, Hisashi]
Page migration with limited local memory capacity
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 412-158
Proceedings Article
1993Dobrindt, Katrin
Mehlhorn, Kurt
Yvinec, Mariette
Attachment IconA Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron
In: Algorithms and data structures (WADS-93) : 3rd workshop, 314-324
Proceedings Article
1
Hide details for Sagot, Marie-FranceSagot, Marie-France
2012[Nor, Igor]
Hermlin, Danny
[Charlat, Sylvain]
[Engelstadter, Jan]
[Reuter, Max]
[Duron, Olivier]
[Sagot, Marie-France]
Mod/Resc Parsimony Inference: Theory and application
In: Information and Computation [213], 23-32
Journal Article
32
Hide details for Sagraloff, MichaelSagraloff, Michael
2013[Yap, Chee]
Sagraloff, Michael
[Sharma, Vikram]
Analytic Root Clustering: A Complete Algorithm using Soft Zero TestsUnpublished/Draft
2013Berberich, Eric
Emeliyanenko, Pavel
Kobel, Alexander
Sagraloff, Michael
Exact symbolic–numeric computation of planar algebraic curves
In: Theoretical Computer Science [491], 1-32
Journal Article
2013Kobel, Alexander
Sagraloff, Michael
Fast Approximate Polynomial Multipoint Evaluation and Applications
In: arXiv [abs/1304.8069], 17
Electronic Journal Article
2013Mehlhorn, Kurt
Sagraloff, Michael
Wang, Pengming
From Approximate Factorization to Root Isolation with Application to Cylindrical Algebraic Decomposition
In: arXiv [abs/1301.4870],
Electronic Journal Article
2012[Kerber, Michael]
Sagraloff, Michael
A worst-case bound for topology computation of algebraic curves
In: Journal of Symbolic Computation [47], 239-258
Journal Article
2012Berberich, Eric
Emeliyanenko, Pavel
Kobel, Alexander
Sagraloff, Michael
Exact Symbolic-Numeric Computation of Planar Algebraic Curves
In: arXiv [abs/1201.1548v1], 1-46
Electronic Journal Article
2012Sagraloff, MichaelExaktes geometrisches RechnenMiscellaneous
2012Emeliyanenko, Pavel
Sagraloff, Michael
On the Complexity of Solving a Bivariate Polynomial System
In: ISSAC 2012 : Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, 154-161
Proceedings Article
2012Sagraloff, MichaelWhen 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
2011Mehlhorn, Kurt
Sagraloff, Michael
A deterministic algorithm for isolating real roots of a real polynomial
In: Journal of Symbolic Computation [46], 70-90
Journal Article
2011Mehlhorn, Kurt
Osbild, Ralf
Sagraloff, Michael
A General Approach to the Analysis of Controlled Perturbation Algorithms
In: Computational Geometry [44], 507-528
Journal Article
2011[Kerber, Michael]
Sagraloff, Michael
A Note on the Complexity of Real Algebraic Hypersurfaces
In: Graphs and Combinatorics [27], 419-430
Journal Article
2011Sagraloff, Michael
[Yap, Chee]
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
2011Berberich, Eric
Emeliyanenko, Pavel
Sagraloff, Michael
An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks
In: 2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX), 35-47
Proceedings Article
2011Berberich, Eric
Emeliyanenko, Pavel
Kobel, Alexander
Sagraloff, Michael
Arrangement Computation for Planar Algebraic Curves
In: arXiv [abs/1103.4697],
Electronic Journal Article
2011Berberich, Eric
Emeliyanenko, Pavel
Kobel, Alexander
Sagraloff, Michael
Arrangement Computation for Planar Algebraic Curves
In: Proceedings of the 4th Internal Workshop on Symbolic-Numeric Computation, 88-98
Proceedings Article
2011[Kerber, Michael]
Sagraloff, Michael
Efficient Real Root Approximation
In: ISSAC 2011 : Proceedings of the 36th International Symposium on Symbolic and Algebraic Computation, 209-216
Proceedings Article
2011Sagraloff, MichaelWhen 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
2010Sagraloff, MichaelA General Approach to Isolating Roots of a Bitstream Polynomial
In: Mathematics in Computer Science [4], 481-506
Journal Article
2010Berberich, Eric
Kerber, Michael
Sagraloff, Michael
An efficient algorithm for the stratification and triangulation of an algebraic surface
In: Computational Geometry: Theory and Applications (CGTA) [43], 257-278
Journal Article
2010Berberich, Eric
Emeliyanenko, Pavel
Sagraloff, Michael
An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks
In: CoRR [abs/1010.1386], 1-16
Electronic Journal Article
2010Sagraloff, MichaelOn the Complexity of Real Root Isolation
In: CoRR [abs/1011.0344], 1-33
Electronic Journal Article
2009Berberich, Eric
Sagraloff, Michael
A Generic and Flexible Framework for the Geometrical and Topological Analysis of (Algebraic) Surfaces
In: Computer Aided Geometric Design (CAGD) [26], 627-647
Journal Article
2009Sagraloff, Michael
Kerber, Michael
Hemmer, Michael
Certified Complex Root Isolation via Adaptive Root Separation Bounds
In: The Joint Conference of ASCM 2009 and MACIS 2009, 151-166
Proceedings Article
2009Mehlhorn, Kurt
Sagraloff, Michael
Isolating real roots of real polynomials
In: Proceedings of the 2009 international symposium on Symbolic and algebraic computation (ISSAC), 247-254
Proceedings Article
2009Emeliyanenko, Pavel
Berberich, Eric
Sagraloff, Michael
Attachment IconVisualizing Arcs of Implicit Algebraic Curves, Exactly and Fast
In: Advances in Visual Computing : 5th International Symposium, ISVC 2009, 608-619
Proceedings Article
2008Mehlhorn, Kurt
Sagraloff, Michael
A deterministic Bitstream Descartes AlgorithmReport
2008Mehlhorn, Kurt
Osbild, Ralf
Sagraloff, Michael
A General Approach to the Analysis of Controlled Perturbation AlgorithmsReport
2008Berberich, Eric
Sagraloff, Michael
Attachment IconA Generic and Flexible Framework for the Geometrical and Topological Analysis of (Algebraic) Surfaces
In: Proceedings of the 2008 ACM Symposium on Solid and Physical Modeling, 171-182
Proceedings Article
2008Berberich, Eric
Kerber, Michael
Sagraloff, Michael
Attachment IconExact Geometric-Topological Analysis of Algebraic Surfaces
In: Proceedings of the 24th ACM Symposium on Computational Geometry, 164-173
Proceedings Article
2008Berberich, Eric
Kerber, Michael
Sagraloff, Michael
Attachment IconGeometric Analysis of Algebraic Surfaces Based on Planar Arrangements
In: 24th European Workshop on Computational Geometry - Collection of Abstracts, 29-32
Proceedings Article
2006Mehlhorn, Kurt
Osbild, Ralf
Sagraloff, Michael
Attachment IconReliable and Efficient Computational Geometry Via Controlled Perturbation
In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Part I, 299-310
Proceedings Article
1
Hide details for Sahai, Amit (ed.)Sahai, Amit (ed.)
2003[Hall, Alex]
[Langkau, Katharina]
Skutella, Martin
An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, 71-82
Proceedings Article
6
Hide details for Saha, ChandanSaha, Chandan
2013[Agrawal, Manindra]
Saha, Chandan
[Saxena, Nitin]
A Case of Depth-3 Identity Testing, Sparse Factorization and Duality
In: 45th ACM Symposium on the Theory of Computing (STOC-13), toappear
Proceedings Article
2013Saha, Chandan
[Saptharishi, Ramprasad]
[Saxena, Nitin]
Attachment IconA Case of Depth-3 Identity Testing, Sparse Factorization and Duality
In: Computational Complexity [22], 39-69
Electronic Journal Article
2012[Agrawal, Manindra]
Saha, Chandan
[Saptharishi, Ramprasad]
[Saxena, Nitin]
Attachment IconJacobian hits circuits: hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits
In: STOC'12 : Proceedings of the 2012 ACM Symposium on Theory of Computing, 599-614
Proceedings Article
2012[Kayal, Neeraj]
Saha, Chandan
Attachment IconOn the Sum of Square Roots of Polynomials and Related Problems
In: The ACM Transactions on Computation Theory [4], 9:1-9:15
Journal Article
2012[Agrawal, Manindra]
Saha, Chandan
[Saxena, Nitin]
Attachment IconQuasi-polynomial Hitting-set for Set-depth-Delta Formulas
In: arXiv [abs/1209.2333], 1-13
Electronic Journal Article
2011[Kayal, Neeraj]
Saha, Chandan
Attachment IconOn the Sum of Square Roots of Polynomials and Related Problems
In: 26th IEEE Conference on Computational Complexity (CCC), 292-299
Proceedings Article
1
Hide details for Sahin, Erol (ed.)Sahin, Erol (ed.)
2010Kötzing, Timo
Neumann, Frank
[Röglin, Heiko]
[Witt, Carsten]
Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem
In: Swarm Intelligence : 7th International Conference, ANTS 2010, 324-335
Proceedings Article
3
Hide details for Sahni, Sartaj (ed.)Sahni, Sartaj (ed.)
2010Friedrich, Tobias
[Sauerwald, Thomas]
The Cover Time of Deterministic Random Walks
In: Computing and Combinatorics : 16th Annual International Conference, COCOON 2010, 130-139
Proceedings Article
2010[Fernau, Henning]
[Fomin, Fedor V.]
Philip, Geevarghese
[Saurabh, Saket]
Attachment IconThe Curse of Connectivity: $t$-Total Vertex (Edge) Cover
In: Computing and Combinatorics, 16th Annual International Conference, COCOON 2010, Nha Trang, Vietnam, July 19-21, 2010. Proceedings, 34-43
Proceedings Article
2004Baswana, Surender
[Sen, Sandeep]
Randomized graph data-structures for approximate shortest path problem
In: Handbook of Data Structures and Applications, 38.1-38.19
Part of a Book
1
Hide details for Sakellariou, Rizos (ed.)Sakellariou, Rizos (ed.)
2001Meyer, UlrichHeaps are better than Buckets: Parallel Shortest Paths on Unbalanced Graphs
In: Proceedings of the 7th International Euro-Par Conference on Parallel Processing (Euro-Par-01) :, 343-351
Proceedings Article
4
Hide details for Sali, Attila (ed.)Sali, Attila (ed.)
2011Panagiotou, Konstantinos
Spöhel, Reto
[Steger, Angelika]
[Thomas, Henning]
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
2011[Gugelmann, Luca]
Spöhel, Reto
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
2011[Mütze, Torsten]
Spöhel, Reto
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
2011Doerr, Benjamin
[Fouz, Mahmoud]
Friedrich, Tobias
Social Networks Spread Rumors in Sublogarithmic Time
In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 303-308
In: Electronic Notes in Discrete Mathematics [38], 303-308
Electronic Proceedings Article
5
Hide details for Salomaa, Arto (ed.)Salomaa, Arto (ed.)
1988Mehlhorn, Kurt
Yap, Chee-Keng
Constructive Hopf's Theorem: Or How to Untangle Closed Planar Curves
In: Automata, languages and programming (ICALP-88) : 15th international colloquium, 410-423
Proceedings Article
1984Mehlhorn, KurtData structures and algorithms. Volume 1 : Sorting and searchingBook
1984Mehlhorn, KurtData structures and algorithms. Volume 2 : Graph algorithms and NP-completenessBook
1984Mehlhorn, KurtData structures and algorithms. Volume 3 : Multi-dimensional searching and computational geometryBook
1977Mehlhorn, KurtDynamic Binary Search
In: Automata, Languages and Programming : Fourth Colloquium (ICALP-77), 323-336
Proceedings Article
1
Hide details for Salowe, Jeffrey S.Salowe, Jeffrey S.
1995Arya, Sunil
[Das, Gautam]
[Mount, David M.]
[Salowe, Jeffrey S.]
Smid, Michiel
Euclidean spanners: short, thin, and lanky
In: 27th Annual ACM Symposium on Theory of Computing (STOC95), 489-498
Proceedings Article
1
Hide details for Saluja, SanjeevSaluja, Sanjeev
1997Gunopulos, Dimitrios
Mannila, Heikki
Saluja, Sanjeev
Discovering all most specific sentences by randomized algorithms
In: Proceedings of the 6th International Conference on Database Theory (ICDT-97), 215-229
Proceedings Article
1
Hide details for Sanderson, Mark (ed.)Sanderson, Mark (ed.)
2006Bast, Holger
[Mortensen, Christian Worm]
Weber, Ingmar
Attachment IconOutput-Sensitive Autocompletion Search
In: String Processing and Information Retrieval : 13th International Conference, SPIRE 2006, 150-162
Proceedings Article
2
Hide details for Sanders, GeoffSanders, Geoff
2011De Sterck, Hans
[Henson, Van Emden]
[Sanders, Geoff]
Multilevel Aggregation Methods for Small-World Graphs with Application to Random-Walk RankingUnpublished/Draft
2011De Sterck, Hans
[Miller, Killian]
[Sanders, Geoff]
[Winlaw, Manda]
Recursively accelerated multilevel aggregation for Markov chains
In: SIAM Journal on Scientific Computing [32], 1652-1671
Journal Article
74
Hide details for Sanders, PeterSanders, Peter
2013[Sanders, Peter]
[Singler, Johannes]
van Stee, Rob
Attachment IconReal-time prefetching and caching
In: Journal of Scheduling [16], 47-58
Journal Article
2011Beier, Rene
Funke, Stefan
Matijevic, Domagoj
[Sanders, Peter]
Energy-Efficient Paths in Radio Networks
In: Algorithmica [61], 298-319
Journal Article
2009[Sanders, Peter]
Sivadasan, Naveen
[Skutella, Martin]
Online scheduling with bounded migration
In: Mathematics of Operations Research [34], 481-498
Journal Article
2008Mehlhorn, Kurt
[Sanders, Peter]
Algorithms and Data Structures: The Basic ToolboxBook
2007Bast, Holger
Funke, Stefan
[Sanders, Peter]
[Schultes, Dominik]
Fast Routing in Road Networks using Transit Nodes
In: Science [316], 566
Journal Article
2007Bast, Holger
Funke, Stefan
Matijevic, Domagoj
[Sanders, Peter]
[Schultes, Dominik]
In Transit to Constant Time Shortest-Path Queries in Road Networks
In: 9th Workshop on Algorithm Enginneering and Experiments (ALENEX'07), 46-59
Proceedings Article
2006Maue, Jens
[Sanders, Peter]
Matijevic, Domagoj
Goal Directed Shortest Path Queries Using Precomputed Cluster Distances
In: Experimental Algorithms, 5th International Workshop, WEA 2006, 316-327
Proceedings Article
2006Kaligosi, Kanela
[Sanders, Peter]
How Branch Mispredictions Affect Quicksort
In: Algorithms - ESA 2006, 14th Annual European Symposium, 780-791
Proceedings Article
2005Sanders, Peter
Steurer, David
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
2005Dementiev, Roman
[Kärkkäinen, Juha]
Mehnert, Jens
Sanders, Peter
Attachment IconBetter External Memory Suffix Array Construction
In: Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics
(ALENEX/ANALCO 2005), 86-97
Proceedings Article
2005Pettie, Seth
Sanders, Peter
Computing Approximate Matchings in External Memory, Streaming, Parallel, and Distributed Network ModelsUnpublished/Draft
2005[Hutchinson, David A.]
Sanders, Peter
[Vitter, Jeffrey Scott]
Duality Between Prefetching and Queued Writing with Parallel Disks
In: SIAM Journal on Computing [34], 1443-1463
Journal Article
2005[Fotakis, Dimitris]
[Pagh, Rasmus]
Sanders, Peter
Spirakis, Paul G.
Space Efficient Hash Tables With Worst Case Constant Access Time
In: Theory of Computing Systems [38], 229-248
Journal Article
2005[Dementiev, Roman]
Kettner, Lutz
[Sanders, Peter]
STXXL: Standard Template Library for XXL Data SetsReport
2005[Dementiev, Roman]
Kettner, Lutz
[Sanders, Peter]
STXXL: Standard Template Library for XXL Data Sets
In: Algorithms - ESA 2005 : 13th Annual European Symposium (ESA 2005), 640-651
Proceedings Article
2005Kaligosi, Kanela
Mehlhorn, Kurt
[Munro, J. Ian]
[Sanders, Peter]
Attachment IconTowards Optimal Multiple Selection
In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, 103-114
Proceedings Article
2004Pettie, Seth
Sanders, Peter
Attachment IconA simpler linear time 2/3 - eps approximation for maximum weight matching
In: Information Processing Letters [91], 271-276
Journal Article
2004Sanders, Peter
Pettie, Seth
Attachment IconA Simpler Linear Time 2/3 - epsilon Approximation for Maximum
Weight Matching
Report
2004Sanders, PeterAlgorithms 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
2004Funke, Stefan
Matijevic, Domagoj
Sanders, Peter
Attachment IconConstant Time Queries for Energy Efficient Paths in Multi-Hop Wireless Networks
In: First International Workshop on Algorithms for Wireless and Mobile Networks, 97-111
Proceedings Article
2004Dementiev, Roman
Kettner, Lutz
Mehnert, Jens
Sanders, Peter
Engineering a Sorted List Data Structure for 32 Bit Key
In: Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics (ALENEX-04), 142-151
Proceedings Article
2004Dementiev, Roman
Sanders, Peter
Schultes, Dominik
[Sibeyn, Jop F.]
Attachment IconEngineering an External Memory Minimum Spanning Tree Algorithm
In: 3rd IFIP International Conference on Theoretical Computer Science (TSC2004), 195-208
Proceedings Article
2004Sivadasan, Naveen
Sanders, Peter
Skutella, Martin
Attachment IconOnline Scheduling with Bounded MigrationReport
2004Sanders, Peter
Sivadasan, Naveen
Skutella, Martin
Attachment IconOnline scheduling with bounded migration
In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, 1111-1122
Proceedings Article
2004Sanders, PeterSuper Scalar Sample Sort
In: Algorithms – ESA 2004: 12th Annual European Symposium, 784-796
Proceedings Article
2003Sanders, Peter
[Sibeyn, Jop F.]
A Bandwidth Latency Tradeoff for Broadcast and Reduction
In: Information Processing Letters [86], 33-38
Journal Article
2003Katriel, Irit
Sanders, Peter
[Träff, Jesper Larsson]
A Practical Minimum Spanning Tree Algorithm Using the Cycle Property
In: Algorithms - ESA 2003: 11th Annual European Symposium, 679-690
Proceedings Article
2003Funke, Stefan
Matijevic, Domagoj
Sanders, Peter
Attachment IconApproximating Energy Efficient Paths in Wireless Multi-hop Networks
In: Algorithms - ESA 2003: 11th Annual European Symposium, 230-241
Proceedings Article
2003Dementiev, Roman
Sanders, Peter
Asynchronous Parallel Disk Sorting
In: Proceedings of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA-03), 138-148
Proceedings Article
2003Sanders, PeterAsynchronous Scheduling of Redundant Disk Arrays
In: IEEE Transactions on Computers [52], 1170-1184
Journal Article
2003Sanders, PeterMemory hierarchies - models and lower bounds
In: Algorithms for memory hierarchies, 1-10
Part of a Book
2003Sanders, Peter
[Egner, Sebastian]
[Tolhuizen, Ludo]
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
2003Mehlhorn, Kurt
Sanders, Peter
Attachment IconScanning Multiple Sequences via Cache Memory
In: Algorithmica [35], 75-93
Journal Article
2003Krysta, Piotr
Sanders, Peter
Vöcking, Berthold
Scheduling and Traffic Allocation for Tasks with Bounded Splittability
In: Mathematical foundations of computer science 2003 : 28th International Symposium, MFCS 2003, 500-510
Proceedings Article
2003Kärkkäinen, Juha
Sanders, Peter
Simple Linear Work Suffix Array Construction
In: Automata, languages and programming : 30th International Colloquium, ICALP 2003, 943-955
Proceedings Article
2003Fotakis, Dimitris
[Pagh, Rasmus]
Sanders, Peter
[Spirakis, Paul G.]
Attachment IconSpace Efficient Hash Tables with Worst Case Constant Access Time
In: Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2003), 271-282
Proceedings Article
2003Sanders, Peter
Vöcking, Berthold
Tail bounds and expectations for random arc allocation and applications
In: Combinatorics, Probability and Computing [12], 225-244
Journal Article
2003Meyer, Ulrich
Sanders, Peter
$\Delta$-stepping: a parallelizable shortest path algorithm
In: Journal of Algorithms [49], 114-152
Journal Article
2002[Bader, David]
[Moret, Bernard]
Sanders, Peter
Algorithm Engineering for Parallel Computation
In: Experimental Algorithmics, 1-23
Part of a Book
2002Beier, Rene
Sanders, Peter
Sivadasan, Naveen
Energy Optimal Routing in Radio Networks Using Geometric Data Structures
In: Automata, Languages and Programming : 29th International Colloquium, ICALP 2002, 366-376
Proceedings Article
2002Sanders, Peter
[Vollmar, R.]
[Worsch, T.]
Feasible models of computation: Three-dimensionality and energy consumption
In: Fundamenta Informaticae [52], 233-248
Journal Article
2002Sanders, PeterPresenting Data from Experiments in Algorithmics
In: Experimental Algorithmics, 181-196
Part of a Book
2002Sanders, Peter
Vöcking, Berthold
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
2002Sanders, PeterRandomized Receiver Initiated Load Balancing Algorithms for Tree Shaped Computations
In: The Computer Journal [45], 561-573
Journal Article
2002Sanders, PeterReconciling simplicity and realism in parallel disk models
In: Parallel Computing [28], 705-723
Journal Article
2002Sanders, Peter
[Träff, Jesper Larsson]
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
2002[Niedermeier, Rolf]
[Reinhard, Klaus]
Sanders, Peter
Towards Optimal Locality in Mesh-Indexings
In: Discrete Applied Mathematics [117], 211-237
Journal Article
2002[McGeoch, Catherine]
Sanders, Peter
[Fleischer, Rudolf]
[Cohen, Paul R.]
[Precup, Doina]
Using Finite Experiments to Study Asymptotic Performance
In: Experimental Algorithmics, 93-126
Part of a Book
2001[Hutchinson, David A.]
Sanders, Peter
[Vitter, Jeffrey Scott]
Duality Between Prefetching and Queued Writing with Parallel Disks
In: Proceedings of the 9th Annual European Symposium on Algorithms (ESA-01), 62-73
Proceedings Article
2001Sanders, Peter
[Solis-Oba, Roberto]
How Helpers Hasten h-Relations
In: Journal of Algorithms [41], 86-98
Journal Article
2001Sanders, PeterReconciling 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
2001[Hutchinson, David A.]
Sanders, Peter
[Vitter, Jeffrey Scott]
The Power of Duality for Prefetching and Sorting with Parallel Disks
In: Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-01), 334-335
Proceedings Article
2000Sanders, Peter
Sibeyn, Jop F.
A Bandwidth Latency Tradeoff for Broadcast and Reduction
In: Euro-Par 2000 Parallel Processing, Proceedings of the 6th International Euro-Par Conference (Euro-Par-00), 918-926
Proceedings Article
2000Sanders, PeterAsynchronous Scheduling of Redundant Disk Arrays
In: Proceedings of the 12th Annual ACM Symposium on Parallel Algorithms and Architecture (SPAA-00), 89-98
Proceedings Article
2000Sanders, Peter
[Egner, Sebastian]
[Korst, Jan]
Fast Concurrent Access to Parallel Disks
In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00), 849-858
Proceedings Article
2000Sanders, PeterFast Priority Queues for Cached Memory
In: Journal of Experimental Algorithmics [5], 1-25
Electronic Journal Article
2000Sanders, Peter
[Solis-Oba, Roberto]
How Helpers Hasten h-Relations
In: Algorithms - ESA 2000, Proceedings of the 8th Annual European Symposium (ESA-00), 392-402
Proceedings Article
2000Meyer, Ulrich
Sanders, Peter
Parallel Shortest Path for Arbitrary Graphs
In: Euro-Par 2000 Parallel Processing, Proceedings of the 6th International Euro-Par Conference (Euro-Par-00), 461-470
Proceedings Article
1999[Rathe, Ulrich]
Sanders, Peter
[Knight, Peter]
A case study in scalability: an ADI method for the two-dimensional time-dependent Dirac equation
In: Parallel Computing [25], 525-534
Journal Article
1999Sanders, PeterAccessing Multiple Sequences Through Set Associative Caches
In: Proceedings of the 26th International Colloquium on Automata, Languages and Programming (ICALP-99), 655-664
Proceedings Article
1999Sanders, PeterAnalysis of nearest neighbor load balancing algorithms for random loads
In: Parallel Computing [25], 1013-1033
Journal Article
1999Sanders, PeterAsynchronous Random Polling Dynamic Load Balancing
In: Algorithms and computation : 10th International Symposium, ISAAC'99, 37-48
Proceedings Article
1999Sanders, PeterBerechnungen mit großen Datenmengen
In: Jahrbuch der Max-Planck-Gesellschaft 1999, 534-540
Part of a Book
1999Sanders, PeterFast Priority Queues for Cached Memory
In: Selected papers of the International Workshop on Algorithm Engineering and Experimentation (ALENEX-99), 312-327
Proceedings Article
1999Sanders, Peter
[Takkula, Tuomo]
[Wedelin, Dag]
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
1998Crauser, Andreas
Mehlhorn, Kurt
Meyer, Ulrich
Sanders, Peter
Attachment IconA Parallelization of Dijkstra's Shortest Path Algorithm
In: Proceedings of the 23rd International Symposium on the Mathematical Foundations of Computer Science (MFCS-98), 722-731
Proceedings Article
1998Hagerup, Torben
Sanders, Peter
[Träff, Jesper Larsson]
An Implementation of the Binary Blocking Flow Algorithm
In: Proceedings of the 2nd Workshop on Algorithm Engineering (WAE-98), 143-154
Proceedings Article
1998[Alefragis, Panayiotis]
[Goumopoulos, Christos]
Sanders, Peter
[Takkula, Tuomo]
[Wedelin, Dag]
Parallel Crew Scheduling in PAROS
In: Proceedings of the 4th International Euro-Par Conference (Euro-Par-98), 1104-1113
Proceedings Article
1998Sanders, PeterRandom Permutations on Distributed, External and Hierarchical Memory
In: Information Processing Letters [67], 305-309
Journal Article
1998Sanders, PeterRandom Permutations on Distributed, External and Hierarchical Memory
In: PARS-Mitteilungen, 160-165
In: PARS-Mitteilungen [1998], 160-165
Journal Article
1998Sanders, PeterRandomized Priority Queues for Fast Parallel Access
In: Journal Parallel and Distributed Computing [49], 86-97
Journal Article
1998Sanders, Peter
[Reussner, Ralf]
[Prechelt, Lutz]
[Müller, Matthias]
SKaMPI: A Detailed, Accurate MPI Benchmark
In: Proceedings of the 5th European PVM/MPI Users' Group Meeting, 52-59
Proceedings Article
1998Sanders, PeterTree Shaped Computations as a Model for Parallel Applications
In: Anwendungsbezogene Lastverteilung (ALV), 123-132
Proceedings Article
1998Meyer, Ulrich
Sanders, Peter
$\Delta$-Stepping: A Parallel Single Source Shortest Path Algorithm
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 393-404
Proceedings Article
10
Hide details for Sanders, Peter (ed.)Sanders, Peter (ed.)
2013Jez, ArturAttachment IconApproximation of Grammar-Based Compression via Recompression
In: 24th Annual Symposium on Combinatorial Pattern Matching (CPM 2013), 165-176
Proceedings Article
2013[Bannai, Hideo]
Gawrychowski, Pawel
[Inenaga, Shunsuke]
[Takeda, Masayuki]
Converting SLP to LZ78 in almost Linear Time
In: Combinatorial Pattern Matching, 24th Annual Symposium (CPM 2013), 38-49
Proceedings Article
2009[Amaldi, Edoardo]
[Iuliano, Claudio]
Jurkiewicz, Tomasz
Mehlhorn, Kurt
[Rizzi, Romeo]
Breaking the $O(m^2n)$ Barrier for Minimum Cycle Bases
In: Algorithms - ESA 2009 : 17th Annual European Symposium, 301-312
Proceedings Article
2009[Amaldi, Edoardo]
[Iuliano, Claudio]
Jurkiewicz, Tomasz
Mehlhorn, Kurt
[Rizzi, Romeo]
Breaking the $O(m^2n)$ Barrier for Minimum Cycle Bases
In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, 301-312
Proceedings Article
2009Elbassioni, Khaled
[Makino, Kazuhisa]
Rauf, Imran
Attachment IconOutput-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs
In: Algorithms - ESA 2009 : 17th Annual European Symposium, 143-154
Proceedings Article
2009Philip, Geevarghese
[Raman, Venkatesh]
[Sikdar, Somnath]
Attachment IconSolving 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
2003Algorithms for Memory HierarchiesBook
2003Katriel, Irit
Meyer, Ulrich
Elementary Graph Algorithms in External Memory
In: Algorithms for Memory Hierarchies, 62-84
Part of a Book
2003Kärkkäinen, Juha
[Rao, S. Srinivasa]
Full-Text Indexes in External Memory
In: Algorithms for Memory Hierarchies, 149-170
Part of a Book
2003Sanders, PeterMemory hierarchies - models and lower bounds
In: Algorithms for memory hierarchies, 1-10
Part of a Book
2
Hide details for Sanjeev Khanna (ed.)Sanjeev Khanna (ed.)
2013[Epstein, Leah]
[Levin, Asaf]
van Stee, Rob
Attachment IconA unified approach to truthful scheduling on related machines
In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, 1243-1252
Proceedings Article
2013[Bogdan, Paul]
Sauerwald, Thomas
[Stauffer, Alexandre]
Sun, He
Balls into Bins via Local Search
In: 24th ACM-SIAM Symposium on Discrete Algorithms (SODA-13), 16-34
Electronic Proceedings Article
2
Hide details for Sankowski, Piotr (ed.)Sankowski, Piotr (ed.)
2011[Berenbrink, Petra]
[Friedetzky, Tom]
[Elsaesser, Robert]
[Nagel, Lars]
Sauerwald, Thomas
Faster Coupon Collecting via Replication with Applications in Gossiping
In: 36th International Symposium on Mathematical Foundations of Computer Science (MFCS-11), 72-83
Proceedings Article
2011[Bredereck, Robert]
[Nichterlein, Andr{\'e}]
[Niedermeier, Rolf]
Philip, Geevarghese
Attachment IconPattern-Guided Data Anonymization and Clustering
In: Mathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011. Proceedings, 182-193
Proceedings Article
3
Hide details for Sannella, Donald (ed.)Sannella, Donald (ed.)
2004Kavitha, Telikepalli
Mehlhorn, Kurt
Michail, Dimitrios
[Paluch, Katarzyna]
Attachment IconA Faster Algorithm for Minimum Cycle Basis of Graphs
In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, 846-857
Proceedings Article
2004[Arge, Lars]
Meyer, Ulrich
[Toma, Laura]
External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs
In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, 146-157
Proceedings Article
2004Sanders, Peter
Sivadasan, Naveen
Skutella, Martin
Attachment IconOnline scheduling with bounded migration
In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, 1111-1122
Proceedings Article
1
Hide details for Sanniti di Baja, G (ed.)Sanniti di Baja, G (ed.)
2000Hagedoorn, Michiel
Overmars, Mark H.
Veltkamp, Remco
A New Visibility Partition for Affine Pattern Matching
In: Discrete Geometry for Computer Imagery, Proceedings of the 9th International Conference (DGCI-00), 358-370
Proceedings Article
7
Hide details for Santoro, Nicola (ed.)Santoro, Nicola (ed.)
1999Fleischer, RudolfFUN with implementing algorithms
In: Proceedings of the International Conference on FUN with Algorithms (FUN-98), 88-98
Proceedings Article
1995Mehlhorn, KurtExperiences with the implementation of geometric algorithms
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 518-518
Proceedings Article
1995[Kagaris, Dimitrios]
[Pantziou, Grammati E.]
[Tragoudas, Spyros]
Zaroliagis, Christos
On the Computation of Fast Data Transmissions in Networks
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 291-302
Proceedings Article
1995Grove, Edward
[Kao, Ming-Yang]
[Krishnan, P.]
[Vitter, Jeffrey Scott]
Online Perfect Matching and Mobile Computing
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 194-205
Proceedings Article
1995Albers, Susanne
[Koga, Hisashi]
Page migration with limited local memory capacity
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 412-158
Proceedings Article
1993Dobrindt, Katrin
Mehlhorn, Kurt
Yvinec, Mariette
Attachment IconA Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron
In: Algorithms and data structures (WADS-93) : 3rd workshop, 314-324
Proceedings Article
1991Fleischer, Rudolf
Jung, Hermann
Mehlhorn, Kurt
A Time-Randomness Tradeoff for Communication Complexity
In: Distributed Algorithms, 4th International Workshop, 390-401
Proceedings Article
2
Hide details for Saptharishi, RamprasadSaptharishi, Ramprasad
2013Saha, Chandan
[Saptharishi, Ramprasad]
[Saxena, Nitin]
Attachment IconA Case of Depth-3 Identity Testing, Sparse Factorization and Duality
In: Computational Complexity [22], 39-69
Electronic Journal Article
2012[Agrawal, Manindra]
Saha, Chandan
[Saptharishi, Ramprasad]
[Saxena, Nitin]
Attachment IconJacobian hits circuits: hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits
In: STOC'12 : Proceedings of the 2012 ACM Symposium on Theory of Computing, 599-614
Proceedings Article
1
Hide details for Sarrafzadeh, MajiSarrafzadeh, Maji
1986Mehlhorn, Kurt
Preparata, Franco P.
Sarrafzadeh, Maji
Attachment IconChannel Routing in Knock-Knee Mode: Simplified Algorithms and Proofs
In: Algorithmica [1], 213-221
Journal Article
2
Hide details for Sassone, Vladimir (ed.)Sassone, Vladimir (ed.)
2006[Hariharan, Ramesh]
[Telikepalli, Kavitha]
Mehlhorn, Kurt
Attachment IconA Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs
In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Part I, 250-261
Proceedings Article
2006Mehlhorn, Kurt
Osbild, Ralf
Sagraloff, Michael
Attachment IconReliable and Efficient Computational Geometry Via Controlled Perturbation
In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Part I, 299-310
Proceedings Article
1
Hide details for Sassone, V. (ed.)Sassone, V. (ed.)
2006Harren, RolfAttachment IconApproximating the Orthogonal Knapsack Problem for Hypercubes
In: Automata, Languages and Programming, 238-249
Proceedings Article
2
Hide details for Sastry, Kumara (ed.)Sastry, Kumara (ed.)
2008GECCO 2008: Proceedings of the 10th Annual Conference on Genetic and Evolutionary ComputationProceedings
2007GECCO 2007: Proceedings of the 9th Annual Conference on Genetic and Evolutionary ComputationProceedings
1
Hide details for Sato, Yosuke (ed.)Sato, Yosuke (ed.)
2009Sagraloff, Michael
Kerber, Michael
Hemmer, Michael
Certified Complex Root Isolation via Adaptive Root Separation Bounds
In: The Joint Conference of ASCM 2009 and MACIS 2009, 151-166
Proceedings Article
33
Hide details for Sauerwald, ThomasSauerwald, Thomas
2014Bringmann, Karl
[Sauerwald, Thomas]
[Stauffer, Alexandre]
Sun, He
Balls into bins via local search: cover time and maximum load
In: 31st Symposium on Theoretical Aspects of Computer Science (STACS-14), accepted
Proceedings Article
2013[Bogdan, Paul]
Sauerwald, Thomas
[Stauffer, Alexandre]
Sun, He
Balls into Bins via Local Search
In: 24th ACM-SIAM Symposium on Discrete Algorithms (SODA-13), 16-34
Electronic Proceedings Article
2013Hoefer, Martin
Sauerwald, Thomas
Brief Announcement: Threshold Load Balancing in Networks
In: 32nd Symposium on Principles of Distributed Computing (PODC-13), 54-56
Proceedings Article
2013Panagiotou, Konstantinos
Pourmiri, Ali
Sauerwald, Thomas
Faster Rumor Spreading with Multiple Calls
In: 24th International Symposium on Algorithms and Computation (ISAAC-13), 446-456
Proceedings Article
2012[Akbari, Hoda]
[Berenbrink, Petra]
Sauerwald, Thomas
A simple approach for adapting continuous load balancing processes to discrete settings
In: PODC'12 : Proceedings of the 2012 ACM Symposium on Principles of Distributed Computing, 271-280
Proceedings Article
2012[Meyerhenke, Henning]
Sauerwald, Thomas
Beyond Good Partition Shapes: An Analysis of Diffusive Graph Partitioning
In: Algorithmica [64], 329-361
Journal Article
2012[Kane, Daniel]
Mehlhorn, Kurt
Sauerwald, Thomas
Sun, He
Counting Arbitrary Subgraphs in Data Streams
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 598-609
Proceedings Article
2012[Giakkoupis, George]
Sauerwald, Thomas
Sun, He
[Woelfel, Philipp]
Low Randomness Rumor Spreading via Hashing
In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 314-325
Electronic Proceedings Article
2012Friedrich, Tobias
[Gairing, Martin]
Sauerwald, Thomas
Quasirandom Load Balancing
In: SIAM Journal on Computing [41], 747-771
Journal Article
2012[Giakkoupis, George]
Sauerwald, Thomas
Rumor spreading and vertex expansion
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 1623-1641
Proceedings Article
2012Sauerwald, Thomas
Sun, He
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
2012Fountoulakis, Nikolaos
[Panagiotou, Konstantinos]
[Sauerwald, Thomas]
Ultra-fast rumor spreading in social networks
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 1642-1660
Proceedings Article
2011Friedrich, Tobias
Sauerwald, Thomas
[Stauffer, Alexandre]
Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions
In: 22nd International Symposium on Algorithms and Computation (ISAAC-11), 190-199
Proceedings Article
2011[Berenbrink, Petra]
[Hoefer, Martin]
Sauerwald, Thomas
Distributed Selfish Load Balancing on Networks
In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 1487-1497
Proceedings Article
2011[Berenbrink, Petra]
[Friedetzky, Tom]
[Elsaesser, Robert]
[Nagel, Lars]
Sauerwald, Thomas
Faster Coupon Collecting via Replication with Applications in Gossiping
In: 36th International Symposium on Mathematical Foundations of Computer Science (MFCS-11), 72-83
Proceedings Article
2011Doerr, Benjamin
Friedrich, Tobias
[Künnemann, Marvin]
Sauerwald, Thomas
Quasirandom Rumor Spreading: An Experimental Analysis
In: ACM Journal of Experimental Algorithmics [16], Article No. 3.3
Journal Article
2011[Berenbrink, Petra]
[Cooper, Colin]
[Friedetzky, Tom]
Friedrich, Tobias
Sauerwald, Thomas
Randomized Diffusion for Indivisible Loads
In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 429-439
Proceedings Article
2011Sauerwald, Thomas
[Stauffer, Alexandre]
Rumor Spreading and Vertex Expansion on Regular Graphs
In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 462-475
Proceedings Article
2011Friedrich, Tobias
[Sauerwald, Thomas]
[Vilenchik, Dan]
Smoothed analysis of balancing networks
In: Random Structures & Algorithms [39], 115-138
Journal Article
2011Doerr, Benjamin
[Goldberg, Leslie Ann]
[Minder, Lorenz]
Sauerwald, Thomas
[Scheideler, Christian]
Stabilizing consensus with the power of two choices
In: 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA-11), 149-158
Proceedings Article
2011[Elsaesser, Robert]
Sauerwald, Thomas
Tight bounds for the cover time of multiple random walks
In: Theoretical Computer Science [412], 2623-2641
Journal Article
2010Doerr, Benjamin
[Goldberg, Leslie Ann]
[Minder, Lorenz]
[Sauerwald, Thomas]
[Scheideler, Christian]
Brief Announcement: Stabilizing Consensus with the Power of Two Choices
In: Distributed Computing : 24th International Symposium, DISC 2010, 528-530
Proceedings Article
2010[Bradonjić, Milan]
[Elsässer, Robert]
Friedrich, Tobias
[Sauerwald, Thomas]
[Stauffer, Alexandre]
Efficient Broadcast on Random Geometric Graphs
In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1412-1421
Proceedings Article
2010Friedrich, Tobias
[Gairing, Martin]
[Sauerwald, Thomas]
Quasirandom Load Balancing
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1620-1629
Proceedings Article
2010Friedrich, Tobias
[Sauerwald, Thomas]
[Vilenchik, Dan]
Smoothed Analysis of Balancing Networks
In: Random Structures and Algorithms [Early View], 1-24
Electronic Journal Article
2010Friedrich, Tobias
[Sauerwald, Thomas]
The Cover Time of Deterministic Random Walks
In: Computing and Combinatorics : 16th Annual International Conference, COCOON 2010, 130-139
Proceedings Article
2010Friedrich, Tobias
Sauerwald, Thomas
The Cover Time of Deterministic Random Walks
In: The Electronic Journal of Combinatorics [17], R167,1-R167,30
Electronic Journal Article
2009[Friedrich, Tobias]
[Sauerwald, Thomas]
Near-Perfect Load Balancing by Randomized Rounding
In: STOC09 : Proceedings of the 2009 ACM International Symposium on Theory of Computing, 121-130
Proceedings Article
2009Doerr, Benjamin
Friedrich, Tobias
[Sauerwald, Thomas]
Quasirandom Rumor Spreading on Expanders
In: Electronic Notes in Discrete Mathematics [34], 243 - 247
Journal Article
2009Doerr, Benjamin
[Friedrich, Tobias]
[Künnemann, Marvin]
[Sauerwald, Thomas]
Quasirandom Rumor Spreading: An Experimental Analysis
In: 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX), 145-153
Proceedings Article
2009Doerr, Benjamin
Friedrich, Tobias
[Sauerwald, Thomas]
Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, 366-377
Proceedings Article
2009Friedrich, Tobias
[Sauerwald, Thomas]
[Vilenchik, Dan]
Smoothed Analysis of Balancing Networks
In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, 472-483
Proceedings Article
2008Doerr, Benjamin
Friedrich, Tobias
[Sauerwald, Thomas]
Quasirandom Rumor Spreading
In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, 773-781
Proceedings Article
13
Hide details for Saurabh, SaketSaurabh, Saket
2012Mnich, Matthias
Philip, Geevarghese
[Saurabh, Saket]
[Suchy, Ondrej]
Attachment IconBeyond Max-Cut: lambda-Extendible Properties
Parameterized Above the Poljak-Turzík Bound
In: 32nd International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012), 412-423
Electronic Proceedings Article
2012[Misra, Neeldhara]
Philip, Geevarghese
[Raman, Venkatesh]
[Saurabh, Saket]
[Sikdar, Somnath]
Attachment IconFPT Algorithms for Connected Feedback Vertex Set
In: Journal of Combinatorial Optimization [24], 131-146
Journal Article
2012[Misra, Neeldhara]
Philip, Geevarghese
[Raman, Venkatesh]
[Saurabh, Saket]
Attachment IconOn Parameterized Independent Feedback Vertex Set
In: Theoretical Computer Science [461], 65-75
Journal Article
2012[Cygan, Marek]
[Dell, Holger]
[Lokshtanov, Daniel]
[Marx, Daniel]
[Nederlof, Jesper]
[Okamoto, Yoshio]
[Paturi, Ramamohan]
[Saurabh, Saket]
Wahlström, Magnus
On Problems as Hard as CNF-SAT
In: 2012 IEEE 27th Conference on Computational Complexity (CCC 2012), 74-84
Proceedings Article
2012[Lokshtanov, Daniel]
[Saurabh, Saket]
Wahlström, Magnus
Subexponential Parameterized Odd Cycle Transversal on Planar Graphs
In: 32nd International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012), 424-434
Electronic Proceedings Article
2011[Arumugam, S.]
[Chandrasekar, K. Raja]
[Misra, Neeldhara]
Philip, Geevarghese
[Saurabh, Saket]
Attachment IconAlgorithmic Aspects of Dominator Colorings in Graphs
In: Combinatorial Algorithms - 22nd International Workshop, IWOCA 2011, Victoria, BC, Canada, July 20-22, 2011, Revised Selected Papers, 19-30
Proceedings Article
2011[Fomin, Fedor V.]
[Lokshtanov, Daniel]
[Misra, Neeldhara]
Philip, Geevarghese
[Saurabh, Saket]
Attachment IconHitting forbidden minors: Approximation and Kernelization
In: 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany, 189-200
Proceedings Article
2011[Misra, Neeldhara]
Philip, Geevarghese
[Raman, Venkatesh]
[Saurabh, Saket]
Attachment IconOn Parameterized Independent Feedback Vertex Set
In: Computing and Combinatorics - 17th Annual International Conference, COCOON 2011, Dallas, TX, USA, August 14-16, 2011. Proceedings, 98-109
Proceedings Article
2011[Fernau, Henning]
[Fomin, Fedor V.]
[Lokshtanov, Daniel]
[Mnich, Matthias]
Philip, Geevarghese
[Saurabh, Saket]
Attachment IconRanking and Drawing in Subexponential Time
In: Combinatorial Algorithms - 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers,
Proceedings Article
2010[Misra, Neeldhara]
Philip, Geevarghese
[Raman, Venkatesh]
[Saurabh, Saket]
[Sikdar, Somnath]
Attachment IconFPT Algorithms for Connected Feedback Vertex Set
In: WALCOM: Algorithms and Computation, 4th International Workshop, WALCOM 2010, Dhaka, Bangladesh, February 10-12, 2010. Proceedings, 269-280
Proceedings Article
2010[Fernau, Henning]
[Fomin, Fedor V.]
Philip, Geevarghese
[Saurabh, Saket]
Attachment IconThe Curse of Connectivity: $t$-Total Vertex (Edge) Cover
In: Computing and Combinatorics, 16th Annual International Conference, COCOON 2010, Nha Trang, Vietnam, July 19-21, 2010. Proceedings, 34-43
Proceedings Article
2010[Misra, Neeldhara]
Philip, Geevarghese
[Raman, Venkatesh]
[Saurabh, Saket]
Attachment IconThe effect of girth on the kernelization complexity of Connected Dominating Set
In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, 96-107
Proceedings Article
2009Amini, Omid
[Peleg, David]
[Pérennes, Stéphane]
[Sau, Ignasi]
[Saurabh, Saket]
Degree-Constrained Subgraph Problems: Hardness and Approximation Results
In: Approximation and Online Algorithms : 6th International Workshop, WAOA 2008, 29-42
Proceedings Article
1
Hide details for Saurabh, Saket (ed.)Saurabh, Saket (ed.)
2010[Ambalath, Abhimanyu M.]
[Balasundaram, Radheshyam]
[H., Chintan Rao]
[Koppula, Venkata]
[Misra, Neeldhara]
Philip, Geevarghese
[Ramanujan, M. S.]
Attachment IconOn the Kernelization Complexity of Colorful Motifs
In: Parameterized and Exact Computation - 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings, 14-25
Proceedings Article
2
Hide details for Sau, IgnasiSau, Ignasi
2009Amini, Omid
[Peleg, David]
[Pérennes, Stéphane]
[Sau, Ignasi]
[Saurabh, Saket]
Degree-Constrained Subgraph Problems: Hardness and Approximation Results
In: Approximation and Online Algorithms : 6th International Workshop, WAOA 2008, 29-42
Proceedings Article
2009Amini, Omid
[Pérennes, Stéphane]
[Sau, Ignasi]
Hardness and approximation of traffic grooming
In: Theoretical Computer Science [410], 3751-3760
Journal Article
4
Hide details for Saxena, NitinSaxena, Nitin
2013[Agrawal, Manindra]
Saha, Chandan
[Saxena, Nitin]
A Case of Depth-3 Identity Testing, Sparse Factorization and Duality
In: 45th ACM Symposium on the Theory of Computing (STOC-13), toappear
Proceedings Article
2013Saha, Chandan
[Saptharishi, Ramprasad]
[Saxena, Nitin]
Attachment IconA Case of Depth-3 Identity Testing, Sparse Factorization and Duality
In: Computational Complexity [22], 39-69
Electronic Journal Article
2012[Agrawal, Manindra]
Saha, Chandan
[Saptharishi, Ramprasad]
[Saxena, Nitin]
Attachment IconJacobian hits circuits: hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits
In: STOC'12 : Proceedings of the 2012 ACM Symposium on Theory of Computing, 599-614
Proceedings Article
2012[Agrawal, Manindra]
Saha, Chandan
[Saxena, Nitin]
Attachment IconQuasi-polynomial Hitting-set for Set-depth-Delta Formulas
In: arXiv [abs/1209.2333], 1-13
Electronic Journal Article
1
Hide details for Sayama, Hiroki (ed.)Sayama, Hiroki (ed.)
2010Kötzing, Timo
Neumann, Frank
[Röglin, Heiko]
[Witt, Carsten]
Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem
In: Swarm Intelligence : 7th International Conference, ANTS 2010, 324-335
Proceedings Article
16
Hide details for Schäfer, GuidoSchäfer, Guido
2010Bonifaci, Vincenzo
[Harks, Tobias]
[Schäfer, Guido]
Attachment IconStackelberg Routing in Arbitrary Networks
In: Mathematics of Operations Research [35], 330 - 346
Journal Article
2006Bast, Holger
Mehlhorn, Kurt
Schäfer, Guido
[Tamaki, Hisao]
Attachment IconMatching Algorithms are Fast in Sparse Random Graphs
In: Theory of Computing Systems [39], 3-14
Journal Article
2004[Leonardi, Stefano]
Schäfer, Guido
Cross-monotonic cost sharing methods for connected facility location games
In: EC'04 : proceedings of the 5th ACM Conference on Electronic Commerce ; New York, New York, USA, May 17-20, 2004, 242-243
Proceedings Article
2004[Leonardi, Stefano]
Schäfer, Guido
Cross-monotonic cost sharing methods for connected facility location games
In: Theoretical Computer Science [326], 431-442
Journal Article
2004Bast, Holger
Mehlhorn, Kurt
Schäfer, Guido
[Tamaki, Hisao]
Attachment IconMatching Algorithms Are Fast in Sparse Random Graphs
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 81-92
Proceedings Article
2004Schäfer, Guido
Sivadasan, Naveen
Attachment IconTopology matters: Smoothed competitiveness of metrical task systems
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 489-500
Proceedings Article
2004Schäfer, GuidoWorst case instances are fragile: average case and smoothed competitive analysis of algorithms
Universität des Saarlandes
Thesis - PhD thesis
2003Bast, Holger
Mehlhorn, Kurt
Schäfer, Guido
Tamaki, Hisao
Attachment IconA Heuristic for Dijkstra's Algorithm With Many Targets and its Use in Weighted Matching Algorithms
In: Algorithmica [36], 75-88
Journal Article
2003[Becchetti, Luca]
[Leonardi, Stefano]
[Marchetti-Spaccamela, Alberto]
Schäfer, Guido
[Vredeveld, Tjark]
Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm
In: 44th Annual Symposium on Foundations of Computer Science (FOCS-03), 462-471
Proceedings Article
2003[Becchetti, Luca]
[Leonardi, Stefano]
[Marchetti-Spaccamela, Alberto]
Schäfer, Guido
Scheduling to minimize flow time metrics
In: International Parallel and Distributed Processing Symposium (IPDPS-03), 223b-CDROM
Proceedings Article
2002Mehlhorn, Kurt
Priebe, Volker
Schäfer, Guido
Sivadasan, Naveen
Attachment IconAll-Pairs Shortest-Paths Computation in the Presence of Negative Cycles
In: Information Processing Letters [81], 341-343
Journal Article
2002Mehlhorn, Kurt
Schäfer, Guido
Attachment IconImplementation of $O(nm \log n)$ Weighted Matchings in General Graphs: The Power of Data Structures
In: Proceedings of the n?th Conference on,
In: Journal of Experimental Algorithmics [7],
Electronic Journal Article
2001Mehlhorn, Kurt
Schäfer, Guido
A Heuristic for Dijkstra's Algorithm With Many Targets and its Use in Weighted Matching Algorithms
In: Proceedings of the 9th Annual European Symposium on Algorithms (ESA-01), 242-253
Proceedings Article
2000Mehlhorn, Kurt
Schäfer, Guido
Attachment IconImplementation of $O(nm \log n)$ weighted matchings: The power of data structures
In: 4th International Workshop on Algorithm Engineering, 23-38
Proceedings Article
2000Schäfer, GuidoWeighted Matchings in General Graphs
Universität des Saarlandes
Thesis - Masters thesis
1998[Frigioni, Daniele]
Miller, Tobias
[Nanni, Umberto]
[Pasqualone, Giulio]
Schäfer, Guido
Zaroliagis, Christos
An experimental study of dynamic algorithms for directed graphs
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 368-380
Proceedings Article
7
Hide details for Schaefer, Robert (ed.)Schaefer, Robert (ed.)
2010Doerr, Benjamin
[Goldberg, Leslie Ann]
Adaptive Drift Analysis
In: Parallel Problem Solving from Nature -- PPSN XI. -- Pt. 1, 32-41
Proceedings Article
2010Doerr, Benjamin
[Goldberg, Leslie Ann]
Drift Analysis with Tail Bounds
In: Parallel Problem Solving from Nature – PPSN XI. - Pt. 1, 174-183
Proceedings Article
2010Kratsch, Stefan
[Lehre, Per Kristian]
[Neumann, Frank]
[Oliveto, Pietro Simone]
Fixed Parameter Evolutionary Algorithms and Maximum Leaf Spanning Trees: A Matter of Mutation
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 204-213
Proceedings Article
2010Doerr, Benjamin
Johannsen, Daniel
Kötzing, Timo
Neumann, Frank
[Theile, Madeleine]
More Effective Crossover Operators for the All-Pairs Shortest Path Problem
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 184-193
Proceedings Article
2010[Böttcher, Süntje]
Doerr, Benjamin
Neumann, Frank
Optimal fixed and adaptive mutation rates for the LeadingOnes problem
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 1-10
Proceedings Article
2010Doerr, Benjamin
[Jansen, Thomas]
[Sudholt, Dirk]
Winzen, Carola
[Zarges, Christine]
Optimizing Monotone Functions Can Be Difficult
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 42-51
Proceedings Article
2010[Bringmann, Karl]
Friedrich, Tobias
Tight Bounds for the Approximation Ratio of the Hypervolume Indicator
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 607-616
Proceedings Article
3
Hide details for Schalekamp, FransSchalekamp, Frans
2012[Schalekamp, Frans]
[Williamson, David P.]
van Zuylen, Anke
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
2012[Qian, Jiawei]
[Schalekamp, Frans]
[Williamson, David P.]
van Zuylen, Anke
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
2011van Zuylen, Anke
[Schalekamp, Frans]
[Williamson, David P.]
Popular Ranking
In: 10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2011, 267-270
Electronic Proceedings Article
1
Hide details for Schanne, ThomasSchanne, Thomas
2001Schanne, ThomasVisualisierung der Dialektgeographie und Topographie im deutschen Dialektraum
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Schapira, MichaelSchapira, Michael
2008Christodoulou, George
[Kovács, Annamária]
[Schapira, Michael]
Bayesian Combinatorial Auctions
In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I, 820-832
Proceedings Article
2
Hide details for Scharbrodt, M.Scharbrodt, M.
1998[Jünger, Michael]
Mutzel, Petra
[Odenthal, Thomas]
[Scharbrodt, M.]
The thickness of a minor-excluded class of graphs
In: Discrete Mathematics [182], 169-176
Journal Article
1998Mutzel, Petra
Odenthal, Thomas
Scharbrodt, M.
The thickness of graphs: A survey
In: Graphs and Combinatorics [14], 59-73
Journal Article
1
Hide details for Schehr, GregorySchehr, Gregory
2009[Schwarz, Karsten]
Karrenbauer, Andreas
[Schehr, Gregory]
[Rieger, H.]
Domain walls and chaos in the disordered SOS model
In: Journal of statistical mechanics : theory and experiment [P08022], 1-23
Electronic Journal Article
2
Hide details for Scheideler, ChristianScheideler, Christian
2011Doerr, Benjamin
[Goldberg, Leslie Ann]
[Minder, Lorenz]
Sauerwald, Thomas
[Scheideler, Christian]
Stabilizing consensus with the power of two choices
In: 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA-11), 149-158
Proceedings Article
2010Doerr, Benjamin
[Goldberg, Leslie Ann]
[Minder, Lorenz]
[Sauerwald, Thomas]
[Scheideler, Christian]
Brief Announcement: Stabilizing Consensus with the Power of Two Choices
In: Distributed Computing : 24th International Symposium, DISC 2010, 528-530
Proceedings Article
2
Hide details for Scheideler, Christian (ed.)Scheideler, Christian (ed.)
2007Ajwani, Deepak
Elbassioni, Khaled
Govindarajan, Sathish
[Ray, Saurabh]
Conflict-free coloring for rectangle ranges using $n^.382$ colors
In: SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallel Algorithms and Architectures, 181-187
Proceedings Article
2007Funke, Stefan
Laue, Sören
Naujoks, Rouven
Minimum Energy Broadcast with Few Senders
In: Distributed Computing in Sensor Systems : Third IEEE International Conference, DCOSS 2007, 404-416
Proceedings Article
3
Hide details for Schenkel, RalfSchenkel, Ralf
2006Bast, Holger
Majumdar, Debapriyo
Schenkel, Ralf
Theobald, Martin
Weikum, Gerhard
IO-Top-k at TREC 2006: Terabyte Track
In: The Fifteenth Text Retrieval Conference Proceedings, TREC 2006, 1-5
Electronic Proceedings Article
2006Bast, Holger
Majumdar, Debapriyo
Schenkel, Ralf
Theobald, Martin
Weikum, Gerhard
Attachment IconIO-Top-k: Index-Access Optimized Top-k Query ProcessingReport
2006Bast, Holger
Majumdar, Debapriyo
Schenkel, Ralf
Theobald, Martin
Weikum, Gerhard
Attachment IconIO-Top-k: Index-Access Optimized Top-k Query Processing
In: Proceedings of the 32nd International Conference on Very Large Data Bases, VLDB 2006, 475-486
Proceedings Article
1
Hide details for Schieber, BaruchSchieber, Baruch
2004Kesselman, Alexander
[Lotker, Zvi]
[Mansour, Yishay]
[Patt-Shamir, Boaz]
[Schieber, Baruch]
[Sviridenko, Maxim]
Buffer Overflow Management in QoS Switches
In: SIAM Journal on Computing [33], 563-583
Journal Article
2
Hide details for Schieber, Baruch (ed.)Schieber, Baruch (ed.)
1992Baumgarten, Hanna
Jung, Hermann
Mehlhorn, Kurt
Dynamic Point Location in General Subdivisions
In: Discrete algorithms (SODA-92) : 3rd annual ACM-SIAM symposium, 250-258
Proceedings Article
1992Mehlhorn, Kurt
Sharir, Micha
Welzl, Emo
Tail Estimates for the Space Complexity of Randomised Incremental Algorithms
In: Discrete algorithms (SODA-92) : 3rd annual ACM-SIAM symposium, 89-93
Proceedings Article
3
Hide details for Schilz, ThomasSchilz, Thomas
2000Schilz, ThomasEffiziente Algorithmen für das verteilte Rechnen auf Workstation-Clustern
Universität des Saarlandes
Thesis - PhD thesis
1999Mehlhorn, Kurt
[Näher, Stefan]
Seel, Michael
[Seidel, Raimund]
Schilz, Thomas
Schirra, Stefan
Uhrig, Christian
Attachment IconChecking geometric programs or verification of geometric structures
In: Computational Geometry: Theory and Applications [12], 85-104
Journal Article
1996Mehlhorn, Kurt
[Näher, Stefan]
Schilz, Thomas
Schirra, Stefan
Seel, Michael
[Seidel, Raimund]
Uhrig, Christian
Checking Geometric Programs or Verification of Geometric Structures
In: 12th Annual ACM Symposium on Computational Geometry (SCG 96), 159-165
Proceedings Article
3
Hide details for Schindelhauer, ChristianSchindelhauer, Christian
2007Weikum, Gerhard
Bast, Holger
[Canright, Geoffrey]
[Hales, David]
[Schindelhauer, Christian]
[Triantafillou, Peter]
Towards Peer-to-Peer Web Search
In: 1st European Conference on Complex Systems, ECCS'05, ?
Proceedings Article
2005Weikum, Gerhard
Bast, Holger
[Canright, Geoffrey]
[Hales, David]
[Schindelhauer, Christian]
[Triantafillou, Peter]
Towards Self-Organizing Query Routing and Processing for Peer-to-Peer Web Search
In: Workshop on Peer-to-peer Data Management in the Complex Systems Perspective, 7-24
Proceedings Article
2000[Karp, Richard]
[Schindelhauer, Christian]
[Shenker, Scott]
Vöcking, Berthold
Randomized Rumor Spreading
In: 41th Annual Symposium on Foundations of Computer Science (FOCS-00), 565-574
Proceedings Article
1
Hide details for Schindelhauer, Christian (ed.)Schindelhauer, Christian (ed.)
2005Weikum, Gerhard
Bast, Holger
[Canright, Geoffrey]
[Hales, David]
[Schindelhauer, Christian]
[Triantafillou, Peter]
Towards Self-Organizing Query Routing and Processing for Peer-to-Peer Web Search
In: Workshop on Peer-to-peer Data Management in the Complex Systems Perspective, 7-24
Proceedings Article
40
Hide details for Schirra, StefanSchirra, Stefan
2009[Burnikel, Christoph]
[Funke, Stefan]
Mehlhorn, Kurt
[Schirra, Stefan]
Schmitt, Susanne
A Separation Bound for Real Algebraic Expressions
In: Algorithmica [55], 14-28
Journal Article
2008Kettner, Lutz
Mehlhorn, Kurt
[Pion, Sylvain]
[Schirra, Stefan]
[Yap, Chee]
Attachment IconClassroom Examples of Robustness Problems in Geometric Computations
In: Computational Geometry: Theory and Applications [40], 61-78
Journal Article
2007Hemmer, Michael
[Hert, Susan]
[Kettner, Lutz]
[Pion, Sylvain]
[Schirra, Stefan]
Number Types, CGAL - Computational Geometry Algorithms Library, release 3.3Manual
2006Kettner, Lutz
Mehlhorn, Kurt
[Pion, Sylvain]
[Schirra, Stefan]
[Yap, Chee]
Reply to "Backward Error Analysis ..."
In: Computational Science and Its Applications - ICCSA 2006, I, 60-60
Proceedings Article
2004Kettner, Lutz
Mehlhorn, Kurt
Pion, Sylvain
[Schirra, Stefan]
[Yap, Chee]
Classroom Examples of Robustness Problems in Geometric ComputationsReport
2004Kettner, Lutz
Mehlhorn, Kurt
[Pion, Sylvain]
[Schirra, Stefan]
[Yap, Chee]
Attachment IconClassroom Examples of Robustness Problems in Geometric Computations
In: ESA 2004: 12th Annual European Symposium on Algorithms, 702-713
Proceedings Article
2004Funke, Stefan
Mehlhorn, Kurt
Schmitt, Susanne
[Burnikel, Christoph]
[Fleischer, Rudolf]
[Schirra, Stefan]
The LEDA class real number -- extended versionReport
2002[de Berg, Marc]
Schirra, Stefan
Guest Editors' Foreword
In: Selected papers from the 16th Annual Symposium on Computational Geometry (SoCG-00), 1-2
Proceedings Article
2001[Burnikel, Christoph]
Funke, Stefan
Mehlhorn, Kurt
[Schirra, Stefan]
Schmitt, Susanne
Attachment IconA Separation Bound for Real Algebraic Expressions
In: Proceedings of the 9th Annual European Symposium on Algorithms (ESA-01), 254-265
Proceedings Article
2001[Bäsken, Matthias]
[Brönnimann, Hervé]
[Frank, Da]
[Devillers, Olivier]
[Ester, Ezra]
[Fabri, Andreas]
[Flato, Eyal]
[Gärtner, Bernd]
[Giezeman, Geert-Jan]
[Halperin, Dan]
[Hanniel, Iddo]
[Har-Peled, Sariel]
[Herrmann, Thomas]
Hert, Susan
[Hirsch, Shai]
[Hoffmann, Michael]
Kettner, Lutz
[Nechushtan, Oren]
[Neyer, Gabriele]
[Pasechnik, Dmitrii]
[Pion, Sylvain]
Schirra, Stefan
[Schönherr, Sven]
Seel, Michael
[Teillaud, Monique]
[Veltkamp, Remco]
[Wein, Ron]
[Wesselink, Wieger]
[Yvinec, Mariette]
CGAL Reference and User ManualsUnknown Form: eBookForm
2001[Cole, Richard]
[Ost, Kirstin]
Schirra, Stefan
Edge-Coloring Bipartite Multigraphs in O(E log D) Time
In: Combinatorica [21], 5-12
Journal Article
2001Mehlhorn, Kurt
Schirra, Stefan
Attachment IconExact computation with leda_real - Theory and geometric applications
In: Symbolic Algebraic Methods and Verification Methods, 163-172
Part of a Book
2000Burnikel, Christoph
Fleischer, Rudolf
Mehlhorn, Kurt
Schirra, Stefan
Attachment IconA strong and easily computable separation bound for arithmetic expressions involving radicals
In: Algorithmica [27], 87-99
Journal Article
2000[Brönnimann, Hervé]
[Kettner, Lutz]
Schirra, Stefan
[Veltkamp, Remco]
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
2000Althaus, Ernst
Mehlhorn, Kurt
Näher, Stefan
Schirra, Stefan
Attachment IconExperiments on curve reconstruction
In: Proceedings of 2nd Workshop on Algorithm Engineering and Experiments (ALENEX-00), 103-114
Electronic Proceedings Article
2000Mehlhorn, Kurt
Schirra, Stefan
Attachment IconGeometric Computing with CGAL and LEDA
In: Curve and surface design, Saint-Malo 1999, 277-286
Proceedings Article
2000[Fabri, Andreas]
[Giezeman, Geert-Jan]
[Kettner, Lutz]
Schirra, Stefan
[Schönherr, Sven]
On the Design of CGAL, a computational geometry algorithms library
In: Software - Practice and Experience [30], 1167-1202
Journal Article
2000Schirra, StefanRobustness and Precision Issues in Geometric Computation
In: Handbook of Computational Geometry, 597-632
Part of a Book
1999Schirra, StefanA 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
1999Mehlhorn, Kurt
[Näher, Stefan]
Seel, Michael
[Seidel, Raimund]
Schilz, Thomas
Schirra, Stefan
Uhrig, Christian
Attachment IconChecking geometric programs or verification of geometric structures
In: Computational Geometry: Theory and Applications [12], 85-104
Journal Article
1999Burnikel, Christoph
Fleischer, Rudolf
Mehlhorn, Kurt
Schirra, Stefan
Attachment IconEfficient exact geometric computation made easy
In: Proceedings of the 15th Annual Symposium on Computational Geometry (SCG-99), 341-350
Proceedings Article
1998Mehlhorn, Kurt
Müller, Michael
Näher, Stefan
Schirra, Stefan
Seel, Michael
Uhrig, Christian
Ziegler, Joachim
A computational basis for higher-dimensional computational geometry and applications
In: Computational Geometry: Theory and Applications [10], 289-304
Journal Article
1998Schirra, StefanComputational Geometry: Theory and Implementation
Universität des Saarlandes
Thesis - Habilitation thesis
1998[de Berg, Marc]
[van Kreveld, Marc]
Schirra, Stefan
Topologically correct subdivision simplification using the bandwidth criterion
In: Cartography and Geographic Information Systems [25], 243-257
Journal Article
1997Mehlhorn, Kurt
Müller, Michael
Näher, Stefan
Schirra, Stefan
Seel, Michael
Uhrig, Christian
Ziegler, Joachim
A Computational Basis for Higher-dimensional Computational Geometry and Applications
In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 254-263
Proceedings Article
1997Mehlhorn, Kurt
Burnikel, Christoph
Fleischer, Rudolf
Schirra, Stefan
A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Square Roots
In: Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-97), 702-709
Proceedings Article
1997[Schwerdt, Jörg]
[Smid, Michiel]
Schirra, Stefan
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
1997[Schwerdt, Jörg]
[Smid, Michiel]
Schirra, Stefan
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
1997Schirra, StefanPrecision and Robustness in Geometric Computations
In: Algorithmic Foundations of Geographic Information Systems, 255-287
Part of a Book
1996Mehlhorn, Kurt
[Näher, Stefan]
Schilz, Thomas
Schirra, Stefan
Seel, Michael
[Seidel, Raimund]
Uhrig, Christian
Checking Geometric Programs or Verification of Geometric Structures
In: 12th Annual ACM Symposium on Computational Geometry (SCG 96), 159-165
Proceedings Article
1996[Devillers, Olivier]
[Golin, Mordecai J.]
[Kedem, Klara]
Schirra, Stefan
Queries on Voronoi Diagrams of Moving Points
In: Computational Geometry. Theory and Applications [5], 315-327
Journal Article
1996[Fabri, Andreas]
[Giezeman, Geert-Jan]
[Kettner, Lutz]
Schirra, Stefan
[Schönherr, Sven]
The CGAL Kernel: A Basis for Geometric Computation
In: Applied Computational Geometry: Towards Geometric Engineering Proceedings (WACG'96), 191-202
Proceedings Article
1996[Krithivasan, Kamala]
[Rema, Anna]
Schirra, Stefan
[Vijaykumar, P.I.]
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
1995[Berg, Marc de]
[Kreveld, Marc van]
Schirra, Stefan
A new approach to subdivision simplification
In: ACSM/ASPRS Annual Convention & Exposition Technical Papers, 79-88
Proceedings Article
1995Burnikel, Christoph
Könemann, Jochen
Mehlhorn, Kurt
[Näher, Stefan]
Schirra, Stefan
Uhrig, Christian
Attachment IconExact Geometric Computation in LEDA
In: 11th ACM Symposium on Computational Geometry (SCG95), C18-C19
Proceedings Article
1994Burnikel, Christoph
Mehlhorn, Kurt
Schirra, Stefan
Attachment IconHow to Compute the Voronoi Diagram of Line Segments:
Theoretical and Experimental Results
In: Algorithms (ESA-94) : 2nd annual European symposium, 227-239
Proceedings Article
1994Burnikel, Christoph
Mehlhorn, Kurt
Schirra, Stefan
Attachment IconOn degeneracy in geometric computations
In: Discrete algorithms (SODA-94) : 5th annual ACM-SIAM symposium, 16-23
Proceedings Article
1992Alt, Helmut
Fleischer, Rudolf
Kaufmann, Michael
Mehlhorn, Kurt
Näher, Stefan
Schirra, Stefan
Uhrig, Christian
Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
In: Algorithmica [8], 391-408
Journal Article
1992Fleischer, Rudolf
Fries, Otfried
Mehlhorn, Kurt
Meiser, Stefan
Näher, Stefan
Rohnert, Hans
Schirra, Stefan
Simon, Klaus
Tsakalidis, Athanasios
Uhrig, Christian
Selected Topics from Computational Geometry, Data Structures and Motion Planning
In: Data Structures and Efficient Algorithms, Final Report on the DFG Special Joint Initiative, 25-43
Part of a Book
1990Alt, Helmut
Fleischer, Rudolf
Kaufmann, Michael
Mehlhorn, Kurt
Näher, Stefan
Schirra, Stefan
Uhrig, Christian
Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures
In: Computational geometry (SCG-90) : 6th annual symposium, 281-289
Proceedings Article
4
Hide details for Schirra, Stefan (ed.)Schirra, Stefan (ed.)
2010Berberich, Eric
[Hagen, Matthias]
[Hiller, Benjamin]
[Moser, Hannes]
Experiments
In: Algorithm Engineering : Bridging the Gap between Algorithm Theory and Practice, 325-388
Part of a Book
2010[Mörig, Marc]
[Scholz, Sven]
[Tscheuschner, Tobias]
Berberich, Eric
Implementation aspects
In: Algorithm Engineering : Bridging the Gap between Algorithm Theory and Practice, 237-289
Part of a Book
2002[de Berg, Marc]
Schirra, Stefan
Guest Editors' Foreword
In: Selected papers from the 16th Annual Symposium on Computational Geometry (SoCG-00), 1-2
Proceedings Article
2002Selected papers from the 16th Annual Symposium on Computational Geometry (SoCG-00)Proceedings
1
Hide details for Schlipf, LenaSchlipf, Lena
2012[Knauer, Christian]
[Schlipf, Lena]
Schmidt, Jens M.
[Tiwary, Hans Raj]
Largest Inscribed Rectangles in Convex Polygons
In: Journal of Discrete Algorithms [13], 78-85
Journal Article
1
Hide details for Schlotter, IldikóSchlotter, Ildikó
2010[Jansen, Klaus]
Kratsch, Stefan
[Marx, Dániel]
[Schlotter, Ildikó]
Bin Packing with Fixed Number of Bins Revisited
In: Algorithm Theory - SWAT 2010 : 12th Scandinavian Symposium and Workshops
on Algorithm Theory, 260-272
Proceedings Article
3
Hide details for Schmidt, Bernd H.Schmidt, Bernd H.
1986Mehlhorn, Kurt
Schmidt, Bernd H.
Attachment IconOn BF-orderable graphs
In: Discrete Applied Mathematics [15], 315-327
Journal Article
1985Mehlhorn, Kurt
Schmidt, Bernd H.
On BF-perfect graphsReport
1983Mehlhorn, Kurt
Schmidt, Bernd H.
A Single Shortest Path Algorithm for Graphs with Separators
In: Fundamentals of Computation Theory, Proceedings of the 1983 International FCT-Conference (FCT 1983), 302-309
Proceedings Article
1
Hide details for Schmidt, ChristianeSchmidt, Christiane
2013[Fekete, Sándor P.]
[Friedrichs, Stephan]
[Kröller, Alexander]
[Schmidt, Christiane]
Facets for Art Gallery Problems
In: Computing and Combinatorics, 208-220
Proceedings Article
1
Hide details for Schmidt, Erik M.Schmidt, Erik M.
1982Mehlhorn, Kurt
Schmidt, Erik M.
Las Vegas Is better than Determinism in VLSI and Distributed Computing
In: Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing (STOC 1982), 330-337
Proceedings Article
1
Hide details for Schmidt, Gunther (ed.)Schmidt, Gunther (ed.)
1995Chaudhuri, Shiva
Hagerup, Torben
Prefix Graphs and their Applications
In: Graph-theoretic Concepts in Computer Science: 20th International Workshop (WG94), 206-218
Proceedings Article
14
Hide details for Schmidt, Jens M.Schmidt, Jens M.
2013Schmidt, Jens M.A Planarity Test via Construction Sequences
In: 38th International Symposium on Mathematical Foundations of Computer Science (MFCS'13), 765-776
Proceedings Article
2013Schmidt, Jens M.A Simple Test on 2-Vertex- and 2-Edge-Connectivity
In: Information Processing Letters [113], 241-244
Journal Article
2013Mehlhorn, Kurt
Neumann, A.
Schmidt, Jens M.
Certifying 3-Edge-Connectivity
In: 39th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'13), 358-369
Proceedings Article
2013Doerr, C.
Schmidt, Jens M.
Ramakrishna, G.
Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time
In: 39th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'13), 225-236
Proceedings Article
2013Schmidt, Jens M.Contractions, Removals and Certifying 3-Connectivity in Linear Time
In: SIAM Journal on Computing [42], 494-535
Journal Article
2013Schmidt, Jens M.Contractions, Removals and How to Certify 3-Connectivity in Linear TimeUnpublished/Draft
2013Elmasry, Amr
Mehlhorn, Kurt
Schmidt, Jens M.
Every DFS tree of a 3-connected graph contains a contractible edge
In: Journal of Graph Theory [72], 112-121
Journal Article
2012[Elmasry, Amr]
Mehlhorn, Kurt
Schmidt, Jens M.
An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs
In: Algorithmica [62], 754-766
Journal Article
2012Schmidt, Jens M.Certifying 3-Connectivity in Linear Time
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 786-797
Proceedings Article
2012Mehlhorn, Kurt
Neumann, Adrian
Schmidt, Jens M.
Attachment IconCertifying 3-Edge-ConnectivityUnpublished/Draft
2012Schmidt, Jens M.Construction Sequences and Certifying 3-Connectivity
In: Algorithmica [62], 192-208
Journal Article
2012Schmidt, Jens M.
[Valtr, Pavel]
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
2012[Knauer, Christian]
[Schlipf, Lena]
Schmidt, Jens M.
[Tiwary, Hans Raj]
Largest Inscribed Rectangles in Convex Polygons
In: Journal of Discrete Algorithms [13], 78-85
Journal Article
2010Elmasry, Amr
Mehlhorn, Kurt
[Schmidt, Jens M.]
An $O(m+n)$ Certifying Triconnectivity Algorithm for Hamiltonian Graphs
In: Algorithmica [Online First], 1-13
Electronic Journal Article
2
Hide details for Schmidt, MartinSchmidt, Martin
2011Doerr, Benjamin
Johannsen, Daniel
[Schmidt, Martin]
Attachment IconRuntime analysis of the (1+1) evolutionary algorithm on strings over finite alphabets
In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, 119-126
Proceedings Article
2009Doerr, Benjamin
Fouz, Mahmoud
[Schmidt, Martin]
Wahlström, Magnus
BBOB: Nelder-Mead with resize and halfruns
In: Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference (GECCO 2009), 2239-2246
Proceedings Article
1
Hide details for Schmitt, DanielSchmitt, Daniel
2006Schmitt, DanielImplementierung einer Überlagerungvon konvexen Arrangements der Kugeloberfläche
Universität des Saarlandes
Thesis - Bachelor thesis
16
Hide details for Schmitt, SusanneSchmitt, Susanne
2009[Burnikel, Christoph]
[Funke, Stefan]
Mehlhorn, Kurt
[Schirra, Stefan]
Schmitt, Susanne
A Separation Bound for Real Algebraic Expressions
In: Algorithmica [55], 14-28
Journal Article
2007[Mourrain, Bernard]
[Pion, Sylvain]
Schmitt, Susanne
[Técourt, Jean-Pierre]
[Tsigaridas, Elias]
Wolpert, Nicola
Algebraic Issues in Computational Geometry
In: Effective Computational Geometry for Curves and Surfaces, 117-155
Part of a Book
2006Funke, Stefan
Klein, Christian
Mehlhorn, Kurt
Schmitt, Susanne
Attachment IconControlled Perturbation for Delaunay TriangulationsReport
2005Eigenwillig, Arno
Kettner, Lutz
[Krandick, Werner]
Mehlhorn, Kurt
Schmitt, Susanne
Wolpert, Nicola
Attachment IconA Descartes algorithm for polynomials with bit-stream coefficients
In: Computer Algebra in Scientific Computing : 8th International Workshop, CASC 2005, 138-149
Proceedings Article
2005Funke, Stefan
Klein, Christian
Mehlhorn, Kurt
Schmitt, Susanne
Attachment IconControlled Perturbation for Delaunay Triangulations
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 1047-1056
Proceedings Article
2005Berberich, Eric
Eigenwillig, Arno
[Hemmer, Michael]
[Hert, Susan]
Kettner, Lutz
Mehlhorn, Kurt
Reichel, Joachim
Schmitt, Susanne
[Schömer, Elmar]
Wolpert, Nicola
Attachment IconEXACUS: Efficient and exact algorithms for curves and surfaces
In: 13th Annual European Symposium on Algorithms (ESA 2005), 155-166
Proceedings Article
2005Schmitt, SusanneAttachment IconThe diamond operator - Implementation of exact real algebraic numbers
In: Computer Algebra in Scientific Computing, 8th International Workshop, CASC 2005, 355-366
Proceedings Article
2004Schmitt, Susanne
Fousse, Laurent
Attachment IconA comparison of polynomial evaluation schemesReport
2004Schmitt, SusanneCommon Subexpression Search in LEDA_reals -- a study of the diamond-operatorReport
2004Berberich, Eric
Eigenwillig, Arno
[Hemmer, Michael]
[Hert, Susan]
Kettner, Lutz
Mehlhorn, Kurt
Reichel, Joachim
Schmitt, Susanne
[Schömer, Elmar]
Weber, Dennis
Wolpert, Nicola
EXACUS: Efficient and Exact Algorithms for Curves and SurfacesReport
2004Schmitt, SusanneImproved separation bounds for the diamond operatorReport
2004Funke, Stefan
Mehlhorn, Kurt
Schmitt, Susanne
[Burnikel, Christoph]
[Fleischer, Rudolf]
[Schirra, Stefan]
The LEDA class real number -- extended versionReport
2003Schmitt, SusanneCommon Subexpression Search in LEDA_realsReport
2003Schmitt, Susanne
[Zimmer, Horst G.]
Elliptic Curves : A Computational ApproachBook
2003Schmitt, SusanneThe Diamond Operator for Real Algebraic NumbersReport
2001[Burnikel, Christoph]
Funke, Stefan
Mehlhorn, Kurt
[Schirra, Stefan]
Schmitt, Susanne
Attachment IconA Separation Bound for Real Algebraic Expressions
In: Proceedings of the 9th Annual European Symposium on Algorithms (ESA-01), 254-265
Proceedings Article
1
Hide details for Schmitz, ChristophSchmitz, Christoph
1995Schmitz, ChristophAnalyse von Branch-and-Bound Algorithmen zum Problem des Handlungsreisenden
Universität des Saarlandes
Thesis - Masters thesis
3
Hide details for Schneider, WolfgangSchneider, Wolfgang
1980Güttler, Reiner
Mehlhorn, Kurt
Schneider, Wolfgang
Attachment IconBinary Search Trees: Average and Worst Case Behavior
In: Elektronische Informationsverarbeitung und Kybernetik [16], 41-61
Journal Article
1976Güttler, Reiner
Mehlhorn, Kurt
Schneider, Wolfgang
Binary Search Trees: Average and Worst Case BehaviorReport
1976Güttler, Reiner
Mehlhorn, Kurt
Schneider, Wolfgang
Wernet, Norbert
Binary Search Trees: Average and Worst Case Behavior
In: GI - 6. Jahrestagung, 301-313
Proceedings Article
1
Hide details for Schnorr, C. P.Schnorr, C. P.
1998Schnorr, C. P.
Subramanian, C. R.
Almost optimal (on the average) algorithms for boolean matrix product witnesses, computing the diameter
In: Proceedings of the 2nd International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM-98), 218-231
Proceedings Article
28
Hide details for Schömer, ElmarSchömer, Elmar
2009Hemmer, Michael
Limbach, Sebastian
[Schömer, Elmar]
Attachment IconContinued Work on the Computation of an Exact Arrangement of Quadrics
In: EuroCG'09 : 25th European Workshop on Computational Geometry, 313-316
Proceedings Article
2008Hemmer, Michael
[Dupont, Laurent]
[Petitjean, Sylvain]
[Schömer, Elmar]
Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangment of QuadricsReport
2007[Dupont, Laurent]
Hemmer, Michael
[Petitjean, Sylvain]
[Schömer, Elmar]
Attachment IconComplete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics
In: 15th Annual European Symposium on Algorithms, 633-644
Proceedings Article
2007Eisenbrand, Friedrich
[Funke, Stefan]
Karrenbauer, Andreas
Reichel, Joachim
[Schömer, Elmar]
Packing a truck - Now with a twist!
In: International Journal of Computational Geometry & Applications [17], 505-527
Journal Article
2007Althaus, Ernst
[Baumann, Tobias]
[Schömer, Elmar]
[Werth, Kai]
Trunk Packing Revisited
In: Experimental Algorithms, 6th International Workshop, 420-432
Proceedings Article
2006[Schömer, Elmar]
Wolpert, Nicola
An Exact and Efficient Approach for Computing a Cell in an Arrangement of Quadrics
In: Computational Geometry [33], 65 - 97
Journal Article
2006Eigenwillig, Arno
Kettner, Lutz
[Schömer, Elmar]
Wolpert, Nicola
Attachment IconExact, Efficient and Complete Arrangement Computation for Cubic Curves
In: Computational Geometry [35], 36-73
Journal Article
2005Berberich, Eric
[Hemmer, Michael]
Kettner, Lutz
[Schömer, Elmar]
Wolpert, Nicola
An Exact, Complete and Efficient Implementation for Computing Planar Maps of Quadric Intersection Curves
In: 21st Annual Symposium on Computational Geometry (SCG'05), 99-106
Proceedings Article
2005Berberich, Eric
Eigenwillig, Arno
[Hemmer, Michael]
[Hert, Susan]
Kettner, Lutz
Mehlhorn, Kurt
Reichel, Joachim
Schmitt, Susanne
[Schömer, Elmar]
Wolpert, Nicola
Attachment IconEXACUS: Efficient and exact algorithms for curves and surfaces
In: 13th Annual European Symposium on Algorithms (ESA 2005), 155-166
Proceedings Article
2005Eisenbrand, Friedrich
[Funke, Stefan]
Karrenbauer, Andreas
Reichel, Joachim
[Schömer, Elmar]
Packing a Trunk - now with a Twist!
In: Proceedings SPM 2005 ACM Symposium on Solid and Physical Modeling, 197-206
Proceedings Article
2004Berberich, Eric
Eigenwillig, Arno
[Emiris, Ioannis]
[Fogel, Efraim]
[Hemmer, Michael]
[Halperin, Dan]
[Kakargias, Athanasios]
Kettner, Lutz
Mehlhorn, Kurt
[Pion, Sylvain]
[Schömer, Elmar]
[Teillaud, Monique]
[Wein, Ron]
Wolpert, Nicola
Attachment IconAn Empirical Comparison of Software for Constructing Arrangements of Curved ArcsReport
2004Eigenwillig, Arno
Kettner, Lutz
[Schömer, Elmar]
Wolpert, Nicola
Complete, Exact and Efficient Computations with Cubic Curves
In: Proceedings of the Twentieth Annual Symposium on Computational Geometry : (SCG'04), 409-418
Proceedings Article
2004[Hemmer, Michael]
Kettner, Lutz
[Schömer, Elmar]
Effects of a Modular Filter on Geometric ApplicationsReport
2004Berberich, Eric
Eigenwillig, Arno
[Hemmer, Michael]
[Hert, Susan]
Kettner, Lutz
Mehlhorn, Kurt
Reichel, Joachim
Schmitt, Susanne
[Schömer, Elmar]
Weber, Dennis
Wolpert, Nicola
EXACUS: Efficient and Exact Algorithms for Curves and SurfacesReport
2003Dhiflaoui, Marcel
Funke, Stefan
Kwappik, Carsten
Mehlhorn, Kurt
Seel, Michael
Schömer, Elmar
Schulte, Ralph
Weber, Dennis
Attachment IconCertifying and Repairing Solutions to Large LPs - How Good are LP-Solvers?
In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 255-256
Proceedings Article
2003Eisenbrand, Friedrich
Funke, Stefan
Reichel, Joachim
[Schömer, Elmar]
Attachment IconPacking a Trunk
In: Algorithms - ESA 2003: 11th Annual European Symposium, 618-629
Proceedings Article
2002Berberich, Eric
Eigenwillig, Arno
Hemmer, Michael
Hert, Susan
Mehlhorn, Kurt
Schömer, Elmar
Attachment IconA Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 174-186
Proceedings Article
2002Schömer, Elmar
Reichel, Joachim
Warken, Thomas
Lennerz, Christian
Efficient Collision Detection for Curved Solid Objects
In: Proceedings of the Seventh ACM Symposium on Solid Modeling and Applications, 321-328
Proceedings Article
2002Lennerz, Christian
Schömer, Elmar
Efficient Distance Computation for Quadratic Curves and Surfaces
In: Proceedings of the 2nd Conference on Geometric Modeling and Processing, 60-69
Proceedings Article
2002Eigenwillig, Arno
[Schömer, Elmar]
Wolpert, Nicola
Sweeping Arrangements of Cubic Segments Exactly and EfficientlyReport
2001[Fuhrmann, Artur]
Schömer, Elmar
A General Method for Computing the Reachable Space of Mechanisms
In: Proceedings of the 2001 ASME Design Engineering Technical Conferences and Computers and Information in Engineering Conference. - Vol. 2, 27th Design Automation Conference (DETC'01), DAC-21057
Proceedings Article
2001[Loock, Achim]
Schömer, Elmar
A Virtual Environment for Interactive Assembly Simulation: From Rigid Bodies to Deformable Cables
In: Proceedings of the 5th World Multiconference on Systemics, Cybernetics and Informatics (SCI-01): Emergent computing and virtual engineering, 325-332
Proceedings Article
2001Geismann, Nicola
Hemmer, Michael
Schömer, Elmar
Computing a 3-dimensional Cell in an Arrangement of Quadrics: Exactly and Actually!
In: Proceedings of the 17th Annual Symposium on Computational Geometry (SCG-01), 264-273
Proceedings Article
2001Warken, Thomas
Schömer, Elmar
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
2001Geismann, Nicola
Hemmer, Michael
Schömer, Elmar
The Convex Hull of Ellipsoids (Video)
In: Proceedings of the 17th Annual Symposium on Computational Geometry (SCG-01), 321-322
Proceedings Article
1997[Follert, Frank]
[Schömer, Elmar]
[Sellen, Jürgen]
Smid, Michiel
[Thiel, Christian]
Computing the largest empty anchored cylinder, and related problems
In: International Journal of Computational Geometry and Applications [7], 563-580
Journal Article
1995[Follert, Frank]
[Schömer, Elmar]
[Sellen, Jürgen]
Smid, Michiel
Thiel, Christian
Computing a largest empty anchored cylinder, and related problems
In: Foundations of Software Technology and Theoretical Computer Science: 15th Conference, 428-442
Proceedings Article
1995[Schömer, Elmar]
Thiel, Christian
Efficient Collision Detection for Moving Polyhedra
In: 11th Annual ACM Symposium on Computational Geometry (SCG95), 51-60
Proceedings Article
1
Hide details for Schömer, Elmar (ed.)Schömer, Elmar (ed.)
2002Goesele, Michael
Kautz, Jan
Lang, Jochen
Lensch, Hendrik P. A.
Seidel, Hans-Peter
7th ACM Symposium on Solid Modeling and Applications; Tutorial T1: Geometric Algorithms for Planning and Simulation Tasks in Virtual PrototypingProceedings
1
Hide details for Schoenauer, Marc (ed.)Schoenauer, Marc (ed.)
2012Doerr, Benjamin
Winzen, Carola
Black-box complexity: Breaking the O(n logn) barrier of LeadingOnes
In: Artificial Evolution 10th International Conference Evolution Artificielle, EA 2011, 205-216
Proceedings Article
3
Hide details for Schönherr, SvenSchönherr, Sven
2001[Bäsken, Matthias]
[Brönnimann, Hervé]
[Frank, Da]
[Devillers, Olivier]
[Ester, Ezra]
[Fabri, Andreas]
[Flato, Eyal]
[Gärtner, Bernd]
[Giezeman, Geert-Jan]
[Halperin, Dan]
[Hanniel, Iddo]
[Har-Peled, Sariel]
[Herrmann, Thomas]
Hert, Susan
[Hirsch, Shai]
[Hoffmann, Michael]
Kettner, Lutz
[Nechushtan, Oren]
[Neyer, Gabriele]
[Pasechnik, Dmitrii]
[Pion, Sylvain]
Schirra, Stefan
[Schönherr, Sven]
Seel, Michael
[Teillaud, Monique]
[Veltkamp, Remco]
[Wein, Ron]
[Wesselink, Wieger]
[Yvinec, Mariette]
CGAL Reference and User ManualsUnknown Form: eBookForm
2000[Fabri, Andreas]
[Giezeman, Geert-Jan]
[Kettner, Lutz]
Schirra, Stefan
[Schönherr, Sven]
On the Design of CGAL, a computational geometry algorithms library
In: Software - Practice and Experience [30], 1167-1202
Journal Article
1996[Fabri, Andreas]
[Giezeman, Geert-Jan]
[Kettner, Lutz]
Schirra, Stefan
[Schönherr, Sven]
The CGAL Kernel: A Basis for Geometric Computation
In: Applied Computational Geometry: Towards Geometric Engineering Proceedings (WACG'96), 191-202
Proceedings Article
1
Hide details for Scholz, SvenScholz, Sven
2010[Mörig, Marc]
[Scholz, Sven]
[Tscheuschner, Tobias]
Berberich, Eric
Implementation aspects
In: Algorithm Engineering : Bridging the Gap between Algorithm Theory and Practice, 237-289
Part of a Book
1
Hide details for Schomburg, Dietmar (ed.)Schomburg, Dietmar (ed.)
1995Lenhof, Hans-PeterAn Algorithm for the Protein Docking Problem
In: Bioinformatics: From Nucleic Acids and Proteins to Cell Metabolism, 125-139
Part of a Book
1
Hide details for Schomer, ElmarSchomer, Elmar
2011Hemmer, Michael
[Dupon, Laurent]
[Petitjean, Sylvain]
[Schomer, Elmar]
A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics
In: Journal of Symbolic Computation [46], 467-494
Journal Article
1
Hide details for Schreiber, FalkSchreiber, Falk
1999[Brandenburg, Franz J.]
[Schreiber, Falk]
[Jünger, Michael]
[Marks, Joe]
Mutzel, Petra
Graph Drawing Contest Report
In: Proceedings of the 7th International Symposium on Graph Drawing (GD-99), 400-409
Proceedings Article
1
Hide details for Schrijver, Alexander (ed.)Schrijver, Alexander (ed.)
1990Kaufmann, Morgan
Mehlhorn, Kurt
Routing problems in grid graphs
In: Paths, Flows, and VLSI-Layout, 165–184
Part of a Book
1
Hide details for Schröder, BiancaSchröder, Bianca
1998Schröder, BiancaUpper and Lower Bounds for Basic Scheduling Problems
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Schröder, HeikoSchröder, Heiko
1995[Kaufmann, Michael]
[Schröder, Heiko]
Sibeyn, Jop F.
Asymptotically Optimal and Practical Routing on the Reconfigurable Mesh
In: Parallel Processing Letters [5], 81-95
Journal Article
1
Hide details for Schroeder, Ulf-Peter (ed.)Schroeder, Ulf-Peter (ed.)
2008[Epstein, Leah]
van Stee, Rob
Attachment IconThe price of anarchy on uniformly related machines revisited
In: Algorithmic Game Theory, First International Symposium, SAGT 2008, 46-57
Proceedings Article
2
Hide details for Schuberth, EvaSchuberth, Eva
2007Giesen, Joachim
[Mitsche, Dieter]
[Schuberth, Eva]
Attachment IconCollaborative Ranking: an aggregation algorithm for individuals' preference estimation
In: Algorithmic Aspects in Information and Management : Third International Conference, AAIM 2007, 58-67
Proceedings Article
2007Giesen, Joachim
[Schuberth, Eva]
[Simon, Klaus]
[Zolliker, Peter]
[Zweifel, Oliver]
Image-Dependent Gamut Mapping as Optimization Problem
In: IEEE Transactions on Image Processing [16], 2401-2410
Journal Article
1
Hide details for Schuierer, SvenSchuierer, Sven
2002[Albers, Susanne]
Kursawe, Klaus
[Schuierer, Sven]
Exploring unkown environments with obstacles
In: Algorithmica [32], 123-143
Journal Article
4
Hide details for Schultes, DominikSchultes, Dominik
2007Bast, Holger
Funke, Stefan
[Sanders, Peter]
[Schultes, Dominik]
Fast Routing in Road Networks using Transit Nodes
In: Science [316], 566
Journal Article
2007Bast, Holger
Funke, Stefan
Matijevic, Domagoj
[Sanders, Peter]
[Schultes, Dominik]
In Transit to Constant Time Shortest-Path Queries in Road Networks
In: 9th Workshop on Algorithm Enginneering and Experiments (ALENEX'07), 46-59
Proceedings Article
2005Schultes, DominikFast and Exact Shortest Path Queries Using Highway Hierachies
Universität des Saarlandes
Thesis - Masters thesis
2004Dementiev, Roman
Sanders, Peter
Schultes, Dominik
[Sibeyn, Jop F.]
Attachment IconEngineering an External Memory Minimum Spanning Tree Algorithm
In: 3rd IFIP International Conference on Theoretical Computer Science (TSC2004), 195-208
Proceedings Article
2
Hide details for Schulte, RalphSchulte, Ralph
2003Dhiflaoui, Marcel
Funke, Stefan
Kwappik, Carsten
Mehlhorn, Kurt
Seel, Michael
Schömer, Elmar
Schulte, Ralph
Weber, Dennis
Attachment IconCertifying and Repairing Solutions to Large LPs - How Good are LP-Solvers?
In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 255-256
Proceedings Article
2001Schulte, RalphExaktes Lösen von Linearen Programmen
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Schulz, Andreas S. (ed.)Schulz, Andreas S. (ed.)
2002Althaus, Ernst
Fink, Christian
A Polyhedral Approach to Surface Reconstruction from Planar Contours.
In: Proceedings of the 9th International Conference on Integer Programming and Combinatorial Optimization, 258-272
Proceedings Article
1
Hide details for Schulz, FrankSchulz, Frank
2007Pyrga, Evangelia
[Schulz, Frank]
[Wagner, Dorothea]
[Zaroliagis, Christos]
Efficient models for timetable information in public transportation systems
In: ACM Journal of Experimental Algorithmics [12], 1-39
Journal Article
1
Hide details for Schulz, JensSchulz, Jens
2011Megow, Nicole
[Möhring, Rolf H.]
[Schulz, Jens]
Decision Support and Optimization in Shutdown and Turnaround Scheduling
In: INFORMS Journal on Computing [23], 189 - 204
Journal Article
1
Hide details for Schumaker, Larry L. (ed.)Schumaker, Larry L. (ed.)
2000Mehlhorn, Kurt
Schirra, Stefan
Attachment IconGeometric Computing with CGAL and LEDA
In: Curve and surface design, Saint-Malo 1999, 277-286
Proceedings Article
1
Hide details for Schupp, Sibylle (ed.)Schupp, Sibylle (ed.)
2005Kettner, LutzReference Counting in Library Design---Optionally and with Union-Find Optimization
In: Library-Centric Software Design (LCSD'05), 1-10
Electronic Proceedings Article
2
Hide details for Schuster, AssafSchuster, Assaf
1995[Ben-Asher, Y.]
[Schuster, Assaf]
Sibeyn, Jop F.
Load balancing: A programmer's approach or the impact of task-length parameter on the load balancing performance of parallel programs
In: International Journal on High-Speed Computing [7], 303-326
Journal Article
1995[Berthomé, P.]
[Duboux, T.]
Hagerup, Torben
[Newman, I.]
[Schuster, Assaf]
Self-Simulation for the Passive Optical Star Model
In: Algorithms-ESA'95: 3rd Annual European Symposium, 268-380
Proceedings Article
1
Hide details for Schwahn, AnneSchwahn, Anne
2008[Krumke, Sven Oliver]
[Schwahn, Anne]
van Stee, Rob
[Westphal, Stephan]
Attachment IconA monotone approximation algorithm for scheduling with precedence constraints
In: Operations Research Letters [36], 247-249
Journal Article
1
Hide details for Schwarzenecker, ErikSchwarzenecker, Erik
1995Schwarzenecker, ErikEin NP-schweres Plazierungsproblem
Universität des Saarlandes
Thesis - PhD thesis
1
Hide details for Schwarzenecker, E.Schwarzenecker, E.
1993Kucera, Ludek
Mehlhorn, Kurt
Preis, B.
Schwarzenecker, E.
Attachment IconExact Algorithms for a Geometric Packing Problem (Extended Abstract)
In: Theoretical aspects of computer science (STACS-93) : 10th annual symposium, 317-322
Proceedings Article
5
Hide details for Schwarz, ChristianSchwarz, Christian
1998[Golin, Mordecai J.]
[Raman, Rajeev]
Schwarz, Christian
Smid, Michiel
Randomized Data Structures for the Dynamic Closest-Pair Problem
In: SIAM Journal on Computing [27], 1036-1072
Journal Article
1995[Evans, B.L.]
Schwarz, Christian
[Teich, Jürgen]
Automated design of two-dimensional rational decimation systems
In: Proceedings of IEEE Asilomar Conference on Signals, Systems, and Computers, 498-502
Proceedings Article
1995[Evans, Brian]
Schwarz, Christian
[Teich, Jürgen]
[Vainshtein, Alek]
[Welzl, Emo]
Minimal enclosing parallelogram with application
In: 11th Annual ACM Symposium on Computational Geometry (SCG95), C34-C35
Proceedings Article
1995Golin, Mordecai J.
[Raman, Rajeev]
Schwarz, Christian
Smid, Michiel
Simple randomized algorithms for closest pair problems
In: Nordic Journal of Computing [2], 3-27
Journal Article
1995[Datta, Amitava]
Lenhof, Hans-Peter
Schwarz, Christian
Smid, Michiel
Static and dynamic algorithms for k-point clustering problems
In: Journal of Algorithms [19], 474-503
Journal Article
1
Hide details for Schwarz, KarstenSchwarz, Karsten
2009[Schwarz, Karsten]
Karrenbauer, Andreas
[Schehr, Gregory]
[Rieger, H.]
Domain walls and chaos in the disordered SOS model
In: Journal of statistical mechanics : theory and experiment [P08022], 1-23
Electronic Journal Article
15
Hide details for Schweitzer, PascalSchweitzer, Pascal
2012Megow, Nicole
Mehlhorn, Kurt
[Schweitzer, Pascal]
Online Graph Exploration: New Results on Old and New Algorithms
In: Theoretical Computer Science [463], 62-72
Journal Article
2011Mehlhorn, Kurt
Näher, Stefan
Schweitzer, Pascal
Certifying algorithms
In: Computer Science Review [5], 119-161
Journal Article
2011Megow, Nicole
Mehlhorn, Kurt
Schweitzer, Pascal
Online Graph Exploration: New Results on Old and New Algorithms
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 478-489
Proceedings Article
2011[Shervashidze, Nino]
Schweitzer, Pascal
[van Leeuwen, Erik Jan]
Mehlhorn, Kurt
[Borgwardt, Karsten M.]
Weisfeiler-Lehman graph kernels
In: Journal of Machine Learning Research [12], 2539-2561
Journal Article
2010McConnella, Ross M.
Mehlhorn, Kurt
[Näher, Stefan]
[Schweitzer, Pascal]
Certifying algorithms
In: Computer Science Review [Article in Press], 1-43
Electronic Journal Article
2010Schweitzer, Pascal
[Schweitzer, Patrick]
Connecting face hitting sets in planar graphs
In: Information Processing Letters [111], 11-15
Journal Article
2010[Rusinov, Momchil]
Schweitzer, Pascal
Homomorphism -- homogeneous graphs
In: Journal of Graph Theory [65], 253-262
Journal Article
2010Kratsch, Stefan
Schweitzer, Pascal
Isomorphism for Graphs of Bounded Feedback Vertex Set Number
In: Algorithm Theory - SWAT 2010 : 12th Scandinavian Symposium and Workshops
on Algorithm Theory, 81-92
Proceedings Article
2010Mehlhorn, Kurt
Schweitzer, Pascal
Progress on Certifying Algorithms
In: Frontiers in Algorithmics : 4th International Workshop, FAW 2010, 1-5
Proceedings Article
2009Angelopoulos, Spyros
Schweitzer, Pascal
Paging and List Update under Bijective Analysis
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 1136-1145
Proceedings Article
2009Schweitzer, PascalProblems of Unknown Complexity: Graph isomorphism and Ramsey theoretic numbers
Universität des Saarlandes
Thesis - PhD thesis
2009Schweitzer, PascalUsing the Incompressibility Method to obtain Local Lemma results for Ramsey-type Problems
In: Information Processing Letters [109], 229-232
Journal Article
2008[Cameron, Peter]
Johannsen, Daniel
[Prellberg, Thomas]
Schweitzer, Pascal
Attachment IconCounting Defective Parking Functions
In: Electronic Journal of Combinatorics [15], R92
Electronic Journal Article
2007Kutz, Martin
Schweitzer, Pascal
ScrewBox: a Randomized Certifying Graph Non-Isomorphism Algorithm
In: 9th Workshop on Algorithm Engineering and Experiments (ALENEX'07), 150-157
Proceedings Article
2007[Lehnert, Jörg]
Schweitzer, Pascal
The Co-Word Problem for the Higman-Thompson Group is context-free
In: Bulletin of the London Mathematical Society [39], 235-241
Journal Article
1
Hide details for Schweitzer, PatrickSchweitzer, Patrick
2010Schweitzer, Pascal
[Schweitzer, Patrick]
Connecting face hitting sets in planar graphs
In: Information Processing Letters [111], 11-15
Journal Article
5
Hide details for Schwentick, Thomas (ed.)Schwentick, Thomas (ed.)
2011[Fomin, Fedor V.]
[Lokshtanov, Daniel]
[Misra, Neeldhara]
Philip, Geevarghese
[Saurabh, Saket]
Attachment IconHitting forbidden minors: Approximation and Kernelization
In: 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany, 189-200
Proceedings Article
2011[Case, John]
Kötzing, Timo
Measuring Learning Complexity with Criteria Epitomizers
In: 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011), 320-331
Electronic Proceedings Article
2011[Chan, Sze-Hang]
[Lam, Tak-Wah]
Lee, Lap-Kei
Scheduling for weighted flow time and energy with rejection penalty
In: 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011), 392-403
Electronic Proceedings Article
2010[Chan, Ho-Leung]
[Lam, Tak-Wah]
Lee, Lap-Kei
[Ting, Hing-Fung]
Continuous monitoring of distributed data streams over a time-based sliding window
In: 27th International Symposium on Theoretical Aspects of Computer Science
STACS 2010, 179-190
Electronic Proceedings Article
2010[Epstein, Leah]
[Levin, Asaf]
Mestre, Julian
[Segev, Danny]
Improved approximation guarantees for weighted matching in the semi-streaming model
In: 27th International Symposium on Theoretical Aspects of Computer Science (STACS 2010), 347-358
Electronic Proceedings Article
2
Hide details for Schwerdt, JörgSchwerdt, Jörg
1997[Schwerdt, Jörg]
[Smid, Michiel]
Schirra, Stefan
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
1997[Schwerdt, Jörg]
[Smid, Michiel]
Schirra, Stefan
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
4
Hide details for Sedgewick, Robert (ed.)Sedgewick, Robert (ed.)
2006[Cooper, Joshua]
Doerr, Benjamin
[Spencer, Joel]
[Tardos, Gábor]
Deterministic Random Walks
In: Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments and the Third Workshop on Analytic Algorithmics and Combinatorics (ALENEX'06 / ANALCO'06), 185-197
Proceedings Article
2005Dementiev, Roman
[Kärkkäinen, Juha]
Mehnert, Jens
Sanders, Peter
Attachment IconBetter External Memory Suffix Array Construction
In: Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics
(ALENEX/ANALCO 2005), 86-97
Proceedings Article
2005[Brönnimann, Hervé]
Kettner, Lutz
[Pocchiola, Michel]
[Snoeyink, Jack]
Counting and enumerating pointed pseudo-triangulations with the greedy flip algorithm
In: Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics
(ALENEX/ANALCO 2005), 98-110
Proceedings Article
2004Dementiev, Roman
Kettner, Lutz
Mehnert, Jens
Sanders, Peter
Engineering a Sorted List Data Structure for 32 Bit Key
In: Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics (ALENEX-04), 142-151
Proceedings Article
15
Hide details for Seel, MichaelSeel, Michael
2007[Hert, Susan]
[Hoffmann, Michael]
Kettner, Lutz
[Pion, Sylvain]
[Seel, Michael]
An adaptable and extensible geometry kernel
In: Computational Geometry: Theory and Applications [38], 16-36
Journal Article
2003Granados, Miguel
Hachenberger, Peter
Hert, Susan
Kettner, Lutz
Mehlhorn, Kurt
Seel, Michael
Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and ImplementationReport
2003Granados, Miguel
Hachenberger, Peter
Hert, Susan
Kettner, Lutz
Mehlhorn, Kurt
Seel, Michael
Attachment IconBoolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation
In: Algorithms - ESA 2003: 11th Annual European Symposium, 654-666
Proceedings Article
2003Dhiflaoui, Marcel
Funke, Stefan
Kwappik, Carsten
Mehlhorn, Kurt
Seel, Michael
Schömer, Elmar
Schulte, Ralph
Weber, Dennis
Attachment IconCertifying and Repairing Solutions to Large LPs - How Good are LP-Solvers?
In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 255-256
Proceedings Article
2003Mehlhorn, Kurt
[Seel, Michael]
Attachment IconInfimaximal frames: A technique for making lines look like segments
In: International Journal of Computational Geometry & Applications [13], 241-255
Journal Article
2001Hert, Susan
[Hoffmann, Michael]
[Kettner, Lutz]
[Pion, Sylvain]
Seel, Michael
An Adaptable and Extensible Geometry Kernel
In: Proceedings of the 5th International Workshop on Algorithm Engineering (WAE-01), 79-90
Proceedings Article
2001[Bäsken, Matthias]
[Brönnimann, Hervé]
[Frank, Da]
[Devillers, Olivier]
[Ester, Ezra]
[Fabri, Andreas]
[Flato, Eyal]
[Gärtner, Bernd]
[Giezeman, Geert-Jan]
[Halperin, Dan]
[Hanniel, Iddo]
[Har-Peled, Sariel]
[Herrmann, Thomas]
Hert, Susan
[Hirsch, Shai]
[Hoffmann, Michael]
Kettner, Lutz
[Nechushtan, Oren]
[Neyer, Gabriele]
[Pasechnik, Dmitrii]
[Pion, Sylvain]
Schirra, Stefan
[Schönherr, Sven]
Seel, Michael
[Teillaud, Monique]
[Veltkamp, Remco]
[Wein, Ron]
[Wesselink, Wieger]
[Yvinec, Mariette]
CGAL Reference and User ManualsUnknown Form: eBookForm
2001Burnikel, Christoph
Funke, Stefan
Seel, Michael
Exact geometric computation using Cascading
In: International Journal of Computational Geometry & Applications [11], 245-266
Journal Article
2001Seel, MichaelPlanar Nef Polyhedra and Generic Higher-dimensional Geometry
Universität des Saarlandes
Thesis - PhD thesis
1999Mehlhorn, Kurt
[Näher, Stefan]
Seel, Michael
[Seidel, Raimund]
Schilz, Thomas
Schirra, Stefan
Uhrig, Christian
Attachment IconChecking geometric programs or verification of geometric structures
In: Computational Geometry: Theory and Applications [12], 85-104
Journal Article
1998Mehlhorn, Kurt
Müller, Michael
Näher, Stefan
Schirra, Stefan
Seel, Michael
Uhrig, Christian
Ziegler, Joachim
A computational basis for higher-dimensional computational geometry and applications
In: Computational Geometry: Theory and Applications [10], 289-304
Journal Article
1998Burnikel, Christoph
Funke, Stefan
Seel, Michael
Exact Geometric Predicates using Cascaded Computation
In: Proceedings of the 14th International Annual ACM Symposium on Computational Geometry (SCG-98), 175-183
Proceedings Article
1997Mehlhorn, Kurt
Müller, Michael
Näher, Stefan
Schirra, Stefan
Seel, Michael
Uhrig, Christian
Ziegler, Joachim
A Computational Basis for Higher-dimensional Computational Geometry and Applications
In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 254-263
Proceedings Article
1996Mehlhorn, Kurt
[Näher, Stefan]
Schilz, Thomas
Schirra, Stefan
Seel, Michael
[Seidel, Raimund]
Uhrig, Christian
Checking Geometric Programs or Verification of Geometric Structures
In: 12th Annual ACM Symposium on Computational Geometry (SCG 96), 159-165
Proceedings Article
1994Seel, MichaelEine Implementierung abstrakter Voronoidiagramme
Universität des Saarlandes
Thesis - Masters thesis
5
Hide details for Segal, MichaelSegal, Michael
2007Funke, Stefan
Kesselman, Alexander
[Kuhn, Fabian]
[Lotker, Zvi]
[Segal, Michael]
Attachment IconImproved approximation algorithms for connected sensor cover
In: Wireless Networks [13], 153-164
Journal Article
2006[Funke, Stefan]
Kesselman, Alexander
Meyer, Ulrich
[Segal, Michael]
A Simple Improved Distributed Algorithm for Minimum CDS in Unit Disk Graphs
In: ACM Transactions on Sensor Networks [2], 444-453
Journal Article
2005Funke, Stefan
Kesselman, Alexander
Meyer, Ulrich
[Segal, Michael]
A Simple Improved Distributed Algorithm for Minimum CDS in Unit Disk Graphs
In: 1st IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob 2005), 220-223
Proceedings Article
2005Kesselman, Alexander
Kowalski, Dariusz
[Segal, Michael]
Attachment IconEnergy efficient communication in ad hoc networks from user's and designer's perspective
In: Proceedings of the n?th Conference on, 15-26
In: ACM SIGMOBILE Mobile Computing and Communications Review [9], 15-26
Journal Article
2004Funke, Stefan
Kesselman, Alexander
Lotker, Zvi
[Segal, Michael]
Improved Approximation Algorithms for Connected Sensor Cover
In: Ad-hoc, mobil and wireless networks : Third International Conference, ADHOC-NOW 2004, 56-69
Proceedings Article
1
Hide details for Segev, DannySegev, Danny
2010[Epstein, Leah]
[Levin, Asaf]
Mestre, Julian
[Segev, Danny]
Improved approximation guarantees for weighted matching in the semi-streaming model
In: 27th International Symposium on Theoretical Aspects of Computer Science (STACS 2010), 347-358
Electronic Proceedings Article
1
Hide details for Seidel, Hans-PeterSeidel, Hans-Peter
2002Goesele, Michael
Kautz, Jan
Lang, Jochen
Lensch, Hendrik P. A.
Seidel, Hans-Peter
7th ACM Symposium on Solid Modeling and Applications; Tutorial T1: Geometric Algorithms for Planning and Simulation Tasks in Virtual PrototypingProceedings
8
Hide details for Seidel, RaimundSeidel, Raimund
2013[Alvarez, Victor]
Bringmann, Karl
[Ray, Saurabh]
[Seidel, Raimund]
Counting Triangulations Approximately
In: 25th Canadian Conference on Computational Geometry (CCCG-13), 85-89
Proceedings Article
2007Ajwani, Deepak
[Ray, Saurabh]
[Seidel, Raimund]
[Tiwary, Hans Raj]
On Computing the Centroid of the Vertices of an Arrangement and Related Problems
In: 10th Workshop on Algorithms and Data Structures (WADS), 519-528
Proceedings Article
2006Elbassioni, Khaled M.
[Lotker, Zvi]
[Seidel, Raimund]
Upper bound on the number of vertices of polyhedra with 0, 1-constraint matrices
In: Information Processing Letters [100], 69 - 71
Journal Article
2005[Seidel, Raimund]
Wolpert, Nicola
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
1999Mehlhorn, Kurt
[Näher, Stefan]
Seel, Michael
[Seidel, Raimund]
Schilz, Thomas
Schirra, Stefan
Uhrig, Christian
Attachment IconChecking geometric programs or verification of geometric structures
In: Computational Geometry: Theory and Applications [12], 85-104
Journal Article
1996Mehlhorn, Kurt
[Näher, Stefan]
Schilz, Thomas
Schirra, Stefan
Seel, Michael
[Seidel, Raimund]
Uhrig, Christian
Checking Geometric Programs or Verification of Geometric Structures
In: 12th Annual ACM Symposium on Computational Geometry (SCG 96), 159-165
Proceedings Article
1993Clarkson, Kenneth L.
Mehlhorn, Kurt
Seidel, Raimund
Attachment IconFour Results on Randomized Incremental Constructions
In: Computational Geometry: Theory and Applications [3], 185-212
Journal Article
1992Clarkson, Kenneth L.
Mehlhorn, Kurt
Seidel, Raimund
Four Results on Randomized Incremental Constructions
In: Theoretical aspects of computer science (STACS-92) : 9th annual symposium, 463-474
Proceedings Article
3
Hide details for Seidel, TillmannSeidel, Tillmann
1999Sibeyn, Jop F.
[Guillaume, Frank]
[Seidel, Tillmann]
Practical Parallel List Ranking
In: Journal of Parallel and Distributed Computing [56], 156-180
Journal Article
1997Seidel, TillmannParalleles List Ranking
Universität des Saarlandes
Thesis - Masters thesis
1997Sibeyn, Jop F.
[Guillaume, Frank]
[Seidel, Tillmann]
Practical Parallel List Ranking
In: Proceedings of the 4th Symposium on Solving Irregularly Structured Problems in Parallel (IRREGULAR-97), 25-36
Proceedings Article
2
Hide details for Seiden, Steve S.Seiden, Steve S.
2000Seiden, Steve S.Online randomized multiprocessor scheduling
In: Algorithmica [28], 173-216
Journal Article
1999Seiden, Steve S.Randomized online scheduling with delivery times
In: Journal of Combinatorial Optimization [3], 399-416
Journal Article
2
Hide details for Sellen, JürgenSellen, Jürgen
1997[Follert, Frank]
[Schömer, Elmar]
[Sellen, Jürgen]
Smid, Michiel
[Thiel, Christian]
Computing the largest empty anchored cylinder, and related problems
In: International Journal of Computational Geometry and Applications [7], 563-580
Journal Article
1995[Follert, Frank]
[Schömer, Elmar]
[Sellen, Jürgen]
Smid, Michiel
Thiel, Christian
Computing a largest empty anchored cylinder, and related problems
In: Foundations of Software Technology and Theoretical Computer Science: 15th Conference, 428-442
Proceedings Article
1
Hide details for Semeloglou, AnastasiosSemeloglou, Anastasios
2000Semeloglou, AnastasiosKürzeste Wege in planare Graphen. Implementierung eines parallelen Algorithmus mithilfe von PAD
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Semeraro, Giovanni (ed.)Semeraro, Giovanni (ed.)
2006Bast, Holger
[Dupret, Georges]
Majumdar, Debapriyo
[Piwowarski, Benjamin]
Discovering a Term Taxonomy from Term Similarities Using Principal Component Analysis
In: Semantics, web and mining : Joint International Workshops, EWMF 2005 and KDO 2005, 103-120
Proceedings Article
4
Hide details for Sen, SandeepSen, Sandeep
2007Baswana, Surender
[Sen, Sandeep]
A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
In: Random Structures & Algorithms [30], 532-563
Journal Article
2005Baswana, Surender
[Goyal, Vishrut]
[Sen, Sandeep]
Attachment IconAll-pairs nearly 2-approximate shortest paths in $O(n^2 \mathrm polylog n)$ time
In: STACS 2005 : 22nd Annual Symposium on Theoretical Aspects of Computer Science, 666-679
Proceedings Article
2004Baswana, Surender
[Sen, Sandeep]
Attachment IconApproximate distance oracle for unweighted graphs in Expected O(n²) time
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 271-280
Proceedings Article
2004Baswana, Surender
[Sen, Sandeep]
Randomized graph data-structures for approximate shortest path problem
In: Handbook of Data Structures and Applications, 38.1-38.19
Part of a Book
1
Hide details for Serna, Maria J. (ed.)Serna, Maria J. (ed.)
2006Maue, Jens
[Sanders, Peter]
Matijevic, Domagoj
Goal Directed Shortest Path Queries Using Precomputed Cluster Distances
In: Experimental Algorithms, 5th International Workshop, WEA 2006, 316-327
Proceedings Article
5
Hide details for Serna, Maria (ed.)Serna, Maria (ed.)
2010Fountoulakis, Nikolaos
Panagiotou, Konstantinos
Rumor spreading on random regular graphs and expanders
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 13th Internationa lWorkshop, APPROX 2010 and 14th International Workshop, RANDOM 2010, 560-573
Proceedings Article
2010[Hajiaghayi, MohammadTaghi]
[Khandekar, Rohit]
[Kortsarz, Guy]
Mestre, Julian
The Checkpoint Problem
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 13th International Workshop, APPROX 2010 and 14th International Workshop, RANDOM 2010, 219-231
Proceedings Article
1998Schnorr, C. P.
Subramanian, C. R.
Almost optimal (on the average) algorithms for boolean matrix product witnesses, computing the diameter
In: Proceedings of the 2nd International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM-98), 218-231
Proceedings Article
1996Gergov, JordanApproximation Algorithms for Dynamic Storage Allocation
In: Algorithms - ESA '96: 4th Annual European Symposium, 52-61
Proceedings Article
1996Arikati, Srinivasa Rao
[Chen, Danny Z.]
[Chew, L. Paul]
[Das, Gautam]
[Smid, Michiel]
Zaroliagis, Christos
Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane
In: Algorithms - ESA '96: 4th Annual European Symposium, 514-528
Proceedings Article
1
Hide details for Servedio, Rocco (ed.)Servedio, Rocco (ed.)
2012[Epstein, Leah]
[Jez, Lukasz]
[Sgall, Jiri]
van Stee, Rob
Attachment IconOnline Scheduling of Jobs with Fixed Start Times on Related Machines
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 15th International Workshop, APPROX 2012 and 16th International Workshop, RANDOM 2012, 134-145
Proceedings Article
1
Hide details for Setter, OphirSetter, Ophir
2010Berberich, Eric
[Fogel, Efi]
[Halperin, Dan]
[Kerber, Michael]
[Setter, Ophir]
Arrangements on Parametric Surfaces II: Concretizations and Applications
In: Mathematics in Computer Science [4], 67-91
Journal Article
1
Hide details for Sevaux, Marc (ed.)Sevaux, Marc (ed.)
2009[Bringmann, Karl]
[Friedrich, Tobias]
Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
In: Evolutionary Multi-Criterion Optimization : 5th International Conference, EMO 2009, 6-20
Proceedings Article
5
Hide details for Severdija, DomagojSeverdija, Domagoj
2012Elbassioni, Khaled
[Matijevic, Domagoj]
[Severdija, Domagoj]
Guarding 1.5D terrains with demands
In: International Journal of Computer Mathematics [89], 2143-2151
Journal Article
2011Elbassioni, Khaled
[Krohn, Erik]
[Matijevic, Domagoj]
Mestre, Julian
[Severdija, Domagoj]
Improved Approximations for Guarding 1.5-Dimensional Terrains
In: Algorithmica [60], 451-463
Journal Article
2010Elbassioni, Khaled
[Matijevic, Domagoj]
[Severdija, Domagoj]
Guarding 1.5-Dimensional with Demands
In: 26th European Workshop on Computational Geometry (EuroCG 2010), 133-136
Proceedings Article
2009Elbassioni, Khaled
[Krohn, Erik]
[Matijevic, Domagoj]
Mestre, Julián
[Severdija, Domagoj]
Improved Approximation Algorithms for 1.5D Terrain Guarding
In: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS), 361-371
Electronic Proceedings Article
2009Elbassioni, Khaled M.
[Krohn, Erik]
[Matijevic, Domagoj]
Mestre, Julián
[Severdija, Domagoj]
Improved Approximations for Guarding 1.5-Dimensional Terrains
In: Algorithmica [Online First], 1-13
Electronic Journal Article
1
Hide details for Sgall, JiriSgall, Jiri
2012[Epstein, Leah]
[Jez, Lukasz]
[Sgall, Jiri]
van Stee, Rob
Attachment IconOnline Scheduling of Jobs with Fixed Start Times on Related Machines
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 15th International Workshop, APPROX 2012 and 16th International Workshop, RANDOM 2012, 134-145
Proceedings Article
8
Hide details for Sgall, Jiri (ed.)Sgall, Jiri (ed.)
2013Bringmann, KarlBringing Order to Special Cases of Klee’s Measure Problem
In: 38th International Symposium on Mathematical Foundations of Computer Science (MFCS-13), 207-218
Proceedings Article
2013[Antoniadis, Antonios]
[Huang, Chien-Chung]
Ott, Sebastian
[Verschae, José]
How to Pack Your Items When You Have to Buy Your Knapsack
In: Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, 62-73
Proceedings Article
2013Bringmann, Karl
[Engels, Christian]
[Manthey, Bodo]
[Raghavendra Rao, B. V.]
Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems
In: 38th International Symposium on Mathematical Foundations of Computer Science (MFCS-13), 219-230
Proceedings Article
2011Doerr, Benjamin
[Fouz, Mahmoud]
Asymptotically Optimal Randomized Rumor Spreading
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 502-513
Proceedings Article
2011Hermelin, Danny
[Levy, Avivit]
[Weimann, Oren]
[Yuster, Raphael]
Distance Oracles for Vertex-Labeled Graphs
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 490-501
Proceedings Article
2011Hermelin, Danny
[Mnich, Matthias]
[van Leeuwen, Erik Jan]
[Woeginger, Gerhard J.]
Domination When the Stars Are Out
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 462-473
Proceedings Article
2011[Canzar,Stefan]
Elbassioni, Khaled
[Klau, Gunnar W.]
[Mestre, Julian]
On Tree-Constrained Matchings and Generalizations
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 98-109
Proceedings Article
2011[Boros, Endre]
Elbassioni, Khaled
[Fouz, Mahmoud]
[Gurvich, Vladimir]
[Makino, Kazuhisa]
[Manthey, Bodo]
Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 147-158
Proceedings Article
2
Hide details for Sgall, Jiří (ed.)Sgall, Jiří (ed.)
2011[Anand, S.]
[Garg, Naveen]
Megow, Nicole
Meeting deadlines: How much speed suffices?
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011. - Pt. I, 232-243
Proceedings Article
2011Megow, Nicole
Mehlhorn, Kurt
Schweitzer, Pascal
Online Graph Exploration: New Results on Old and New Algorithms
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 478-489
Proceedings Article
1
Hide details for Shallom, GillShallom, Gill
2006[Bartal, Yair]
[Leonardi, Stefano]
[Shallom, Gill]
Sitters, Rene
On the value of preemption in scheduling
In: 9th Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX, 39-48
Proceedings Article
2
Hide details for Shaltiel, Ronen (ed.)Shaltiel, Ronen (ed.)
2010Fountoulakis, Nikolaos
Panagiotou, Konstantinos
Rumor spreading on random regular graphs and expanders
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 13th Internationa lWorkshop, APPROX 2010 and 14th International Workshop, RANDOM 2010, 560-573
Proceedings Article
2010[Hajiaghayi, MohammadTaghi]
[Khandekar, Rohit]
[Kortsarz, Guy]
Mestre, Julian
The Checkpoint Problem
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 13th International Workshop, APPROX 2010 and 14th International Workshop, RANDOM 2010, 219-231
Proceedings Article
1
Hide details for Shamir, Ron (ed.)Shamir, Ron (ed.)
2000Althaus, Ernst
Kohlbacher, Oliver
Lenhof, Hans-Peter
Müller, Peter
A Combinatorial Approach to Protein Docking with Flexible Side-Chains
In: Proceedings of the 4th Annual International Conference on Computational Molecular Biology (RECOMB-00), 15-24
Proceedings Article
1
Hide details for Shannon, Greogory E.Shannon, Greogory E.
1998Bradford, Phillip Gnassi
[Rawlins, Gregory J.E.]
[Shannon, Greogory E.]
Efficient Matrix Chain Ordering in Polylog Time
In: SIAM Journal on Computing [27], 466-490
Journal Article
1
Hide details for Shan, Wang (ed.)Shan, Wang (ed.)
2005Bast, Holger
Weber, Ingmar
Insights from Viewing Ranked Retrieval as Rank Aggregation
In: Workshop on Challenges in Web Information Retrieval and Integration (WIRI'05), 243-248
Proceedings Article
1
Hide details for Shapiro, Vadim (ed.)Shapiro, Vadim (ed.)
2005Hachenberger, Peter
Kettner, Lutz
Boolean Operations on 3D Selective Nef Complexes: Optimized Implementation and Experiments
In: ACM Symposium on Solid and Physical Modeling (SPM 2005), 163-174
Proceedings Article
3
Hide details for Sharir, MichaSharir, Micha
2002[Agarwal, Pankaj]
[Hagerup, Torben]
Ray, Rahul
[Sharir, Micha]
[Smid, Michiel]
[Welzl, Emo]
Translating a Planar Object to Maximize Point Containment
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 42-53
Proceedings Article
1993Mehlhorn, Kurt
Sharir, Micha
Welzl, Emo
Attachment IconTail Estimates for the Efficiency of Randomized Incremental Algorithms for Line Segment Intersection
In: Computational Geometry: Theory and Applications [3], 235-246
Journal Article
1992Mehlhorn, Kurt
Sharir, Micha
Welzl, Emo
Tail Estimates for the Space Complexity of Randomised Incremental Algorithms
In: Discrete algorithms (SODA-92) : 3rd annual ACM-SIAM symposium, 89-93
Proceedings Article
1
Hide details for Sharma, A. (ed.)Sharma, A. (ed.)
2000Klau, Gunnar W.
Mutzel, Petra
Optimal Labelling of Point Features in the Slider Model
In: Computing and Combinatorics, Proceedings of the 6th Annual International Conference (COCOON-00), 340-350
Proceedings Article
5
Hide details for Sharma, VikramSharma, Vikram
2013[Yap, Chee]
Sagraloff, Michael
[Sharma, Vikram]
Analytic Root Clustering: A Complete Algorithm using Soft Zero TestsUnpublished/Draft
2011Manjunath, Madhusudan
[Sharma, Vikram]
Applications of dimensionality reduction and exponential sums to graph automorphism
In: Theoretical Computer Science [412], 3639-3649
Journal Article
2010[Batra, Prashant]
Sharma, Vikram
Bounds on absolute positiveness of multivariate polynomials
In: Journal of Symbolic Computation [45], 617-628
Journal Article
2008Sharma, VikramComplexity of real root isolation using continued fractions
In: Theoretical Computer Science [409], 292-310
Electronic Journal Article
2006Eigenwillig, Arno
[Sharma, Vikram]
[Yap, Chee K.]
Attachment IconAlmost Tight Recursion Tree Bounds for the Descartes Method
In: ISSAC '06: Proceedings of the 2006 international symposium on Symbolic and algebraic computation, 71-78
Electronic Proceedings Article
1
Hide details for Shell, D.A.Shell, D.A.
2004Konidaris, G.
Mehlhorn, Kurt
Shell, D.A.
Attachment IconAn optimal algorithm for finding edge segment adjacencies in configurations of convex polygonsUnpublished/Draft
1
Hide details for Shenker, ScottShenker, Scott
2000[Karp, Richard]
[Schindelhauer, Christian]
[Shenker, Scott]
Vöcking, Berthold
Randomized Rumor Spreading
In: 41th Annual Symposium on Foundations of Computer Science (FOCS-00), 565-574
Proceedings Article
2
Hide details for Shepherd, F. Bruce (ed.)Shepherd, F. Bruce (ed.)
2010[Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Makino, Kazuhisa]
A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information
In: Integer Programming and Combinatorial Optimization : 14th International Conference, IPCO 2010, 341-354
Proceedings Article
2010[Epstein, Leah]
[Levin, Asaf]
[Marchetti-Spaccamela, Alberto]
Megow, Nicole
Mestre, Julian
Skutella, Martin
[Stougie, Leen]
Universal sequencing on a single machine
In: Integer Programming and Combinatorial Optimization : 14th International Conference, IPCO 2010, 230-243
Proceedings Article
2
Hide details for Shermer, Thomas C.Shermer, Thomas C.
1997Mehlhorn, Kurt
[Shermer, Thomas C.]
[Yap, Chee]
Attachment IconA complete roundness classification procedure
In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 129-138
Proceedings Article
1996[Gupta, Arvind]
[Kaller, Damon]
[Mahajan, Sanjeev]
[Shermer, Thomas C.]
Vertex partitioning problems on partial k-trees
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 161-172
Proceedings Article
2
Hide details for Shervashidze, NinoShervashidze, Nino
2011[Shervashidze, Nino]
Schweitzer, Pascal
[van Leeuwen, Erik Jan]
Mehlhorn, Kurt
[Borgwardt, Karsten M.]
Weisfeiler-Lehman graph kernels
In: Journal of Machine Learning Research [12], 2539-2561
Journal Article
2009[Shervashidze, Nino]
Vishwanathan, S .V. N.
[Petri, Tobias H.]
Mehlhorn, Kurt
[Borgwardt, Karsten M.]
Attachment IconEfficient Graphlet Kernels for Large Graph Comparison
In: Proceedings of the Twelfth International Conference on Artificial Intelligence and Statistics (AISTATS), 488-495
Electronic Proceedings Article
1
Hide details for Shin, Chan-SuShin, Chan-Su
2000Lee, Jae-Ha
[Shin, Chan-Su]
[Chwa, Kyung-Yong]
Optimal Embedding of Multiple Directed Hamiltonian Rings into d-dimensional Meshes
In: Journal of Parallel and Distributed Computing [60], 775-783
Journal Article
1
Hide details for Shin, Dongwan (ed.)Shin, Dongwan (ed.)
2009Celikik, Marjan
Bast, Holger
Attachment IconFast Error-Tolerant Search on Very Large Texts
In: The 24th Annual ACM Symposium on Applied Computing, 1724-1731
Proceedings Article
1
Hide details for Shin, Sung-YongShin, Sung-Yong
2000Lee, Jae-Ha
[Cheong, Otfried]
[Kwon, Woo-Cheol]
[Shin, Sung-Yong]
[Chwa, Kyung-Yong]
Approximation of Curvature-constrained Shortest Paths through a Sequence of Points
In: Algorithms - ESA 2000, Proceedings of the 8th Annual European Symposium (ESA-00), 314-325
Proceedings Article
1
Hide details for Shriver, Bruce D. (ed.)Shriver, Bruce D. (ed.)
1995[Kagaris, Dimitrios]
[Pantziou, Grammati E.]
[Tragoudas, Spyros]
Zaroliagis, Christos
Quickest Paths: Parallelization and Dynamization
In: 28th Annual Hawaii International Conference on System Sciences (HICSS-28), 39-44
Proceedings Article
1
Hide details for Shukla, Sandeep K. (ed.)Shukla, Sandeep K. (ed.)
2009[Krumke, Sven]
van Stee, Rob
[Westphal, Stefan]
Attachment IconOnline job admissions
In: Fundamental Problems in Computing : Essays in Honor of Professor Daniel J. Rosenkrantz, 435-454
Part of a Book
1
Hide details for Shur, Arseny M. (ed.)Shur, Arseny M. (ed.)
2013Gawrychowski, PawelAlphabetic Minimax Trees in Linear Time
In: 8th International Computer Science Symposium in Russia (CSR 2013), 36-48
Proceedings Article
2
Hide details for Shvartsman, AlexShvartsman, Alex
2004[Chlebus, Bogdan S.]
Kowalski, Dariusz
[Shvartsman, Alex]
Collective asynchronous reading with polylogarithmic worst-case overhead
In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC-04), 321-330
Proceedings Article
2004Kowalski, Dariusz
[Shvartsman, Alex]
Writing-All deterministically and optimally using a non-trivial number of asynchronous processors
In: Sixteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-04), 311-320
Proceedings Article
4
Hide details for Shvartsman, AlexanderShvartsman, Alexander
2005[Georgiou, Chryssis]
Kowalski, Dariusz
[Shvartsman, Alexander]
Efficient gossip and robust distributed computation
In: Theoretical Computer Science [347], 130-166
Journal Article
2005Kowalski, Dariusz
[Musial, Peter M.]
[Shvartsman, Alexander]
Explicit combinatorial structures for cooperative distributed algorithms
In: 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05), 49-58
Proceedings Article
2004[Konwar, Kishori]
Kowalski, Dariusz
[Shvartsman, Alexander]
The Join problem in dynamic network algorithms
In: 2004 International Conference on Dependable Systems and Networks (DSN 2004), 315-324
Proceedings Article
2003[Georgiou, Chryssis]
Kowalski, Dariusz
[Shvartsman, Alexander]
Efficient Gossip and Robust Distributed Computation
In: Distributed Computing, 17th International Conference (DISC 2003), 224-238
Proceedings Article
1
Hide details for Shvartsman, Alexander A. (ed.)Shvartsman, Alexander A. (ed.)
2010Doerr, Benjamin
[Goldberg, Leslie Ann]
[Minder, Lorenz]
[Sauerwald, Thomas]
[Scheideler, Christian]
Brief Announcement: Stabilizing Consensus with the Power of Two Choices
In: Distributed Computing : 24th International Symposium, DISC 2010, 528-530
Proceedings Article
1
Hide details for Shyamasundar, Rudrapatna K. (ed.)Shyamasundar, Rudrapatna K. (ed.)
1993Dubhashi, Devdatt P.
Ranjan, Desh
Mehlhorn, Kurt
Thiel, Christian
Attachment IconSearching, Sorting and Randomised Algorithms for Central Elements and Ideal Counting in Posets
In: Foundations of software technology and theoretical computer science (FSTTCS-93) : 13th conference, 436-443
Proceedings Article
1
Hide details for Shyamasundar, Rudrapatna (ed.)Shyamasundar, Rudrapatna (ed.)
1992Mehlhorn, KurtRecent Developments in Algorithms for the Maximum Flow Problem (Abstract)
In: Proceedings of Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1992), 404-404
Proceedings Article
47
Hide details for Sibeyn, Jop F.Sibeyn, Jop F.
2006[Donato, Debora]
[Laura, Luigi]
[Leonardi, Stefano]
[Millozzi, Stefano]
Meyer, Ulrich
[Sibeyn, Jop F.]
Attachment IconAlgorithms and Experiments for the Webgraph
In: Journal of Graph Algorithms and Applications [10], 219-236
Electronic Journal Article
2004Dementiev, Roman
Sanders, Peter
Schultes, Dominik
[Sibeyn, Jop F.]
Attachment IconEngineering an External Memory Minimum Spanning Tree Algorithm
In: 3rd IFIP International Conference on Theoretical Computer Science (TSC2004), 195-208
Proceedings Article
2003Sanders, Peter
[Sibeyn, Jop F.]
A Bandwidth Latency Tradeoff for Broadcast and Reduction
In: Information Processing Letters [86], 33-38
Journal Article
2003[Laura, Luigi]
[Leonardi, Stefano]
[Millozzi, Stefano]
Meyer, Ulrich
[Sibeyn, Jop F.]
Algorithms and Experiments for the Webgraph
In: Algorithms - ESA 2003: 11th Annual European Symposium, 703-714
Proceedings Article
2002[Sibeyn, Jop F.]
[Abello, James]
Meyer, Ulrich
Heuristics for Semi-External Depth First Search on Directed Graphs
In: SPAA 2002 : Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 282-292
Proceedings Article
2002Meyer, Ulrich
[Sibeyn, Jop F.]
Oblivious Gossiping on Tori
In: Journal of Algorithms [42], 1-19
Journal Article
2000Sanders, Peter
Sibeyn, Jop F.
A Bandwidth Latency Tradeoff for Broadcast and Reduction
In: Euro-Par 2000 Parallel Processing, Proceedings of the 6th International Euro-Par Conference (Euro-Par-00), 918-926
Proceedings Article
2000Beier, Rene
Sibeyn, Jop F.
A powerful heuristic for telephone gossiping
In: Proceedings of the 7th International Colloquium on Structural Information and Communication Complexity (SIROCCO-00), 17-36
Proceedings Article
2000Sibeyn, Jop F.Solving fundamental problems on sparse-meshes
In: IEEE Transactions on Parallel & Distributed Systems [11], 1324-1332
Journal Article
1999Sibeyn, Jop F.Better Deterministic Routing on Meshes
In: Proceedings of the 13th International Parallel Processing Symposium, and 10th Symposium on Parallel and Distributed Processing (IPPS/SPDP-99), 420-425
Proceedings Article
1999Sibeyn, Jop F.Effiziente parallele Algorithmen
Universität des Saarlandes
Thesis - Habilitation thesis
1999Sibeyn, Jop F.External Selection
In: Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science (STACS-99), 291-301
Proceedings Article
1999Lambert, Oliver
Sibeyn, Jop F.
Parallel and External List Ranking and Connected Components on a Cluster of Workstations
In: Proceedings of the 11th International Conference on Parallel and Distributed Computing and Systems (PDCS-99), 454-460
Proceedings Article
1999Sibeyn, Jop F.Power and Limitations of Optical Reconfigurable Arrays
In: Proceedings of the 6th International Colloquium on Structural Information and Communication Complexity (SIROCCO 6), 249-263
Proceedings Article
1999Sibeyn, Jop F.
[Guillaume, Frank]
[Seidel, Tillmann]
Practical Parallel List Ranking
In: Journal of Parallel and Distributed Computing [56], 156-180
Journal Article
1999Sibeyn, Jop F.Row-Major Sorting on Meshes
In: SIAM Journal on Computing [28], 847-863
Journal Article
1999Sibeyn, Jop F.Ultimate Parallel List Ranking?
In: Proceedings of the 6th International Conference on High Performance Computing (HiPC-99), 197-201
Proceedings Article
1998Meyer, Ulrich
Sibeyn, Jop F.
Gossiping Large Packets on Full-Port Tori
In: Proceedings of the 4th International Euro-Par Conference (Euro-Par-98), 1040-1046
Proceedings Article
1998Sibeyn, Jop F.
[Juurlink, Ben]
Rao, P. Srinivasa
Gossiping on Meshes and Tori
In: IEEE Transactions on Parallel and Distributed Systems [9], 513-525
Journal Article
1998Sibeyn, Jop F.List Ranking on Meshes
In: Acta Informatica [35], 543-566
Journal Article
1998Sibeyn, Jop F.
[Grammatikakis, M.D.]
[Hsu, D.F.]
[Kraetzl, M.]
Packet Routing in Fixed-Connection Networks: A Survey
In: Journal of Parallel and Distributed Computing [54], 77-132
Journal Article
1998Sibeyn, Jop F.Solving Fundamental Problems on Sparse-Meshes
In: Proceedings of the 6th Scandinavian Workshop on Algorithm Theory (SWAT-98), 288-299
Proceedings Article
1997Sibeyn, Jop F.Better Trade-offs for Parallel List Ranking
In: Proceedings of the 9th Symposium on Parallel Algorithms and Architectures (SPAA-97), 221-230
Proceedings Article
1997Sibeyn, Jop F.
[Kaufmann, Michael]
BSP-Like External-Memory Computation
In: Proceedings of the 3rd Italian Conference on Algorithms and Complexity (CIAC-97), 229-240
Proceedings Article
1997Sibeyn, Jop F.
Kaufmann, Michael
Chlebus, Bogdan S.
Deterministic Permutation Routing on Meshes
In: Journal of Algorithms [22], 111-141
Journal Article
1997[Kaufmann, Michael]
Meyer, Ulrich
Sibeyn, Jop F.
Matrix Transpose on Meshes: Theory and Practice
In: Computers and Artificial Intelligence [16], 107-140
Journal Article
1997[Kaufmann, Michael]
Meyer, Ulrich
Sibeyn, Jop F.
Matrix Transpose on Meshes: Theory and Practice
In: Proceedings of the 11th International Parallel Processing Symposium (IPPS-97), 315-319
Proceedings Article
1997Sibeyn, Jop F.
[Guillaume, Frank]
[Seidel, Tillmann]
Practical Parallel List Ranking
In: Proceedings of the 4th Symposium on Solving Irregularly Structured Problems in Parallel (IRREGULAR-97), 25-36
Proceedings Article
1997Sibeyn, Jop F.
[Kaufmann, Michael]
Randomized Multipacket Routing and Sorting on Meshes
In: Algorithmica [17], 224-244
Journal Article
1997[Kaufmann, Michael]
Sibeyn, Jop F.
Randomized Multipacket Routing and Sorting on Meshes
In: Algorithmica [17], 224-244
Journal Article
1997[Kaufmann, Michael]
[Raman, Rajeev]
Sibeyn, Jop F.
Routing on Meshes with Buses
In: Algorithmica [18], 417-444
Journal Article
1997Chlebus, Bogdan S.
Czumaj, Artur
Sibeyn, Jop F.
Routing on the PADAM: Degrees of Optimality
In: Proceedings of the 3rd International Euro-Par Conference on Parallel Processing (Euro-Par-97), 272-279
Proceedings Article
1997Sibeyn, Jop F.Routing on Triangles, Tori and Honeycombs
In: International Journal on the Foundations of Computer Science [8], 269-287
Journal Article
1997Sibeyn, Jop F.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
1997Sibeyn, Jop F.Sample Sort on Meshes
In: Proceedings of the 3rd International Euro-Par Conference on Parallel Processing (Euro-Par-97), 389-398
Proceedings Article
1996Sibeyn, Jop F.List Ranking on Interconnection Networks
In: 2nd Euro-Par Conference, 529-541
Proceedings Article
1996Preetham, A. J.
[Krithivasan, Kamala]
[Rangan, C. Pandu]
Sibeyn, Jop F.
Parallel algorithm for maximum empty L-shaped polygon
In: 3rd Conference on High-Performance Computing, -
Proceedings Article
1996Sibeyn, Jop F.Routing on Triangles, Tori and Honeycombs
In: Mathematical Foundations of Computer Science 1996: 21st International Symposium (MFCS'96), 529-541
Proceedings Article
1996[Juurlink, Ben]
Sibeyn, Jop F.
[Rao, P. Srinivasa]
Worm-Hole Gossiping on Meshes and Tori
In: 2nd Euro-Par Conference, 361-369
Proceedings Article
1995[Kaufmann, Michael]
[Schröder, Heiko]
Sibeyn, Jop F.
Asymptotically Optimal and Practical Routing on the Reconfigurable Mesh
In: Parallel Processing Letters [5], 81-95
Journal Article
1995[Kaufmann, Michael]
Sibeyn, Jop F.
[Suel, Torsten]
Beyond the Worst-Case Bisection Bound:
Fast Ranking and Counting on Meshes
In: Algorithms - ESA'95: 3rd Annual European Symposium, 75-88
Proceedings Article
1995[Juurlink, Ben]
Sibeyn, Jop F.
Fast Routing on Weak Hypercubes: Making the Valiant-Brebner Algorithm More Practical
In: Conference on High-Performance Computing, 755-760
Proceedings Article
1995[Ben-Asher, Y.]
[Schuster, Assaf]
Sibeyn, Jop F.
Load balancing: A programmer's approach or the impact of task-length parameter on the load balancing performance of parallel programs
In: International Journal on High-Speed Computing [7], 303-326
Journal Article
1995Sibeyn, Jop F.Sample Sort on Meshes
In: Proceedings of Computing Science in the Netherlands, SION, 217-228
Proceedings Article
1995Meyer, Ulrich
Sibeyn, Jop F.
Simulating the Simulator: Determinstic PRAM Simulation on a Mesh Simulator
In: Eurosim '95, 285-290
Proceedings Article
1995[Kaufmann, Michael]
Sibeyn, Jop F.
Solving Cheap Graph Problems on Meshes
In: Mathematical Foundations of Computer Science 1995: 20th International Symposium (MFCS95), 412-422
Proceedings Article
1994[Kaufmann, Michael]
Meyer, Ulrich
Sibeyn, Jop F.
Towards Practical Permutation Routing on Meshes
In: Proceedings of the 6th IEEE Symposium on Parallel and Distributed Processing, 656-663
Proceedings Article
4
Hide details for Sibeyn, Jop F. (ed.)Sibeyn, Jop F. (ed.)
2003Algorithms for Memory HierarchiesBook
2003Katriel, Irit
Meyer, Ulrich
Elementary Graph Algorithms in External Memory
In: Algorithms for Memory Hierarchies, 62-84
Part of a Book
2003Kärkkäinen, Juha
[Rao, S. Srinivasa]
Full-Text Indexes in External Memory
In: Algorithms for Memory Hierarchies, 149-170
Part of a Book
2003Sanders, PeterMemory hierarchies - models and lower bounds
In: Algorithms for memory hierarchies, 1-10
Part of a Book
1
Hide details for Siek, Jeremy (ed.)Siek, Jeremy (ed.)
2006Kettner, LutzReference Counting in Library Design---Optionally and with Union-Find Optimization
In: Proceedings of the First International Workshop on Library-Centric Software Design, LCSD'05, 34-43
Proceedings Article
4
Hide details for Sikdar, SomnathSikdar, Somnath
2012[Misra, Neeldhara]
Philip, Geevarghese
[Raman, Venkatesh]
[Saurabh, Saket]
[Sikdar, Somnath]
Attachment IconFPT Algorithms for Connected Feedback Vertex Set
In: Journal of Combinatorial Optimization [24], 131-146
Journal Article
2012Philip, Geevarghese
[Raman, Venkatesh]
[Sikdar, Somnath]
Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond
In: ACM Transactions on Algorithms [9], 23
Journal Article
2010[Misra, Neeldhara]
Philip, Geevarghese
[Raman, Venkatesh]
[Saurabh, Saket]
[Sikdar, Somnath]
Attachment IconFPT Algorithms for Connected Feedback Vertex Set
In: WALCOM: Algorithms and Computation, 4th International Workshop, WALCOM 2010, Dhaka, Bangladesh, February 10-12, 2010. Proceedings, 269-280
Proceedings Article
2009Philip, Geevarghese
[Raman, Venkatesh]
[Sikdar, Somnath]
Attachment IconSolving 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
1
Hide details for Silva, Cláudio T. (ed.)Silva, Cláudio T. (ed.)
2009Emeliyanenko, Pavel
Berberich, Eric
Sagraloff, Michael
Attachment IconVisualizing Arcs of Implicit Algebraic Curves, Exactly and Fast
In: Advances in Visual Computing : 5th International Symposium, ISVC 2009, 608-619
Proceedings Article
2
Hide details for Silvestri, RiccardoSilvestri, Riccardo
2013[Clementi, Andrea]
[Crescenzi, Pierluigi]
Doerr, Carola
[Fraigniaud, Pierre]
[Pasquale, Francesco]
[Silvestri, Riccardo]
Diffusion probabiliste dans les reseaux dynamiques
In: Proc. of the 15èmes Rencontres Francophones pour les Aspects Algorithmiques des Télécommunications (AlgoTel 2013),
Proceedings Article
2013[Clementi, Andrea]
[Crescenzi, Pierluigi]
Doerr, Carola
[Fraigniaud, Pierre]
[Isopi, Marc]
[Panconesi, Alessandro]
[Pasquale, Francesco]
[Silvestri, Riccardo]
Rumor Spreading in Random Evolving Graphs
In: Proc. of the 21st European Symposium on Algorithms (ESA 2013), 325-336
Proceedings Article
1
Hide details for Simon M. Lucas (ed.)Simon M. Lucas (ed.)
2008Doerr, Benjamin
Johannsen, Daniel
[Tang, Ching Hoo]
Attachment IconHow Single Ant ACO Systems Optimize Pseudo-Boolean Functions
In: Parallel Problem Solving from Nature – PPSN X, 378-388
Proceedings Article
1
Hide details for Simon, Imre (ed.)Simon, Imre (ed.)
1994Mehlhorn, Kurt
Näher, Stefan
Attachment IconThe Implementation of Geometric Algorithms
In: Technology and foundations : Information Processing '94 ; proceedings of the IFIP 13th World Computer Congress, 223-231
Proceedings Article
3
Hide details for Simon, KlausSimon, Klaus
2007Giesen, Joachim
[Schuberth, Eva]
[Simon, Klaus]
[Zolliker, Peter]
[Zweifel, Oliver]
Image-Dependent Gamut Mapping as Optimization Problem
In: IEEE Transactions on Image Processing [16], 2401-2410
Journal Article
1992Fleischer, Rudolf
Fries, Otfried
Mehlhorn, Kurt
Meiser, Stefan
Näher, Stefan
Rohnert, Hans
Schirra, Stefan
Simon, Klaus
Tsakalidis, Athanasios
Uhrig, Christian
Selected Topics from Computational Geometry, Data Structures and Motion Planning
In: Data Structures and Efficient Algorithms, Final Report on the DFG Special Joint Initiative, 25-43
Part of a Book
1985Mehlhorn, Kurt
Simon, Klaus
Attachment IconIntersecting two polyhedra one of which is convex
In: FCT '85: Fundamentals of Computation Theory, 534-542
Proceedings Article
1
Hide details for Sinclair, Alistair (ed.)Sinclair, Alistair (ed.)
1999Solis-Oba, Roberto
[Jansen, Klaus]
[Sviridenko, Maxim]
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
1
Hide details for Singler, JohannesSingler, Johannes
2013[Sanders, Peter]
[Singler, Johannes]
van Stee, Rob
Attachment IconReal-time prefetching and caching
In: Journal of Scheduling [16], 47-58
Journal Article
1
Hide details for Sinha, Bhabani F. (ed.)Sinha, Bhabani F. (ed.)
1999Sibeyn, Jop F.Ultimate Parallel List Ranking?
In: Proceedings of the 6th International Conference on High Performance Computing (HiPC-99), 197-201
Proceedings Article
1
Hide details for Sinha, MakrandSinha, Makrand
2012Panagiotou, Konstantinos
[Sinha, Makrand]
Vertices of degree k in random unlabeled trees
In: Journal of Graph Theory [69], 114-130
Journal Article
15
Hide details for Sitters, RenéSitters, René
2012[Chan, Ho-Leung]
Megow, Nicole
[Sitters, René]
van Stee, Rob
Attachment IconA note on sorting buffers offline
In: Theoretical Computer Science [423], 11-18
Journal Article
2012Elbassioni, Khaled
[Raman, Rajiv]
Ray, Saurabh
[Sitters, René]
On the complexity of the highway problem
In: Theoretical Computer Science [460], 70-77
Journal Article
2009Elbassioni, Khaled
[Fishkin, Aleksei V.]
[Sitters, René]
Approximation algorithms for the Euclidean traveling salesman problem with discrete and continuous neighborhoods
In: International Journal of Computational Geometry & Applications [19], 173-193
Journal Article
2009Elbassioni, Khaled
Raman, Rajiv
Ray, Saurabh
[Sitters, Rene]
Attachment 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
2009Elbassioni, Khaled
Raman, Rajiv
[Ray, Saurabh]
[Sitters, Rene]
On the approximability of the maximum feasible subsystem problem with 0/1-coefficients
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 1210-1219
Proceedings Article
2007Elbassioni, Khaled M.
[Sitters, Rene]
[Zhang, Yan]
Attachment IconA Quasi-PTAS for Envy-free Pricing on Line GraphsUnpublished/Draft
2007Elbassioni, Khaled
[Sitters, Rene]
[Zhang, Yan]
A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs
In: Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings, 451-462
Proceedings Article
2006[Grigoriev, Alexander]
[van Loon, Joyce]
Sitters, Rene
[Uetz, Marc]
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
2006Elbassioni, Khaled M.
[Fishkin, Aleksei V.]
Sitters, Rene
On Approximating the TSP with Intersecting Neighborhoods
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 213-222
Proceedings Article
2006[Bodlaender, Hans L.]
[Feremans, Corinne]
[Grigoriev, Alexander]
[Penninkx, Eelko]
Sitters, Rene
[Wolle, Thomas]
On the minimum corridor connection and other generalized geometric problems
In: 4th Workshop on Approximation and Online Algorithms, WAOA, 69-82
Proceedings Article
2006[Bartal, Yair]
[Leonardi, Stefano]
[Shallom, Gill]
Sitters, Rene
On the value of preemption in scheduling
In: 9th Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX, 39-48
Proceedings Article
2006Sitters, Rene
[Stougie, Leen]
The general two-server problem
In: Journal of the ACM [53], 437-458
Journal Article
2006[Feremans, Corinne]
[Grigoriev, Alexander]
Sitters, Rene
The geometric generalized minimum spanning tree problem with grid clustering
In: 4OR: A Quarterly Journal of Operations Research [4], 319-329
Journal Article
2005Elbassioni, Khaled M.
Fishkin, Aleksei V.
Mustafa, Nabil H.
Sitters, Rene
Approximation algorithms for Euclidean Group TSP
In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, 1115-1126
Proceedings Article
2005Sitters, ReneComplexity of preemptive minsum scheduling on unrelated parallel machines
In: Journal of Algorithms [57], 37-48
Journal Article
10
Hide details for Sivadasan, NaveenSivadasan, Naveen
2009[Sanders, Peter]
Sivadasan, Naveen
[Skutella, Martin]
Online scheduling with bounded migration
In: Mathematics of Operations Research [34], 481-498
Journal Article
2004Chandran, L. Sunil
Sivadasan, Naveen
Attachment IconOn the Hadwiger's Conjecture for Graph ProductsReport
2004Sivadasan, NaveenOnline Problems and Two-Player Games: Algorithms and Analysis
Universität des Saarlandes
Thesis - PhD thesis
2004Sivadasan, Naveen
Sanders, Peter
Skutella, Martin
Attachment IconOnline Scheduling with Bounded MigrationReport
2004Sanders, Peter
Sivadasan, Naveen
Skutella, Martin
Attachment IconOnline scheduling with bounded migration
In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, 1111-1122
Proceedings Article
2004Schäfer, Guido
Sivadasan, Naveen
Attachment IconTopology matters: Smoothed competitiveness of metrical task systems
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 489-500
Proceedings Article
2003[Adler, Micah]
[Räcke, Harald]
Sivadasan, Naveen
[Sohler, Christian]
Vöcking, Berthold
Attachment IconRandomized Pursuit-Evasion in Graphs
In: Combinatorics, Probability and Computing [12], 225-244
Journal Article
2002Mehlhorn, Kurt
Priebe, Volker
Schäfer, Guido
Sivadasan, Naveen
Attachment IconAll-Pairs Shortest-Paths Computation in the Presence of Negative Cycles
In: Information Processing Letters [81], 341-343
Journal Article
2002Beier, Rene
Sanders, Peter
Sivadasan, Naveen
Energy Optimal Routing in Radio Networks Using Geometric Data Structures
In: Automata, Languages and Programming : 29th International Colloquium, ICALP 2002, 366-376
Proceedings Article
2002[Adler, Micah]
[Räcke, Harald]
Sivadasan, Naveen
[Sohler, Christian]
Vöcking, Berthold
Randomized Pursuit-Evasion in Graphs
In: Automata, Languages and Programming : 29th International Colloquium, ICALP 2002, 901-912
Proceedings Article
1
Hide details for Sivakumar, G. (ed.)Sivakumar, G. (ed.)
1997Mahajan, Sanjeev
Ramos, Edgar A.
Subrahmanyam, K. V.
Solving some discrepancy problems in NC
In: Proceedings of the 17th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS-97), 22-36
Proceedings Article
1
Hide details for Six, Hans-Werner (ed.)Six, Hans-Werner (ed.)
2003Mehlhorn, KurtAttachment IconThe reliable algorithmic software challenge RASC : dedicated to Thomas Ottmann on the occassion of his 60th birthday
In: Computer Science in Perspective : essays dedicated to Thomas Ottmann, 255-263
Part of a Book
1
Hide details for Skala, Vaclav (ed.)Skala, Vaclav (ed.)
2001Warken, Thomas
Schömer, Elmar
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
3
Hide details for Skopalik, AlexanderSkopalik, Alexander
2013Hoefer, Martin
[Skopalik, Alexander]
Altruism in Atomic Congestion Games
In: ACM Transactions on Economics and Computation [1], 21
Journal Article
2013[Harks, Tobias]
Hoefer, Martin
[Klimm, Max]
[Skopalik, Alexander]
Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games
In: Mathematical Programming [141], 193-215
Journal Article
2013Hoefer, Martin
[Skopalik, Alexander]
On the Complexity of Pareto-optimal Nash and Strong Equilibria
In: Theory of Computing Systems [53], 441-453
Journal Article
1
Hide details for Skraba, PrimozSkraba, Primoz
2011Milosavljevic, Nikola
[Morozov, Dmitriy]
[Skraba, Primoz]
Zigzag Persistent Homology in Matrix Multiplication Time
In: Proceedings of the 27th Annual Symposium on Computational Geometry (SCG'11), 216-225
Proceedings Article
1
Hide details for Skrekovski, RisteSkrekovski, Riste
2007[Cole, Richard]
Kowalik, Lukasz
[Skrekovski, Riste]
A Generalization of Kotzig's Theorem and Its Application
In: SIAM Journal on Discrete Mathematics [21], 93-106
Journal Article
19
Hide details for Skutella, MartinSkutella, Martin
2012Megow, Nicole
[Skutella, Martin]
[Verschae, Jose]
Wiese, Andreas
The Power of Recourse for Online MST and TSP
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 689-700
Proceedings Article
2012[Epstein, Leah]
[Levin, Asaf]
[Marchetti-Spaccamela, Alberto]
Megow, Nicole
Mestre, Julian
Skutella, Martin
[Stougie, Leen]
Universal sequencing on an unreliable machine
In: SIAM Journal on Computing [41], 565-586
Journal Article
2011Neumann, Frank
[Reichel, Joachim]
[Skutella, Martin]
Computing Minimum Cuts by Randomized Search Heuristics
In: Algorithmica [59], 323-342
Journal Article
2010[Epstein, Leah]
[Levin, Asaf]
[Marchetti-Spaccamela, Alberto]
Megow, Nicole
Mestre, Julian
Skutella, Martin
[Stougie, Leen]
Universal sequencing on a single machine
In: Integer Programming and Combinatorial Optimization : 14th International Conference, IPCO 2010, 230-243
Proceedings Article
2009[Eisenbrand, Friedrich]
Karrenbauer, Andreas
[Skutella, Martin]
[Xu, Chihao]
Multiline Addressing by Network Flow
In: Algorithmica [53], 583-596
Journal Article
2009[Sanders, Peter]
Sivadasan, Naveen
[Skutella, Martin]
Online scheduling with bounded migration
In: Mathematics of Operations Research [34], 481-498
Journal Article
2008Neumann, Frank
[Reichel, Joachim]
[Skutella, Martin]
Computing Minimum Cuts by Randomized Search Heuristics
In: Genetic and Evolutionary Computation Conference 2008, 779-786
Proceedings Article
2006[Eisenbrand, Friedrich]
Karrenbauer, Andreas
[Skutella, Martin]
[Xu, Chihao]
Multiline Addressing by Network Flow
In: Algorithms - ESA 2006 : 14th Annual European Symposium, 744-755
Proceedings Article
2005Althaus, Ernst
Funke, Stefan
[Har-Peled, Sariel]
[Könemann, Jochen]
[Ramos, Edgar A.]
Skutella, Martin
Approximating k-Hop Minimum-Spanning Trees
In: Operations Research Letters [33], 115-120
Journal Article
2004[Goemans, Michel X.]
Skutella, Martin
Attachment IconCooperative facility location games
In: Journal of Algorithms [50], 194-214
Journal Article
2004Martens, Maren
Skutella, Martin
Flows on Few Paths: Algorithms and Lower Bounds
In: Algorithms – ESA 2004: 12th Annual European Symposium, 520-531
Proceedings Article
2004Sivadasan, Naveen
Sanders, Peter
Skutella, Martin
Attachment IconOnline Scheduling with Bounded MigrationReport
2004Sanders, Peter
Sivadasan, Naveen
Skutella, Martin
Attachment IconOnline scheduling with bounded migration
In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, 1111-1122
Proceedings Article
2004[Moehring, Rolf H.]
Skutella, Martin
[Stork, Frederik]
Attachment IconScheduling with AND/OR Precedence Constraints
In: SIAM Journal on Computing [33], 393-415
Journal Article
2003[Hall, Alex]
[Langkau, Katharina]
Skutella, Martin
An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, 71-82
Proceedings Article
2003[Fleischer, Lisa]
Skutella, Martin
Attachment IconMinimum Cost Flows Over Time without Intermediate Storage
In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 66-75
Proceedings Article
2003[Hall, Alex]
[Hippler, Steffen]
Skutella, Martin
Attachment IconMulticommodity Flows Over Time: Efficient Algorithms and Complexity
In: Automata, languages and programming : 30th International Colloquium, ICALP 2003, 397-409
Proceedings Article
2003[Hoogeveen, Han]
Skutella, Martin
[Woeginger, Gerhard J.]
Attachment IconPreemptive scheduling with rejection
In: Mathematical Programming [94], 361-374
Journal Article
2003[Fekete, Sandor P.]
Skutella, Martin
[Woeginger, Gerhard J.]
Attachment IconThe complexity of economic equilibria for house allocation markets
In: Information Processing Letters [88], 219-223
Journal Article
3
Hide details for Skutella, Martin (ed.)Skutella, Martin (ed.)
2009Amini, Omid
[Peleg, David]
[Pérennes, Stéphane]
[Sau, Ignasi]
[Saurabh, Saket]
Degree-Constrained Subgraph Problems: Hardness and Approximation Results
In: Approximation and Online Algorithms : 6th International Workshop, WAOA 2008, 29-42
Proceedings Article
2008[Epstein, Leah]
van Stee, Rob
Attachment IconApproximation schemes for packing splittable items with cardinality constraints
In: Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, 232-245
Proceedings Article
2008[Epstein, Leah]
van Stee, Rob
Attachment IconOn the Online Unit Clustering Problem
In: Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, 193-206
Proceedings Article
2
Hide details for Skyum, Sven (ed.)Skyum, Sven (ed.)
1998Chaudhuri, Shiva
[Subrahmanyam, K. V.]
[Wagner, Frank]
Zaroliagis, Christos
Computing Mimicking Networks
In: Proceedings of the 25th International Colloquium on Automata, Languages and Programming (ICALP-98), 556-567
Proceedings Article
1998Hagerup, TorbenSimpler and Faster Dictionaries on the AC° RAM
In: Proceedings of the 25th International Colloquium on Automata, Languages and Programming (ICALP-98), 79-90
Proceedings Article
1
Hide details for Sliacan, JakubSliacan, Jakub
2013Bringmann, Karl
Doerr, Benjamin
Neumann, Adrian
[Sliacan, Jakub]
Online Checkpointing with Improved Worst-Case Guarantees
In: Automata, Languages, and Programming - 40th International Colloquium (ICALP 2013), 255-266
Proceedings Article
1
Hide details for Slivkins, AleksandrsSlivkins, Aleksandrs
2009Chan, T-H. Hubert
[Dhamdhere, Kedar]
[Gupta, Anupam]
[Kleinberg, Jon]
[Slivkins, Aleksandrs]
Metric Embeddings with Relaxed Guarantees
In: SIAM Journal on Computing [38], 2303-2329
Journal Article
2
Hide details for Sloot, Peter (ed.)Sloot, Peter (ed.)
1999Sanders, Peter
[Takkula, Tuomo]
[Wedelin, Dag]
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
1999[Jung, Bernd]
Lenhof, Hans-Peter
Müller, Peter
Rüb, Christine
Simulating synthetic polymer chains in parallel
In: Proceedings of the 7th International Conference on High-Performance Computing and Networking Europe (HPCN Europe-99), 13-22
Proceedings Article
1
Hide details for Smari, Waleed W. (ed.)Smari, Waleed W. (ed.)
2011Emeliyanenko, PavelAttachment IconHigh-performance polynomial GCD computations on graphics processors
In: Proceedings of the 2011 International Conference on High Performance Computing & Simulation (HPCS 2011), 215-224
Proceedings Article
38
Hide details for Smid, MichielSmid, Michiel
2004[Smid, Michiel]
Ray, Rahul
[Wendt, Ulrich]
[Lange, Katharina]
Computing Large Planar Regions in Terrains, with an Application to Fracture Surface
In: Discrete Applied Mathematics [139], 253-264
Journal Article
2002Ray, Rahul
[Smid, MIchiel]
[Lange, Katharina]
[Wendt, Ulrich]
Attachment IconComputing Large Planar Regions in Terrains
In: IWCIA 2001, 8th International Workshop on Combinatorial Image Analysis (IWCIA-01), 139-152
Proceedings Article
2002[Wendt, Ulrich]
[Lange, Katharina]
[Smid, Michiel]
Ray, Rahul
[Tönnies, Klaus-Dietz]
Surface Topography Quantification by Integral and Feature-related Parameters
In: Materialwissenschaft und Werkstofftechnik [33], 621-627
Journal Article
2002[Agarwal, Pankaj]
[Hagerup, Torben]
Ray, Rahul
[Sharir, Micha]
[Smid, Michiel]
[Welzl, Emo]
Translating a Planar Object to Maximize Point Containment
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 42-53
Proceedings Article
2001[Wendt, Ulrich]
[Lange, Katharina]
Ray, Rahul
[Smid, Michiel]
Surface Topography Quantification using Computational GeometryMiscellaneous
1999Gupta, Prosenjit
[Janardan, Ravi]
Smid, Michiel
Efficient algorithms for counting and reporting pairwise intersections between convex polygons
In: Information Processing Letters [69], 7-13
Journal Article
1998[Golin, Mordecai J.]
[Raman, Rajeev]
Schwarz, Christian
Smid, Michiel
Randomized Data Structures for the Dynamic Closest-Pair Problem
In: SIAM Journal on Computing [27], 1036-1072
Journal Article
1997[Follert, Frank]
[Schömer, Elmar]
[Sellen, Jürgen]
Smid, Michiel
[Thiel, Christian]
Computing the largest empty anchored cylinder, and related problems
In: International Journal of Computational Geometry and Applications [7], 563-580
Journal Article
1997[Schwerdt, Jörg]
[Smid, Michiel]
Schirra, Stefan
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
1997[Schwerdt, Jörg]
[Smid, Michiel]
Schirra, Stefan
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
1997Arya, Sunil
Smid, Michiel
Efficient construction of a bounded degree spanner with low weight
In: Algorithmica [17], 33-54
Journal Article
1997Bradford, Phillip Gnassi
Fleischer, Rudolf
Smid, Michiel
More efficient parallel totally monotone matrix searching
In: Journal of Algorithms [23], 386-400
Journal Article
1997[Das, Gautam]
[Kapoor, Sanjiv]
Smid, Michiel
On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees
In: 16th Conference on Foundations of Software Technology and Theoretical Computer Science, 447-460
In: Algorithmica [19], 447-460
Journal Article
1997Gupta, Prosenjit
[Janardan, Ravi]
Smid, Michiel
[Dasgupta, Bhaskar]
The rectangle enclosure and point-dominance problems revisited
In: International Journal of Computational Geometry and Applications [7], 437-456
Journal Article
1996Gupta, Prosenjit
[Janardan, Ravi]
Smid, Michiel
Algorithms for generalized halfspace range searching and other intersection searching problems
In: Computational Geometry [5], 321-340
Journal Article
1996Gupta, Prosenjit
[Janardan, Ravi]
Smid, Michiel
Algorithms for generalized halfspace range searching and other intersection searching problems
In: Computational Geometry [6], 1-19
Journal Article
1996Gupta, Prosenjit
[Janardan, Ravi]
Smid, Michiel
Fast algorithms for collision and proximity problems involving moving geometric objects
In: Computational Geometry [6], 371-391
Journal Article
1996[Chen, Danny Z.]
[Das, Gautam]
Smid, Michiel
Lower bounds for computing geometric spanners and approximate shortest paths
In: 8th Canadian Conference on Computing, 155-160
Proceedings Article
1996Kapoor, Sanjiv
Smid, Michiel
New techniques for exact and approximate dynamic closest-point problems
In: SIAM Journal on Computing [25], 775-796
Journal Article
1996[Das, Gautam]
[Kapoor, Sanjiv]
Smid, Michiel
On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees
In: Foundations of software technology and theoretical computer science (FSTTCS-96) : 16th conference, 64-75
Proceedings Article
1996Arikati, Srinivasa Rao
[Chen, Danny Z.]
[Chew, L. Paul]
[Das, Gautam]
[Smid, Michiel]
Zaroliagis, Christos
Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane
In: Algorithms - ESA '96: 4th Annual European Symposium, 514-528
Proceedings Article
1995[Follert, Frank]
[Schömer, Elmar]
[Sellen, Jürgen]
Smid, Michiel
Thiel, Christian
Computing a largest empty anchored cylinder, and related problems
In: Foundations of Software Technology and Theoretical Computer Science: 15th Conference, 428-442
Proceedings Article
1995Smid, MichielDynamic rectangular point location, with an application to the closest pair problem
In: Information and Computation [16], 1-9
Journal Article
1995Arya, Sunil
[Das, Gautam]
[Mount, David M.]
[Salowe, Jeffrey S.]
Smid, Michiel
Euclidean spanners: short, thin, and lanky
In: 27th Annual ACM Symposium on Theory of Computing (STOC95), 489-498
Proceedings Article
1995Gupta, Prosenjit
[Janardan, Ravi]
Smid, Michiel
Further results on generalized intersection searching problems:
counting, reporting, and dynamization
In: Journal of Algorithms [19], 282-317
Journal Article
1995Lenhof, Hans-Peter
Smid, Michiel
Maintaining the visibility map of spheres while moving the viewpoint
In: Algorithmica [13], 301-312
Journal Article
1995[Janardan, Ravi]
Smid, Michiel
On the width and roundness of a set of points in the plane
In: 7th Canadian Conference on Computational Geometry, 193-198
Proceedings Article
1995Lenhof, Hans-Peter
Smid, Michiel
Sequential and parallel algorithms for the k closest pairs problem
In: International Journal of Computational Geometry & Applications [5], 273-288
Journal Article
1995Golin, Mordecai J.
[Raman, Rajeev]
Schwarz, Christian
Smid, Michiel
Simple randomized algorithms for closest pair problems
In: Nordic Journal of Computing [2], 3-27
Journal Article
1995[Datta, Amitava]
Lenhof, Hans-Peter
Schwarz, Christian
Smid, Michiel
Static and dynamic algorithms for k-point clustering problems
In: Journal of Algorithms [19], 474-503
Journal Article
1995Gupta, Prosenjit
[Janardan, Ravi]
Smid, Michiel
[Dasgupta, Bhaskar]
The rectangle enclosure and point-dominance problems revisited
In: 11th Annual ACM Symposium on Computing Geometry, 162-171
Proceedings Article
1995Gupta, Prosenjit
[Janardan, Ravi]
Smid, Michiel
The rectangle enclosure and point-dominance problems revisited
In: 11th Annual !CM Symposium on Computational Geometry, 162-171
Proceedings Article
1994Lenhof, Hans-Peter
Smid, Michiel
An animation of a fixed-radius all-nearest neighbors algorithm
In: Proceedings of the 10th Symposium on Computational Geometry (SCG94), 387
Proceedings Article
1994Lenhof, Hans-Peter
Smid, Michiel
Using persistent data structures for adding range restrictions to searching problems
In: RAIRO Theoretical Informatics and Applications [28], 25-49
Journal Article
1993Lenhof, Hans-Peter
Smid, Michiel
An optimal construction method for generalized convex layers
In: International Journal of Computational Geometry & Applications [3], 245-267
Journal Article
1992Lenhof, Hans-Peter
Smid, Michiel
Enumerating the k closest pairs optimally
In: 33rd Annual Symposium on Foundations of Computer Science (FOCS92), 380-386
Proceedings Article
1992Lenhof, Hans-Peter
Smid, Michiel
Maintaining the visibility map of speres while moving the viewpoint on a circle at infinity
In: Algorithms Theory - SWAT'92: Third Scandinavian Workshop on Algorithm Theory, 388-398
Proceedings Article
1991Lenhof, Hans-Peter
Smid, Michiel
An optimal construction method for generalized convex layers
In: ISA'91 Algorithms: 2nd International Symposium on Algorithms, 349-363
Proceedings Article
1
Hide details for Smid, Michiel H. M.Smid, Michiel H. M.
1990Ching, Yu-Tai
Mehlhorn, Kurt
Smid, Michiel H. M.
Dynamic deferred data structuring
In: Information Processing Letters [35], 37-40
Journal Article
1
Hide details for Smyth, William F. (ed.)Smyth, William F. (ed.)
2011[Arumugam, S.]
[Chandrasekar, K. Raja]
[Misra, Neeldhara]
Philip, Geevarghese
[Saurabh, Saket]
Attachment IconAlgorithmic Aspects of Dominator Colorings in Graphs
In: Combinatorial Algorithms - 22nd International Workshop, IWOCA 2011, Victoria, BC, Canada, July 20-22, 2011, Revised Selected Papers, 19-30
Proceedings Article
1
Hide details for Snelting, Gregor (ed.)Snelting, Gregor (ed.)
2000Informatik 2000 : neue Horizonte im neuen Jahrhundert, 30. Jahrestagung der Gesellschaft für InformatikProceedings
4
Hide details for Snoeyink, JackSnoeyink, Jack
2006[Brönnimann, Hervé]
Kettner, Lutz
[Pocchiola, Michel]
[Snoeyink, Jack]
Attachment IconCounting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm
In: SIAM Journal on Computing [36], 721-739
Journal Article
2005[Brönnimann, Hervé]
Kettner, Lutz
[Pocchiola, Michel]
[Snoeyink, Jack]
Counting and enumerating pointed pseudo-triangulations with the greedy flip algorithm
In: Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics
(ALENEX/ANALCO 2005), 98-110
Proceedings Article
2003Kettner, Lutz
[Rossignac, Jarek]
[Snoeyink, Jack]
The Safari Interface for Visualizing Time-dependent Volume Data Using Iso-surfaces and Contour Spectra
In: Computational Geometry - Theory and Applications [25], 97-116
Journal Article
2003Kettner, Lutz
[Kirkpatrick, David]
[Mantler, Andrea]
[Snoeyink, Jack]
[Speckmann, Bettina]
[Takeuchi, Fumihiko]
Tight Degree Bounds for Pseudo-triangulations of Points
In: Computational Geometry - Theory and Applications [25], 3-12
Journal Article
1
Hide details for Snoeyink, Jack (ed.)Snoeyink, Jack (ed.)
2001Mehlhorn, Kurt
Ziegelmann, Mark
Attachment IconCNOP - A Package for Constrained Network Optimization
In: Algorithm engineering and experimentation (ALENEX-01) :Third International Workshop ALENEX 2001 ; revised papers, 17-31
Proceedings Article
2
Hide details for Sohler, ChristianSohler, Christian
2003[Adler, Micah]
[Räcke, Harald]
Sivadasan, Naveen
[Sohler, Christian]
Vöcking, Berthold
Attachment IconRandomized Pursuit-Evasion in Graphs
In: Combinatorics, Probability and Computing [12], 225-244
Journal Article
2002[Adler, Micah]
[Räcke, Harald]
Sivadasan, Naveen
[Sohler, Christian]
Vöcking, Berthold
Randomized Pursuit-Evasion in Graphs
In: Automata, Languages and Programming : 29th International Colloquium, ICALP 2002, 901-912
Proceedings Article
3
Hide details for Soh, Kian MinSoh, Kian Min
2008[Xu, Chihao]
Karrenbauer, Andreas
[Soh, Kian Min]
[Codrea, Cosmin]
Consecutive multiline addressing: A scheme for addressing PMOLEDs
In: Journal of the Society for Information Display [16], 211-219
Journal Article
2007[Xu, Chihao]
Karrenbauer, Andreas
[Soh, Kian Min]
[Wahl, Jürgen]
A New Addressing Scheme for PM OLED Display
In: SID 2007 International Symposium Digest of Technical Papers, 97-100
Proceedings Article
2005[Xu, Chihao]
[Wahl, Jürgen]
[Eeisenbrand, Friedrich]
Karrenbauer, Andreas
[Soh, Kian Min]
[Hitzelberger, Christoph]
Verfahren zur Ansteuerung von MatrixanzeigenMiscellaneous
10
Hide details for Solis-Oba, RobertoSolis-Oba, Roberto
2001Krysta, Piotr
Solis-Oba, Roberto
Approximation Algorithms for Bounded Facility Location
In: Journal of Combinatorial Optimization [5], 233-247
Journal Article
2001Sanders, Peter
[Solis-Oba, Roberto]
How Helpers Hasten h-Relations
In: Journal of Algorithms [41], 86-98
Journal Article
2000Sanders, Peter
[Solis-Oba, Roberto]
How Helpers Hasten h-Relations
In: Algorithms - ESA 2000, Proceedings of the 8th Annual European Symposium (ESA-00), 392-402
Proceedings Article
2000[Jansen, Klaus]
Solis-Oba, Roberto
[Sviridenko, Maxim]
Linear time approximation schemes for shop scheduling problems
In: Approximation and complexity in numerical optimization, 338-346
Part of a Book
1999Solis-Oba, Roberto
[Jansen, Klaus]
[Sviridenko, Maxim]
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
1999Krysta, Piotr
Solis-Oba, Roberto
Approximation algorithms for bounded facility location
In: Proceedings of the 5th Annual International Conference on Computing and Combinatorics (COCOON-99), 241-250
Proceedings Article
1999Solis-Oba, Roberto
[Jansen, Klaus]
[Sviridenko, Maxim]
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
1998Solis-Oba, Roberto2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 441-452
Proceedings Article
1998[Frederickson, Greg N.]
Solis-Oba, Roberto
Algorithms for Measuring Perturbability in Matroid Optimization
In: Combinatorica [18], 503-518
Journal Article
1998Solis-Oba, Roberto
Frederickson, Greg N.
Rooted Spanning Trees with Small Weight and Average Length
In: Theoretical Computer Science, 114-125
Proceedings Article
3
Hide details for Solis-Oba, Roberto (ed.)Solis-Oba, Roberto (ed.)
2012Harren, Rolf
[Kern, Walter]
Improved Lower Bound for Online Strip Packing
In: Approximation and Online Algorithms : 9th International Workshop ,WAOA 2011, 211-218
Proceedings Article
2012van Zuylen, AnkeSimpler 3/4-approximation algorithms for MAX SAT
In: Approximation and Online Algorithms : 9th International Workshop, WAOA 2011, 188-197
Proceedings Article
2011van Stee, RobAttachment IconAn improved algorithm for online rectangle filling
In: Approximation and Online Algorithms : 8th International Workshop, WAOA 2010, 249-260
Proceedings Article
1
Hide details for Son, Jung-BaeSon, Jung-Bae
1999Son, Jung-BaeBerechnung konvexer Hüllen in erwarteter Linearzeit
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Soranzo, NicolaSoranzo, Nicola
2012[Soranzo, Nicola]
Ramezani, Fahimeh
[Iacono, Giovanni]
[Altafini, Claudio]
Decompositions of large-scale biological systems based on dynamical properties
In: Bioinformatics [28], 76-83
Journal Article
1
Hide details for Soranzo, N.Soranzo, N.
2010[Iacono, G.]
Ramezani, Fahimeh
[Soranzo, N.]
[Altafani, C.]
Determining the distance to monotonicity of a biological network: a graph-theoretical approach
In: IET Systems Biology [4], 223-235
Journal Article
1
Hide details for Sotiris E. Nikoletseas (ed.)Sotiris E. Nikoletseas (ed.)
2008Funke, Stefan
Laue, Sören
Naujoks, Rouven
[Lotker, Zvi]
Power Assignment Problems in Wireless Communication: Covering Points by Disks, Reaching few Receivers Quickly, and Energy-Efficient Travelling Salesman Tours
In: Distributed Computing in Sensor Systems, 4th IEEE International Conference, DCOSS 2008, 282-295
Proceedings Article
5
Hide details for Soule, Terence (ed.)Soule, Terence (ed.)
2012Doerr, Benjamin
[Hota, Ashish]
Kötzing, Timo
Ants easily solve stochastic shortest path problems
In: GECCO'12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, 17-24
Proceedings Article
2012Doerr, BenjaminBlack-box complexity: from complexity theory to playing mastermind
In: GECCO'12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, 1079-1092
Proceedings Article
2012Doerr, Benjamin
Winzen, Carola
Reducing the arity in unbiased black-box complexity
In: GECCO'12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, 1309-1316
Proceedings Article
2012Doerr, Benjamin
Pohl, Sebastian
Run-time analysis of the (1+1) evolutionary algorithm optimizing linear functions over a finite alphabet
In: GECCO'12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, 1317-1324
Proceedings Article
2012Kötzing, Timo
[Sutton, Andrew M.]
[Neumann, Frank]
[O'Reilly, Una-May]
The max problem revisited: the importance of mutation in genetic programming
In: GECCO’12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, 1333-1340
Proceedings Article
1
Hide details for Spaniol, Otto (ed.)Spaniol, Otto (ed.)
1997Crauser, Andreas
Mehlhorn, Kurt
Meyer, Ulrich
Kürzeste-Wege-Berechnung bei sehr großen Datenmengen
In: Promotion tut not: Innovationsmotor "Graduiertenkolleg", 113-132
Proceedings Article
1
Hide details for Speckmann, BettinaSpeckmann, Bettina
2003Kettner, Lutz
[Kirkpatrick, David]
[Mantler, Andrea]
[Snoeyink, Jack]
[Speckmann, Bettina]
[Takeuchi, Fumihiko]
Tight Degree Bounds for Pseudo-triangulations of Points
In: Computational Geometry - Theory and Applications [25], 3-12
Journal Article
1
Hide details for Speckmann, Bettina (ed.)Speckmann, Bettina (ed.)
2015Bei, XiaohuiSolving Linear Programming with Constraints Unknown
In: Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I., 129-142
Proceedings Article
8
Hide details for Spencer, JoelSpencer, Joel
2010[Cooper, Joshua]
Doerr, Benjamin
Friedrich, Tobias
[Spencer, Joel]
Deterministic Random Walks on Regular Trees
In: Random Structures and Algorithms [37], 353-366
Journal Article
2010[Kuhn, Fabian]
Panagiotou, Konstantinos
[Spencer, Joel]
[Steger, Angelika]
Synchrony and Asynchrony in Neural Networks
In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 949-964
Proceedings Article
2008[Cooper, Joshua]
Doerr, Benjamin
Friedrich, Tobias
[Spencer, Joel]
Deterministic Random Walks on Regular Trees
In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, 766-772
Proceedings Article
2007[Cooper, Joshua]
Doerr, Benjamin
Friedrich, Tobias
[Spencer, Joel]
Deterministic Random Walks on Regular Trees
In: Electronic Notes in Discrete Mathematics [29], 509-513
Journal Article
2007[Cooper, Joshua]
Doerr, Benjamin
[Spencer, Joel]
[Tardos, Gábor]
Deterministic random walks on the integers
In: European Journal of Combinatorics [28], 2072-2090
Journal Article
2006[Cooper, Joshua]
Doerr, Benjamin
[Spencer, Joel]
[Tardos, Gábor]
Deterministic Random Walks
In: Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments and the Third Workshop on Analytic Algorithmics and Combinatorics (ALENEX'06 / ANALCO'06), 185-197
Proceedings Article
2006[Cooper, Joshua]
Doerr, Benjamin
[Spencer, Joel]
[Tardos, Gabor]
Deterministic Random Walks on the Integers
In: ??? [?], 1-27
Miscellaneous
2005[Cooper, Joshua]
Doerr, Benjamin
[Spencer, Joel]
[Tardos, Gabor]
Deterministic Random Walks on the Integers
In: 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 73-76
In: Discrete Mathematics & Theoretical Computer Science [AE], 73-76
Proceedings Article
1
Hide details for Spencer, Stephen N. (ed.)Spencer, Stephen N. (ed.)
2005Eisenbrand, Friedrich
[Funke, Stefan]
Karrenbauer, Andreas
Reichel, Joachim
[Schömer, Elmar]
Packing a Trunk - now with a Twist!
In: Proceedings SPM 2005 ACM Symposium on Solid and Physical Modeling, 197-206
Proceedings Article
1
Hide details for Spies, Peter Pau (ed.)Spies, Peter Pau (ed.)
1979Mehlhorn, KurtAttachment IconKonzepte der Komplexitätstheorie illustriert am Beispiel des Sortierens
In: GI - 9. Jahrestagung, 16-22
Proceedings Article
1
Hide details for Spiliopoulou, Myra (ed.)Spiliopoulou, Myra (ed.)
2006Bast, Holger
[Dupret, Georges]
Majumdar, Debapriyo
[Piwowarski, Benjamin]
Discovering a Term Taxonomy from Term Similarities Using Principal Component Analysis
In: Semantics, web and mining : Joint International Workshops, EWMF 2005 and KDO 2005, 103-120
Proceedings Article
3
Hide details for Spinrad, Jeremy P.Spinrad, Jeremy P.
2006[Kratsch, Dieter]
[McConnell, Ross]
Mehlhorn, Kurt
[Spinrad, Jeremy P.]
Attachment IconCertifying Algorithms for Recognizing Interval Graphs and Permutation Graphs
In: Siam Journal on Computing, 326-353
In: SIAM Journal on Computing [36], 326-353
Journal Article
2005Mehlhorn, Kurt
Eigenwillig, Arno
Kaligosi, Kanela
Kratsch, Dieter
McConnell, Ross
Meyer, Ulrich
Spinrad, Jeremy P.
Certifying Algorithms (draft)Unpublished/Draft
2003Kratsch, Dieter
McConnell, Ross
Mehlhorn, Kurt
Spinrad, Jeremy P.
Attachment IconCertifying Algorithms for Recognizing Interval Graphs and Permutation Graphs
In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 158-167
Proceedings Article
11
Hide details for Spirakis, Paul G.Spirakis, Paul G.
2005[Fotakis, Dimitris]
[Pagh, Rasmus]
Sanders, Peter
Spirakis, Paul G.
Space Efficient Hash Tables With Worst Case Constant Access Time
In: Theory of Computing Systems [38], 229-248
Journal Article
2003Fotakis, Dimitris
[Pagh, Rasmus]
Sanders, Peter
[Spirakis, Paul G.]
Attachment IconSpace Efficient Hash Tables with Worst Case Constant Access Time
In: Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2003), 271-282
Proceedings Article
2002Fotakis, Dimitris
[Spirakis, Paul G.]
Attachment IconMinimum Congestion Redundant Assignments to Tolerate Random Faults
In: Algorithmica [32], 396-422
Journal Article
Next Page