| # |  | Year | Author(s) [non member] | | Title | Type | |
|---|
| 1 |
 | Schömer, Elmar (ed.) |
| |
| | 2002 | Goesele, 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 Prototyping | Proceedings | |
| 3 |
| Schö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 Manuals | Unknown 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 |
| Schreiber, 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 |
| Schrijver, Alexander (ed.) |
| |
| | 1990 | Kaufmann, Morgan
Mehlhorn, Kurt | | Routing problems in grid graphs
In: Paths, Flows, and VLSI-Layout, 165–184 | Part of a Book | |
| 1 |
| Schröder, Bianca |
| |
| | 1998 | Schröder, Bianca | | Upper and Lower Bounds for Basic Scheduling Problems
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Schrö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 |
| Schroeder, Ulf-Peter (ed.) |
| |
| | 2008 | [Epstein, Leah]
van Stee, Rob |  | The price of anarchy on uniformly related machines revisited
In: Algorithmic Game Theory, First International Symposium, SAGT 2008, 46-57 | Proceedings Article | |
| 2 |
| Schuberth, Eva |
| |
| | 2007 | Giesen, Joachim
[Mitsche, Dieter]
[Schuberth, Eva] | | Collaborative Ranking: an aggregation algorithm for individuals' preference estimation
In: Algorithmic Aspects in Information and Management : Third International Conference, AAIM 2007, 58-67 | Proceedings Article | |
| | 2007 | Giesen, 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 |
| |
| | 2002 | [Albers, Susanne]
Kursawe, Klaus
[Schuierer, Sven] | | Exploring unkown environments with obstacles
In: Algorithmica [32], 123-143 | Journal Article | |
| 4 |
| |
| | 2007 | Bast, Holger
Funke, Stefan
[Sanders, Peter]
[Schultes, Dominik] | | Fast Routing in Road Networks using Transit Nodes
In: Science [316], 566 | Journal Article | |
| | 2007 | Bast, Holger
Funke, Stefan
Matijevic, Domagoj
[Sanders, Peter]
[Schultes, Dominik] | | In Transit to Constant Time Shortest-Path Queries in Road Networks
In: 9th Workshop on Algorithm Enginneering and Experiments (ALENEX'07), 46-59 | Proceedings Article | |
| | 2005 | Schultes, Dominik | | Fast and Exact Shortest Path Queries Using Highway Hierachies
Universität des Saarlandes | Thesis - Masters thesis | |
| | 2004 | Dementiev, Roman
Sanders, Peter
Schultes, Dominik
[Sibeyn, Jop F.] | | Engineering an External Memory Minimum Spanning Tree Algorithm
In: 3rd IFIP International Conference on Theoretical Computer Science (TSC2004), 195-208 | Proceedings Article | |
| 2 |
| Schulte, Ralph |
| |
| | 2003 | Dhiflaoui, Marcel
Funke, Stefan
Kwappik, Carsten
Mehlhorn, Kurt
Seel, Michael
Schömer, Elmar
Schulte, Ralph
Weber, Dennis | | Certifying and Repairing Solutions to Large LPs - How Good are LP-Solvers?
In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 255-256 | Proceedings Article | |
| | 2001 | Schulte, Ralph | | Exaktes Lösen von Linearen Programmen
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| |
| | 2002 | Althaus, Ernst
Fink, Christian | | A Polyhedral Approach to Surface Reconstruction from Planar Contours.
In: Proceedings of the 9th International Conference on Integer Programming and Combinatorial Optimization, 258-272 | Proceedings Article | |
| 1 |
| |
| | 2007 | Pyrga, 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 |
| |
| | 2011 | Megow, 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 |
| Schumaker, Larry L. (ed.) |
| |
| | 2000 | Mehlhorn, Kurt
Schirra, Stefan | | Geometric Computing with CGAL and LEDA
In: Curve and surface design, Saint-Malo 1999, 277-286 | Proceedings Article | |
| 1 |
| |
| | 2005 | Kettner, Lutz | | Reference Counting in Library Design---Optionally and with Union-Find Optimization
In: Library-Centric Software Design (LCSD'05), 1-10 | Electronic Proceedings Article | |
| 2 |
| |
| | 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 |
| Schwahn, Anne |
| |
| | 2008 | [Krumke, Sven Oliver]
[Schwahn, Anne]
van Stee, Rob
[Westphal, Stephan] | | A monotone approximation algorithm for scheduling with precedence constraints
In: Operations Research Letters [36], 247-249 | Journal Article | |
| 1 |
| Schwarzenecker, Erik |
| |
| | 1995 | Schwarzenecker, Erik | | Ein NP-schweres Plazierungsproblem
Universität des Saarlandes | Thesis - PhD thesis | |
| 1 |
| Schwarzenecker, E. |
| |
| | 1993 | Kucera, Ludek
Mehlhorn, Kurt
Preis, B.
Schwarzenecker, E. | | Exact Algorithms for a Geometric Packing Problem (Extended Abstract)
In: Theoretical aspects of computer science (STACS-93) : 10th annual symposium, 317-322 | Proceedings Article | |
| 5 |
| Schwarz, 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 | |
| | 1995 | Golin, 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 |
| Schwarz, 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 |
| Schweitzer, Pascal |
| |
| | 2012 | Megow, Nicole
Mehlhorn, Kurt
[Schweitzer, Pascal] | | Online Graph Exploration: New Results on Old and New Algorithms
In: Theoretical Computer Science [463], 62-72 | Journal Article | |
| | 2011 | Mehlhorn, Kurt
Näher, Stefan
Schweitzer, Pascal | | Certifying algorithms
In: Computer Science Review [5], 119-161 | Journal Article | |
| | 2011 | Megow, Nicole
Mehlhorn, Kurt
Schweitzer, Pascal | | Online Graph Exploration: New Results on Old and New Algorithms
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 478-489 | Proceedings Article | |
| | 2011 | [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 | |
| | 2010 | McConnella, Ross M.
Mehlhorn, Kurt
[Näher, Stefan]
[Schweitzer, Pascal] | | Certifying algorithms
In: Computer Science Review [Article in Press], 1-43 | Electronic Journal Article | |
| | 2010 | Schweitzer, 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 | |
| | 2010 | Kratsch, 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 | |
| | 2010 | Mehlhorn, Kurt
Schweitzer, Pascal | | Progress on Certifying Algorithms
In: Frontiers in Algorithmics : 4th International Workshop, FAW 2010, 1-5 | Proceedings Article | |
| | 2009 | Angelopoulos, Spyros
Schweitzer, Pascal | | Paging and List Update under Bijective Analysis
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 1136-1145 | Proceedings Article | |
| | 2009 | Schweitzer, Pascal | | Problems of Unknown Complexity: Graph isomorphism and Ramsey theoretic numbers
Universität des Saarlandes | Thesis - PhD thesis | |
| | 2009 | Schweitzer, Pascal | | Using 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 | | Counting Defective Parking Functions
In: Electronic Journal of Combinatorics [15], R92 | Electronic Journal Article | |
| | 2007 | Kutz, Martin
Schweitzer, Pascal | | ScrewBox: a Randomized Certifying Graph Non-Isomorphism Algorithm
In: 9th Workshop on Algorithm Engineering and Experiments (ALENEX'07), 150-157 | Proceedings Article | |
| | 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 |
| Schweitzer, Patrick |
| |
| | 2010 | Schweitzer, Pascal
[Schweitzer, Patrick] | | Connecting face hitting sets in planar graphs
In: Information Processing Letters [111], 11-15 | Journal Article | |
| 5 |
| Schwentick, Thomas (ed.) |
| |
| | 2011 | [Fomin, Fedor V.]
[Lokshtanov, Daniel]
[Misra, Neeldhara]
Philip, Geevarghese
[Saurabh, Saket] | | Hitting 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 |
| Schwerdt, 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 |
| |
| | 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 | |
| | 2005 | Dementiev, Roman
[Kärkkäinen, Juha]
Mehnert, Jens
Sanders, Peter | | Better External Memory Suffix Array Construction
In: Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics
(ALENEX/ANALCO 2005), 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 | |
| | 2004 | Dementiev, Roman
Kettner, Lutz
Mehnert, Jens
Sanders, Peter | | Engineering a Sorted List Data Structure for 32 Bit Key
In: Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics (ALENEX-04), 142-151 | Proceedings Article | |
| 15 |
| Seel, 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 | |
| | 2003 | Granados, Miguel
Hachenberger, Peter
Hert, Susan
Kettner, Lutz
Mehlhorn, Kurt
Seel, Michael | | Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation | Report | |
| | 2003 | Granados, Miguel
Hachenberger, Peter
Hert, Susan
Kettner, Lutz
Mehlhorn, Kurt
Seel, Michael | | Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation
In: Algorithms - ESA 2003: 11th Annual European Symposium, 654-666 | Proceedings Article | |
| | 2003 | Dhiflaoui, Marcel
Funke, Stefan
Kwappik, Carsten
Mehlhorn, Kurt
Seel, Michael
Schömer, Elmar
Schulte, Ralph
Weber, Dennis | | Certifying and Repairing Solutions to Large LPs - How Good are LP-Solvers?
In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 255-256 | Proceedings Article | |
| | 2003 | Mehlhorn, Kurt
[Seel, Michael] | | Infimaximal frames: A technique for making lines look like segments
In: International Journal of Computational Geometry & Applications [13], 241-255 | Journal Article | |
| | 2001 | Hert, 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 Manuals | Unknown Form: eBookForm | |
| | 2001 | Burnikel, Christoph
Funke, Stefan
Seel, Michael | | Exact geometric computation using Cascading
In: International Journal of Computational Geometry & Applications [11], 245-266 | Journal Article | |
| | 2001 | Seel, Michael | | Planar Nef Polyhedra and Generic Higher-dimensional Geometry
Universität des Saarlandes | Thesis - PhD thesis | |
| | 1999 | Mehlhorn, Kurt
[Näher, Stefan]
Seel, Michael
[Seidel, Raimund]
Schilz, Thomas
Schirra, Stefan
Uhrig, Christian | | Checking geometric programs or verification of geometric structures
In: Computational Geometry: Theory and Applications [12], 85-104 | Journal Article | |
| | 1998 | Mehlhorn, 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 | |
| | 1998 | Burnikel, 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 | |
| | 1997 | Mehlhorn, 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 | |
| | 1996 | Mehlhorn, 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 | |
| | 1994 | Seel, Michael | | Eine Implementierung abstrakter Voronoidiagramme
Universität des Saarlandes | Thesis - Masters thesis | |
| 5 |
| Segal, Michael |
| |
| | 2007 | Funke, Stefan
Kesselman, Alexander
[Kuhn, Fabian]
[Lotker, Zvi]
[Segal, Michael] | | Improved 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 | |
| | 2005 | Funke, 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 | |
| | 2005 | Kesselman, Alexander
Kowalski, Dariusz
[Segal, Michael] | | Energy 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 | |
| | 2004 | Funke, Stefan
Kesselman, Alexander
Lotker, Zvi
[Segal, Michael] | | Improved Approximation Algorithms for Connected Sensor Cover
In: Ad-hoc, mobil and wireless networks : Third International Conference, ADHOC-NOW 2004, 56-69 | Proceedings Article | |
| 1 |
| Segev, 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 |
| Seidel, Hans-Peter |
| |
| | 2002 | Goesele, 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 Prototyping | Proceedings | |
| 8 |
| Seidel, 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 | |
| | 2007 | Ajwani, Deepak
[Ray, Saurabh]
[Seidel, Raimund]
[Tiwary, Hans Raj] | | On Computing the Centroid of the Vertices of an Arrangement and Related Problems
In: 10th Workshop on Algorithms and Data Structures (WADS), 519-528 | Proceedings Article | |
| | 2006 | Elbassioni, 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 | |
| | 1999 | Mehlhorn, Kurt
[Näher, Stefan]
Seel, Michael
[Seidel, Raimund]
Schilz, Thomas
Schirra, Stefan
Uhrig, Christian | | Checking geometric programs or verification of geometric structures
In: Computational Geometry: Theory and Applications [12], 85-104 | Journal Article | |
| | 1996 | Mehlhorn, 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 | |
| | 1993 | Clarkson, Kenneth L.
Mehlhorn, Kurt
Seidel, Raimund | | Four Results on Randomized Incremental Constructions
In: Computational Geometry: Theory and Applications [3], 185-212 | Journal Article | |
| | 1992 | Clarkson, 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 |
| |
| | 1999 | Sibeyn, Jop F.
[Guillaume, Frank]
[Seidel, Tillmann] | | Practical Parallel List Ranking
In: Journal of Parallel and Distributed Computing [56], 156-180 | Journal Article | |
| | 1997 | Seidel, Tillmann | | Paralleles List Ranking
Universität des Saarlandes | Thesis - Masters thesis | |
| | 1997 | Sibeyn, Jop F.
[Guillaume, Frank]
[Seidel, Tillmann] | | Practical Parallel List Ranking
In: Proceedings of the 4th Symposium on Solving Irregularly Structured Problems in Parallel (IRREGULAR-97), 25-36 | Proceedings Article | |
| 2 |
| |
| | 2000 | Seiden, Steve S. | | Online randomized multiprocessor scheduling
In: Algorithmica [28], 173-216 | Journal Article | |
| | 1999 | Seiden, Steve S. | | Randomized online scheduling with delivery times
In: Journal of Combinatorial Optimization [3], 399-416 | Journal Article | |
| 2 |
| Sellen, 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 |
| |
| | 2000 | Semeloglou, Anastasios | | Kürzeste Wege in planare Graphen. Implementierung eines parallelen Algorithmus mithilfe von PAD
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| |
| | 2006 | Bast, Holger
[Dupret, Georges]
Majumdar, Debapriyo
[Piwowarski, Benjamin] | | Discovering a Term Taxonomy from Term Similarities Using Principal Component Analysis
In: Semantics, web and mining : Joint International Workshops, EWMF 2005 and KDO 2005, 103-120 | Proceedings Article | |
| 4 |
| |
| | 2007 | Baswana, Surender
[Sen, Sandeep] | | A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
In: Random Structures & Algorithms [30], 532-563 | Journal Article | |
| | 2005 | Baswana, Surender
[Goyal, Vishrut]
[Sen, Sandeep] | | All-pairs nearly 2-approximate shortest paths in $O(n^2 \mathrm polylog n)$ time
In: STACS 2005 : 22nd Annual Symposium on Theoretical Aspects of Computer Science, 666-679 | Proceedings Article | |
| | 2004 | Baswana, Surender
[Sen, Sandeep] | | Approximate distance oracle for unweighted graphs in Expected O(n²) time
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 271-280 | Proceedings Article | |
| | 2004 | Baswana, Surender
[Sen, Sandeep] | | Randomized graph data-structures for approximate shortest path problem
In: Handbook of Data Structures and Applications, 38.1-38.19 | Part of a Book | |
| 1 |
| Serna, Maria J. (ed.) |
| |
| | 2006 | Maue, Jens
[Sanders, Peter]
Matijevic, Domagoj | | Goal Directed Shortest Path Queries Using Precomputed Cluster Distances
In: Experimental Algorithms, 5th International Workshop, WEA 2006, 316-327 | Proceedings Article | |
| 5 |
| Serna, Maria (ed.) |
| |
| | 2010 | Fountoulakis, 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 | |
| | 1998 | Schnorr, 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 | |
| | 1996 | Gergov, Jordan | | Approximation Algorithms for Dynamic Storage Allocation
In: Algorithms - ESA '96: 4th Annual European Symposium, 52-61 | Proceedings Article | |
| | 1996 | Arikati, Srinivasa Rao
[Chen, Danny Z.]
[Chew, L. Paul]
[Das, Gautam]
[Smid, Michiel]
Zaroliagis, Christos | | Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane
In: Algorithms - ESA '96: 4th Annual European Symposium, 514-528 | Proceedings Article | |
| 1 |
| Servedio, Rocco (ed.) |
| |
| | 2012 | [Epstein, Leah]
[Jez, Lukasz]
[Sgall, Jiri]
van Stee, Rob | | Online 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 |
| Setter, Ophir |
| |
| | 2010 | Berberich, Eric
[Fogel, Efi]
[Halperin, Dan]
[Kerber, Michael]
[Setter, Ophir] | | Arrangements on Parametric Surfaces II: Concretizations and Applications
In: Mathematics in Computer Science [4], 67-91 | Journal Article | |
| 1 |
| 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 |
| Severdija, Domagoj |
| |
| | 2012 | Elbassioni, Khaled
[Matijevic, Domagoj]
[Severdija, Domagoj] | | Guarding 1.5D terrains with demands
In: International Journal of Computer Mathematics [89], 2143-2151 | Journal Article | |
| | 2011 | Elbassioni, Khaled
[Krohn, Erik]
[Matijevic, Domagoj]
Mestre, Julian
[Severdija, Domagoj] | | Improved Approximations for Guarding 1.5-Dimensional Terrains
In: Algorithmica [60], 451-463 | Journal Article | |
| | 2010 | Elbassioni, Khaled
[Matijevic, Domagoj]
[Severdija, Domagoj] | | Guarding 1.5-Dimensional with Demands
In: 26th European Workshop on Computational Geometry (EuroCG 2010), 133-136 | Proceedings Article | |
| | 2009 | Elbassioni, Khaled
[Krohn, Erik]
[Matijevic, Domagoj]
Mestre, Julián
[Severdija, Domagoj] | | Improved Approximation Algorithms for 1.5D Terrain Guarding
In: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS), 361-371 | Electronic Proceedings Article | |
| | 2009 | Elbassioni, 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 |
| Sgall, Jiri |
| |
| | 2012 | [Epstein, Leah]
[Jez, Lukasz]
[Sgall, Jiri]
van Stee, Rob | | Online 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 |
| Sgall, Jirí (ed.) |
| |
| | 2013 | Bringmann, Karl | | Bringing 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 | |
| | 2013 | Bringmann, 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 | |
| | 2011 | Doerr, Benjamin
[Fouz, Mahmoud] | | Asymptotically Optimal Randomized Rumor Spreading
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 502-513 | Proceedings Article | |
| | 2011 | Hermelin, Danny
[Levy, Avivit]
[Weimann, Oren]
[Yuster, Raphael] | | Distance Oracles for Vertex-Labeled Graphs
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 490-501 | Proceedings Article | |
| | 2011 | Hermelin, Danny
[Mnich, Matthias]
[van Leeuwen, Erik Jan]
[Woeginger, Gerhard J.] | | Domination When the Stars Are Out
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 462-473 | Proceedings Article | |
| | 2011 | [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 |
| |
| | 2011 | [Anand, S.]
[Garg, Naveen]
Megow, Nicole | | Meeting deadlines: How much speed suffices?
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011. - Pt. I, 232-243 | Proceedings Article | |
| | 2011 | Megow, Nicole
Mehlhorn, Kurt
Schweitzer, Pascal | | Online Graph Exploration: New Results on Old and New Algorithms
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 478-489 | Proceedings Article | |
| 1 |
| Shallom, 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 |
| Shaltiel, Ronen (ed.) |
| |
| | 2010 | Fountoulakis, 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 |
| |
| | 2000 | Althaus, Ernst
Kohlbacher, Oliver
Lenhof, Hans-Peter
Müller, Peter | | A Combinatorial Approach to Protein Docking with Flexible Side-Chains
In: Proceedings of the 4th Annual International Conference on Computational Molecular Biology (RECOMB-00), 15-24 | Proceedings Article | |
| 1 |
| |
| | 1998 | Bradford, Phillip Gnassi
[Rawlins, Gregory J.E.]
[Shannon, Greogory E.] | | Efficient Matrix Chain Ordering in Polylog Time
In: SIAM Journal on Computing [27], 466-490 | Journal Article | |
| 1 |
| |
| | 2005 | Bast, Holger
Weber, Ingmar | | Insights from Viewing Ranked Retrieval as Rank Aggregation
In: Workshop on Challenges in Web Information Retrieval and Integration (WIRI'05), 243-248 | Proceedings Article | |
| 1 |
| |
| | 2005 | Hachenberger, 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 |
| |
| | 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 | |
| | 1993 | Mehlhorn, Kurt
Sharir, Micha
Welzl, Emo | | Tail Estimates for the Efficiency of Randomized Incremental Algorithms for Line Segment Intersection
In: Computational Geometry: Theory and Applications [3], 235-246 | Journal Article | |
| | 1992 | Mehlhorn, 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 |
| |
| | 2000 | Klau, 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 |
| |
| | 2013 | [Yap, Chee]
Sagraloff, Michael
[Sharma, Vikram] | | Analytic Root Clustering: A Complete Algorithm using Soft Zero Tests | Unpublished/Draft | |
| | 2011 | Manjunath, 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 | |
| | 2008 | Sharma, Vikram | | Complexity of real root isolation using continued fractions
In: Theoretical Computer Science [409], 292-310 | Electronic Journal Article | |
| | 2006 | Eigenwillig, Arno
[Sharma, Vikram]
[Yap, Chee K.] | | Almost 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 |
| |
| | 2004 | Konidaris, G.
Mehlhorn, Kurt
Shell, D.A. | | An optimal algorithm for finding edge segment adjacencies in configurations of convex polygons | Unpublished/Draft | |
| 1 |
| |
| | 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 |
| |
| | 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 |
| Shermer, Thomas C. |
| |
| | 1997 | Mehlhorn, Kurt
[Shermer, Thomas C.]
[Yap, Chee] | | A 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 |
| |
| | 2011 | [Shervashidze, Nino]
Schweitzer, Pascal
[van Leeuwen, Erik Jan]
Mehlhorn, Kurt
[Borgwardt, Karsten M.] | | Weisfeiler-Lehman graph kernels
In: Journal of Machine Learning Research [12], 2539-2561 | Journal Article | |
| | 2009 | [Shervashidze, Nino]
Vishwanathan, S .V. N.
[Petri, Tobias H.]
Mehlhorn, Kurt
[Borgwardt, Karsten M.] | | Efficient Graphlet Kernels for Large Graph Comparison
In: Proceedings of the Twelfth International Conference on Artificial Intelligence and Statistics (AISTATS), 488-495 | Electronic Proceedings Article | |
| 1 |
| Shin, Chan-Su |
| |
| | 2000 | Lee, 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 |
| Shin, Dongwan (ed.) |
| |
| | 2009 | Celikik, Marjan
Bast, Holger | | Fast Error-Tolerant Search on Very Large Texts
In: The 24th Annual ACM Symposium on Applied Computing, 1724-1731 | Proceedings Article | |
| 1 |
| Shin, Sung-Yong |
| |
| | 2000 | Lee, 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 |
| 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 |
| Shukla, Sandeep K. (ed.) |
| |
| | 2009 | [Krumke, Sven]
van Stee, Rob
[Westphal, Stefan] | | Online job admissions
In: Fundamental Problems in Computing : Essays in Honor of Professor Daniel J. Rosenkrantz, 435-454 | Part of a Book | |
| 1 |
| Shur, Arseny M. (ed.) |
| |
| | 2013 | Gawrychowski, Pawel | | Alphabetic Minimax Trees in Linear Time
In: 8th International Computer Science Symposium in Russia (CSR 2013), 36-48 | Proceedings Article | |
| 2 |
| Shvartsman, 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 | |
| | 2004 | Kowalski, 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 |
| |
| | 2005 | [Georgiou, Chryssis]
Kowalski, Dariusz
[Shvartsman, Alexander] | | Efficient gossip and robust distributed computation
In: Theoretical Computer Science [347], 130-166 | Journal Article | |
| | 2005 | Kowalski, 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 |
| Shvartsman, Alexander A. (ed.) |
| |
| | 2010 | Doerr, 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 |
| Shyamasundar, Rudrapatna K. (ed.) |
| |
| | 1993 | Dubhashi, Devdatt P.
Ranjan, Desh
Mehlhorn, Kurt
Thiel, Christian | | Searching, 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 |
| Shyamasundar, Rudrapatna (ed.) |
| |
| | 1992 | Mehlhorn, Kurt | | Recent 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 |
| Sibeyn, Jop F. |
| |
| | 2006 | [Donato, Debora]
[Laura, Luigi]
[Leonardi, Stefano]
[Millozzi, Stefano]
Meyer, Ulrich
[Sibeyn, Jop F.] | | Algorithms and Experiments for the Webgraph
In: Journal of Graph Algorithms and Applications [10], 219-236 | Electronic Journal Article | |
| | 2004 | Dementiev, Roman
Sanders, Peter
Schultes, Dominik
[Sibeyn, Jop F.] | | Engineering an External Memory Minimum Spanning Tree Algorithm
In: 3rd IFIP International Conference on Theoretical Computer Science (TSC2004), 195-208 | Proceedings Article | |
| | 2003 | Sanders, 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 | |
| | 2002 | Meyer, Ulrich
[Sibeyn, Jop F.] | | Oblivious Gossiping on Tori
In: Journal of Algorithms [42], 1-19 | Journal Article | |
| | 2000 | Sanders, Peter
Sibeyn, Jop F. | | A Bandwidth Latency Tradeoff for Broadcast and Reduction
In: Euro-Par 2000 Parallel Processing, Proceedings of the 6th International Euro-Par Conference (Euro-Par-00), 918-926 | Proceedings Article | |
| | 2000 | Beier, Rene
Sibeyn, Jop F. | | A powerful heuristic for telephone gossiping
In: Proceedings of the 7th International Colloquium on Structural Information and Communication Complexity (SIROCCO-00), 17-36 | Proceedings Article | |
| | 2000 | Sibeyn, Jop F. | | Solving fundamental problems on sparse-meshes
In: IEEE Transactions on Parallel & Distributed Systems [11], 1324-1332 | Journal Article | |
| | 1999 | Sibeyn, 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 | |
| | 1999 | Sibeyn, Jop F. | | Effiziente parallele Algorithmen
Universität des Saarlandes | Thesis - Habilitation thesis | |
| | 1999 | Sibeyn, Jop F. | | External Selection
In: Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science (STACS-99), 291-301 | Proceedings Article | |
| | 1999 | Lambert, 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 | |
| | 1999 | Sibeyn, Jop F. | | Power and Limitations of Optical Reconfigurable Arrays
In: Proceedings of the 6th International Colloquium on Structural Information and Communication Complexity (SIROCCO 6), 249-263 | Proceedings Article | |
| | 1999 | Sibeyn, Jop F.
[Guillaume, Frank]
[Seidel, Tillmann] | | Practical Parallel List Ranking
In: Journal of Parallel and Distributed Computing [56], 156-180 | Journal Article | |
| | 1999 | Sibeyn, Jop F. | | Row-Major Sorting on Meshes
In: SIAM Journal on Computing [28], 847-863 | Journal Article | |
| | 1999 | Sibeyn, Jop F. | | Ultimate Parallel List Ranking?
In: Proceedings of the 6th International Conference on High Performance Computing (HiPC-99), 197-201 | Proceedings Article | |
| | 1998 | Meyer, 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 | |
| | 1998 | Sibeyn, 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 | |
| | 1998 | Sibeyn, Jop F. | | List Ranking on Meshes
In: Acta Informatica [35], 543-566 | Journal Article | |
| | 1998 | Sibeyn, 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 | |
| | 1998 | Sibeyn, Jop F. | | Solving Fundamental Problems on Sparse-Meshes
In: Proceedings of the 6th Scandinavian Workshop on Algorithm Theory (SWAT-98), 288-299 | Proceedings Article | |
| | 1997 | Sibeyn, 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 | |
| | 1997 | Sibeyn, Jop F.
[Kaufmann, Michael] | | BSP-Like External-Memory Computation
In: Proceedings of the 3rd Italian Conference on Algorithms and Complexity (CIAC-97), 229-240 | Proceedings Article | |
| | 1997 | Sibeyn, 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 | |
| | 1997 | Sibeyn, Jop F.
[Guillaume, Frank]
[Seidel, Tillmann] | | Practical Parallel List Ranking
In: Proceedings of the 4th Symposium on Solving Irregularly Structured Problems in Parallel (IRREGULAR-97), 25-36 | Proceedings Article | |
| | 1997 | Sibeyn, 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 | |
| | 1997 | Chlebus, 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 | |
| | 1997 | Sibeyn, Jop F. | | Routing on Triangles, Tori and Honeycombs
In: International Journal on the Foundations of Computer Science [8], 269-287 | Journal Article | |
| | 1997 | Sibeyn, 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 | |
| | 1997 | Sibeyn, 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 | |
| | 1996 | Sibeyn, Jop F. | | List Ranking on Interconnection Networks
In: 2nd Euro-Par Conference, 529-541 | Proceedings Article | |
| | 1996 | Preetham, 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 | |
| | 1996 | Sibeyn, 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 | |
| | 1995 | Sibeyn, Jop F. | | Sample Sort on Meshes
In: Proceedings of Computing Science in the Netherlands, SION, 217-228 | Proceedings Article | |
| | 1995 | Meyer, 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 |
| Sibeyn, Jop F. (ed.) |
| |
| | 2003 | | | Algorithms for Memory Hierarchies | Book | |
| | 2003 | Katriel, Irit
Meyer, Ulrich | | Elementary Graph Algorithms in External Memory
In: Algorithms for Memory Hierarchies, 62-84 | Part of a Book | |
| | 2003 | Kärkkäinen, Juha
[Rao, S. Srinivasa] | | Full-Text Indexes in External Memory
In: Algorithms for Memory Hierarchies, 149-170 | Part of a Book | |
| | 2003 | Sanders, Peter | | Memory hierarchies - models and lower bounds
In: Algorithms for memory hierarchies, 1-10 | Part of a Book | |
| 1 |
| |
| | 2006 | Kettner, Lutz | | Reference Counting in Library Design---Optionally and with Union-Find Optimization
In: Proceedings of the First International Workshop on Library-Centric Software Design, LCSD'05, 34-43 | Proceedings Article | |
| 4 |
| |
| | 2012 | [Misra, Neeldhara]
Philip, Geevarghese
[Raman, Venkatesh]
[Saurabh, Saket]
[Sikdar, Somnath] | | FPT Algorithms for Connected Feedback Vertex Set
In: Journal of Combinatorial Optimization [24], 131-146 | Journal Article | |
| | 2012 | Philip, 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] | | FPT 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 | |
| | 2009 | Philip, Geevarghese
[Raman, Venkatesh]
[Sikdar, Somnath] | | Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels
In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, 694-705 | Proceedings Article | |
| 1 |
| Silva, Cláudio T. (ed.) |
| |
| | 2009 | Emeliyanenko, Pavel
Berberich, Eric
Sagraloff, Michael | | Visualizing Arcs of Implicit Algebraic Curves, Exactly and Fast
In: Advances in Visual Computing : 5th International Symposium, ISVC 2009, 608-619 | Proceedings Article | |
| 2 |
| Silvestri, 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 |
| |
| | 2008 | Doerr, Benjamin
Johannsen, Daniel
[Tang, Ching Hoo] | | How Single Ant ACO Systems Optimize Pseudo-Boolean Functions
In: Parallel Problem Solving from Nature – PPSN X, 378-388 | Proceedings Article | |
| 1 |
| |
| | 1994 | Mehlhorn, Kurt
Näher, Stefan | | The Implementation of Geometric Algorithms
In: Technology and foundations : Information Processing '94 ; proceedings of the IFIP 13th World Computer Congress, 223-231 | Proceedings Article | |
| 3 |
| |
| | 2007 | Giesen, 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 | |
| | 1992 | Fleischer, 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 | |
| | 1985 | Mehlhorn, Kurt
Simon, Klaus | | Intersecting two polyhedra one of which is convex
In: FCT '85: Fundamentals of Computation Theory, 534-542 | Proceedings Article | |
| 1 |
| |
| | 1999 | Solis-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 |
| |
| | 2013 | [Sanders, Peter]
[Singler, Johannes]
van Stee, Rob | | Real-time prefetching and caching
In: Journal of Scheduling [16], 47-58 | Journal Article | |
| 1 |
| |
| | 1999 | Sibeyn, Jop F. | | Ultimate Parallel List Ranking?
In: Proceedings of the 6th International Conference on High Performance Computing (HiPC-99), 197-201 | Proceedings Article | |
| 1 |
| |
| | 2012 | Panagiotou, Konstantinos
[Sinha, Makrand] | | Vertices of degree k in random unlabeled trees
In: Journal of Graph Theory [69], 114-130 | Journal Article | |
| 15 |
| |
| | 2012 | [Chan, Ho-Leung]
Megow, Nicole
[Sitters, René]
van Stee, Rob | | A note on sorting buffers offline
In: Theoretical Computer Science [423], 11-18 | Journal Article | |
| | 2012 | Elbassioni, Khaled
[Raman, Rajiv]
Ray, Saurabh
[Sitters, René] | | On the complexity of the highway problem
In: Theoretical Computer Science [460], 70-77 | Journal Article | |
| | 2009 | Elbassioni, 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 | |
| | 2009 | Elbassioni, Khaled
Raman, Rajiv
Ray, Saurabh
[Sitters, Rene] | | On Profit-Maximizing Pricing for the Highway and Tollbooth Problems
In: Algorithmic Game Theory : Second International Symposium, SAGT 2009, 275-286
In: ArXiv.org [5814], 275-286 | Proceedings Article | |
| | 2009 | Elbassioni, 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 | |
| | 2007 | Elbassioni, Khaled M.
[Sitters, Rene]
[Zhang, Yan] | | A Quasi-PTAS for Envy-free Pricing on Line Graphs | Unpublished/Draft | |
| | 2007 | Elbassioni, Khaled
[Sitters, Rene]
[Zhang, Yan] | | A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs
In: Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings, 451-462 | Proceedings Article | |
| | 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 | |
| | 2006 | Elbassioni, Khaled M.
[Fishkin, Aleksei V.]
Sitters, Rene | | On Approximating the TSP with Intersecting Neighborhoods
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 213-222 | Proceedings Article | |
| | 2006 | [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 | |
| | 2006 | Sitters, 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 | |
| | 2005 | Elbassioni, 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 | |
| | 2005 | Sitters, Rene | | Complexity of preemptive minsum scheduling on unrelated parallel machines
In: Journal of Algorithms [57], 37-48 | Journal Article | |
| 10 |
| |
| | 2009 | [Sanders, Peter]
Sivadasan, Naveen
[Skutella, Martin] | | Online scheduling with bounded migration
In: Mathematics of Operations Research [34], 481-498 | Journal Article | |
| | 2004 | Chandran, L. Sunil
Sivadasan, Naveen | | On the Hadwiger's Conjecture for Graph Products | Report | |
| | 2004 | Sivadasan, Naveen | | Online Problems and Two-Player Games: Algorithms and Analysis
Universität des Saarlandes | Thesis - PhD thesis | |
| | 2004 | Sivadasan, Naveen
Sanders, Peter
Skutella, Martin | | Online Scheduling with Bounded Migration | Report | |
| | 2004 | Sanders, Peter
Sivadasan, Naveen
Skutella, Martin | | Online scheduling with bounded migration
In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, 1111-1122 | Proceedings Article | |
| | 2004 | Schäfer, Guido
Sivadasan, Naveen | | Topology 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 | | Randomized Pursuit-Evasion in Graphs
In: Combinatorics, Probability and Computing [12], 225-244 | Journal Article | |
| | 2002 | Mehlhorn, Kurt
Priebe, Volker
Schäfer, Guido
Sivadasan, Naveen | | All-Pairs Shortest-Paths Computation in the Presence of Negative Cycles
In: Information Processing Letters [81], 341-343 | Journal Article | |
| | 2002 | Beier, Rene
Sanders, Peter
Sivadasan, Naveen | | Energy Optimal Routing in Radio Networks Using Geometric Data Structures
In: Automata, Languages and Programming : 29th International Colloquium, ICALP 2002, 366-376 | Proceedings Article | |
| | 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 |
| Sivakumar, G. (ed.) |
| |
| | 1997 | Mahajan, 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 |
| Six, Hans-Werner (ed.) |
| |
| | 2003 | Mehlhorn, Kurt | | The 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 |
| Skala, Vaclav (ed.) |
| |
| | 2001 | Warken, 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 |
| Skopalik, Alexander |
| |
| | 2013 | Hoefer, 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 | |
| | 2013 | Hoefer, Martin
[Skopalik, Alexander] | | On the Complexity of Pareto-optimal Nash and Strong Equilibria
In: Theory of Computing Systems [53], 441-453 | Journal Article | |
| 1 |
| Skraba, Primoz |
| |
| | 2011 | Milosavljevic, 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 |
| Skrekovski, 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 |
| Skutella, Martin |
| |
| | 2012 | Megow, 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 | |
| | 2011 | Neumann, 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 | |
| | 2008 | Neumann, 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 | |
| | 2005 | Althaus, Ernst
Funke, Stefan
[Har-Peled, Sariel]
[Könemann, Jochen]
[Ramos, Edgar A.]
Skutella, Martin | | Approximating k-Hop Minimum-Spanning Trees
In: Operations Research Letters [33], 115-120 | Journal Article | |
| | 2004 | [Goemans, Michel X.]
Skutella, Martin | | Cooperative facility location games
In: Journal of Algorithms [50], 194-214 | Journal Article | |
| | 2004 | Martens, Maren
Skutella, Martin | | Flows on Few Paths: Algorithms and Lower Bounds
In: Algorithms – ESA 2004: 12th Annual European Symposium, 520-531 | Proceedings Article | |
| | 2004 | Sivadasan, Naveen
Sanders, Peter
Skutella, Martin | | Online Scheduling with Bounded Migration | Report | |
| | 2004 | Sanders, Peter
Sivadasan, Naveen
Skutella, Martin | | Online 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] | | Scheduling 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 | | Minimum 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 | | Multicommodity 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.] | | Preemptive scheduling with rejection
In: Mathematical Programming [94], 361-374 | Journal Article | |
| | 2003 | [Fekete, Sandor P.]
Skutella, Martin
[Woeginger, Gerhard J.] | | The complexity of economic equilibria for house allocation markets
In: Information Processing Letters [88], 219-223 | Journal Article | |
| 3 |
| Skutella, Martin (ed.) |
| |
| | 2009 | Amini, Omid
[Peleg, David]
[Pérennes, Stéphane]
[Sau, Ignasi]
[Saurabh, Saket] | | Degree-Constrained Subgraph Problems: Hardness and Approximation Results
In: Approximation and Online Algorithms : 6th International Workshop, WAOA 2008, 29-42 | Proceedings Article | |
| | 2008 | [Epstein, Leah]
van Stee, Rob | | Approximation 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 | | On the Online Unit Clustering Problem
In: Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, 193-206 | Proceedings Article | |
| 2 |
| Skyum, Sven (ed.) |
| |
| | 1998 | Chaudhuri, 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 | |
| | 1998 | Hagerup, Torben | | Simpler 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 |
| |
| | 2013 | Bringmann, 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 |
| |
| | 2009 | Chan, 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 |
| |
| | 1999 | Sanders, 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 |
| Smari, Waleed W. (ed.) |
| |
| | 2011 | Emeliyanenko, Pavel | | High-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 |
| Smid, 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 | |
| | 2002 | Ray, Rahul
[Smid, MIchiel]
[Lange, Katharina]
[Wendt, Ulrich] | | Computing 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 Geometry | Miscellaneous | |
| | 1999 | Gupta, 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 | |
| | 1997 | Arya, Sunil
Smid, Michiel | | Efficient construction of a bounded degree spanner with low weight
In: Algorithmica [17], 33-54 | Journal Article | |
| | 1997 | Bradford, Phillip Gnassi
Fleischer, Rudolf
Smid, Michiel | | More efficient parallel totally monotone matrix searching
In: Journal of Algorithms [23], 386-400 | Journal Article | |
| | 1997 | [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 | |
| | 1997 | Gupta, 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 | |
| | 1996 | Gupta, Prosenjit
[Janardan, Ravi]
Smid, Michiel | | Algorithms for generalized halfspace range searching and other intersection searching problems
In: Computational Geometry [5], 321-340 | Journal Article | |
| | 1996 | Gupta, Prosenjit
[Janardan, Ravi]
Smid, Michiel | | Algorithms for generalized halfspace range searching and other intersection searching problems
In: Computational Geometry [6], 1-19 | Journal Article | |
| | 1996 | Gupta, 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 | |
| | 1996 | Kapoor, 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 | |
| | 1996 | Arikati, Srinivasa Rao
[Chen, Danny Z.]
[Chew, L. Paul]
[Das, Gautam]
[Smid, Michiel]
Zaroliagis, Christos | | Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane
In: Algorithms - ESA '96: 4th Annual European Symposium, 514-528 | Proceedings Article | |
| | 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 | Smid, Michiel | | Dynamic rectangular point location, with an application to the closest pair problem
In: Information and Computation [16], 1-9 | Journal Article | |
| | 1995 | Arya, Sunil
[Das, Gautam]
[Mount, David M.]
[Salowe, Jeffrey S.]
Smid, Michiel | | Euclidean spanners: short, thin, and lanky
In: 27th Annual ACM Symposium on Theory of Computing (STOC95), 489-498 | Proceedings Article | |
| | 1995 | Gupta, 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 | |
| | 1995 | Lenhof, 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 | |
| | 1995 | Lenhof, 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 | |
| | 1995 | Golin, 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 | |
| | 1995 | Gupta, 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 | |
| | 1995 | Gupta, 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 | |
| | 1994 | Lenhof, 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 | |
| | 1994 | Lenhof, 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 | |
| | 1993 | Lenhof, Hans-Peter
Smid, Michiel | | An optimal construction method for generalized convex layers
In: International Journal of Computational Geometry & Applications [3], 245-267 | Journal Article | |
| | 1992 | Lenhof, Hans-Peter
Smid, Michiel | | Enumerating the k closest pairs optimally
In: 33rd Annual Symposium on Foundations of Computer Science (FOCS92), 380-386 | Proceedings Article | |
| | 1992 | Lenhof, 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 | |
| | 1991 | Lenhof, 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 |
| |
| | 1990 | Ching, Yu-Tai
Mehlhorn, Kurt
Smid, Michiel H. M. | | Dynamic deferred data structuring
In: Information Processing Letters [35], 37-40 | Journal Article | |
| 1 |
| |
| | 2011 | [Arumugam, S.]
[Chandrasekar, K. Raja]
[Misra, Neeldhara]
Philip, Geevarghese
[Saurabh, Saket] | | Algorithmic Aspects of Dominator Colorings in Graphs
In: Combinatorial Algorithms - 22nd International Workshop, IWOCA 2011, Victoria, BC, Canada, July 20-22, 2011, Revised Selected Papers, 19-30 | Proceedings Article | |
| 1 |
| |
| | 2000 | | | Informatik 2000 : neue Horizonte im neuen Jahrhundert, 30. Jahrestagung der Gesellschaft für Informatik | Proceedings | |
| 4 |
| |
| | 2006 | [Brönnimann, Hervé]
Kettner, Lutz
[Pocchiola, Michel]
[Snoeyink, Jack] | | Counting 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 | |
| | 2003 | Kettner, 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 | |
| | 2003 | Kettner, 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 |
| Snoeyink, Jack (ed.) |
| |
| | 2001 | Mehlhorn, Kurt
Ziegelmann, Mark | | CNOP - 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 |
| Sohler, Christian |
| |
| | 2003 | [Adler, Micah]
[Räcke, Harald]
Sivadasan, Naveen
[Sohler, Christian]
Vöcking, Berthold | | Randomized Pursuit-Evasion in Graphs
In: Combinatorics, Probability and Computing [12], 225-244 | Journal Article | |
| | 2002 | [Adler, Micah]
[Räcke, Harald]
Sivadasan, Naveen
[Sohler, Christian]
Vöcking, Berthold | | Randomized Pursuit-Evasion in Graphs
In: Automata, Languages and Programming : 29th International Colloquium, ICALP 2002, 901-912 | Proceedings Article | |
| 3 |
| |
| | 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 Matrixanzeigen | Miscellaneous | |
| 10 |
| |
| | 2001 | Krysta, Piotr
Solis-Oba, Roberto | | Approximation Algorithms for Bounded Facility Location
In: Journal of Combinatorial Optimization [5], 233-247 | Journal Article | |
| | 2001 | Sanders, Peter
[Solis-Oba, Roberto] | | How Helpers Hasten h-Relations
In: Journal of Algorithms [41], 86-98 | Journal Article | |
| | 2000 | Sanders, 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 | |
| | 1999 | Solis-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 | |
| | 1999 | Krysta, Piotr
Solis-Oba, Roberto | | Approximation algorithms for bounded facility location
In: Proceedings of the 5th Annual International Conference on Computing and Combinatorics (COCOON-99), 241-250 | Proceedings Article | |
| | 1999 | Solis-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 | |
| | 1998 | Solis-Oba, Roberto | | 2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 441-452 | Proceedings Article | |
| | 1998 | [Frederickson, Greg N.]
Solis-Oba, Roberto | | Algorithms for Measuring Perturbability in Matroid Optimization
In: Combinatorica [18], 503-518 | Journal Article | |
| | 1998 | Solis-Oba, Roberto
Frederickson, Greg N. | | Rooted Spanning Trees with Small Weight and Average Length
In: Theoretical Computer Science, 114-125 | Proceedings Article | |
| 3 |
| Solis-Oba, Roberto (ed.) |
| |
| | 2012 | Harren, Rolf
[Kern, Walter] | | Improved Lower Bound for Online Strip Packing
In: Approximation and Online Algorithms : 9th International Workshop ,WAOA 2011, 211-218 | Proceedings Article | |
| | 2012 | van Zuylen, Anke | | Simpler 3/4-approximation algorithms for MAX SAT
In: Approximation and Online Algorithms : 9th International Workshop, WAOA 2011, 188-197 | Proceedings Article | |
| | 2011 | van Stee, Rob | | An improved algorithm for online rectangle filling
In: Approximation and Online Algorithms : 8th International Workshop, WAOA 2010, 249-260 | Proceedings Article | |
| 1 |
| Son, Jung-Bae |
| |
| | 1999 | Son, Jung-Bae | | Berechnung konvexer Hüllen in erwarteter Linearzeit
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Soranzo, 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 |
| 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 |
| Sotiris E. Nikoletseas (ed.) |
| |
| | 2008 | Funke, Stefan
Laue, Sören
Naujoks, Rouven
[Lotker, Zvi] | | Power Assignment Problems in Wireless Communication: Covering Points by Disks, Reaching few Receivers Quickly, and Energy-Efficient Travelling Salesman Tours
In: Distributed Computing in Sensor Systems, 4th IEEE International Conference, DCOSS 2008, 282-295 | Proceedings Article | |
| 5 |
| Soule, Terence (ed.) |
| |
| | 2012 | Doerr, 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 | |
| | 2012 | Doerr, Benjamin | | Black-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 | |
| | 2012 | Doerr, 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 | |
| | 2012 | Doerr, 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 | |
| | 2012 | Kö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 |
| Spaniol, Otto (ed.) |
| |
| | 1997 | Crauser, 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 |
| Speckmann, Bettina |
| |
| | 2003 | Kettner, 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 |
| Speckmann, Bettina (ed.) |
| |
| | 2015 | Bei, Xiaohui | | Solving Linear Programming with Constraints Unknown
In: Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I., 129-142 | Proceedings Article | |
| 8 |
| Spencer, 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 |
| Spencer, Stephen N. (ed.) |
| |
| | 2005 | Eisenbrand, 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 |
| |
| | 1979 | Mehlhorn, Kurt | | Konzepte der Komplexitätstheorie illustriert am Beispiel des Sortierens
In: GI - 9. Jahrestagung, 16-22 | Proceedings Article | |
| 1 |
| |
| | 2006 | Bast, Holger
[Dupret, Georges]
Majumdar, Debapriyo
[Piwowarski, Benjamin] | | Discovering a Term Taxonomy from Term Similarities Using Principal Component Analysis
In: Semantics, web and mining : Joint International Workshops, EWMF 2005 and KDO 2005, 103-120 | Proceedings Article | |
| 3 |
| |
| | 2006 | [Kratsch, Dieter]
[McConnell, Ross]
Mehlhorn, Kurt
[Spinrad, Jeremy P.] | | Certifying 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 | |
| | 2005 | Mehlhorn, Kurt
Eigenwillig, Arno
Kaligosi, Kanela
Kratsch, Dieter
McConnell, Ross
Meyer, Ulrich
Spinrad, Jeremy P. | | Certifying Algorithms (draft) | Unpublished/Draft | |
| | 2003 | Kratsch, Dieter
McConnell, Ross
Mehlhorn, Kurt
Spinrad, Jeremy P. | | Certifying 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 |
| |
| | 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 | |
| | 2003 | Fotakis, Dimitris
[Pagh, Rasmus]
Sanders, Peter
[Spirakis, Paul G.] | | Space Efficient Hash Tables with Worst Case Constant Access Time
In: Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2003), 271-282 | Proceedings Article | |
| | 2002 | Fotakis, Dimitris
[Spirakis, Paul G.] | | Minimum Congestion Redundant Assignments to Tolerate Random Faults
In: Algorithmica [32], 396-422 | Journal Article | |
| | 2002 | [Andreou, Maria]
Fotakis, Dimitris
[Nikoletseas, Sotiris]
[Papadopoulou, Vicky]
[Spirakis, Paul G.] | | On Radiocoloring Hierarchically Specified Planar Graphs: PSPACE-Completeness and Approximations
In: Mathematical Foundations of Computer Science 2002 : 27th International Symposium, MFCS 2002, 81-92 | Proceedings Article | |
| | 2002 | Fotakis, Dimitris
[Nikoletseas, Sotiris]
[Papadopoulou, Vicky]
[Spirakis, Paul G.] | | Radiocolorings in Periodic Planar Graphs: PSPACE-Completeness and Efficient Approximations for the Optimal Range of Frequencies
In: Graph-Theoretic Concepts in Computer Science : 28th International Workshop, WG 2002, 223-234 | Proceedings Article | |
| | 2002 | Fotakis, Dimitris
Kontogiannis, Spyros
[Koutsoupias, Elias]
[Mavronicolas, Marios]
[Spirakis, Paul G.] | | The Structure and Complexity of Nash Equilibria for a Selfish Routing Game
In: Automata, Languages and Programming : 29th International Colloquium, ICALP 2002, 123-134 | Proceedings Article | |
| | 2000 | Fatourou, Panagiota
[Spirakis, Paul G.] | | Efficient Scheduling of Strict Multithreaded Computations
In: Theory of Computing Systems [33], 173-232 | Journal Article | |
| | 2000 | Kontogiannis, Spyros
[Pantziou, Grammati E.]
[Spirakis, Paul G.]
[Yung, Moti] | | Robust Parallel Computations through Randomization
In: Theory of Computing Systems [33], 427-464 | Journal Article | |
| | 1996 | [Kavvadias, Dimitris J.]
[Pantziou, Grammati E.]
[Spirakis, Paul G.]
Zaroliagis, Christos | | Hammock-on-ears decomposition : a technique for the efficient parallel solution of shortest paths and other problems
In: Theoretical Computer Science [168], 121-154 | Journal Article | |
| | 1996 | [Kirousis, Lefteris]
Spirakis, Paul G.
Tsigas, Philippas | | Simple Atomic Snapshots: A Linear Complexity Solution with Unbounded Time-Stamps
In: Information Processing Letters [58], 47-53 | Journal Article | |
| | 1995 | [Dubhashi, Devdatt]
[Pantziou, Grammati E.]
[Spirakis, Paul G.]
Zaroliagis, Christos | | The Fourth Moment in Luby's Distribution
In: Theoretical Computer Science [148], 133-140 | Journal Article | |
| 8 |
| |
| | 2010 | [Epstein, Leah]
[Levin, Asaf]
van Stee, Rob | | Max-min online allocations with a reordering buffer
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010, 336-347 | Proceedings Article | |
| | 2010 | Fountoulakis, Nikolaos
Panagiotou, Konstantinos | | Orientability of random hypergraphs and the power of multiple choices
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010. - Pt. 1, 348-359 | Proceedings Article | |
| | 2010 | Kratsch, Stefan
Wahlström, Magnus | | Preprocessing of Min Ones Problems: A Dichotomy
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010, 653-665 | Proceedings Article | |
| | 2001 | [Park, Sang-Min]
Lee, Jae-Ha
[Chwa, Kyung-Yong] | | Visibility-Based Pursuit-Evasion in a Polygonal Region by a Searcher
In: Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP-01), 456-468 | Proceedings Article | |
| | 1986 | Fürer, Martin
Mehlhorn, Kurt | | AT$^2$-Optimal Galois Field Multiplier for VLSI
In: VLSI Algorithms and Architectures, Aegean Workshop on Computing, 217-225 | Proceedings Article | |
| | 1986 | | | VLSI algorithms and architectures : Aegean workshop on computing | Proceedings | |
| | 1986 | [Fürer, Martin]
[Mehlhorn, Kurt] | | VLSI Algorithms and Architectures, Aegean Workshop on Computing - >> Dublette
In: VLSI Algorithms and Architectures, Aegean Workshop on Computing, 328 | Proceedings | |
| | 1986 | [Fürer, Martin]
[Mehlhorn, Kurt] | | VLSI Algorithms and Architectures, Aegean Workshop on Computing - >> Dublette
In: VLSI Algorithms and Architectures, Aegean Workshop on Computing, 328 | Proceedings | |
| 8 |
| Spirakis, Paul (ed.) |
| |
| | 2010 | [Christodoulou, Giorgos]
[Ligett, Katrina]
Pyrga, Evangelia | | Contention Resolution under Selfishness
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010. - Pt. II, 430-441 | Proceedings Article | |
| | 2005 | Funke, Stefan
[Milosavljevic, Nikola] | | Infrastructure-Establishment from Scratch in Wireless Sensor Networks
In: Distributed computing in sensor systems : First IEEE International Conference, DCOSS 2005, 354-367 | Proceedings Article | |
| | 2000 | Beier, Rene
Sibeyn, Jop F. | | A powerful heuristic for telephone gossiping
In: Proceedings of the 7th International Colloquium on Structural Information and Communication Complexity (SIROCCO-00), 17-36 | Proceedings Article | |
| | 1995 | Mutzel, Petra | | A Polyhedral Approach to Planar Augmentation and Related Problems
In: Algorithms - ESA'95: 3rd Annual European Symposium, 494-507 | Proceedings 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 | Mehlhorn, Kurt
Priebe, Volker | | On the All-Pairs Shortest Path Algorithm of Moffat and Takaoka
In: Algorithms - ESA'95: 3rd Annual European Symposium, 185-198 | Proceedings Article | |
| | 1995 | Chaudhuri, Shiva
Zaroliagis, Christos | | Optimal Parallel Shortest Paths in Small Treewidth Digraphs
In: Algorithms - ESA'95: 3rd Annual European Symposium, 31-45 | Proceedings 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 | |
| 12 |
| |
| | 2013 | Panagiotou, Konstantinos
Spöhel, Reto
[Steger, Angelika]
[Thomas, Henning] | | Explosive percolation in Erdös-Rényi-like random graph processes
In: Combinatorics, Probability and Computing [22], 133-145 | Journal Article | |
| | 2013 | [Doerr, Benjamin]
[Doerr, Carola]
[Spöhel, Reto]
[Thomas, Henning] | | Playing Mastermind with Many Colors
In: arXiv [abs/1207.0773], 1-22 | Electronic Journal Article | |
| | 2013 | Doerr, Benjamin
Spöhel, Reto
[Thomas, Henning]
Winzen, Carola | | Playing Mastermind with many colors
In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), 695-704 | Proceedings Article | |
| | 2012 | [Krivelevich, Michael]
Spöhel, Reto | | Creating small subgraphs in Achlioptas processes with growing parameter
In: SIAM Journal on Discrete Mathematics [26], 670-686 | Journal Article | |
| | 2012 | Doerr, Benjamin
Spöhel, Reto
[Thomas, Henning]
Winzen, Carola | | Playing Mastermind with Many Colors
In: Proc. of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2012), | Proceedings Article | |
| | 2012 | [Belfrage, Michael]
[Mütze, Torsten]
Spöhel, Reto | | Probabilistic one-player Ramsey games via deterministic two-player games
In: SIAM Journal on Discrete Mathematics [26], 1031-1049 | Journal Article | |
| | 2011 | [Mütze, Torsten]
[Rast, Thomas]
Spöhel, Reto | | Coloring random graphs online without creating monochromatic subgraphs
In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), 145-158 | Proceedings Article | |
| | 2011 | Panagiotou, 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 Electronic Journal of Combinatorics [18], 1-33 | Electronic Journal 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 | |
| | 2011 | Kötzing, Timo
[Neumann, Frank]
Spöhel, Reto | | PAC learning and genetic programming
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 2091-2096 | Proceedings Article | |
| 1 |
| Squillero, Giovanni (ed.) |
| |
| | 2009 | | | GECCO 2009: Proceedings of the 11th Annual conference on Genetic and evolutionary computation. | Proceedings | |
| 1 |
| Sridharan, K |
| |
| | 1998 | [Sridharan, K]
Subramanian, C. R.
[Sudha, N] | | Some Properties of Touching Distances for Polygons and Polyhedra
In: Applied Mathematics Letters [11], 1-7 | Journal Article | |
| 1 |
| Srinivasan, Aravind |
| |
| | 2000 | [Goldberg, Leslie Ann]
[MacKenzie, Philip D.]
[Paterson, Mike]
Srinivasan, Aravind | | Contention resolution with constant expected delay
In: Journal of the ACM [42], 1048-1096 | Journal Article | |
| 1 |
| Srivastava, Satanand |
| |
| | 1996 | Srivastava, Satanand | | Entwicklung und Implementierung eines Entscheidungsalgorithmus zur Zuordnung von Probleminstanzen an Hierarchieebenen
Universität des Saarlandes | Thesis - Masters thesis | |
| 6 |
| Srivastav, Anand |
| |
| | 2007 | [Ahuja, Nitin]
[Baltz, Andreas]
Doerr, Benjamin
[Privetivy, Ales]
[Srivastav, Anand] | | On the Minimum Load Coloring Problem
In: Journal of Discrete Algorithms [5], 533-545 | Journal Article | |
| | 2005 | Doerr, Benjamin
[Gnewuch, Michael]
[Srivastav, Anand] | | Bounds and Constructions for the Star-Discrepancy via Delta-Covers
In: Journal of Complexity [21], 691-709 | Journal Article | |
| | 2005 | [Ahuja, Nitin]
[Baltz, Andreas]
Doerr, Benjamin
[Privetivy, Ales]
[Srivastav, Anand] | | On the Minimum Load Coloring Problem
In: Third Workshop on Approximation and Online Algorithms (WAOA 2005), 15-26 | Proceedings Article | |
| | 2004 | [Ahuja, Nitin]
[Baltz, Andreas]
Doerr, Benjamin
[Srivastav, Anand] | | Coloring Graphs with Minimal Load
In: Electronic Notes in Discrete Mathematics [17], 129-133 | Journal Article | |
| | 2001 | Doerr, Benjamin
[Srivastav, Anand] | | Multi-Color Discrepancies
In: Electronic Notes in Discrete Mathematics [7], xx-xx | Journal Article | |
| | 2001 | Doerr, Benjamin
[Srivastav, Anand] | | Multi-Color Discrepancy of Arithmetic Progressions
In: Electronic Notes in Discrete Mathematics [8], 27-30 | Journal Article | |
| 1 |
| |
| | 2013 | Doerr, Carola
[Gnewuch, Michael]
Wahlström, Magnus | | Calculation of Discrepancy Measures and Applications
In: A Panorama of Discrepancy Theory, 1-55 | Part of a Book | |
| 1 |
| Stallmann, Matthias F. (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 | |
| 2 |
| |
| | 2008 | | | GECCO 2008: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation | Proceedings | |
| | 2007 | | | GECCO 2007: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation | Proceedings | |
| 1 |
| Stanley, Kenneth O. (ed.) |
| |
| | 2009 | | | GECCO 2009: Proceedings of the 11th Annual conference on Genetic and evolutionary computation. | Proceedings | |
| 2 |
| Staples, John (ed.) |
| |
| | 1995 | Bradford, Phillip Gnassi
Fleischer, Rudolf | | Matching nuts and bolts faster
In: Algorithms and Computation: 6th International Symposium (ISAAC'95), 402-408 | Proceedings Article | |
| | 1995 | [Dedorath, Jürgen]
Gergov, Jordan
Hagerup, Torben | | More Efficient Parallel Flow Algorithms
In: Algorithms and Computation: 6th International Symposium (ISAAC95), 234-243 | Proceedings Article | |
| 1 |
| |
| | 2013 | Gawrychowski, Pawel
[Kucherov, Gregory]
[Nekrich, Yakov]
[Starikovskaya, Tatiana] | | Minimal Discriminating Words Problem Revisited
In: String Processing and Information Retrieval - 20th International Symposium (SPIRE 2013), | Proceedings Article | |
| 1 |
| Starikovskaya, Tatiana A. |
| |
| | 2014 | [Babenko, Maxim A.]
[Gawrychowski, Pawel]
[Kociumaka, Tomasz]
[Starikovskaya, Tatiana A.] | | Computing Minimal and Maximal Suffixes of a Substring Revisited
In: Combinatorial Pattern Matching - 25th Annual Symposium, CPM 2014, Moscow, Russia, June 16-18, 2014. Proceedings, 30-39 | Proceedings Article | |
| 5 |
| |
| | 2014 | Bringmann, 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 | |
| | 2011 | Friedrich, Tobias
Sauerwald, Thomas
[Stauffer, Alexandre] | | Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions
In: 22nd International Symposium on Algorithms and Computation (ISAAC-11), 190-199 | Proceedings Article | |
| | 2011 | Sauerwald, 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 | |
| | 2010 | [Bradonjić, Milan]
[Elsässer, Robert]
Friedrich, Tobias
[Sauerwald, Thomas]
[Stauffer, Alexandre] | | Efficient Broadcast on Random Geometric Graphs
In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1412-1421 | Proceedings Article | |
| 1 |
| |
| | 2011 | [Bredereck, Robert]
[Nichterlein, Andr{\'e}]
[Niedermeier, Rolf]
Philip, Geevarghese | | The Effect of Homogeneity on the Complexity of $k$-Anonymity
In: Fundamentals of Computation Theory - 18th International Symposium, FCT 2011, Oslo, Norway, August 22-25, 2011. Proceedings, 53-64 | Proceedings Article | |
| 8 |
| |
| | 2013 | Panagiotou, Konstantinos
Spöhel, Reto
[Steger, Angelika]
[Thomas, Henning] | | Explosive percolation in Erdös-Rényi-like random graph processes
In: Combinatorics, Probability and Computing [22], 133-145 | Journal Article | |
| | 2012 | [Brightwell, Graham]
Panagiotou, Konstantinos
[Steger, Angelika] | | Extremal subgraphs of random graphs
In: Random Structures & Algorithms [41], 147-178 | Journal Article | |
| | 2011 | Panagiotou, 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 | Panagiotou, Konstantinos
[Steger, Angelika] | | On the Degree Sequence of Random Planar Graphs
In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), 1198-1210 | Proceedings Article | |
| | 2010 | Panagiotou, Konstantinos
[Steger, Angelika] | | Maximal Biconnected Subgraphs of Random Planar Graphs
In: ACM Transactions on Algorithms [6], 31,1-31,21 | 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 | |
| | 2009 | Panagiotou, Konstantinos
[Steger, Angelika] | | Maximal Biconnected Subgraphs of Random Planar Graphs
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 432-440 | Proceedings Article | |
| | 1997 | Hundack, Christoph
Prömel, Hans Jürgen
Steger, Angelika | | Extremal Graph Problems for Graphs with a Color-Critical Vertex
In: Combinatorics, Geometry and Probability, 421-433 | Part of a Book | |
| 1 |
| Steinby, Magnus (ed.) |
| |
| | 1977 | Mehlhorn, Kurt | | Dynamic Binary Search
In: Automata, Languages and Programming : Fourth Colloquium (ICALP-77), 323-336 | Proceedings Article | |
| 1 |
| Stellmacher, Bernd |
| |
| | 2006 | [Bundy, David]
Hebbinghaus, Nils
[Stellmacher, Bernd] | | The Local C(G,T) Theorem
In: Journal of Algebra [300], 741-789 | Journal Article | |
| 1 |
| Stephan, Anne |
| |
| | 2000 | Stephan, Anne | | Implementierung eines heuristischen und eines exakten Ansatzes zur Berechnung minimaler Steinerbäume in Netzwerken
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Stephan, Frank |
| |
| | 2012 | [Jain, Sanjay]
Kötzing, Timo
[Stephan, Frank] | | Enlarging Learnable Classes
In: Algorithmic Learning Theory : 23rd International Conference, ALT 2012, 36-50 | Proceedings Article | |
| 1 |
| Stephan, Frank (ed.) |
| |
| | 2010 | [Case, John]
Kötzing, Timo | | Solutions to Open Questions for Non-U-Shaped Learning with Memory Limitations
In: Algorithmic Learning Theory : 21st International Conference, ALT 2010, 285-299 | Proceedings Article | |
| 1 |
| Stern, Michal (ed.) |
| |
| | 2012 | Hermelin, Danny
[Mestre, Julian]
[Rawitz, Dror] | | Optimization Problems in Dotted Interval Graphs
In: Graph-Theoretic Concepts in Computer Science : 38th InternationalWorkshop, WG 2012, 46-56 | Proceedings Article | |
| 1 |
| Steurer, Daniel |
| |
| | 2006 | Doerr, Benjamin
[Lengler, Johannes]
[Steurer, Daniel] | | The Interval Liar Game
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 318-327 | Proceedings Article | |
| 3 |
| Steurer, David |
| |
| | 2006 | Steurer, David | | An Asymptomic Approximation Scheme for Multigraph Edge Coloring
Universität des Saarlandes | Thesis - Masters thesis | |
| | 2006 | Steurer, David | | Tight Bounds on the Min-Max Boundary Decomposition Cost of Weighted Graphs
Universität des Saarlandes | Thesis - Bachelor thesis | |
| | 2005 | Sanders, 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 | |
| 3 |
| Stiller, Sebastian |
| |
| | 2013 | [Bonifaci, Vincenzo]
[Marchetti-Spaccamela, Alberto]
[Stiller, Sebastian]
Wiese, Andreas | | Feasibility Analysis in the Sporadic DAG Task Model
In: Proceedings of the 25th Euromicro Conference on Real-Time Systems (ECRTS 2013), | Proceedings Article | |
| | 2012 | Bonifaci, Vincenzo
[Marchetti-Spaccamela, Alberto]
[Stiller, Sebastian] | | A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
In: Algorithmica [62], 1034-1049 | Journal Article | |
| | 2010 | [Baruah, Sanjoy]
Bonifaci, Vincenzo
[Marchetti-Spaccamela, Alberto]
[Stiller, Sebastian] | | Improved Multiprocessor Global Schedulability Analysis
In: Real-Time Systems [46], 3-24 | Journal Article | |
| 1 |
| Stoica, Adrian (ed.) |
| |
| | 2008 | | | GECCO 2008: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation | Proceedings | |
| 1 |
| Stoltz, Gilles (ed.) |
| |
| | 2012 | [Jain, Sanjay]
Kötzing, Timo
[Stephan, Frank] | | Enlarging Learnable Classes
In: Algorithmic Learning Theory : 23rd International Conference, ALT 2012, 36-50 | Proceedings Article | |
| 1 |
| Storb, Christoph |
| |
| | 1988 | Gao, Shaodi
Kaufmann, Michael
Mehlhorn, Kurt
Rülling, Wolfgang
Storb, Christoph
Jerrum, Mark | | On Continuous Homotopic One Layer Routing (Extended Abstract)
In: Computational geometry and its applications (CG-88) : international workshop, 55-70 | Proceedings Article | |
| 1 |
| Storch, Tobias |
| |
| | 2007 | Doerr, Benjamin
Klein, Christian
[Storch, Tobias] | | Faster Evolutionary Algorithms by Superior Graph Representation
In: First IEEE Symposium on Foundations of Computational Intelligence (FOCI-2007), 245-250 | Proceedings Article | |
| 1 |
| Storer, J. A. (ed.) |
| |
| | 1998 | [Crochemore, Maxime]
Gasieniec, Leszek
[Rytter, Wojciech] | | Constant-space string-matching in sublinear average time
In: Compression and Complexity of SEQUENCES 1997, 230-239 | Proceedings Article | |
| 1 |
| Stork, Frederik |
| |
| | 2004 | [Moehring, Rolf H.]
Skutella, Martin
[Stork, Frederik] | | Scheduling with AND/OR Precedence Constraints
In: SIAM Journal on Computing [33], 393-415 | Journal Article | |
| 1 |
| Stormer, Henrik |
| |
| | 1998 | Stormer, Henrik | | Ein Programm zum visuellen Erlernen von Graphalgorithmen
Universität des Saarlandes | Thesis - Masters thesis | |
| 9 |
| Stougie, Leen |
| |
| | 2012 | [Canzar, Stefan]
[El-Kebir, Mohammed]
[Pool, Rene]
Elbassioni, Khaled
[Malde, Alpeshkumar K.]
[Mark, Alan E.]
[Geerke, Daan P.]
[Stougie, Leen]
[Klau, Gunnar W.] | | Charge Group Partitioning in Biomolecular Simulation
In: Research in Computational Molecular Biology : 16th Annual International Conference, RECOMB 2012, 29-43 | Proceedings Article | |
| | 2012 | [Baruah, Sanjoy]
[Bonifaci, Vincenzo]
[D'Angelo, Gianlorenzo]
[Li, Haohan]
[Marchetti-Spaccamela, Alberto]
Megow, Nicole
[Stougie, Leen] | | Scheduling Real-Time Mixed-Criticality Jobs
In: IEEE Transactions on Computers [61], 1140-1152 | Journal Article | |
| | 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 | |
| | 2011 | Bonifaci, Vincenzo
[Korteweg, Peter]
[Marchetti-Spaccamela, Alberto]
[Stougie, Leen] | | Minimizing Flow Time in the Wireless Gathering Problem
In: ACM Transactions on Algorithms [7], 33:1-33:20 | Journal Article | |
| | 2011 | [Baruah, Sanjoy]
Bonifaci, Vincenzo
[D'Angelo, Gianlorenzo]
[Marchetti-Spaccamela, Alberto]
[van der Ster, Suzanne]
[Stougie, Leen] | | Mixed-criticality scheduling of sporadic task systems
In: Algorithms - ESA 2011 : 19th Annual European Symposium, 555-566 | Proceedings Article | |
| | 2011 | Bonifaci, Vincenzo
[Korteweg, Peter]
[Marchetti-Spaccamela, Alberto]
[Stougie, Leen] | | The Distributed Wireless Gathering Problem
In: Theoretical Computer Science [412], 633-641 | Journal Article | |
| | 2010 | [Baruah, Sanjoy]
Bonifaci, Vincenzo
[D'Angelo, Gianlorenzo]
[Li, Haohan]
[Marchetti-Spaccamela, Alberto]
Megow, Nicole
[Stougie, Leen] | | Scheduling Real-Time Mixed-Criticality Jobs
In: Mathematical Foundations of Computer Science 2010 : 35th International Symposium, MFCS 2010, 90-101 | Proceedings Article | |
| | 2010 | [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 | |
| | 2006 | Sitters, Rene
[Stougie, Leen] | | The general two-server problem
In: Journal of the ACM [53], 437-458 | Journal Article | |
| 1 |
| Stoye, Jens (ed.) |
| |
| | 2012 | Gawrychowski, Pawel | | Simple and efficient LZW-compressed multiple pattern matching
In: Combinatorial Pattern Matching : 23rd Annual Symposium, CPM 2012, 232-242 | Proceedings Article | |
| 1 |
| Straszak, Damian |
| |
| | 2013 | Gawrychowski, Pawel
[Straszak, Damian] | | Beating O(nm) in Approximate LZW-Compressed Pattern Matching
In: Algorithms and Computation - 24th International Symposium (ISAAC 2013), 78-88 | Proceedings Article | |
| 1 |
| Strehl, Volker (ed.) |
| |
| | 2009 | Panagiotou, Konstantinos | | Blocks In Constrained Random Graphs with Fixed Average Degree
In: 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009), 733-744 | Electronic Proceedings Article | |
| 1 |
| Struth, Georg (ed.) |
| |
| | 2008 | [Diedrich, Florian]
[Kehden, Britta]
Neumann, Frank | | Multi-objective Problems in Terms of Relational Algebra
In: Relations and Kleene Algebra in Computer Science 2008, 84-98 | Proceedings Article | |
| 1 |
| Stuller, Július (ed.) |
| |
| | 2004 | Sanders, Peter | | Algorithms for Scalable Storage Servers
In: SOFSEM 2004 : theory and practice of computer science ; 30th Conference on Current Trends in Theory and Practice of Computer Science, 82-101 | Proceedings Article | |
| 1 |
| Stumme, Gerd (ed.) |
| |
| | 2006 | Bast, Holger
[Dupret, Georges]
Majumdar, Debapriyo
[Piwowarski, Benjamin] | | Discovering a Term Taxonomy from Term Similarities Using Principal Component Analysis
In: Semantics, web and mining : Joint International Workshops, EWMF 2005 and KDO 2005, 103-120 | Proceedings Article | |
| 5 |
| Stützle, Thomas (ed.) |
| |
| | 2010 | Kötzing, Timo
Neumann, Frank
[Röglin, Heiko]
[Witt, Carsten] | | Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem
In: Swarm Intelligence : 7th International Conference, ANTS 2010, 324-335 | Proceedings Article | |
| | 2009 | | | GECCO 2009: Proceedings of the 11th Annual conference on Genetic and evolutionary computation. | Proceedings | |
| | 2008 | Neumann, Frank
[Sudholt, Dirk]
[Witt, Carsten] | | Rigorous Analyses for the Combination of Ant Colony Optimization and Local Search
In: International Conference on Ant Colony Optimization and Swarm Intelligence 2008, 132-143 | Proceedings Article | |
| | 2007 | Neumann, Frank
[Sudholt, Dirk]
[Witt, Carsten] | | Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions
In: Engineering Stochastic Local Search Algorithms 2007, 61-75 | Proceedings Article | |
| | 2007 | | | GECCO 2007: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation | Proceedings | |
| 3 |
| Subrahmanyam, K. V. |
| |
| | 2000 | Chaudhuri, Shiva
[Subrahmanyam, K. V.]
[Wagner, Frank]
[Zaroliagis, Christos] | | Computing mimicking networks
In: Algorithmica [26], 31-49 | Journal Article | |
| | 1998 | Chaudhuri, 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 | |
| | 1997 | Mahajan, 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 | |
| 7 |
| Subramanian, C. R. |
| |
| | 2003 | Telikepalli, Kavitha
Chandran, Sunil
[Subramanian, C. R.] | | Isoperimetric Inequalities and Width Parameters of Graphs
In: Computing and Combinatorics : 9th Annual International Conference, COCOON 2003, 385-393 | Proceedings Article | |
| | 2000 | Subramanian, C. R. | | Algorithms for Colouring Random k-colourable Graphs
In: Combinatorics, Probability and Computing [9], 45-77 | Journal Article | |
| | 1999 | Subramanian, C. R. | | A Generalization of Janson inequalities and its application to finding shortest paths
In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), 795-804 | Proceedings Article | |
| | 1999 | Subramanian, C. R. | | Minimum Coloring k-Colorable Graphs in Polynomial Average Time
In: Journal of Algorithms [33], 112-123 | Journal Article | |
| | 1998 | [Subramanian, C. R.]
[Fürer, Martin]
Veni Madhavan, C. E. | | Algorithms for Coloring Semi-random Graphs
In: Random Structures & Algorithms [13], 125-158 | Journal Article | |
| | 1998 | Schnorr, 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 | |
| | 1998 | [Sridharan, K]
Subramanian, C. R.
[Sudha, N] | | Some Properties of Touching Distances for Polygons and Polyhedra
In: Applied Mathematics Letters [11], 1-7 | Journal Article | |
| 1 |
| Suchanek, Fabian |
| |
| | 2007 | Bast, Holger
Chitea, Alexandru
Suchanek, Fabian
Weber, Ingmar | | ESTER: Efficient Search in Text, Entities, and Relations
In: 30th International Conference on Research and Development in Information Retrieval (SIGIR'07), 671-678 | Proceedings Article | |
| 1 |
| Suchan, Karol |
| |
| | 2009 | [Correa, Jose R.]
Megow, Nicole
Raman, Rajiv
[Suchan, Karol] | | Cardinality Constrained Graph Partitioning into Cliques with Submodular Costs
In: 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2009), 347-350 | Proceedings Article | |
| 1 |
| Suchy, Ondrej |
| |
| | 2012 | Mnich, Matthias
Philip, Geevarghese
[Saurabh, Saket]
[Suchy, Ondrej] | | Beyond 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 | |
| 1 |
| Sudha, N |
| |
| | 1998 | [Sridharan, K]
Subramanian, C. R.
[Sudha, N] | | Some Properties of Touching Distances for Polygons and Polyhedra
In: Applied Mathematics Letters [11], 1-7 | Journal Article | |
| 13 |
| Sudholt, Dirk |
| |
| | 2013 | Doerr, Benjamin
[Jansen, Thomas]
[Sudholt, Dirk]
Winzen, Carola
[Zarges, Christine] | | Mutation rate matters even when optimizing monotonic functions
In: Evolutionary Computation [21], 1-27 | Journal Article | |
| | 2013 | Doerr, Benjamin
[Sudholt, Dirk]
[Witt, Carsten] | | When Do Evolutionary Algorithms Optimize Separable Functions in Parallel?
In: ACM/SIGEVO Foundations of Genetic Algorithms (FOGA 2013), 51-63 | Proceedings Article | |
| | 2011 | Kötzing, Timo
[Sudholt, Dirk]
[Theile, Madeleine] | | How crossover helps in pseudo-Boolean optimization
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 989-996 | Proceedings Article | |
| | 2011 | Doerr, Benjamin
[Neumann, Frank]
[Sudholt, Dirk]
[Witt, Carsten] | | Runtime analysis of the 1-ANT ant colony optimizer
In: Theoretical Computer Science [412], 1629-1644 | Journal Article | |
| | 2011 | Kötzing, Timo
[Neumann, Frank]
[Sudholt, Dirk]
[Wagner, Markus] | | Simple max-min ant systems and the optimization of linear pseudo-Boolean functions
In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, 209-218 | Proceedings Article | |
| | 2010 | Doerr, 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 | |
| | 2009 | Neumann, Frank
[Sudholt, Dirk]
[Witt, Carsten] | | Analysis of Different MMAS ACO Algorithms on Unimodal Functions and Plateaus
In: Swarm Intelligence [3], 35-68 | Journal Article | |
| | 2009 | [Friedrich, Tobias]
[Oliveto, Pietro]
[Sudholt, Dirk]
[Witt, Carsten] | | Analysis of Diversity-Preserving Mechanisms for Global Exploration
In: Evolutionary Computation [17], 455-476 | Journal Article | |
| | 2009 | Neumann, Frank
[Sudholt, Dirk]
[Witt, Carsten] | | Computational Complexity of Ant Colony Optimization and Its Hybridization with Local Search
In: Innovations in Swarm Intelligence, 91-120 | Part of a Book | |
| | 2008 | Neumann, Frank
[Sudholt, Dirk]
[Witt, Carsten] | | Rigorous Analyses for the Combination of Ant Colony Optimization and Local Search
In: International Conference on Ant Colony Optimization and Swarm Intelligence 2008, 132-143 | Proceedings Article | |
| | 2008 | Friedrich, Tobias
[Oliveto, Pietro]
[Sudholt, Dirk]
[Witt, Carsten] | | Theoretical Analysis of Diversity Mechanisms for Global Exploration
In: Proceedings of the 10th annual conference on Genetic and evolutionary computation (GECCO 2008), 945-952 | Proceedings Article | |
| | 2007 | Neumann, Frank
[Sudholt, Dirk]
[Witt, Carsten] | | Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions
In: Engineering Stochastic Local Search Algorithms 2007, 61-75 | Proceedings Article | |
| | 2007 | Doerr, Benjamin
Neumann, Frank
[Sudholt, Dirk]
[Witt, Carsten] | | On the Runtime Analysis of the 1-ANT ACO algorithm
In: Genetic and Evolutionary Computation Conference 2007, 33-40 | Proceedings Article | |
| 1 |
| Suel, Torsten |
| |
| | 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 | |
| 2 |
| Sundar, R. |
| |
| | 1997 | Mehlhorn, Kurt
[Sundar, R.]
Uhrig, Christian | | Maintaining Dynamic Sequences under Equality Tests in Polylogarithmic Time
In: Algorithmica [17], 183-198 | Journal Article | |
| | 1994 | Mehlhorn, Kurt
Sundar, R.
Uhrig, Christian | | Maintaining dynamic sequences under equality-tests in polylogarithmic time
In: Discrete algorithms (SODA-94) : 5th annual ACM-SIAM symposium, 213-222 | Proceedings Article | |
| 1 |
| |
| | 2009 | Gidenstam, Anders
[Papatriantafilou, Marina]
[Sundell, Håkan]
[Tsigas, Philippas] | | Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting
In: IEEE Transactions on Parallel and Distributed Systems [20], 1173-1187 | Journal Article | |
| 10 |
| |
| | 2014 | Bringmann, 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 | |
| | 2013 | Elbassioni, Khaled
[Chalermsook, Parinya]
[Nanongkai, Danupon]
Sun, He | | Multi-Attribute Profit-Maximizing Pricing | Unpublished/Draft | |
| | 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 | |
| | 2012 | Sauerwald, 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 | |
| | 2011 | Manjunath, Madhusudan
Mehlhorn, Kurt
Panagiotou, Konstantinos
Sun, He | | Approximate Counting of Cycles in Streams
In: 19th Annual European Symposium on Algorithms (ESA-11), 677-688 | Proceedings Article | |
| | 2011 | [Guo, Zeyu]
Sun, He
[Zhu, Hong] | | Greedy Construction of 2-Approximate Minimum Manhattan Networks
In: International Journal of Computational Geometry and Applications [21], 331-350 | Journal Article | |
| | 2011 | [Chin, Francis Y. L.]
[Guo, Zeyu]
Sun, He | | Minimum Manhattan Network is NP-Complete
In: Discrete & Computational Geometry [45], 701-722 | Journal Article | |
| | 2010 | [Kao, Ming-Yang]
[Leung, Henry C. M.]
Sun, He
[Zhang, Yong] | | Deterministic Polynomial-Time Algorithms for Designing Short DNA Words
In: Theory and Applications of Models of Computation : 7th Annual Conference, TAMC 2010, 308-319 | Proceedings Article | |
| 1 |
| Sutton, Andrew M. |
| |
| | 2012 | Kö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 |
| Suzuki, Masakazu (ed.) |
| |
| | 2009 | Sagraloff, Michael
Kerber, Michael
Hemmer, Michael | | Certified Complex Root Isolation via Adaptive Root Separation Bounds
In: The Joint Conference of ASCM 2009 and MACIS 2009, 151-166 | Proceedings Article | |
| 1 |
| Su, Yi |
| |
| | 2010 | Gao, Pu (Jane)
[Wormald, Nicholas]
[Su, Yi] | | Induced subgraphs in sparse random graphs with given degree sequence | Unpublished/Draft | |
| 1 |
| Svatek, Vojtech (ed.) |
| |
| | 2006 | Bast, Holger
[Dupret, Georges]
Majumdar, Debapriyo
[Piwowarski, Benjamin] | | Discovering a Term Taxonomy from Term Similarities Using Principal Component Analysis
In: Semantics, web and mining : Joint International Workshops, EWMF 2005 and KDO 2005, 103-120 | Proceedings Article | |
| 5 |
| Sviridenko, Maxim |
| |
| | 2013 | [Sviridenko, Maxim]
Wiese, Andreas | | Approximating the Configuration-LP for Minimizing Weighted Sum of Completion Times on Unrelated Machines
In: Proceedings of the 16th Conference on Integer Programming and Combinatorial Optimization (IPCO 2013), | Proceedings Article | |
| | 2004 | Kesselman, 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 | |
| | 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 | |
| | 1999 | Solis-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 | |
| | 1999 | Solis-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 | |
| 1 |
| Swamy, Chaitanya |
| |
| | 2010 | Elbassioni, 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 | |
| 1 |
| Sykora, O. (ed.) |
| |
| | 1998 | [Biedl, Therese]
[Kaufmann, Michael]
Mutzel, Petra | | Drawing Planar Partitions II: HH-Drawings
In: Proceedings of the 24th Workshop on Graph-Theoretic Concepts in Computer Science (WG-98), 124-136 | Proceedings Article | |
| 3 |
| Szalas, Andrzej (ed.) |
| |
| | 1996 | Gasieniec, Leszek
[Kranakis, Evangelos]
[Krizanc, Danny]
[Pelc, Andrzej] | | Minimizing Congestion of Layouts for ATM Networks with Faulty Links
In: Mathematical Foundations of Computer Science 1996: 21st International Symposium (MFCS'96), 392-403 | Proceedings Article | |
| | 1996 | [Chlebus, Bogdan S.]
[Czumaj, Artur]
Gasieniec, Leszek
[Kowaluk, Miroslaw]
[Plandowski, Wojciech] | | Parallel Alternating-Direction Access Machine
In: Mathematical Foundations of Computer Science 1996: 21st International Symposium (MFCS'96), 255-266 | Proceedings Article | |
| | 1996 | Sibeyn, Jop F. | | Routing on Triangles, Tori and Honeycombs
In: Mathematical Foundations of Computer Science 1996: 21st International Symposium (MFCS'96), 529-541 | Proceedings Article | |
| 1 |
| Szepesvári, Csaba (ed.) |
| |
| | 2011 | Kötzing, Timo | | Iterative Learning from Positive Data and Counters
In: Algorithmic Learning Theory : 22nd International Conference, ALT 2011, 40-54 | Proceedings Article | |
| 1 |
| Szepietowski, Andrzej (ed.) |
| |
| | 2005 | [Khachiyan, Leonid]
[Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir] | | Generating All Minimal Integral Solutions to Monotone $\wedge,\vee$-Systems of Linear, Transversal and Polymatroid Inequalities
In: Mathematical Foundations of Computer Science 2005 : 30th International Symposium, MFCS 2005, 556-567 | Proceedings Article | |
| 1 |
| Tait, John (ed.) |
| |
| | 2005 | Bast, Holger
Majumdar, Debapriyo | | Why Spectral Retrieval Works
In: 28th Annual International Conference on Research and Development in Information Retrieval (SIGIR'05), 11-18 | Proceedings Article | |
| 1 |
| Takayama, Nobuki (ed.) |
| |
| | 2010 | Mehlhorn, Kurt | | Reliable and Efficient Geometric Computing
In: Mathematical Software, ICMS 2010 : Third International Congress
on Mathematical Software, 10-11 | Proceedings Article | |
| 1 |
| Takeda, Masayuki |
| |
| | 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 | |
| 1 |
| Takeda, Masayuki (ed.) |
| |
| | 2002 | Burkhardt, Stefan
Kärkkäinen, Juha | | One-Gapped q-Gram Filters for Levenshtein Distance
In: Combinatorial Pattern Matching : 13th Annual Symposium, CPM 2002, 225-234 | Proceedings Article | |
| 1 |
| Takeuchi, Fumihiko |
| |
| | 2003 | Kettner, 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 | |
| 2 |
| Takkula, Tuomo |
| |
| | 1999 | Sanders, 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 | |
| | 1998 | [Alefragis, Panayiotis]
[Goumopoulos, Christos]
Sanders, Peter
[Takkula, Tuomo]
[Wedelin, Dag] | | Parallel Crew Scheduling in PAROS
In: Proceedings of the 4th International Euro-Par Conference (Euro-Par-98), 1104-1113 | Proceedings Article | |
| 1 |
| |
| | 2008 | | | GECCO 2008: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation | Proceedings | |
| 3 |
| |
| | 2006 | Bast, Holger
Mehlhorn, Kurt
Schäfer, Guido
[Tamaki, Hisao] | | Matching Algorithms are Fast in Sparse Random Graphs
In: Theory of Computing Systems [39], 3-14 | Journal Article | |
| | 2004 | Bast, Holger
Mehlhorn, Kurt
Schäfer, Guido
[Tamaki, Hisao] | | Matching Algorithms Are Fast in Sparse Random Graphs
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 81-92 | Proceedings Article | |
| | 2003 | Bast, Holger
Mehlhorn, Kurt
Schäfer, Guido
Tamaki, Hisao | | A Heuristic for Dijkstra's Algorithm With Many Targets and its Use in Weighted Matching Algorithms
In: Algorithmica [36], 75-88 | Journal Article | |
| 1 |
| |
| | 1995 | [Chian, Yi-Feng]
[Goodrich, Michael T.]
Grove, Edward
[Tamassia, Roberto]
[Vengroff, Darren Erik]
[Vitter, Jeffrey Scott] | | External-Memory Graph Algorithms
In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95), 139-149 | Proceedings Article | |
| 3 |
| |
| | 2005 | Dementiev, Roman
[Kärkkäinen, Juha]
Mehnert, Jens
Sanders, Peter | | Better External Memory Suffix Array Construction
In: Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics
(ALENEX/ANALCO 2005), 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 | |
| | 1995 | [Jünger, Michael]
Mutzel, Petra | | The Polyhedral Approach to the Maximum Planar Subgraph Problem:
New Chances for Related Problems
In: Graph Drawing: DIMACS International Workshop (GD94), 119-130 | Proceedings Article | |
| 1 |
| |
| | 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 | |
| 1 |
| |
| | 2009 | [Epstein, Leah]
van Stee, Rob
[Tamir, Tami] | | Paging with request sets
In: Theory of Computing Systems [44], 67-81 | Journal Article | |
| 2 |
| |
| | 2011 | [Mainberger, Markus]
[Hoffmann, Sebastian]
[Weickert, Joachim]
Tang, Ching Hoo
[Johannsen, Daniel]
[Neumann, Frank]
Doerr, Benjamin | | Optimising Spatial and Tonal Data for Homogeneous Diffusion Inpainting
In: Scale Space and Variational Methods in Computer Vision : Third International Conference, SSVM 2011, 26-37 | Proceedings Article | |
| | 2008 | Doerr, Benjamin
Johannsen, Daniel
[Tang, Ching Hoo] | | How Single Ant ACO Systems Optimize Pseudo-Boolean Functions
In: Parallel Problem Solving from Nature – PPSN X, 378-388 | Proceedings Article | |
| 1 |
| Taniar, David (ed.) |
| |
| | 2006 | Kettner, 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 | |
| 1 |
| Tan, C. J.Kenneth (ed.) |
| |
| | 2006 | Kettner, 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 | |
| 4 |
| Tardos, Gábor |
| |
| | 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 |
| |
| | 2009 | Celikik, Marjan
Bast, Hannah | | Fast Single-Pass Construction of a Half-Inverted Index
In: String processing and information retrieval : 16th International Symposium, SPIRE 2009, 194-205 | Proceedings Article | |
| 1 |
| |
| | 2009 | [Correa, Jose R.]
Megow, Nicole
Raman, Rajiv
[Suchan, Karol] | | Cardinality Constrained Graph Partitioning into Cliques with Submodular Costs
In: 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2009), 347-350 | Proceedings Article | |
| 10 |
| |
| | 1995 | [Han, Xiaofeng]
Kelsen, Pierre
[Ramachandran, Vijaya]
[Tarjan, Robert E.] | | Computing minimal spanning subgraphs in linear time
In: SIAM Journal on Computing [24], 1332-1358 | Journal Article | |
| | 1994 | [Dietzfelbinger, Martin]
[Karlin, Anna]
Mehlhorn, Kurt
[Meyer Auf Der Heide, Friedhelm]
[Rohnert, Hans]
[Tarjan, Robert E.] | | Dynamic Perfect Hashing: Upper and Lower Bounds
In: SIAM Journal on Computing [23], 738-761 | Journal Article | |
| | 1991 | Dietzfelbinger, Martin
Karlin, Anna
Mehlhorn, Kurt
Meyer Auf Der Heide, Friedhelm
Rohnert, Hans
Tarjan, Robert E. | | Dynamic Perfect Hashing: Upper and Lower Bounds | Report | |
| | 1990 | Ahuja, Ravindra K.
Mehlhorn, Kurt
Orlin, James B.
Tarjan, Robert E. | | Faster algorithms for the shortest path problem
In: Journal of the ACM [37], 213-223 | Journal Article | |
| | 1988 | Dietzfelbinger, Martin
Karlin, Anna
Mehlhorn, Kurt
Meyer auf der Heide, Friedhelm
Rohnert, Hans
Tarjan, Robert E. | | Dynamic Perfect Hashing: Upper and Lower Bounds
In: 29th Annual Symposium on Foundations of Computer Science (FOCS 1988), 524-531 | Proceedings Article | |
| | 1988 | Ahuja, Ravindra K.
Mehlhorn, Kurt
Orlin, James B.
Tarjan, Robert E. | | Faster Algorithms for the Shortest Path Problem | Report | |
| | 1988 | Ahuja, Ravindra K.
Mehlhorn, Kurt
Orlin, James B.
Tarjan, Robert E. | | Faster Algorithms for the Shortest Path Problem | Report | |
| | 1986 | Hoffmann, Kurt
Mehlhorn, Kurt
Rosenstiehl, Pierre
Tarjan, Robert E. | | Sorting Jordan Sequences in Linear Time Using Level-Linked Search Trees
In: Information and Control [68], 170-184 | Journal Article | |
| | 1985 | Hoffmann, Kurt
Mehlhorn, Kurt
Rosenstiehl, Pierre
Tarjan, Robert E. | | Sorting Jordan sequences in linear time
In: Computational geometry (SCG-85) : 1st symposium, 196-203 | Proceedings Article | |
| | 1984 | Hoffmann, Kurt
Mehlhorn, Kurt
Rosenstiehl, Pierre
Tarjan, Robert E. | | Sorting Jordan sequences in linear time | Report | |
| 1 |
| Tarlecki, Andrzej (ed.) |
| |
| | 2007 | Christodoulou, George
[Koutsoupias, Elias]
Kovács, Annamária | | Mechanism design for fractional scheduling on unrelated machines
In: Automata, Languages and Programming : 34th International Colloquium, ICALP 2007, 40-52 | Proceedings Article | |
| 1 |
| Tarui, Jun (ed.) |
| |
| | 2011 | [Althaus, Ernst]
Kupilas, Joschka
Naujoks, Rouven | | On the Low-Dimensional Steiner Minimum Tree Problem in Hamming Metric
In: Theory and Applications of Models of Computation : 8th Annual Conference, TAMC 2011, 308-319 | Proceedings Article | |
| 3 |
| Tchervenski, Nickolay |
| |
| | 2006 | Althaus, Ernst
[Calinescu, Gruia]
[Mandoiu, Ion]
[Prasad, Sushil]
[Tchervenski, Nickolay]
[Zelikovsly, Alexander] | | Power efficient range assignment for symmetric connectivity in static ad-hoc wireless networks
In: Wireless Networks [12], 287-299 | Journal Article | |
| | | | | | | |
| | 2003 | Althaus, Ernst
[Calinescu, Gruia]
[Mandoiu, Ion]
[Prasad, Sushil]
[Tchervenski, Nickolay]
[Zelikovsly, Alexander] | | Power Efficient Range Assignment in Ad-hoc Wireless
In: Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC-03), 1889-1894 | Proceedings Article | |
| 1 |
| Técourt, Jean-Pierre |
| |
| | 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 | |
| 2 |
| Teich, Jürgen |
| |
| | 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 | |
| 7 |
| |
| | 2008 | Berberich, Eric
Hemmer, Michael
[Karavelas, Menelaos]
[Pion, Sylvain]
[Teillaud, Monique]
[Tsigaridas, Elias] | | Prototype implementation of the algebraic kernel | Report | |
| | 2007 | [Fogel, Efi]
[Halperin, Dan]
Kettner, Lutz
[Teillaud, Monique]
[Wein, Ron]
Wolpert, Nicola | | Arrangements
In: Effective Computational Geometry for Curves and Surfaces, 1-66 | Part of a Book | |
| | 2007 | Berberich, Eric
Hemmer, Michael
[Karavelas, Menelaos I.]
[Teillaud, Monique] | | Revision of interface specification of algebraic kernel | Report | |
| | 2006 | Berberich, Eric
Hemmer, Michael
[Karavelas, Menelaos]
[Pion, Sylvain]
[Teillaud, Monique]
[Tsigaridas, Elias] | | Interface specification of algebraic kernel | Report | |
| | 2004 | Berberich, Eric
Eigenwillig, Arno
[Emiris, Ioannis]
[Fogel, Efraim]
[Hemmer, Michael]
[Halperin, Dan]
[Kakargias, Athanasios]
Kettner, Lutz
Mehlhorn, Kurt
[Pion, Sylvain]
[Schömer, Elmar]
[Teillaud, Monique]
[Wein, Ron]
Wolpert, Nicola | | An Empirical Comparison of Software for Constructing Arrangements of Curved Arcs | Report | |
| | 2003 | Berberich, Eric
Eigenwillig, Arno
[Fogel, Efi]
[Halperin, Dan]
Hert, Susan
Kettner, Lutz
[Teillaud, Monique]
[Wein, Ron] | | Specification of the traits classes for CGAL arrangements of curves | Report | |
| | 2001 | [Bäsken, Matthias]
[Brönnimann, Hervé]
[Frank, Da]
[Devillers, Olivier]
[Ester, Ezra]
[Fabri, Andreas]
[Flato, Eyal]
[Gärtner, Bernd]
[Giezeman, Geert-Jan]
[Halperin, Dan]
[Hanniel, Iddo]
[Har-Peled, Sariel]
[Herrmann, Thomas]
Hert, Susan
[Hirsch, Shai]
[Hoffmann, Michael]
Kettner, Lutz
[Nechushtan, Oren]
[Neyer, Gabriele]
[Pasechnik, Dmitrii]
[Pion, Sylvain]
Schirra, Stefan
[Schönherr, Sven]
Seel, Michael
[Teillaud, Monique]
[Veltkamp, Remco]
[Wein, Ron]
[Wesselink, Wieger]
[Yvinec, Mariette] | | CGAL Reference and User Manuals | Unknown Form: eBookForm | |
| 5 |
| |
| | 2009 | [Giesen, Joachim]
Manjunath, Madhusudan | | Minimizing Absolute Gaussian Curvature over Meshes
In: Computational Geometry, 1-16 | Electronic Proceedings Article | |
| | 2008 | Berberich, Eric
Kerber, Michael
Sagraloff, Michael | | Exact Geometric-Topological Analysis of Algebraic Surfaces
In: Proceedings of the 24th ACM Symposium on Computational Geometry, 164-173 | Proceedings Article | |
| | 2008 | Emeliyanenko, Pavel
Kerber, Michael | | Visualizing and Exploring Planar Algebraic Arrangements -- a Web Application
In: Proceedings of the 24th ACM Symposium on Computational Geometry, 224-225 | Proceedings 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 | |
| | 2007 | [Fogel, Efi]
[Halperin, Dan]
Kettner, Lutz
[Teillaud, Monique]
[Wein, Ron]
Wolpert, Nicola | | Arrangements
In: Effective Computational Geometry for Curves and Surfaces, 1-66 | Part of a Book | |
| 8 |
| |
| | 2006 | [Hariharan, Ramesh]
[Telikepalli, Kavitha]
Mehlhorn, Kurt | | A 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 | |
| | 2006 | [Irving, Robert W.]
[Telikepalli, Kavitha]
Mehlhorn, Kurt
Michail, Dimitrios
[Paluch, Katarzyna] | | Rank-Maximal Matchings
In: ACM Transactions on Algorithms [2], 602-610 | Journal Article | |
| | 2005 | Baswana, Surender
Telikepalli, Kavitha
Mehlhorn, Kurt
Pettie, Seth | | New Constructions of (alpha, beta)-Spanners and Purely Additive Spanners
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 672-681 | Proceedings Article | |
| | 2005 | Abraham, David
[Irving, Robert W.]
Mehlhorn, Kurt
Telikepalli, Kavitha | | Popular Matchings
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 424-432 | Proceedings Article | |
| | 2004 | Mehlhorn, Kurt
Michail, Dimitrios
Telikepalli, Kavitha
[Irving, Robert W.]
[Paluch, Katarzyna] | | Rank-Maximal Matchings
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 68-75 | Proceedings Article | |
| | 2003 | Telikepalli, Kavitha | | Efficient Algorithms for Abelian group isomorphism and related problems
In: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science : 23rd Conference, 277-288 | Proceedings Article | |
| | 2003 | Telikepalli, Kavitha
Chandran, Sunil
[Subramanian, C. R.] | | Isoperimetric Inequalities and Width Parameters of Graphs
In: Computing and Combinatorics : 9th Annual International Conference, COCOON 2003, 385-393 | Proceedings Article | |
| | 2003 | Telikepalli, Kavitha
[Varadarajan, Kasturi] | | On Shortest Paths in Line Arrangements
In: 15th Canadian Conference in Computational Geometry (CCCG-03), 170-173 | Proceedings Article | |
| 1 |
| Telle, Jan Arne (ed.) |
| |
| | 2011 | [Bredereck, Robert]
[Nichterlein, Andr{\'e}]
[Niedermeier, Rolf]
Philip, Geevarghese | | The Effect of Homogeneity on the Complexity of $k$-Anonymity
In: Fundamentals of Computation Theory - 18th International Symposium, FCT 2011, Oslo, Norway, August 22-25, 2011. Proceedings, 53-64 | Proceedings Article | |
| 2 |
| Teng, Shang-Hua (ed.) |
| |
| | 2000 | Sanders, Peter | | Asynchronous Scheduling of Redundant Disk Arrays
In: Proceedings of the 12th Annual ACM Symposium on Parallel Algorithms and Architecture (SPAA-00), 89-98 | Proceedings Article | |
| | 2000 | [Park, Sang-Min]
Lee, Jae-Ha
[Chwa, Kyung-Yong] | | Characterization of Rooms Searchable by Two Guards
In: Proceedings of the 11th Conference on Algorithms and Computation, 515-526 | Proceedings Article | |
| 1 |
| ter Haar Romeny, Bart M. (ed.) |
| |
| | 2011 | [Mainberger, Markus]
[Hoffmann, Sebastian]
[Weickert, Joachim]
Tang, Ching Hoo
[Johannsen, Daniel]
[Neumann, Frank]
Doerr, Benjamin | | Optimising Spatial and Tonal Data for Homogeneous Diffusion Inpainting
In: Scale Space and Variational Methods in Computer Vision : Third International Conference, SSVM 2011, 26-37 | Proceedings Article | |
| 1 |
| |
| | 2006 | [Teramoto, Sachio]
[Asano, Tetsuo]
[Katoh, Naoki]
Doerr, Benjamin | | Inserting Points Uniformly at Every Instance
In: IEICE - Transactions on Information and Systems [E89-D], 2348-2356 | Journal Article | |
| 2 |
| |
| | 2010 | Friedrich, 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] | | The 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 | |
| 6 |
| Theile, Madeleine |
| |
| | 2013 | Doerr, Benjamin
[Johannsen, Daniel]
Kötzing, Timo
[Neumann, Frank]
[Theile, Madeleine] | | More effective crossover operators for the all-pairs shortest path problem
In: Theoretical Computer Science [471], 12-26 | Journal Article | |
| | 2011 | Doerr, Benjamin
[Eremeev, Anton]
Neumann, Frank
[Theile, Madeleine]
[Thyssen, Christian] | | Evolutionary algorithms and dynamic programming
In: Theoretical Computer Science [412], 6020-6035 | Journal Article | |
| | 2011 | Kötzing, Timo
[Sudholt, Dirk]
[Theile, Madeleine] | | How crossover helps in pseudo-Boolean optimization
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 989-996 | Proceedings Article | |
| | 2010 | Doerr, 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 | |
| | 2009 | Doerr, Benjamin
[Eremeev, Anton]
[Horoba, Christian]
Neumann, Frank
[Theile, Madeleine] | | Evolutionary Algorithms and Dynamic Programming
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 771-777 | Proceedings Article | |
| | 2009 | Doerr, Benjamin
[Theile, Madeleine] | | Improved Analysis Methods for Crossover-Based Algorithms
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 247-254 | Proceedings Article | |
| 3 |
| |
| | 2006 | Bast, Holger
Majumdar, Debapriyo
Schenkel, Ralf
Theobald, Martin
Weikum, Gerhard | | IO-Top-k at TREC 2006: Terabyte Track
In: The Fifteenth Text Retrieval Conference Proceedings, TREC 2006, 1-5 | Electronic Proceedings Article | |
| | 2006 | Bast, Holger
Majumdar, Debapriyo
Schenkel, Ralf
Theobald, Martin
Weikum, Gerhard | | IO-Top-k: Index-Access Optimized Top-k Query Processing | Report | |
| | 2006 | Bast, Holger
Majumdar, Debapriyo
Schenkel, Ralf
Theobald, Martin
Weikum, Gerhard | | IO-Top-k: Index-Access Optimized Top-k Query Processing
In: Proceedings of the 32nd International Conference on Very Large Data Bases, VLDB 2006, 475-486 | Proceedings Article | |
| 2 |
| |
| | 1995 | Arikati, Srinivasa Rao
Chaudhuri, Shiva
Zaroliagis, Christos | | All-Pairs Min-Cut in Sparse Networks
In: Foundations of software technology and theoretical computer science (FSTTCS-95) : 15th conference, 363-376 | Proceedings Article | |
| | 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 | |
| 5 |
| Thiel, Christian |
| |
| | 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 | |
| | 1996 | Thiel, Christian | | Effiziente Algorithmen für Probleme der Kollisionserkennung und der geometrischen Optimierung
Universität des Saarlandes | Thesis - PhD thesis | |
| | 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 | |
| | 1993 | Dubhashi, Devdatt P.
Ranjan, Desh
Mehlhorn, Kurt
Thiel, Christian | | Searching, 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 | |
| 15 |
| Thiel, Sven |
| |
| | 2007 | [Beldiceanu, Nicolas]
Katriel, Irit
Thiel, Sven | | Filtering Algorithms for the Same and UsedBy Constraints
In: Archives of Control Sciences [to appear], to appear | Journal Article | |
| | 2005 | Katriel, Irit
Thiel, Sven | | Complete Bound Consistency for the Global Cardinality Constraint
In: Constraints [10], 191-217 | Journal Article | |
| | 2005 | [Beldiceanu, Nicolas]
Katriel, Irit
Thiel, Sven | | GCC-like Restrictions on the Same constraint
In: Constraint Satisfaction and Constraint Logic Programming : ERCIM/CoLogNet International Workshop, CSCLP 2004, 1-11
In: Recent Advances in Constraints [3419], 1-11 | Proceedings Article | |
| | 2004 | Thiel, Sven | | Efficient Algorithms for Constraint Propagation and for Processing Tree Descriptions
Universität des Saarlandes | Thesis - PhD thesis | |
| | 2004 | Beldiceanu, Nicolas
Katriel, Irit
Thiel, Sven | | Filtering algorithms for the Same and UsedBy constraints | Report | |
| | 2004 | [Beldiceanu, Nicolas]
Katriel, Irit
Thiel, Sven | | Filtering algorithms for the Same constraint
In: Integration of AI and OR techniques in constraint programming for combinatorial optimization problems : First International Conference, CPAIOR 2004, 65-79 | Proceedings Article | |
| | 2004 | [Henz, Martin]
[Müller, Tobias]
Thiel, Sven | | Global constraints for round robin tournament scheduling
In: European Journal of Operational Research [153], 92-101 | Journal Article | |
| | 2003 | Althaus, Ernst
[Duchier, Denys]
[Koller, Alexander]
Mehlhorn, Kurt
[Niehren, Joachim]
Thiel, Sven | | An Efficient Algorithm for the Configuration Problem of Dominance Graphs
In: Journal of Algorithms [48], 194-219 | Journal Article | |
| | 2003 | Katriel, Irit
Thiel, Sven | | Fast Bound-Consistency for the Global Cardinality Constraint
In: Principles and Practice of Constraint Programming - CP 2003 : 9th International Conference, CP 2003, 437-451 | Proceedings Article | |
| | 2003 | [Beldiceanu, Nicolas]
[Carlsson, Mats]
Thiel, Sven | | Sweep Synchronization as a Global Propagation Mechanism
In: Fifth International Workshop on Integration of AI and OR Techniques
in Constraint Programming for Combinatorial Optimization Problems, 139-152 | Electronic Proceedings Article | |
| | 2002 | [Beldiceanu, Nicolas]
[Carlsson, Mats]
Thiel, Sven | | Cost-Filtering Algorithms for the two Sides of the Sum of Weights of Distinct Values Constraint | Report | |
| | 2001 | Althaus, Ernst
[Duchier, Denys]
[Koller, Alexander]
Mehlhorn, Kurt
[Niehren, Joachim]
Thiel, Sven | | An Efficient Algorithm for the Configuration Problem of Dominance Graphs
In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), 815-824 | Proceedings Article | |
| | 2001 | [Beldiceanu, Nicolas]
[Guo, Qi]
Thiel, Sven | | Non-overlapping Constraints between Convex Polytopes
In: Proceedings of the 7th International Symposium on Principles and Practice of Constraint Programming (CP-01), 392-407 | Proceedings Article | |
| | 2000 | Mehlhorn, Kurt
Thiel, Sven | | Faster Algorithms for Bound-Consistency of the Sortedness and the Alldifferent Constraint
In: Principles and practice of constraint programming - CP 2000 (CP-00) : 6th international conference, CP 2000, 306-319 | Proceedings Article | |
| | 1999 | Thiel, Sven | | Persistente Suchbäume
Universität des Saarlandes | Thesis - Masters thesis | |
| 3 |
| Thierens, Dirk (ed.) |
| |
| | 2007 | Doerr, Benjamin
Johannsen, Daniel | | Adjacency List Matchings --- An Ideal Genotype for Cycle Covers
In: Genetic and Evolutionary Computation Conference (GECCO-2007), 1203-1210 | Proceedings Article | |
| | 2007 | | | GECCO 2007: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation | Proceedings | |
| | 2007 | Doerr, Benjamin
Neumann, Frank
[Sudholt, Dirk]
[Witt, Carsten] | | On the Runtime Analysis of the 1-ANT ACO algorithm
In: Genetic and Evolutionary Computation Conference 2007, 33-40 | Proceedings Article | |
| 1 |
| Thilikos, Dimitrios M. (ed.) |
| |
| | 2010 | Philip, Geevarghese
[Raman, Venkatesh]
[Villanger, Yngve] | | A Quartic Kernel for Pathwidth-One Vertex Deletion
In: Graph Theoretic Concepts in Computer Science - 36th International Workshop, WG 2010, Zar\'os, Crete, Greece, June 28-30, 2010 Revised Papers, 196-207 | Proceedings Article | |
| 2 |
| Thöle, Ralf |
| |
| | 2008 | [Diedrich, Florian]
Harren, Rolf
[Jansen, Klaus]
[Thöle, Ralf]
[Thomas, Henning] | | Approximation Algorithms for 3D Orthogonal Knapsack
In: Journal of Science and Technology [23], 749-762 | Journal Article | |
| | 2007 | [Diedrich, Florian]
Harren, Rolf
[Jansen, Klaus]
[Thöle, Ralf]
[Thomas, Henning] | | Approximation Algorithms for 3D Orthogonal Knapsack
In: Theory and Applications of Models of Computation, 34-45 | Proceedings Article | |
| 1 |
| |
| | 2008 | Doerr, Benjamin
Johannsen, Daniel
[Tang, Ching Hoo] | | How Single Ant ACO Systems Optimize Pseudo-Boolean Functions
In: Parallel Problem Solving from Nature – PPSN X, 378-388 | Proceedings Article | |
| 1 |
| |
| | 1997 | Hundack, Christoph
Prömel, Hans Jürgen
Steger, Angelika | | Extremal Graph Problems for Graphs with a Color-Critical Vertex
In: Combinatorics, Geometry and Probability, 421-433 | Part of a Book | |
| 7 |
| |
| | 2013 | Panagiotou, Konstantinos
Spöhel, Reto
[Steger, Angelika]
[Thomas, Henning] | | Explosive percolation in Erdös-Rényi-like random graph processes
In: Combinatorics, Probability and Computing [22], 133-145 | Journal Article | |
| | 2013 | [Doerr, Benjamin]
[Doerr, Carola]
[Spöhel, Reto]
[Thomas, Henning] | | Playing Mastermind with Many Colors
In: arXiv [abs/1207.0773], 1-22 | Electronic Journal Article | |
| | 2013 | Doerr, Benjamin
Spöhel, Reto
[Thomas, Henning]
Winzen, Carola | | Playing Mastermind with many colors
In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), 695-704 | Proceedings Article | |
| | 2012 | Doerr, Benjamin
Spöhel, Reto
[Thomas, Henning]
Winzen, Carola | | Playing Mastermind with Many Colors
In: Proc. of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2012), | Proceedings Article | |
| | 2011 | Panagiotou, 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 | |
| | 2008 | [Diedrich, Florian]
Harren, Rolf
[Jansen, Klaus]
[Thöle, Ralf]
[Thomas, Henning] | | Approximation Algorithms for 3D Orthogonal Knapsack
In: Journal of Science and Technology [23], 749-762 | Journal Article | |
| | 2007 | [Diedrich, Florian]
Harren, Rolf
[Jansen, Klaus]
[Thöle, Ralf]
[Thomas, Henning] | | Approximation Algorithms for 3D Orthogonal Knapsack
In: Theory and Applications of Models of Computation, 34-45 | Proceedings Article | |
| 1 |
| |
| | 1996 | [Mehlhorn, Kurt]
Claus, Volker
Thomas, Wolfgang | | Komplexitätstheorie und Algorithmik
In: Informatik : Grundlagen - Anwendungen - Perspektiven, 113-116 | Proceedings Article | |
| 8 |
| |
| | 2009 | [Kavitha, T.]
Mestre, Julián
[Nasre, M.] | | Popular Mixed Matchings
In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, 574-584 | Proceedings Article | |
| | 2009 | Doerr, Benjamin
Friedrich, Tobias
[Sauerwald, Thomas] | | Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, 366-377 | Proceedings Article | |
| | 2009 | Friedrich, Tobias
[Sauerwald, Thomas]
[Vilenchik, Dan] | | Smoothed Analysis of Balancing Networks
In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, 472-483 | Proceedings Article | |
| | 2007 | Funke, Stefan
Laue, Sören | | Bounded-Hop Energy-Efficient Broadcast in Low-Dimensional Metrics Via Coresets
In: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, 272-283 | Proceedings Article | |
| | 2007 | [Kavitha, Telikepalli]
Mehlhorn, Kurt
Michail, Dimitrios | | New Approximation Algorithms for Minimum Cycle Bases of Graphs
In: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, 512-523 | Proceedings Article | |
| | 2007 | Doerr, Benjamin | | Randomly Rounding Rationals with Cardinality Constraints and Derandomizations
In: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, 441-452 | Proceedings Article | |
| | 2006 | Elbassioni, Khaled M.
Mustafa, Nabil H. | | Conflict-Free Colorings of Rectangle Ranges
In: STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, 254-263 | Proceedings Article | |
| | 2006 | Doerr, Benjamin | | Generating Randomized Roundings with Cardinality Constraints and Derandomizations
In: STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, 571-583 | Proceedings Article | |
| 2 |
| Thome, Stefan |
| |
| | 2000 | Thome, Stefan | | Erweiterung des hierarchischen Zeichenmodells in ArchEd
Universität des Saarlandes | Thesis - Masters thesis | |
| | 1997 | Hundack, Christoph
Mutzel, Petra
[Pouchkarev, Igor]
[Thome, Stefan] | | ArchE: A Graph Drawing System for Archaeology
In: Proceedings of the 5th Symposium on Graph Drawing (GD-97), 297-302 | Proceedings Article | |
| 2 |
| |
| | 2000 | [Cole, Richard]
[Farach-Colton, Martin]
Hariharan, Ramesh
[Przytycka, Teresa]
[Thorup, Mikkel] | | An O(n log n) algorithm for the maximum agreement subtree problem for binary trees
In: SIAM Journal on Computing [30], 1385-1404 | Journal Article | |
| | 2000 | Thorup, Mikkel | | Floats, Integers, and Single Source Shortest Paths
In: Journal of Algorithms [35], 189 -201 | Journal Article | |
| 1 |
| Thyssen, Christian |
| |
| | 2011 | Doerr, Benjamin
[Eremeev, Anton]
Neumann, Frank
[Theile, Madeleine]
[Thyssen, Christian] | | Evolutionary algorithms and dynamic programming
In: Theoretical Computer Science [412], 6020-6035 | Journal Article | |
| 2 |
| Ting, Hing-Fung |
| |
| | 2012 | [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: Algorithmica [62], 1088-1111 | Journal 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 | |
| 1 |
| Tinhofer, Gottfried (ed.) |
| |
| | 1995 | Chaudhuri, Shiva
Hagerup, Torben | | Prefix Graphs and their Applications
In: Graph-theoretic Concepts in Computer Science: 20th International Workshop (WG94), 206-218 | Proceedings Article | |
| 1 |
| |
| | 2013 | Gawrychowski, Pawel
[Manea, Florin]
[Mercas, Robert]
[Nowotka, Dirk]
[Tiseanu, Catalin] | | Finding Pseudo-repetitions
In: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), 257-268 | Proceedings Article | |
| 1 |
| |
| | 1999 | Sibeyn, Jop F. | | External Selection
In: Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science (STACS-99), 291-301 | Proceedings Article | |
| 10 |
| |
| | 2012 | Elbassioni, Khaled
[Tiwary, Hans Raj] | | Complexity of Approximating the Vertex Centroid of a Polyhedron
In: Theoretical Computer Science [421], 56-61 | Journal 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 | |
| | 2011 | Elbassioni, Khaled
[Tiwary, Hans Raj] | | On a cone covering problem
In: Computational Geometry [44], 129-134 | Journal Article | |
| | 2011 | [Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Tiwary, Hans Raj] | | The negative cycles polyhedron and hardness of checking some polyhedral properties
In: Annals of Operations Research [188], 63-76 | Journal Article | |
| | 2009 | Elbassioni, Khaled
[Tiwary, Hans Raj] | | Complexity of Approximating the Vertex Centroid of a Polyhedron
In: Algorithms and Computation, 20th International Symposium (ISAAC), 413-422 | Proceedings Article | |
| | 2008 | [Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Tiwary, Hans Raj] | | Characterization of the vertices and extreme directions of the negative cycle polyhedron and hardness of generating vertices of 0/1-polyhedra
In: CoRR [abs/0801.3790], x-x | Journal Article | |
| | 2008 | Elbassioni, Khaled
[Tiwary, Hans Raj] | | On a Cone Covering Problem
In: Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 171-174 | Proceedings Article | |
| | 2008 | Elbassioni, Khaled
[Tiwary, Hans Raj] | | On Computing the Vertex Centroid of a Polyhedron
In: CoRR [abs/0806.3456], x-x | Journal Article | |
| | 2008 | [Tiwary, Hans Raj]
Elbassioni, Khaled | | On the complexity of checking self-duality of polytopes and its relations to vertex enumeration and graph isomorphism
In: Symposium on Computational Geometry 2008, 192-198 | Proceedings Article | |
| | 2007 | Ajwani, Deepak
[Ray, Saurabh]
[Seidel, Raimund]
[Tiwary, Hans Raj] | | On Computing the Centroid of the Vertices of an Arrangement and Related Problems
In: 10th Workshop on Algorithms and Data Structures (WADS), 519-528 | Proceedings Article | |
| 2 |
| Tokuyama, Takeshi |
| |
| | 2006 | [Aronov, Boris]
[Asano, Tetsuo]
[Katoh, Naoki]
Mehlhorn, Kurt
[Tokuyama, Takeshi] | | Polyline Fitting of Planar Points under Min-sum Criteria
In: International Journal of Computational Geometry and Applications [16], 97-116 | Journal Article | |
| | 2004 | [Aranov, Boris]
[Asano, Tetsuo]
[Katoh, Naoki]
Mehlhorn, Kurt
[Tokuyama, Takeshi] | | Polyline Fitting of Planar Points Under Min-sum Criteria
In: Algorithms and Computation: 15th International Symposium, ISAAC 2004, 77-88 | Proceedings Article | |
| 2 |
| |
| | 2007 | Ajwani, Deepak
Friedrich, Tobias | | Average-Case Analysis of Online Topological Ordering
In: Algorithms and Computation : 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007. Proceedings, 464-475 | Proceedings Article | |
| | 2007 | [Aronov, Boris]
[Asano, Tetsuo]
Funke, Stefan | | Optimal Triangulation with Steiner Points
In: Algorithms and Computation : 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007. Proceedings, 681-691 | Proceedings Article | |
| 1 |
| Tokuyama, T. (ed.) |
| |
| | 1999 | Krysta, Piotr
Solis-Oba, Roberto | | Approximation algorithms for bounded facility location
In: Proceedings of the 5th Annual International Conference on Computing and Combinatorics (COCOON-99), 241-250 | Proceedings Article | |
| 1 |
| Toledo, Sivan |
| |
| | 2008 | Ajwani, Deepak
[Malinger, Itay]
[Meyer, Ulrich]
[Toledo, Sivan] | | Characterizing the Performance of Flash Memory Storage Devices and Its Impact on Algorithm Design
In: Proc. 7th Intern. Workshop on Experimental Algorithms (WEA), 208-219 | Proceedings Article | |
| 1 |
| Tolhuizen, Ludo |
| |
| | 2003 | Sanders, 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 | |
| 1 |
| Tollis, Ioannis G. (ed.) |
| |
| | 1995 | [Jünger, Michael]
Mutzel, Petra | | The Polyhedral Approach to the Maximum Planar Subgraph Problem:
New Chances for Related Problems
In: Graph Drawing: DIMACS International Workshop (GD94), 119-130 | Proceedings Article | |
| 3 |
| Toma, Laura |
| |
| | 2004 | [Arge, Lars]
Meyer, Ulrich
[Toma, Laura] | | External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs
In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, 146-157 | Proceedings Article | |
| | 2003 | [Arge, Lars]
Meyer, Ulrich
[Toma, Laura]
[Zeh, Norbert] | | On external-memory planar depth first search
In: Journal of Graph Algorithms and Applications [7], 105-129 | Journal Article | |
| | 2001 | [Arge, Lars]
Meyer, Ulrich
[Toma, Laura]
[Zeh, Norbert] | | On External-Memory Planar Depth First Search
In: Proceedings of the 7th International Workshop on Algorithms and Data Structures (WADS-01), 471-482 | Proceedings Article | |
| 1 |
| Tönnies, Klaus-Dietz |
| |
| | 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 | |
| 1 |
| Tóth, Csaba D. (ed.) |
| |
| | 2009 | Angelopoulos, Spyros | | Online Priority Steiner Tree Problems
In: Algorithms and Data Structures : 11th International Symposium, WADS 2009, 37-48 | Proceedings Article | |
| 1 |
| Toussaint, Marc (ed.) |
| |
| | 2012 | [Croitoru, Cosmina]
Kötzing, Timo | | Deliberative Acceptability of Arguments
In: STAIRS 2012 - Proceedings of the Sixth Starting AI Researchers' Symposium, 71-82 | Proceedings Article | |
| 1 |
| Tovar, Eduardo (ed.) |
| |
| | 2007 | Gidenstam, Anders
[Papatriantafilou, Marina] | | LFthreads: A Lock-Free Thread Library
In: 11th International Conference On Principles Of Distributed Systems (OPODIS), 217-231 | Proceedings Article | |
| 1 |
| To, Isaac K. K. |
| |
| | 2010 | [Han, Xin]
[Lam, Tak-Wah]
Lee, Lap-Kei
[To, Isaac K. K.]
[Wong, Prudence W. H.] | | Deadline scheduling and power management for speed bounded processors
In: Theoretical Computer Science [411], 3587-3600 | Journal Article | |
| 13 |
| Träff, Jesper Larsson |
| |
| | 2003 | Katriel, 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 | |
| | 2002 | Sanders, 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 | |
| | 2000 | Träff, Jesper Larsson
Zaroliagis, Christos | | A simple parallel algorithm for the single-source shortest path problem on planar digraphs
In: Journal of Parallel and Distributed Computing [60], 1103-1124 | Journal Article | |
| | 1998 | Brodal, Gerth Stølting
Träff, Jesper Larsson
Zaroliagis, Christos | | A Parallel Priority Queue with Constant Time Operations
In: Journal of Parallel and Distributed Computing, Special Issue on Parallel Data Structures [49], 4-21 | Journal Article | |
| | 1998 | Hagerup, 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 | |
| | 1997 | Katajainen, Jyrki
Träff, Jesper Larsson | | A meticulous analysis of mergesort programs
In: Proceedings of the 3rd Italian Conference on Algorithms and Complexity (CIAC-97), 217-228 | Proceedings Article | |
| | 1997 | Brodal, Gerth Stølting
Träff, Jesper Larsson
Zaroliagis, Christos | | A parallel priority data structure with applications
In: 11th Internatinal Parallel Processing Symposium (IPPS-97), 689-693 | Proceedings Article | |
| | 1997 | [Keßler, Christoph W.]
Träff, Jesper Larsson | | Language and library support for practical PRAM programming
In: Proceedings of the 5th Euromicro Workshop on Parallel and Distributed Processing (PDP-97), 216-221 | Proceedings Article | |
| | 1997 | Czumaj, Artur
Ferragina, Paolo
Gasieniec, Leszek
[Muthukrishnan, S.]
Träff, Jesper Larsson | | The Architecture of a Software Library for String Processing
In: Proceedings of the Workshop on Algorithm Engineering (WAE-97), 166-176 | Proceedings Article | |
| | 1996 | Träff, Jesper Larsson | | A Heuristic for Blocking Flow Algorithms
In: European Journal of Operational Research [89], 564-569 | Journal Article | |
| | 1996 | [Keßler, Christoph W.]
Träff, Jesper Larsson | | A Library of basic PRAM Algorithms and its Implementation in FORK
In: 8th Annual ACM Symposium on Parallel Algorithms and Architechtures (SPAA'96), 193-195 | Proceedings Article | |
| | 1996 | Trä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 | |
| | 1995 | Träff, Jesper Larsson | | An Experimental Comparison of two Distributed Singel-Source Shortest Path Algorithm
In: Parallel Computing [21], 1505-1532 | Journal Article | |
| 3 |
| Tragoudas, Spyros |
| |
| | 1999 | Kagaris, Dimitrios
[Pantziou, Grammati E.]
[Tragoudas, Spyros]
Zaroliagis, Christos | | Transmissions in a network with capacities and delays
In: Networks [33
], 167-174 | Journal Article | |
| | 1995 | [Kagaris, Dimitrios]
[Pantziou, Grammati E.]
[Tragoudas, Spyros]
Zaroliagis, Christos | | On the Computation of Fast Data Transmissions in Networks
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 291-302 | Proceedings Article | |
| | 1995 | [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 |
| Trajan, Robert E. (ed.) |
| |
| | 1991 | | | Effiziente Algorithmen - Tagungsbericht | Proceedings | |
| 1 |
| Travaglini, G. (ed.) |
| |
| | 2013 | Doerr, Carola
[Gnewuch, Michael]
Wahlström, Magnus | | Calculation of Discrepancy Measures and Applications
In: A Panorama of Discrepancy Theory, 1-55 | Part of a Book | |
| 2 |
| Triantafillou, Peter |
| |
| | 2007 | Weikum, Gerhard
Bast, Holger
[Canright, Geoffrey]
[Hales, David]
[Schindelhauer, Christian]
[Triantafillou, Peter] | | Towards Peer-to-Peer Web Search
In: 1st European Conference on Complex Systems, ECCS'05, ? | Proceedings Article | |
| | 2005 | Weikum, Gerhard
Bast, Holger
[Canright, Geoffrey]
[Hales, David]
[Schindelhauer, Christian]
[Triantafillou, Peter] | | Towards Self-Organizing Query Routing and Processing for Peer-to-Peer Web Search
In: Workshop on Peer-to-peer Data Management in the Complex Systems Perspective, 7-24 | Proceedings Article | |
| 3 |
| Triguero, Francisco (ed.) |
| |
| | 2002 | Beier, Rene
Sanders, Peter
Sivadasan, Naveen | | Energy Optimal Routing in Radio Networks Using Geometric Data Structures
In: Automata, Languages and Programming : 29th International Colloquium, ICALP 2002, 366-376 | Proceedings Article | |
| | 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 | |
