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

MPI-INF D1 Publications

MPI-INF D1 Publications

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

Login to this database


 

Viewing:

1. Author,Editor - 1. by Individual - 1. by Names
Next Page
Show entries starting with: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
#YearAuthor(s) [non member]TitleType
2
Hide details for Trippen, Gerhard (ed.)Trippen, Gerhard (ed.)
2004[Aranov, Boris]
[Asano, Tetsuo]
[Katoh, Naoki]
Mehlhorn, Kurt
[Tokuyama, Takeshi]
Attachment IconPolyline Fitting of Planar Points Under Min-sum Criteria
In: Algorithms and Computation: 15th International Symposium, ISAAC 2004, 77-88
Proceedings Article
2004Kowalski, Dariusz
[Pelc, Andrzej]
Polynomial deterministic rendezvous in arbitrary graphs
In: Algorithms and Computation: 15th International Symposium, ISAAC 2004, 644-656
Proceedings Article
1
Hide details for Trippen, G. (ed.)Trippen, G. (ed.)
2004Abraham, David
[Cechlárová, Katarina]
[Manlove, David F.]
Mehlhorn, Kurt
Attachment IconPareto-optimality in house allocation problems
In: Algorithms and Computation: 15th International Symposium, ISAAC 2004, 3-15
Proceedings Article
1
Hide details for Trullemans, C (ed.)Trullemans, C (ed.)
1986Lengauer, Thomas
Mehlhorn, Kurt
Attachment IconVLSI complexity, efficient VLSI algorithms and the HILL design system
In: Algorithmics for VLSI, 33-89
Part of a Book
1
Hide details for Truss, AnkeTruss, Anke
2009[Böcker, Sebastian]
[Hüffner, Falk]
[Truss, Anke]
Wahlström, Magnus
A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams
In: Parameterized and Exact Computation : 4th International Workshop, IWPEC 2009, 38-49
Proceedings Article
1
Hide details for Tsagarakis, M.Tsagarakis, M.
1979Mehlhorn, Kurt
Tsagarakis, M.
On the isomorphism of two algorithms: Hu/Tucker and Garsia/Wachs
In: Colloque de Lille `Les Arbres en Algebre et en Programmation' [??], ??
Journal Article
1
Hide details for Tsakalidis, AthanasiosTsakalidis, Athanasios
1992Fleischer, Rudolf
Fries, Otfried
Mehlhorn, Kurt
Meiser, Stefan
Näher, Stefan
Rohnert, Hans
Schirra, Stefan
Simon, Klaus
Tsakalidis, Athanasios
Uhrig, Christian
Selected Topics from Computational Geometry, Data Structures and Motion Planning
In: Data Structures and Efficient Algorithms, Final Report on the DFG Special Joint Initiative, 25-43
Part of a Book
5
Hide details for Tsakalidis, Athanasios K.Tsakalidis, Athanasios K.
1993Mehlhorn, Kurt
Tsakalidis, Athanasios K.
Dynamic Interpolation Search
In: Journal of the ACM [40], 621-634
Journal Article
1989Mehlhorn, Kurt
Tsakalidis, Athanasios K.
Attachment IconData structuresReport
1986Mehlhorn, Kurt
Tsakalidis, Athanasios K.
Attachment IconAn Amortized Analysis of Insertions into AVL-Trees
In: SIAM Journal on Computing [15], 22-33
Journal Article
1985Mehlhorn, Kurt
Tsakalidis, Athanasios K.
Attachment IconDynamic Interpolation Search
In: Automata, languages and programming (ICALP-85) : 12th international colloquium, 424-434
Proceedings Article
1985Mehlhorn, Kurt
Tsakalidis, Athanasios K.
Routing Through a Generalized Switchbox
In: Automata, languages and programming (ICALP-85) : 12th international colloquium, 328-337
Proceedings Article
2
Hide details for Tsakalidis, A.Tsakalidis, A.
1990Mehlhorn, Kurt
Tsakalidis, A.
Data Structures
In: Handbook of Theoretical Computer Science, 301-341
Part of a Book
1987Fries, O.
Mehlhorn, Kurt
Näher, Stefan
Tsakalidis, A.
A $\log \log n$ data structure for three-sided range queries
In: Information Processing Letters [25], 269-273
Journal Article
1
Hide details for Tscheuschner, TobiasTscheuschner, Tobias
2010[Mörig, Marc]
[Scholz, Sven]
[Tscheuschner, Tobias]
Berberich, Eric
Implementation aspects
In: Algorithm Engineering : Bridging the Gap between Algorithm Theory and Practice, 237-289
Part of a Book
5
Hide details for Tsigaridas, EliasTsigaridas, Elias
2008[Emiris,Ioannis]
Hemmer, Michael
[Karavelas, Menelaos]
[Limbach, Sebastian]
[Mourrain, Bernard]
[Tsigaridas, Elias]
[Zafeirakopoulos,Zafeirakis]
Cross-benchmarks of univariate algebraic kernelsReport
2008Berberich, Eric
Hemmer, Michael
[Karavelas, Menelaos]
[Pion, Sylvain]
[Teillaud, Monique]
[Tsigaridas, Elias]
Prototype implementation of the algebraic kernelReport
2008[Emiris, Ioannis]
Hemmer, Michael
[Tsigaridas, Elias]
[Tzoumas, Georg]
Voronoi diagram of ellipses: CGAL-based implementationReport
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
2006Berberich, Eric
Hemmer, Michael
[Karavelas, Menelaos]
[Pion, Sylvain]
[Teillaud, Monique]
[Tsigaridas, Elias]
Interface specification of algebraic kernelReport
2
Hide details for Tsigaridas, Elias P.Tsigaridas, Elias P.
2009Hemmer, Michael
[Tsigaridas, Elias P.]
[Zafeirakopoulos, Zafeirakis]
[Emiris, Ioannis Z.]
[Karavelas, Menelaos I.]
[Mourrain, Bernard]
Experimental evaluation and cross-benchmarking of univariate real solvers
In: Symbolic Numeric Computation 2009 (SNC 2009), 45-54
Proceedings Article
2008[Emiris, Ioannis Z.]
Hemmer, Michael
[Karavelas, Menelaos]
[Mourrain, Bernard]
[Tsigaridas, Elias P.]
[Zafeirakopoulos, Zafeirakis]
Attachment IconExperimental evaluation and cross-benchmarking of univariate real solversReport
10
Hide details for Tsigas, PhilippasTsigas, Philippas
2010Gidenstam, Anders
[Papatriantafilou, Marina]
[Tsigas, Philippas]
NBmalloc: Allocating Memory in a Lock-Free Manner
In: Algorithmica [58], 304-338
Journal Article
2009Gidenstam, 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
2009[Larsson, Andreas]
Gidenstam, Anders
[Ha, Phuong H.]
[Papatriantafilou, Marina]
[Tsigas, Philippas]
Multiword Atomic Read/Write Registers on Multiprocessor Systems
In: Journal of experimental algorithmics [13], 7:1-7:30
Electronic Journal Article
1998[Panconesi, Alessandro]
Papatriantafilou, Marina
Tsigas, Philippas
[Vitanyi, Paul]
Randomized Naming Using Wait-Free Shared Variables
In: Distributed Computing [11], 113-124
Journal Article
1997Papatriantafilou, Marina
Tsigas, Philippas
Self-Stabilizing Wait-Free Clock Synchronization
In: Parallel Processing Letters [7], 321-328
Journal Article
1997[Mavronicolas, Marios]
Papatriantafilou, Marina
Tsigas, Philippas
The impact of timing on linearizability in counting networks
In: Proceedings of the 11th International Parallel Processing Symposium (IPPS-97), 684-688
Proceedings Article
1996Garg, Naveen
Papatriantafilou, Marina
Tsigas, Philippas
Distributed List Coloring: How to Dynamically Allocate Frequencies to Mobile Base Stations
In: 8th Annual IEEE Symposium on Parallel and Distributed Processing (SPDP '96), 18-25
Proceedings 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[Hoepman, Jaap-Henk]
Papatriantafilou, Marina
Tsigas, Philippas
Self-Stabilization in Wait-Free Shared Memory Objects
In: Distributed Algorithms: 9th International Workshop (WDAG95), 273-287
Proceedings Article
1995Papatriantafilou, Marina
Tsigas, Philippas
Wait-Free Consensus in ``In-Phase'' Multiprocessor Systems
In: Seventh IEEE Symposium on Parallel and Distributed Processing, 312-319
Proceedings Article
1
Hide details for Tsigas, Philippas (ed.)Tsigas, Philippas (ed.)
2007Gidenstam, Anders
[Papatriantafilou, Marina]
LFthreads: A Lock-Free Thread Library
In: 11th International Conference On Principles Of Distributed Systems (OPODIS), 217-231
Proceedings Article
1
Hide details for Tsigas, PhillipasTsigas, Phillipas
2009Gidenstam, Anders
[Papatriantafilou, Marina]
[Tsigas, Phillipas]
NBmalloc : Allocating Memory in a Lock-Free Manner
In: Algorithmica [Online First], 1-35
Electronic Journal Article
1
Hide details for Tuza, ZsoltTuza, Zsolt
1998[Bodlaender, Hans L.]
[Deogun, Jitender S.]
Jansen, Klaus
[Kloks, Ton]
[Kratsch, Dieter]
[Müller, Haiko]
[Tuza, Zsolt]
Ranking of Graphs
In: SIAM Journal on Discrete Mathematics [11], 168-181
Journal Article
1
Hide details for Tzoumas, GeorgTzoumas, Georg
2008[Emiris, Ioannis]
Hemmer, Michael
[Tsigaridas, Elias]
[Tzoumas, Georg]
Voronoi diagram of ellipses: CGAL-based implementationReport
1
Hide details for Ueckerdt, T.Ueckerdt, T.
2009[Kavitha, T.]
[Liebchen, Ch.]
Mehlhorn, K.
Michail, D.
[Rizzi, R.]
[Ueckerdt, T.]
[Zweig, K.]
Attachment IconCycle Bases in Graphs: Characterization, Algorithms, Complexity, and Applications
In: Computer Science Review [3], 199-243
Journal Article
1
Hide details for Uetz, MarcUetz, Marc
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
1
Hide details for Uhrig, CUhrig, C
1992Mehlhorn, Kurt
[Paul, Wolfgang J.]
Uhrig, C
Attachment Icon$k$ versus $k+1$ Index Registers and Modifiable versus Non-modifiable Programs
In: Information and Computation [101], 123-129
Journal Article
16
Hide details for Uhrig, ChristianUhrig, Christian
1999Mehlhorn, Kurt
[Näher, Stefan]
Seel, Michael
[Seidel, Raimund]
Schilz, Thomas
Schirra, Stefan
Uhrig, Christian
Attachment IconChecking geometric programs or verification of geometric structures
In: Computational Geometry: Theory and Applications [12], 85-104
Journal Article
1998Mehlhorn, Kurt
Müller, Michael
Näher, Stefan
Schirra, Stefan
Seel, Michael
Uhrig, Christian
Ziegler, Joachim
A computational basis for higher-dimensional computational geometry and applications
In: Computational Geometry: Theory and Applications [10], 289-304
Journal Article
1997Mehlhorn, Kurt
Müller, Michael
Näher, Stefan
Schirra, Stefan
Seel, Michael
Uhrig, Christian
Ziegler, Joachim
A Computational Basis for Higher-dimensional Computational Geometry and Applications
In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 254-263
Proceedings Article
1997Mehlhorn, Kurt
[Sundar, R.]
Uhrig, Christian
Maintaining Dynamic Sequences under Equality Tests in Polylogarithmic Time
In: Algorithmica [17], 183-198
Journal Article
1997Mehlhorn, Kurt
Näher, Stefan
Uhrig, Christian
The LEDA platform for combinatorial and geometric computing
In: Proceedings of the 24th International Colloquium on Automata, Languages, and Programming (ICALP-97), 7-16
Proceedings Article
1996Mehlhorn, Kurt
[Näher, Stefan]
Schilz, Thomas
Schirra, Stefan
Seel, Michael
[Seidel, Raimund]
Uhrig, Christian
Checking Geometric Programs or Verification of Geometric Structures
In: 12th Annual ACM Symposium on Computational Geometry (SCG 96), 159-165
Proceedings Article
1996Mehlhorn, Kurt
Näher, Stefan
Uhrig, Christian
The LEDA Platform for Combinatorial and Geometric Computing
In: Beherrschung von Informationssystemen : Tagungsband der Informatik '96 ; GI - 26. Jahrestagung, 43-50
Proceedings Article
1995Burnikel, Christoph
Könemann, Jochen
Mehlhorn, Kurt
[Näher, Stefan]
Schirra, Stefan
Uhrig, Christian
Attachment IconExact Geometric Computation in LEDA
In: 11th ACM Symposium on Computational Geometry (SCG95), C18-C19
Proceedings Article
1995[Dietz, Paul]
Mehlhorn, Kurt
[Raman, Rajeev]
Uhrig, Christian
Attachment IconLower bounds for set intersection queries
In: Algorithmica [14], 154-168
Journal Article
1994Mehlhorn, 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
1993Dietz, Paul
Mehlhorn, Kurt
Raman, Rajeev
Uhrig, Christian
Lower Bounds for Set Intersection queries
In: Discrete algorithms (SODA-93) : 4th annual ACM-SIAM symposium, 194-201
Proceedings Article
1992Alt, Helmut
Fleischer, Rudolf
Kaufmann, Michael
Mehlhorn, Kurt
Näher, Stefan
Schirra, Stefan
Uhrig, Christian
Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
In: Algorithmica [8], 391-408
Journal Article
1992Fleischer, Rudolf
Fries, Otfried
Mehlhorn, Kurt
Meiser, Stefan
Näher, Stefan
Rohnert, Hans
Schirra, Stefan
Simon, Klaus
Tsakalidis, Athanasios
Uhrig, Christian
Selected Topics from Computational Geometry, Data Structures and Motion Planning
In: Data Structures and Efficient Algorithms, Final Report on the DFG Special Joint Initiative, 25-43
Part of a Book
1990Alt, Helmut
Fleischer, Rudolf
Kaufmann, Michael
Mehlhorn, Kurt
Näher, Stefan
Schirra, Stefan
Uhrig, Christian
Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures
In: Computational geometry (SCG-90) : 6th annual symposium, 281-289
Proceedings Article
1990Mehlhorn, Kurt
Näher, Stefan
Uhrig, Christian
Attachment IconHidden line elimination for isooriented rectanglesReport
1990Mehlhorn, Kurt
Näher, Stefan
Uhrig, Christian
Attachment IconHidden line elimination for isooriented rectangles
In: Information Processing Letters [35], 137-143
Journal Article
2
Hide details for Ukkonen, Esko (ed.)Ukkonen, Esko (ed.)
2011Kötzing, TimoIterative Learning from Positive Data and Counters
In: Algorithmic Learning Theory : 22nd International Conference, ALT 2011, 40-54
Proceedings Article
1992Lenhof, Hans-Peter
Smid, Michiel
Maintaining the visibility map of speres while moving the viewpoint on a circle at infinity
In: Algorithms Theory - SWAT'92: Third Scandinavian Workshop on Algorithm Theory, 388-398
Proceedings Article
1
Hide details for Urrutia, JorgUrrutia, Jorg
1999Mehlhorn, Kurt
Sack, Jörg-Rüdiger
Urrutia, Jorg
Editorial
In: Computational Geometry [12], 153-154
Journal Article
1
Hide details for Urrutia, Jorge (ed.)Urrutia, Jorge (ed.)
2000Schirra, StefanRobustness and Precision Issues in Geometric Computation
In: Handbook of Computational Geometry, 597-632
Part of a Book
1
Hide details for Uthaisombut, PatchrawatUthaisombut, Patchrawat
2008[Pruhs, Kirk]
van Stee, Rob
[Uthaisombut, Patchrawat]
Attachment IconSpeed Scaling of Tasks with Precedence Constraints
In: Theory of Computing Systems [43], 67-80
Journal Article
1
Hide details for Uznanski, PrzemyslawUznanski, Przemyslaw
2014Gawrychowski, Pawel
[Uznanski, Przemyslaw]
Order-Preserving Pattern Matching with k Mismatches
In: Combinatorial Pattern Matching - 25th Annual Symposium, CPM 2014, Moscow, Russia, June 16-18, 2014. Proceedings, 130-139
Proceedings Article
2
Hide details for Vaccaro, U. (ed.)Vaccaro, U. (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
1998Solis-Oba, Roberto
Frederickson, Greg N.
Rooted Spanning Trees with Small Weight and Average Length
In: Theoretical Computer Science, 114-125
Proceedings Article
6
Hide details for Vahdati Daneshmand, SiavashVahdati Daneshmand, Siavash
2003Althaus, Ernst
Polzin, Tobias
[Vahdati Daneshmand, Siavash]
Improving Linear Programming Approaches for the Steiner Tree Problem
In: Experimental and efficient algorithms : Second International Workshop, WEA 2003, 1-14
Proceedings Article
2003Polzin, Tobias
[Vahdati Daneshmand, Siavash]
On Steiner trees and minimum spanning trees in hypergraphs
In: Operations Research Letters [31], 12-20
Journal Article
2002Polzin, Tobias
[Vahdati Daneshmand, Siavash]
Extending Reduction Techniques for the Steiner Tree Problem
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 795-807
Proceedings Article
2001Polzin, Tobias
[Vahdati Daneshmand, Siavash]
A Comparison of Steiner Tree Relaxations
In: Discrete Applied Mathematics [112], 241-261
Journal Article
2001Polzin, Tobias
[Vahdati Daneshmand, Siavash]
Improved Algorithms for the Steiner Problem in Networks
In: Discrete Applied Mathematics [112], 263-300
Journal Article
2000Polzin, Tobias
[Vahdati Daneshmand, Siavash]
Primal-Dual Approaches to the Steiner Problem
In: Approximation Algorithms for Combinatorial Optimization, 214-225
Proceedings Article
3
Hide details for Vahrenhold, Jan (ed.)Vahrenhold, Jan (ed.)
2010Elbassioni, Khaled
[Matijevic, Domagoj]
[Severdija, Domagoj]
Guarding 1.5-Dimensional with Demands
In: 26th European Workshop on Computational Geometry (EuroCG 2010), 133-136
Proceedings Article
2010Berberich, Eric
[Halperin, Dan]
[Kerber, Michael]
[Pogalnikova, Roza]
Polygonal Reconstruction from Approximate Offsets
In: 26th European Workshop on Computational Geometry : Workshop Proceedings, 65-68
Electronic Proceedings Article
2009[Althaus, Ernst]
[Dumitriu, Daniel]
Fast and Accurate Bounds on Linear Programs
In: Experimental Algorithms : 8th International Symposium on Experimental Algorithms (SEA 2009), 40-50
Proceedings Article
2
Hide details for Vaidya, Pravin (ed.)Vaidya, Pravin (ed.)
1992Baumgarten, Hanna
Jung, Hermann
Mehlhorn, Kurt
Dynamic Point Location in General Subdivisions
In: Discrete algorithms (SODA-92) : 3rd annual ACM-SIAM symposium, 250-258
Proceedings Article
1992Mehlhorn, Kurt
Sharir, Micha
Welzl, Emo
Tail Estimates for the Space Complexity of Randomised Incremental Algorithms
In: Discrete algorithms (SODA-92) : 3rd annual ACM-SIAM symposium, 89-93
Proceedings Article
1
Hide details for Vainshtein, AlekVainshtein, Alek
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
1
Hide details for Vakali, Athena (ed.)Vakali, Athena (ed.)
2005Bast, Holger
Weber, Ingmar
Insights from Viewing Ranked Retrieval as Rank Aggregation
In: Workshop on Challenges in Web Information Retrieval and Integration (WIRI'05), 243-248
Proceedings Article
1
Hide details for Valk, Rüdiger (ed.)Valk, Rüdiger (ed.)
1988Mehlhorn, KurtSFB 124: VLSI-Entwurfsmethoden und Parallelität
In: GI - 18. Jahrestagung II, Vernetzte and komplexe Informatik-Systems, 3-29
Proceedings Article
1
Hide details for Valtr, PavelValtr, Pavel
2012Schmidt, Jens M.
[Valtr, Pavel]
Cubic Plane Graphs on a Given Point Set
In: Proceedings of the Twenty-Eighth Annual Symposium on Computational Geometry (SCG'12), 201-208
Proceedings Article
3
Hide details for Van der Hoeven, Joris (ed.)Van der Hoeven, Joris (ed.)
2012Emeliyanenko, Pavel
Sagraloff, Michael
On the Complexity of Solving a Bivariate Polynomial System
In: ISSAC 2012 : Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, 154-161
Proceedings Article
2012Sagraloff, MichaelWhen Newton meets Descartes: A Simple and Fast Algorithm to Isolate the Real Roots of a Polynomial
In: ISSAC 2012 : Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, 297-304
Proceedings Article
2010Mehlhorn, KurtReliable and Efficient Geometric Computing
In: Mathematical Software, ICMS 2010 : Third International Congress
on Mathematical Software, 10-11
Proceedings Article
1
Hide details for van der Ster, Suzannevan der Ster, Suzanne
2011[Baruah, Sanjoy]
Bonifaci, Vincenzo
[D'Angelo, Gianlorenzo]
[Marchetti-Spaccamela, Alberto]
[van der Ster, Suzanne]
[Stougie, Leen]
Attachment IconMixed-criticality scheduling of sporadic task systems
In: Algorithms - ESA 2011 : 19th Annual European Symposium, 555-566
Proceedings Article
1
Hide details for van Dyk, David (ed.)van Dyk, David (ed.)
2009[Shervashidze, Nino]
Vishwanathan, S .V. N.
[Petri, Tobias H.]
Mehlhorn, Kurt
[Borgwardt, Karsten M.]
Attachment IconEfficient Graphlet Kernels for Large Graph Comparison
In: Proceedings of the Twelfth International Conference on Artificial Intelligence and Statistics (AISTATS), 488-495
Electronic Proceedings Article
1
Hide details for Van Emde Boas, Peter (ed.)Van Emde Boas, Peter (ed.)
2004Sanders, PeterAlgorithms for Scalable Storage Servers
In: SOFSEM 2004 : theory and practice of computer science ; 30th Conference on Current Trends in Theory and Practice of Computer Science, 82-101
Proceedings Article
1
Hide details for van Emde Boas, P. (ed.)van Emde Boas, P. (ed.)
1999Sanders, PeterAccessing Multiple Sequences Through Set Associative Caches
In: Proceedings of the 26th International Colloquium on Automata, Languages and Programming (ICALP-99), 655-664
Proceedings Article
1
Hide details for van Hemert, Jano (ed.)van Hemert, Jano (ed.)
2009GECCO 2009: Proceedings of the 11th Annual conference on Genetic and evolutionary computation.Proceedings
1
Hide details for Van Hentenryck, PascalVan Hentenryck, Pascal
2005Katriel, Irit
[Michel, Laurent]
[Van Hentenryck, Pascal]
Maintaining Longest Paths Incrementally
In: Constraints [10], 159-183
Journal Article
2
Hide details for van Hoeij, Mark (ed.)van Hoeij, Mark (ed.)
2012Emeliyanenko, Pavel
Sagraloff, Michael
On the Complexity of Solving a Bivariate Polynomial System
In: ISSAC 2012 : Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, 154-161
Proceedings Article
2012Sagraloff, MichaelWhen Newton meets Descartes: A Simple and Fast Algorithm to Isolate the Real Roots of a Polynomial
In: ISSAC 2012 : Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, 297-304
Proceedings Article
2
Hide details for van Krefeld, Marc (ed.)van Krefeld, Marc (ed.)
2011Berberich, Eric
[Hemmer, Michael]
[Kerber, Michael]
A Generic Algebraic Kernel for Non-linear Geometric Applications
In: Proceedings of the 27th Annual Symposium on Computational Geometry (SCG'11), 179-186
Proceedings Article
2011Berberich, Eric
[Halperin, Dan]
[Kerber, Michael]
[Pogalnikova, Roza]
Deconstructing Approximate Offsets
In: Proceedings of the 27th Annual Symposium on Computational Geometry (SCG'11), 187-196
Proceedings Article
1
Hide details for van Kreveld, Marcvan Kreveld, Marc
1998[de Berg, Marc]
[van Kreveld, Marc]
Schirra, Stefan
Topologically correct subdivision simplification using the bandwidth criterion
In: Cartography and Geographic Information Systems [25], 243-257
Journal Article
1
Hide details for van Kreveld, Marc (ed.)van Kreveld, Marc (ed.)
1997Schirra, StefanPrecision and Robustness in Geometric Computations
In: Algorithmic Foundations of Geographic Information Systems, 255-287
Part of a Book
3
Hide details for van Leeuwen, Erik Janvan Leeuwen, Erik Jan
2012Hermelin, Danny
[Mnich, Matthias]
[van Leeuwen, Erik Jan]
Parameterized complexity of induced H-matching on claw-free graphs
In: Algorithms - ESA 2012 : 20th Annual European Symposium, 624-635
Proceedings Article
2011Hermelin, Danny
[Mnich, Matthias]
[van Leeuwen, Erik Jan]
[Woeginger, Gerhard J.]
Domination When the Stars Are Out
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 462-473
Proceedings Article
2011[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
6
Hide details for van Leeuwen, Jan (ed.)van Leeuwen, Jan (ed.)
1994Burnikel, Christoph
Mehlhorn, Kurt
Schirra, Stefan
Attachment IconHow to Compute the Voronoi Diagram of Line Segments:
Theoretical and Experimental Results
In: Algorithms (ESA-94) : 2nd annual European symposium, 227-239
Proceedings Article
1994Attachment IconIncremental Computation and Dynamic Algorithms 02.05.-06.05.94Report
1992Mehlhorn, Kurt
Näher, Stefan
Attachment IconAlgorithm Design and Software Libraries: Recent Developments in the LEDA Project
In: Proceedings of the IFIP 12th World Computer Congress. Volume 1: Algorithms, Software, Architecture, 493-508
Proceedings Article
1991Fleischer, Rudolf
Jung, Hermann
Mehlhorn, Kurt
A Time-Randomness Tradeoff for Communication Complexity
In: Distributed Algorithms, 4th International Workshop, 390-401
Proceedings Article
1990Mehlhorn, Kurt
Tsakalidis, A.
Data Structures
In: Handbook of Theoretical Computer Science, 301-341
Part of a Book
1980Mehlhorn, KurtAttachment IconPebbling Mountain Ranges and its Application of DCFL-Recognition
In: Automata, languages and programming (ICALP-80) : 7th annual international colloquium, 422-435
Proceedings Article
1
Hide details for van Loon, Joycevan Loon, Joyce
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
1
Hide details for van Moorsel, Aad (ed.)van Moorsel, Aad (ed.)
2004Bast, HolgerDimension Reduction: A Powerful Principle for Automatically Finding Concepts in Unstructured Data
In: International Workshop on Self-* Properties in Complex Information Systems (SELF-STAR 2004), 113-116
Proceedings Article
1
Hide details for van Someren, Maarten W. (ed.)van Someren, Maarten W. (ed.)
2006Bast, Holger
[Dupret, Georges]
Majumdar, Debapriyo
[Piwowarski, Benjamin]
Discovering a Term Taxonomy from Term Similarities Using Principal Component Analysis
In: Semantics, web and mining : Joint International Workshops, EWMF 2005 and KDO 2005, 103-120
Proceedings Article
1
Hide details for van Steen, Maarten (ed.)van Steen, Maarten (ed.)
2004Bast, HolgerDimension Reduction: A Powerful Principle for Automatically Finding Concepts in Unstructured Data
In: International Workshop on Self-* Properties in Complex Information Systems (SELF-STAR 2004), 113-116
Proceedings Article
43
Hide details for van Stee, Robvan Stee, Rob
2015Heydrich, Sandy
[van Stee, Rob]
Dividing Connected Chores Fairly
In: Theoretical Computer Science [593], 51-61
Journal Article
2013[Christodoulou, George]
[Kovacs, Annamaria]
van Stee, Rob
Attachment IconA truthful constant approximation for maximizing the minimum load on related machines
In: Theoretical Computer Science [489-490], 88-98
Journal Article
2013[Epstein, Leah]
[Levin, Asaf]
van Stee, Rob
Attachment IconA unified approach to truthful scheduling on related machines
In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, 1243-1252
Proceedings Article
2013[Heydrich, Sandy]
van Stee, Rob
Attachment IconDividing connected chores fairly
In: 6th International Symposium on Algorithmic Game Theory, 420-433
Proceedings Article
2013[Chen, Xujin]
[Epstein, Leah]
[Kleiman, Elena]
van Stee, Rob
Attachment IconMaximizing the minimum load: The cost of selfishness
In: Theoretical Computer Science [482], 9-19
Journal Article
2013[Sanders, Peter]
[Singler, Johannes]
van Stee, Rob
Attachment IconReal-time prefetching and caching
In: Journal of Scheduling [16], 47-58
Journal Article
2013van Stee, RobSIGACT News Online Algorithms Column 22
In: SIGACT News [44], 125
Journal Article
2012[Chan, Ho-Leung]
Megow, Nicole
[Sitters, René]
van Stee, Rob
Attachment IconA note on sorting buffers offline
In: Theoretical Computer Science [423], 11-18
Journal Article
2012Harren, Rolf
van Stee, Rob
Absolute Approximation Ratios for Packing Rectangles into Bins
In: Journal of Scheduling [15], 63-75
Journal Article
2012van Stee, RobAttachment IconAn improved algorithm for online rectangle filling
In: Theoretical Computer Science [423], 59-74
Journal Article
2012[Epstein, Leah]
[Levin, Asaf]
van Stee, Rob
Attachment IconApproximation Schemes for Packing Splittable Items with Cardinality Constraints
In: Algorithmica [62], 102-129
Journal Article
2012[Epstein, Leah]
[Jez, Lukasz]
[Sgall, Jiri]
van Stee, Rob
Attachment IconOnline Scheduling of Jobs with Fixed Start Times on Related Machines
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 15th International Workshop, APPROX 2012 and 16th International Workshop, RANDOM 2012, 134-145
Proceedings Article
2012van Stee, RobAttachment IconSIGACT News Online Algorithms Column 20: The Power of Harmony
In: SIGACT News [43], 127-136
Journal Article
2012van Stee, RobAttachment IconSIGACT News Online Algorithms Column 21: APPROX and ALGO
In: SIGACT News [43], 123-129
Journal Article
2012[Chen, Xujin]
Doerr, Benjamin
[Hu, Xiaodong]
[Ma, Weidong]
van Stee, Rob
Winzen, Carola
Attachment IconThe Price of Anarchy for Selfish Ring Routing is Two
In: Internet and Network Economics : 8th International Workshop, WINE 2012, 420-433
Proceedings Article
2012[Epstein, Leah]
van Stee, Rob
Attachment IconThe price of anarchy on uniformly related machines revisited
In: Information and Computation [212], 37-54
Journal Article
2011Harren, Rolf
[Jansen, Klaus]
[Prädel, Lars]
van Stee, Rob
Attachment IconA (5/3 + ε)-Approximation for Strip Packing
In: Algorithms and Data Structures : 12th International Symposium, WADS 2011, 475-487
Proceedings Article
2011van Stee, RobAttachment IconAn improved algorithm for online rectangle filling
In: Approximation and Online Algorithms : 8th International Workshop, WAOA 2010, 249-260
Proceedings Article
2011[Epstein, Leah]
van Stee, Rob
Attachment IconImproved results for a memory allocation problem
In: Theory of Computing Systems [48], 79-92
Journal Article
2011[Epstein, Leah]
[Levin, Asaf]
van Stee, Rob
Attachment IconMax-min online allocations with a reordering buffer
In: SIAM Journal on Discrete Mathematics [25], 1230-1250
Journal Article
2011[Epstein, Leah]
van Stee, Rob
On the online unit clustering problem
In: ACM Transactions on Algorithms [7], 7:1-7:1
Journal Article
2010[Christodoulou, George]
[Kovacs, Annamaria]
van Stee, Rob
A truthful constant approximation for maximizing the minimum load on related machines
In: Internet and Network Economics : 6th International Workshop, WINE 2010, 182-193
Proceedings Article
2010[Epstein, Leah]
[Levin, Asaf]
van Stee, Rob
Attachment IconMax-min online allocations with a reordering buffer
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010, 336-347
Proceedings Article
2010[Epstein, Leah]
van Stee, Rob
Maximizing the minimum load for selfish agents
In: Theoretical Computer Science [411], 44-57
Journal Article
2010[Epstein, Leah]
van Stee, Rob
Attachment IconOn the online unit clustering problem
In: ACM Transactions on Algorithms [7], 1-18
Journal Article
2010Christodoulou, George
[Chung, Christine]
[Ligett, Katrina]
Pyrga, Evangelia
van Stee, Rob
Attachment IconOn the price of stability for undirected network design
In: Approximation and Online Algorithms : 7th International Workshop, WAOA 2009, 86-97
Proceedings Article
2009Harren, Rolf
van Stee, Rob
Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 12th International Workshop, APPROX 2009 and 13th International Workshop, RANDOM 2009, 177-189
Proceedings Article
2009[Epstein, Leah]
[Kleiman, Elena]
van Stee, Rob
Maximizing the Minimum Load: The Cost of Selfishness
In: Internet and Network Economics : 5th International Workshop, WINE 2009, 232-243
Proceedings Article
2009[Krumke, Sven]
van Stee, Rob
[Westphal, Stefan]
Attachment IconOnline job admissions
In: Fundamental Problems in Computing : Essays in Honor of Professor Daniel J. Rosenkrantz, 435-454
Part of a Book
2009[Epstein, Leah]
van Stee, Rob
[Tamir, Tami]
Attachment IconPaging with request sets
In: Theory of Computing Systems [44], 67-81
Journal Article
2008[Krumke, Sven Oliver]
[Schwahn, Anne]
van Stee, Rob
[Westphal, Stephan]
Attachment IconA monotone approximation algorithm for scheduling with precedence constraints
In: Operations Research Letters [36], 247-249
Journal Article
2008[Epstein, Leah]
van Stee, Rob
Attachment IconApproximation schemes for packing splittable items with cardinality constraints
In: Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, 232-245
Proceedings Article
2008van Stee, RobAttachment IconCombinatorial algorithms for packing and scheduling problems
Universität Karlsruhe
Thesis - Habilitation thesis
2008[Epstein, Leah]
van Stee, Rob
Attachment IconMaximizing the minimum load for selfish agents
In: LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, 264-275
Proceedings Article
2008[Epstein, Leah]
van Stee, Rob
Attachment IconOn the Online Unit Clustering Problem
In: Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, 193-206
Proceedings Article
2008[Epstein, Leah]
[Levin, Asaf]
van Stee, Rob
Attachment IconOnline unit clustering: Variations on a theme
In: Theoretical Computer Science [407], 85-96
Journal Article
2008van Stee, RobAttachment IconPacket Switching in Single Buffer
In: Encyclopedia of Algorithms, 1-99
Part of a Book
2008Harren, Rolf
van Stee, Rob
Attachment IconPacking Rectangles into 2 OPT Bins using Rotations
In: 11th Scandinavian Workshop on Algorithm Theory, 306-318
Proceedings Article
2008van Stee, RobAttachment IconPaging
In: Encyclopedia of Algorithms, 1-99
Part of a Book
2008[Pruhs, Kirk]
van Stee, Rob
[Uthaisombut, Patchrawat]
Attachment IconSpeed Scaling of Tasks with Precedence Constraints
In: Theory of Computing Systems [43], 67-80
Journal Article
2008[Epstein, Leah]
van Stee, Rob
Attachment IconThe price of anarchy on uniformly related machines revisited
In: Algorithmic Game Theory, First International Symposium, SAGT 2008, 46-57
Proceedings Article
2008[Epstein, Leah]
[Levin, Asaf]
van Stee, Rob
Attachment IconTwo-dimensional packing with conflicts
In: Acta Informatica [45], 155-175
Journal Article
2002[Epstein, Leah]
Imreh, Csanád
[van Stee, Rob]
More on weighted servers or FIFO is better than LRU
In: Mathematical Foundations of Computer Science 2002 : 27th International Symposium, MFCS 2002, 257-268
Proceedings Article
10
Hide details for Van Zuylen, AnkeVan Zuylen, Anke
2012[Schalekamp, Frans]
[Williamson, David P.]
van Zuylen, Anke
A proof of the Boyd-Carr conjecture
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 1477-1486
Proceedings Article
2012[Ailon, Nir]
[Avigdor-Elgrabli, Noa]
[Liberty, Edo]
van Zuylen, Anke
Improved Approximation Algorithms for Bipartite Correlation Clustering
In: SIAM Journal on Computing [41], 1110-1121
Journal Article
2012[Qian, Jiawei]
[Schalekamp, Frans]
[Williamson, David P.]
van Zuylen, Anke
On the Integrality Gap of the Subtour LP for the 1,2-TSP
In: LATIN 2012: Theoretical Informatics ; 10th Latin American Symposium, 606-617
Proceedings Article
2012van Zuylen, AnkeSimpler 3/4-approximation algorithms for MAX SAT
In: Approximation and Online Algorithms : 9th International Workshop, WAOA 2011, 188-197
Proceedings Article
2012Elbassioni, Khaled
[Paluch, Katarzyna]
van Zuylen, Anke
Simpler Approximation of the Maximum Asymmetric Traveling Salesman Problem
In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 501-506
Electronic Proceedings Article
2011van Zuylen, AnkeAn improved monotone algorithm for scheduling related machines with precedence constraints
In: Operations Research Letters [39], 423-427
Journal Article
2011van Zuylen, AnkeDeterministic Sampling Algorithms for Network Design
In: Algorithmica [60], 110-151
Journal Article
2011[Ailon, Nir]
[Avigdor-Elgrabli, Noa]
[Liberty, Noa]
van Zuylen, Anke
Improved Approximation Algorithms for Bipartite Correlation Clustering
In: Algorithms - ESA 2011 : 19th Annual European Symposium, 25-36
Proceedings Article
2011van Zuylen, AnkeLinear programming based approximation algorithms for feedback set problems in bipartite tournaments.
In: Theoretical Computer Science [412], 2556-2561
Journal Article
2011van Zuylen, Anke
[Schalekamp, Frans]
[Williamson, David P.]
Popular Ranking
In: 10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2011, 267-270
Electronic Proceedings Article
2
Hide details for Varadarajan, KasturiVaradarajan, Kasturi
2011[Pemmaraju, Sriram V.]
Raman, Rajiv
[Varadarajan, Kasturi]
Max-coloring and online coloring with bandwidths on interval graphs
In: ACM Transactions on Algorithms [7], 35:1-35:21
Journal Article
2003Telikepalli, Kavitha
[Varadarajan, Kasturi]
On Shortest Paths in Line Arrangements
In: 15th Canadian Conference in Computational Geometry (CCCG-03), 170-173
Proceedings Article
2
Hide details for Varma, GirishVarma, Girish
2012Bonifaci, Vincenzo
Mehlhorn, Kurt
[Varma, Girish]
Physarum Can Compute Shortest Paths
In: Journal of Theoretical Biology [309], 121-133
Journal Article
2012Bonifaci, Vincenzo
Mehlhorn, Kurt
[Varma, Girish]
Physarum Can Compute Shortest Paths
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 233-240
Proceedings Article
1
Hide details for Vayatis, Nicolas (ed.)Vayatis, Nicolas (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
2
Hide details for Vazirani, Vijay V.Vazirani, Vijay V.
1996Garg, Naveen
[Vazirani, Vijay V.]
Approximate max-flow min-(multi)cut theorems and their applications
In: SIAM Journal on Computing [25], 235-251
Journal Article
1995Garg, Naveen
[Vazirani, Vijay V.]
A polyhedron with all s-t cuts as vertices, and adjacency of cuts
In: Mathematical Programming (A) [70], 17-25
Journal Article
1
Hide details for Veeramachaneni, KalyanVeeramachaneni, Kalyan
2011Wagner, Markus
[Veeramachaneni, Kalyan]
[Neumann, Frank]
[O'Reilly, Una-May]
Attachment IconOptimizing the Layout of 1000 Wind Turbines
In: European Wind Energy Association Annual Event, 1-10
Proceedings Article
3
Hide details for Veltkamp, RemcoVeltkamp, Remco
2001[Bäsken, Matthias]
[Brönnimann, Hervé]
[Frank, Da]
[Devillers, Olivier]
[Ester, Ezra]
[Fabri, Andreas]
[Flato, Eyal]
[Gärtner, Bernd]
[Giezeman, Geert-Jan]
[Halperin, Dan]
[Hanniel, Iddo]
[Har-Peled, Sariel]
[Herrmann, Thomas]
Hert, Susan
[Hirsch, Shai]
[Hoffmann, Michael]
Kettner, Lutz
[Nechushtan, Oren]
[Neyer, Gabriele]
[Pasechnik, Dmitrii]
[Pion, Sylvain]
Schirra, Stefan
[Schönherr, Sven]
Seel, Michael
[Teillaud, Monique]
[Veltkamp, Remco]
[Wein, Ron]
[Wesselink, Wieger]
[Yvinec, Mariette]
CGAL Reference and User ManualsUnknown Form: eBookForm
2000Hagedoorn, Michiel
Overmars, Mark H.
Veltkamp, Remco
A New Visibility Partition for Affine Pattern Matching
In: Discrete Geometry for Computer Imagery, Proceedings of the 9th International Conference (DGCI-00), 358-370
Proceedings Article
2000[Brönnimann, Hervé]
[Kettner, Lutz]
Schirra, Stefan
[Veltkamp, Remco]
Applications of the Generic Programming Paradigm in the Design of CGAL
In: Generic programming - International Seminar on Generic Programming Dagstuhl Castle, Germany, April 27 - May 1, 1998, selected papers, 206-216
Part of a Book
1
Hide details for Vengroff, Darren ErikVengroff, Darren Erik
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
1
Hide details for Veni Madhavan, C. E.Veni Madhavan, C. E.
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
1
Hide details for Verbeek, RutgerVerbeek, Rutger
1983von Braunmühl, Burchard
Cook, Stephen
Mehlhorn, Kurt
Verbeek, Rutger
The Recognition of Deterministic CFL's in Small Time and Space
In: Information and Control [56], 34-51
Journal Article
1
Hide details for Vereshchagin, Nikolai (ed.)Vereshchagin, Nikolai (ed.)
2014[Diekert, Volker]
Jez, Artur
[Plandowski, Wojciech]
Finding All Solutions of Equations in Free Groups and Monoids with Involution
In: 9th International Computer Science Symposium in Russia (CSR 2014), 1-15
Proceedings Article
1
Hide details for Vereshchagin, Nikolay (ed.)Vereshchagin, Nikolay (ed.)
2011Doerr, Benjamin
Winzen, Carola
Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity
In: Computer Science - Theory and Applications : 6th International Computer Science Symposium in Russia (CSR 2011), 15-28
Proceedings Article
3
Hide details for Verschae, JoseVerschae, Jose
2013Megow, Nicole
[Verschae, Jose]
Dual techniques for scheduling on a machine with varying speed
In: Proc. of the 40th International Colloquium on Automata, Languages and Programming (ICALP 2013), 745–756
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
2012Megow, Nicole
[Skutella, Martin]
[Verschae, Jose]
Wiese, Andreas
The Power of Recourse for Online MST and TSP
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 689-700
Proceedings Article
2
Hide details for Vialette, StephaneVialette, Stephane
2012Hermelin, Danny
[Rizzi, Romeo]
[Vialette, Stephane]
Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph
In: Algorithms and Computation : 23rd International Symposium, ISAAC 2012, 465-474
Proceedings Article
2011[Fellows, Michael R.]
[Fertin, Guillaume]
Hermelin, Danny
[Vialette, Stephane]
Upper and lower bounds for finding connected motifs in vertex-colored graphs
In: Journal of Computer and System Sciences [77], 799-811
Journal Article
2
Hide details for Vidal-Naquet, Guy (ed.)Vidal-Naquet, Guy (ed.)
1987Kaufmann, Michael
Mehlhorn, Kurt
On Local Routing of Two-Terminal Nets
In: STACS '87 : 4th Annual Symposium on Theoretical Aspects of Computer Science, 40-52
Proceedings Article
1986Mehlhorn, Kurt
Preparata, Franco P.
Area-time Optimal Division for T=Omega(log n)$^1+epsilon$"
In: STACS 86, 3rd Annual Symposium on Theoretical Aspects of Computer Science, 341-352
Proceedings Article
5
Hide details for Vidali, AngelinaVidali, Angelina
2010[Pountourakis, Emmanouil]
Vidali, Angelina
A complete characterization of group-strategyproof mechanisms of cost-sharing.
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. I, 146-157
Proceedings Article
2009Christodoulou, George
[Koutsoupias, Elias]
[Vidali, Angelina]
A lower bound for scheduling mechanisms
In: Algorithmica [85], 729-740
Journal Article
2009Vidali, AngelinaThe Geometry of Truthfulness
In: Internet and Network Economics : 5th International Workshop, WINE 2009, 340-350
Proceedings Article
2008Christodoulou, George
[Koutsoupias, Elias]
[Vidali, Angelina]
A Characterization of 2-Player Mechanisms for Scheduling
In: Algorithms - ESA 2008, 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings., 297-307
Proceedings Article
2007Christodoulou, George
[Koutsoupias, Elias]
[Vidali, Angelina]
A lower bound for scheduling mechanisms
In: ACM-SIAM Symposium on Discrete Algorithms (SODA), 1163-1170
Proceedings Article
1
Hide details for Vijaykumar, P.I.Vijaykumar, P.I.
1996[Krithivasan, Kamala]
[Rema, Anna]
Schirra, Stefan
[Vijaykumar, P.I.]
Velocity planning for a robot moving along the shortest straight line path among moving obstacles
In: Canadian Conference on Computational Geometry (CCCG '96), 149-154
Proceedings Article
3
Hide details for Vilenchik, DanVilenchik, Dan
2011Friedrich, Tobias
[Sauerwald, Thomas]
[Vilenchik, Dan]
Smoothed analysis of balancing networks
In: Random Structures & Algorithms [39], 115-138
Journal Article
2010Friedrich, Tobias
[Sauerwald, Thomas]
[Vilenchik, Dan]
Smoothed Analysis of Balancing Networks
In: Random Structures and Algorithms [Early View], 1-24
Electronic Journal Article
2009Friedrich, Tobias
[Sauerwald, Thomas]
[Vilenchik, Dan]
Smoothed Analysis of Balancing Networks
In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, 472-483
Proceedings Article
2
Hide details for Villanger, YngveVillanger, Yngve
2011[Fomin, Fedor V.]
Philip, Geevarghese
[Villanger, Yngve]
Attachment IconMinimum Fill-in of Sparse Graphs: Kernelization and Approximation
In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, 164-175
Proceedings Article
2010Philip, Geevarghese
[Raman, Venkatesh]
[Villanger, Yngve]
Attachment IconA 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
Hide details for Vinay, V. (ed.)Vinay, V. (ed.)
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
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
5
Hide details for Vingron, MartinVingron, Martin
2000[Kececioglu, John]
Lenhof, Hans-Peter
Mehlhorn, Kurt
Mutzel, Petra
Reinert, Knut
[Vingron, Martin]
Attachment IconA polyhedral approach to sequence alignment problems
In: Discrete Applied Mathematics [104], 143-186
Journal Article
1999Burkhardt, Stefan
Crauser, Andreas
[Ferragina, Paolo]
Lenhof, Hans-Peter
[Rivals, Eric]
[Vingron, Martin]
q-gram Based Database Searching Using a Suffix Array (QUASAR)
In: Proceedings of the 3rd Annual International Conference on Computational Molecular Biology (RECOMB-99), 77-83
Proceedings Article
1998Lenhof, Hans-Peter
Reinert, Knut
[Vingron, Martin]
A Polyhedral Approach to RNA Sequence Structure Alignment
In: Journal of Computational Biology [5], 517-530
Journal Article
1998Lenhof, Hans-Peter
Reinert, Knut
[Vingron, Martin]
A polyhedral approach to RNA sequence structure alignment
In: Proceedings of the 2nd Annual International Conference on Computational Molecular Biology (RECOMB-98), 153-162
Proceedings Article
1997[Vingron, Martin]
Lenhof, Hans-Peter
Mutzel, Petra
Computational Molecular Biology
In: Annotated Bibliographies in Combinatorial Optimization, 445-471
Part of a Book
2
Hide details for Viola, Alfredo (ed.)Viola, Alfredo (ed.)
2014[Gagie, Travis]
Gawrychowski, Pawel
[Kärkkäinen, Juha]
[Nekrich, Yakov]
[Puglisi, Simon J.]
LZ77-Based Self-indexing with Faster Pattern Matching
In: LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31 - April 4, 2014. Proceedings, 731-742
Proceedings Article
2013[Afshani, Peyman]
[Agrawal, Manindra]
Doerr, Benjamin
Doerr, Carola
[Larsen, Kasper Green]
Mehlhorn, Kurt
The Query Complexity of Finding a Hidden Permutation
In: Space-Efficient Data Structures, Streams, and Algorithms, 1-11
Part of a Book
2
Hide details for Vishkin, UziVishkin, Uzi
1984Mehlhorn, Kurt
Vishkin, Uzi
Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
In: Acta Informatica [21], 339-374
Journal Article
1983Mehlhorn, Kurt
Vishkin, Uzi
Granularity of parallel memoriesReport
1
Hide details for Vishwanathan, S .V. N.Vishwanathan, S .V. N.
2009[Shervashidze, Nino]
Vishwanathan, S .V. N.
[Petri, Tobias H.]
Mehlhorn, Kurt
[Borgwardt, Karsten M.]
Attachment IconEfficient Graphlet Kernels for Large Graph Comparison
In: Proceedings of the Twelfth International Conference on Artificial Intelligence and Statistics (AISTATS), 488-495
Electronic Proceedings Article
1
Hide details for Vitanyi, PaulVitanyi, Paul
1998[Panconesi, Alessandro]
Papatriantafilou, Marina
Tsigas, Philippas
[Vitanyi, Paul]
Randomized Naming Using Wait-Free Shared Variables
In: Distributed Computing [11], 113-124
Journal Article
8
Hide details for Vitter, Jeffrey ScottVitter, Jeffrey Scott
2005[Hutchinson, David A.]
Sanders, Peter
[Vitter, Jeffrey Scott]
Duality Between Prefetching and Queued Writing with Parallel Disks
In: SIAM Journal on Computing [34], 1443-1463
Journal Article
2001[Hutchinson, David A.]
Sanders, Peter
[Vitter, Jeffrey Scott]
Duality Between Prefetching and Queued Writing with Parallel Disks
In: Proceedings of the 9th Annual European Symposium on Algorithms (ESA-01), 62-73
Proceedings Article
2001[Hutchinson, David A.]
Sanders, Peter
[Vitter, Jeffrey Scott]
The Power of Duality for Prefetching and Sorting with Parallel Disks
In: Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-01), 334-335
Proceedings Article
1999[Agarwal, Pankaj]
[Arge, Lars]
Brodal, Gerth Stølting
[Vitter, Jeffrey Scott]
I/O-Efficient Dynamic Point Location in Monotone Subdivisions
In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), 11-20
Proceedings Article
1995[Barve, Rakesh D.]
Grove, Edward
[Vitter, Jeffrey Scott]
An Application-Controlled Paging Algorithm for a Shared Cache
In: 36th Annual Symposium on Foundations of Computer Science, 204-213
Proceedings Article
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
1995[Awerbuch, Baruch]
[Azar, Yossi]
Grove, Edward
[Kao, Ming-Yang]
Krishnan, P.
[Vitter, Jeffrey Scott]
Load Balancing in the Euclidean Norm
In: 36th Annual Symposium on Foundations of Computer Science, 383-391
Proceedings Article
1995Grove, Edward
[Kao, Ming-Yang]
[Krishnan, P.]
[Vitter, Jeffrey Scott]
Online Perfect Matching and Mobile Computing
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 194-205
Proceedings Article
1
Hide details for Vitter, Jeffrey Scott (ed.)Vitter, Jeffrey Scott (ed.)
1999Crauser, Andreas
[Ferragina, Paolo]
Mehlhorn, Kurt
Meyer, Ulrich
Ramos, Edgar A.
I/O-optimal computation of segment intersections
In: Proceedings of the DIMACS Workshop on External Algorithms and Visualization, 131-138
Proceedings Article
5
Hide details for Vitter, Jeffrey S. (ed.)Vitter, Jeffrey S. (ed.)
1999[Comes, Jochen]
Ziegelmann, Mark
An Easy to Use Implementation of Linear Perturbations within CGAL
In: Algorithm engineering (WAE-99) : 3rd International Workshop, WAE'99, 169-182
Proceedings Article
1999Brengel, Klaus
Crauser, Andreas
Meyer, Ulrich
[Ferragina, Paolo]
An Experimental Study of Priority Queues in External Memory
In: Algorithm engineering (WAE-99) : 3rd International Workshop, WAE'99, 345-359
Proceedings Article
1999Boghossian, Nicolas Pascal
Kohlbacher, Oliver
Lenhof, Hans-Peter
BALL: Biochemical Algorithms Library
In: Algorithm engineering (WAE-99) : 3rd International Workshop, WAE'99, 330-344
Proceedings Article
1999Crauser, Andreas
Mehlhorn, Kurt
Attachment IconLEDA-SM : Extending LEDA to Secondary Memory
In: Algorithm engineering (WAE-99) : 3rd International Workshop, WAE'99, 228-242
Proceedings Article
1999Mehlhorn, KurtTen Years of LEDA Some Thoughts (Abstract)
In: Algorithm engineering (WAE-99) : 3rd International Workshop, 14-14
Proceedings Article
25
Hide details for Vöcking, BertholdVöcking, Berthold
2013[Fanghänel, Alexander]
[Geulen, Sascha]
Hoefer, Martin
[Vöcking, Berthold]
Online Capacity Maximization in Wireless Networks
In: Journal of Scheduling [16], 81-91
Journal Article
2013Hoefer, Martin
[Kesselheim, Thomas]
[Vöcking, Berthold]
Truthfulness and Stochastic Dominance with Monetary Transfers.
In: 14th Conf. Electronic Commerce (EC-13), 567-582
Proceedings Article
2007Beier, René
[Röglin, Heiko]
[Vöcking, Berthold]
Attachment IconThe Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
In: Integer Programming and Combinatorial Optimization : 12th International IPCO Conference, 53-67
Proceedings Article
2006Beier, René
[Vöcking, Berthold]
Attachment IconAn Experimental Study of Random Knapsack Problems
In: Algorithmica [45], 121-136
Journal Article
2006Beier, René
[Czumaj, Artur]
[Krysta, Piotr]
[Vöcking, Berthold]
Attachment IconComputing Equilibria for a Service Provider Game with (Im)perfect Information
In: ACM Transactions on Algorithms [2], 679-706
Journal Article
2006Beier, René
[Vöcking, Berthold]
Attachment IconTypical Properties of Winners and Losers in Discrete Optimization
In: SIAM Journal on Computing [35], 855-881
Journal Article
2004Beier, Rene
[Krysta, Piotr]
[Czumaj, Artur]
[Vöcking, Berthold]
Computing Equilibria for Congestion Games with (Im)perfect Information
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 739-748
Proceedings Article
2004Beier, Rene
Vöcking, Berthold
Probabilistic Analysis of Knapsack Core Algorithms
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 461-470
Proceedings Article
2004Beier, René
Vöcking, Berthold
Random knapsack in expected polynomial time
In: Journal of Computer and System Sciences [69], 306-329
Journal Article
2004Beier, Rene
Vöcking, Berthold
Typical Properties of Winners and Losers in Discrete Optimization
In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC-04), 343-352
Proceedings Article
2003[Agarwal, Amit]
[Agarwal, Tarun]
[Chopra, Sumit]
[Feldmann, Anja]
[Kammenhuber, Nils]
Krysta, Piotr
[Vöcking, Berthold]
An experimental study of k-splittable scheduling for DNS-based traffic allocation
In: Euro-Par 2003 parallel processing : 9th International Euro-Par Conference ; proceedings, 230-235
Proceedings Article
2003[Krick, Christof]
[Meyer auf der Heide, Friedhelm]
[Räcke, Harald]
Vöcking, Berthold
[Westermann, Matthias]
Data Management in Networks: Experimental Evaluation of a Provably Good Strategy
In: Theory of Computing Systems [35], 217-245
Journal Article
2003Beier, Rene
Vöcking, Berthold
Random Knapsack in Expected Polynomial Time
In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC-03), 232-241
Proceedings Article
2003[Adler, Micah]
[Räcke, Harald]
Sivadasan, Naveen
[Sohler, Christian]
Vöcking, Berthold
Attachment IconRandomized Pursuit-Evasion in Graphs
In: Combinatorics, Probability and Computing [12], 225-244
Journal Article
2003Krysta, Piotr
Sanders, Peter
Vöcking, Berthold
Scheduling and Traffic Allocation for Tasks with Bounded Splittability
In: Mathematical foundations of computer science 2003 : 28th International Symposium, MFCS 2003, 500-510
Proceedings Article
2003Sanders, Peter
Vöcking, Berthold
Tail bounds and expectations for random arc allocation and applications
In: Combinatorics, Probability and Computing [12], 225-244
Journal Article
2002Sanders, Peter
Vöcking, Berthold
Random Arc Allocation and Applications to Disks, Drums and DRAMs
In: Algorithm theory, SWAT 2002 : 8th Scandinavian Workshop on Algorithm Theory, 121-130
Proceedings Article
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
2002[Czumaj, Artur]
Krysta, Piotr
Vöcking, Berthold
Selfish Traffic Allocation for Server Farms
In: Proceedings of the 34th ACM Symposium on Theory of Computing (STOC-02), 287-296
Proceedings Article
2002[Czumaj, Artur]
Vöcking, Berthold
Tight bounds for worst-case equilibria
In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-02), 413-420
Proceedings Article
2001[Rajaraman, Rajmohan]
[Richa, Andrea W.]
Vöcking, Berthold
[Vuppuluri, Gayathri]
A Data Tracking Scheme for General Networks
In: Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-01), 247-254
Proceedings Article
2001Vöcking, BertholdAlmost Optimal Permutation Routing on Hypercubes
In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC-01), 530-539
Proceedings Article
2001Vöcking, BertholdSymmetric vs. Asymmetric Multiple-Choice Algorithms
In: Proceedings of the 2nd International Workshop on Approximation and Randomized Algorithms in Communication Networks (ARACNE), 1-10
Proceedings Article
2000[Maggs, Bruce M.]
Vöcking, Berthold
Improved Routing and Sorting on Multibutterflies
In: Algorithmica [28], 438-464
Journal Article
2000[Karp, Richard]
[Schindelhauer, Christian]
[Shenker, Scott]
Vöcking, Berthold
Randomized Rumor Spreading
In: 41th Annual Symposium on Foundations of Computer Science (FOCS-00), 565-574
Proceedings Article
1
Hide details for Voecking, Berthold (ed.)Voecking, Berthold (ed.)
2013[Heydrich, Sandy]
van Stee, Rob
Attachment IconDividing connected chores fairly
In: 6th International Symposium on Algorithmic Game Theory, 420-433
Proceedings Article
1
Hide details for Voigt, MarcoVoigt, Marco
2013Doerr, Benjamin
Kodric, Bojana
Voigt, Marco
Lower bounds for the runtime of a global multi-objective evolutionary algorithm
In: IEEE Congress on Evolutionary Computation, 432-439
Proceedings Article
2
Hide details for Vojtas, Peter (ed.)Vojtas, Peter (ed.)
2003Krysta, Piotr
Sanders, Peter
Vöcking, Berthold
Scheduling and Traffic Allocation for Tasks with Bounded Splittability
In: Mathematical foundations of computer science 2003 : 28th International Symposium, MFCS 2003, 500-510
Proceedings Article
2003Banderier, Cyril
Beier, Rene
Mehlhorn, Kurt
Attachment IconSmoothed Analysis of Three Combinatorial Problems
In: Mathematical foundations of computer science 2003 : 28th International Symposium, MFCS 2003, 198-207
Proceedings Article
1
Hide details for Vollmar, R.Vollmar, R.
2002Sanders, Peter
[Vollmar, R.]
[Worsch, T.]
Feasible models of computation: Three-dimensionality and energy consumption
In: Fundamenta Informaticae [52], 233-248
Journal Article
1
Hide details for von Braunmühl, Burchardvon Braunmühl, Burchard
1983von Braunmühl, Burchard
Cook, Stephen
Mehlhorn, Kurt
Verbeek, Rutger
The Recognition of Deterministic CFL's in Small Time and Space
In: Information and Control [56], 34-51
Journal Article
1
Hide details for von Stengel, Bernhardvon Stengel, Bernhard
1995Albers, Susanne
[von Stengel, Bernhard]
[Wechner, Ralph]
A combined BIT and TIMESTAMP algorithm for the list update problem
In: Information Processing Letters [56], 135-139
Journal Article
1
Hide details for von Zülow, Max Henningvon Zülow, Max Henning
1994von Zülow, Max HenningDas k-Closest-Pair-Problem
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Voorhees, Ellen M. (ed.)Voorhees, Ellen M. (ed.)
2006Bast, Holger
Majumdar, Debapriyo
Schenkel, Ralf
Theobald, Martin
Weikum, Gerhard
IO-Top-k at TREC 2006: Terabyte Track
In: The Fifteenth Text Retrieval Conference Proceedings, TREC 2006, 1-5
Electronic Proceedings Article
2
Hide details for Vorozhtsov, Evgenii V. (ed.)Vorozhtsov, Evgenii V. (ed.)
2005Eigenwillig, Arno
Kettner, Lutz
[Krandick, Werner]
Mehlhorn, Kurt
Schmitt, Susanne
Wolpert, Nicola
Attachment IconA Descartes algorithm for polynomials with bit-stream coefficients
In: Computer Algebra in Scientific Computing : 8th International Workshop, CASC 2005, 138-149
Proceedings Article
2005Schmitt, SusanneAttachment IconThe diamond operator - Implementation of exact real algebraic numbers
In: Computer Algebra in Scientific Computing, 8th International Workshop, CASC 2005, 355-366
Proceedings Article
1
Hide details for Vorozhtsov, Evgenii (ed.)Vorozhtsov, Evgenii (ed.)
2009Kerber, MichaelAttachment IconOn the Complexity of Reliable Root Approximation
In: Computer Algebra in Scientific Computing : 11th International Workshop, CASC 2009, 155-167
Proceedings Article
2
Hide details for Voss, ThomasVoss, Thomas
2013Bringmann, Karl
[Friedrich, Tobias]
[Igel, Christian]
[Voß, Thomas]
Speeding Up Many-Objective Optimization by Monte Carlo Approximations
In: Artificial Intelligence [204], 22–29
Journal Article
2011Friedrich, Tobias
[Bringmann, Karl]
[Voss, Thomas]
[Igel, Christian]
The Logarithmic Hypervolume Indicator
In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, 81-92
Proceedings Article
1
Hide details for Vovk, Vladimir (ed.)Vovk, Vladimir (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
Hide details for Vredeveld, TjarkVredeveld, Tjark
2003[Becchetti, Luca]
[Leonardi, Stefano]
[Marchetti-Spaccamela, Alberto]
Schäfer, Guido
[Vredeveld, Tjark]
Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm
In: 44th Annual Symposium on Foundations of Computer Science (FOCS-03), 462-471
Proceedings Article
1
Hide details for Vuppuluri, GayathriVuppuluri, Gayathri
2001[Rajaraman, Rajmohan]
[Richa, Andrea W.]
Vöcking, Berthold
[Vuppuluri, Gayathri]
A Data Tracking Scheme for General Networks
In: Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-01), 247-254
Proceedings Article
3
Hide details for Wagener, HubertWagener, Hubert
1988Alt, Helmut
Mehlhorn, Kurt
Wagener, Hubert
Welzl, Emo
Attachment IconCongruence, Similarity, and Symmetries of Geometric Objects
In: Discrete and Computational Geometry [3], 237-256
Journal Article
1987[Alt, Helmut]
Mehlhorn, Kurt
[Wagener, Hubert]
[Welzl, Emo]
Attachment IconCongruence, similarity and symmetries of geometric objectsReport
1987Alt, Helmut
Mehlhorn, Kurt
Wagener, Hubert
Welzl, Emo
Convergence, Similarity and Symmetries of Geometric Objects
In: Computational geometry (SCG-87) : 3rd symposium, 308-315
Proceedings Article
1
Hide details for Wagner, DorotheaWagner, Dorothea
2007Pyrga, Evangelia
[Schulz, Frank]
[Wagner, Dorothea]
[Zaroliagis, Christos]
Efficient models for timetable information in public transportation systems
In: ACM Journal of Experimental Algorithmics [12], 1-39
Journal Article
3
Hide details for Wagner, Dorothea (ed.)Wagner, Dorothea (ed.)
2007[Klein, Rolf]
Kutz, Martin
Attachment IconComputing Geometric Minimum-Dilation Graphs Is NP-Hard
In: Graph Drawing : 14th International Symposium, GD 2006, 196-207
Proceedings Article
2001[Eiglsperger, Markus]
Fekete, Sandor P.
Klau, Gunnar W.
Orthogonal Graph Drawing
In: Drawing Graphs: Methods and Models, 121-171
Part of a Book
2000Mehlhorn, Kurt
Schäfer, Guido
Attachment IconImplementation of $O(nm \log n)$ weighted matchings: The power of data structures
In: 4th International Workshop on Algorithm Engineering, 23-38
Proceedings Article
2
Hide details for Wagner, FrankWagner, Frank
2000Chaudhuri, Shiva
[Subrahmanyam, K. V.]
[Wagner, Frank]
[Zaroliagis, Christos]
Computing mimicking networks
In: Algorithmica [26], 31-49
Journal Article
1998Chaudhuri, Shiva
[Subrahmanyam, K. V.]
[Wagner, Frank]
Zaroliagis, Christos
Computing Mimicking Networks
In: Proceedings of the 25th International Colloquium on Automata, Languages and Programming (ICALP-98), 556-567
Proceedings Article
1
Hide details for Wagner, Klaus W. (ed.)Wagner, Klaus W. (ed.)
2009Wahlström, MagnusNew Plain-Exponential Time Classes for Graph Homomorphism
In: Computer Science – Theory and Applications : 4th International Computer Science Symposium in Russia, CSR 2009, 346-355
Proceedings Article
2
Hide details for Wagner, LisaWagner, Lisa
2013Hoefer, Martin
[Wagner, Lisa]
Designing Profit Shares in Matching and Coalition Formation Games
In: 9th Conference on Web and Internet Economics (WINE-13), 249-262
Proceedings Article
2013Hoefer, Martin
[Wagner, Lisa]
Locally Stable Marriage with Strict Preferences
In: 40th International Colloquium on Automata, Languages and Programming (ICALP-13), 620-631
Proceedings Article
4
Hide details for Wagner, MarkusWagner, Markus
2011Bringmann, Karl
Friedrich, Tobias
[Neumann, Frank]
[Wagner, Markus]
Approximation-guided evolutionary multi-objective optimization
In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI 2011), 1198-1203
Proceedings Article
2011Doerr, Benjamin
Johannsen, Daniel
Kötzing, Timo
[Lehre, Per Christian]
Wagner, Markus
Winzen, Carola
Faster black-box algorithms through higher arity operators
In: Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI (FOGA 2011), 163-172
Proceedings Article
2011Wagner, Markus
[Veeramachaneni, Kalyan]
[Neumann, Frank]
[O'Reilly, Una-May]
Attachment IconOptimizing the Layout of 1000 Wind Turbines
In: European Wind Energy Association Annual Event, 1-10
Proceedings Article
2011Kö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
25
Hide details for Wahlström, MagnusWahlström, Magnus
2013Wahlström, MagnusAbusing the Tutte Matrix: An Algebraic Instance Compression for the K-set-cycle Problem
In: 29th International Symposium on Theoretical Aspects of Computer Science (STACS-13),
Electronic Proceedings Article
2013Doerr, Carola
[Gnewuch, Michael]
Wahlström, Magnus
Calculation of Discrepancy Measures and Applications
In: A Panorama of Discrepancy Theory, 1-55
Part of a Book
2012[Gnewuch, Michael]
Wahlström, Magnus
Winzen, Carola
A New Randomized Algorithm to Approximate the Star Discrepancy Based on Threshold Accepting
In: SIAM Journal on Numerical Analysis [50], 781-807
Journal Article
2012[Cygan, Marek]
[Kratsch, Stefan]
[Pilipczuk, Marcin]
[Pilipczuk, Michał]
Wahlström, Magnus
Clique Cover and Graph Separation: New Incompressibility Results
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 254-265
Proceedings Article
2012[Kratsch, Stefan]
Wahlström, Magnus
Compression via matroids: a randomized polynomial kernel for odd cycle transversal
In: Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 94-103
Proceedings Article
2012[Kratsch, Stefan]
[Pilipczuk, Marcin]
[Pilipczuk, Michał]
Wahlström, Magnus
Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs
In: Automata, Languages, and Programming ; 39th International Colloquium, ICALP 2012, 581-593
Proceedings Article
2012[Giannopoulos, Panos]
[Knauer, Christian]
Wahlström, Magnus
[Werner, Daniel]
Hardness of discrepancy computation and ε-net verification in high dimension
In: Journal of Complexity [28], 162-176
Journal Article
2012[Cygan, Marek]
[Dell, Holger]
[Lokshtanov, Daniel]
[Marx, Daniel]
[Nederlof, Jesper]
[Okamoto, Yoshio]
[Paturi, Ramamohan]
[Saurabh, Saket]
Wahlström, Magnus
On Problems as Hard as CNF-SAT
In: 2012 IEEE 27th Conference on Computational Complexity (CCC 2012), 74-84
Proceedings Article
2012[Kratsch, Stefan]
Wahlström, Magnus
Representative Sets and Irrelevant Vertices: New Tools for Kernelization
In: IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS-12), 450-459
Proceedings Article
2012[Lokshtanov, Daniel]
[Saurabh, Saket]
Wahlström, Magnus
Subexponential Parameterized Odd Cycle Transversal on Planar Graphs
In: 32nd International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012), 424-434
Electronic Proceedings Article
2011Doerr, Benjamin
[Künnemann, Marvin]
Wahlström, Magnus
Dependent Randomized Rounding: The Bipartite Case
In: 2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX), 96-106
Proceedings Article
2011Wahlström, MagnusNew Plain-Exponential Time Classes for Graph Homomorphism
In: Theory of Computing Systems [49], 273-282
Journal Article
2011Hermelin, Danny
[Huang, Chien-Chung]
[Kratsch, Stefan]
Wahlström, Magnus
Parameterized Two-Player Nash Equilibrium
In: Graph-Theoretic Concepts in Computer Science : 37th International Workshop, WG 2011, 215-226
Proceedings Article
2010Doerr, Benjamin
[Gnewuch, Michael]
Wahlström, Magnus
Algorithmic construction of low-discrepancy point sets via dependent randomized rounding
In: Journal of Complexity [26], 490-507
Journal Article
2010Kratsch, Stefan
[Marx, Dániel]
Wahlström, Magnus
Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems
In: Mathematical Foundations of Computer Science 2010 : 35th International Symposium, MFCS 2010, 489-500
Proceedings Article
2010Kratsch, 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
2010Doerr, Benjamin
[Künnemann, Marvin]
Wahlström, Magnus
Randomized Rounding for Routing and Covering Problems: Experiments and Improvements
In: Experimental Algorithms : 9th International Symposium, SEA 2010, 190-201
Proceedings Article
2009[Böcker, Sebastian]
[Hüffner, Falk]
[Truss, Anke]
Wahlström, Magnus
A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams
In: Parameterized and Exact Computation : 4th International Workshop, IWPEC 2009, 38-49
Proceedings Article
2009Doerr, Benjamin
Fouz, Mahmoud
[Schmidt, Martin]
Wahlström, Magnus
BBOB: Nelder-Mead with resize and halfruns
In: Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference (GECCO 2009), 2239-2246
Proceedings Article
2009Doerr, Benjamin
[Gnewuch, Michael]
Wahlström, Magnus
Implementation of a component-by-component algorithm to generate small low-discrepancy samples
In: Monte Carlo and Quasi-Monte Carlo Methods 2008, 323-338
Proceedings Article
2009Wahlström, MagnusNew Plain-Exponential Time Classes for Graph Homomorphism
In: Computer Science – Theory and Applications : 4th International Computer Science Symposium in Russia, CSR 2009, 346-355
Proceedings Article
2009Doerr, Benjamin
Wahlström, Magnus
Randomized Rounding in the Presence of a Cardinality Constraint
In: 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX), 162-174
Proceedings Article
2009Johannsen, Daniel
[Razgon, Igor]
Wahlström, Magnus
Attachment IconSolving SAT for CNF formulas with a one-sided variable occurrence restriction
In: Theory and Applications of Satisfiability Testing, SAT 2009 : 12th International Conference, SAT 2009, 80-85
Proceedings Article
2009Kratsch, Stefan
Wahlström, Magnus
Two Edge Modification Problems without Polynomial Kernels
In: Parameterized and Exact Computation : 4th International Workshop, IWPEC 2009, 264-275
Proceedings Article
2008Wahlström, MagnusA Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances
In: 3rd International Workshop on Parameterized and Exact Computation (IWPEC 2008), 202-213
Proceedings Article
2
Hide details for Wahl, JürgenWahl, Jürgen
2007[Xu, Chihao]
Karrenbauer, Andreas
[Soh, Kian Min]
[Wahl, Jürgen]
A New Addressing Scheme for PM OLED Display
In: SID 2007 International Symposium Digest of Technical Papers, 97-100
Proceedings Article
2005[Xu, Chihao]
[Wahl, Jürgen]
[Eeisenbrand, Friedrich]
Karrenbauer, Andreas
[Soh, Kian Min]
[Hitzelberger, Christoph]
Verfahren zur Ansteuerung von MatrixanzeigenMiscellaneous
2
Hide details for Wahl, MichaelaWahl, Michaela
2000Wahl, MichaelaEin neuer Algorithmus für Online-Scheduling
Universität des Saarlandes
Thesis - Masters thesis
2000Fleischer, Rudolf
Wahl, Michaela
Online scheduling revisited
In: Algorithms - ESA 2000, Proceedings of the 8th Annual European Symposium (ESA-00), 202-210
Proceedings Article
1
Hide details for Waldmann, UweWaldmann, Uwe
2005Mehlhorn, Kurt
Waldmann, Uwe
[Wilhelm, Reinhard]
Harald Ganzinger : 31.10.1950 - 3.6.2004
In: MPG-Jahrbuch, 107-108
In: Jahrbuch / Max-Planck-Gesellschaft [?], 107-108
Part of a Book
3
Hide details for Walsh, Toby (ed.)Walsh, Toby (ed.)
2011Bringmann, Karl
Friedrich, Tobias
[Neumann, Frank]
[Wagner, Markus]
Approximation-guided evolutionary multi-objective optimization
In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI 2011), 1198-1203
Proceedings Article
2011[Fellows, Michael R.]
Friedrich, Tobias
Hermelin, Danny
[Narodytska, Nina]
[Rosamond, Frances A.]
Constraint Satisfaction Problems: Convexity Makes All Different Constraints Tractable
In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI 2011), 522-527
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
1
Hide details for Walukiewicz, Igor (ed.)Walukiewicz, Igor (ed.)
2008Christodoulou, George
[Kovács, Annamária]
[Schapira, Michael]
Bayesian Combinatorial Auctions
In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I, 820-832
Proceedings Article
1
Hide details for Wang, Junxian (ed.)Wang, Junxian (ed.)
2009Emeliyanenko, Pavel
Berberich, Eric
Sagraloff, Michael
Attachment IconVisualizing Arcs of Implicit Algebraic Curves, Exactly and Fast
In: Advances in Visual Computing : 5th International Symposium, ISVC 2009, 608-619
Proceedings Article
2
Hide details for Wang, Lusheng (ed.)Wang, Lusheng (ed.)
2005[Khachiyan, Leonid]
[Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
A New Algorithm for the Hypergraph Transversal Problem
In: Computing and combinatorics : 11th Annual International Conference, COCOON 2005, 767-776
Proceedings Article
2005Kutz, Martin
[Pór, Attila]
Attachment IconAngel, Devil, and King
In: Computing and Combinatorics : 11th Annual International Conference, COCOON 2005, 925-934
Proceedings Article
2
Hide details for Wang, PengmingWang, Pengming
2013Mehlhorn, Kurt
Sagraloff, Michael
Wang, Pengming
From Approximate Factorization to Root Isolation with Application to Cylindrical Algebraic Decomposition
In: arXiv [abs/1301.4870],
Electronic Journal Article
2012Wang, PengmingCertification of Curve Arrangements
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Wang, YusuWang, Yusu
2006Funke, Stefan
[Guibas, Leonidas]
[Nguyen, An]
[Wang, Yusu]
Distance-Sensitive Information Brokerage in Sensor Networks
In: Distributed Computing in Sensor Systems, Second IEEE International Conference, DCOSS 2006, 234-251
Proceedings Article
1
Hide details for Wanka, RolfWanka, Rolf
2009[Helwig, Sabine]
Neumann, Frank
[Wanka, Rolf]
Particle Swarm Optimization with Velocity Adaptation
In: 2009 International Conference on Adaptive and Intelligent Systems ICAIS 2009 : proceedings, 146-151
Proceedings Article
3
Hide details for Warken, ThomasWarken, Thomas
2004Warken, ThomasCollision detection for Curved Rigid Objects in the Context of Dynamics Simulations
Universität des Saarlandes
Thesis - PhD thesis
2002Schömer, Elmar
Reichel, Joachim
Warken, Thomas
Lennerz, Christian
Efficient Collision Detection for Curved Solid Objects
In: Proceedings of the Seventh ACM Symposium on Solid Modeling and Applications, 321-328
Proceedings Article
2001Warken, Thomas
Schömer, Elmar
Rolling Rigid Objects
In: Proceedings of the 9th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision (WSCG-01), 57-62
Proceedings Article
1
Hide details for Warken, Thomas (ed.)Warken, Thomas (ed.)
2002Goesele, Michael
Kautz, Jan
Lang, Jochen
Lensch, Hendrik P. A.
Seidel, Hans-Peter
7th ACM Symposium on Solid Modeling and Applications; Tutorial T1: Geometric Algorithms for Planning and Simulation Tasks in Virtual PrototypingProceedings
1
Hide details for Warnow, Tandy (ed.)Warnow, Tandy (ed.)
2003Telikepalli, 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
1
Hide details for Watanabe, Osamu (ed.)Watanabe, Osamu (ed.)
2011Friedrich, Tobias
Sauerwald, Thomas
[Stauffer, Alexandre]
Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions
In: 22nd International Symposium on Algorithms and Computation (ISAAC-11), 190-199
Proceedings Article
3
Hide details for Waterman, Michael (ed.)Waterman, Michael (ed.)
2000Althaus, Ernst
Kohlbacher, Oliver
Lenhof, Hans-Peter
Müller, Peter
A Combinatorial Approach to Protein Docking with Flexible Side-Chains
In: Proceedings of the 4th Annual International Conference on Computational Molecular Biology (RECOMB-00), 15-24
Proceedings Article
1999Burkhardt, Stefan
Crauser, Andreas
[Ferragina, Paolo]
Lenhof, Hans-Peter
[Rivals, Eric]
[Vingron, Martin]
q-gram Based Database Searching Using a Suffix Array (QUASAR)
In: Proceedings of the 3rd Annual International Conference on Computational Molecular Biology (RECOMB-99), 77-83
Proceedings Article
1998Lenhof, Hans-Peter
Reinert, Knut
[Vingron, Martin]
A polyhedral approach to RNA sequence structure alignment
In: Proceedings of the 2nd Annual International Conference on Computational Molecular Biology (RECOMB-98), 153-162
Proceedings Article
1
Hide details for Watson, Jean-Paul (ed.)Watson, Jean-Paul (ed.)
2008Neumann, Frank
[Witt, Carsten]
Ant Colony Optimization and the Minimum Spanning Tree Problem
In: International Conference on Learning and Intelligent Optimization 2007, 153-166
Proceedings Article
1
Hide details for Watson, Richard (ed.)Watson, Richard (ed.)
2007GECCO 2007: Proceedings of the 9th Annual Conference on Genetic and Evolutionary ComputationProceedings
7
Hide details for Wattenhofer, Roger (ed.)Wattenhofer, Roger (ed.)
2012Elbassioni, KhaledA QPTAS for ε-Envy-Free Profit-Maximizing Pricing on Line Graphs
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 513-524
Proceedings Article
2012Schmidt, Jens M.Certifying 3-Connectivity in Linear Time
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 786-797
Proceedings Article
2012[Cygan, Marek]
[Kratsch, Stefan]
[Pilipczuk, Marcin]
[Pilipczuk, Michał]
Wahlström, Magnus
Clique Cover and Graph Separation: New Incompressibility Results
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 254-265
Proceedings Article
2012[Kane, Daniel]
Mehlhorn, Kurt
Sauerwald, Thomas
Sun, He
Counting Arbitrary Subgraphs in Data Streams
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 598-609
Proceedings Article
2012Bringmann, Karl
[Panagiotou, Konstantinos]
Attachment IconEfficient Sampling Methods for Discrete Distributions
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 133-144
Proceedings Article
2012[Kratsch, Stefan]
[Pilipczuk, Marcin]
[Pilipczuk, Michał]
Wahlström, Magnus
Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs
In: Automata, Languages, and Programming ; 39th International Colloquium, ICALP 2012, 581-593
Proceedings Article
2012Megow, Nicole
[Skutella, Martin]
[Verschae, Jose]
Wiese, Andreas
The Power of Recourse for Online MST and TSP
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 689-700
Proceedings Article
1
Hide details for Weber, AndreasWeber, Andreas
2006[Brown, Christopher]
El Kahoui, M'hammed
[Novotni, Dominik]
[Weber, Andreas]
Attachment IconAlgorithmic methods for investigating equilibria in epidemic modeling
In: Journal of Symbolic Computation [41], 1157-1173
Journal Article
3
Hide details for Weber, DennisWeber, Dennis
2006Weber, DennisSolving large Sparse Linear Systems exactly
Universität des Saarlandes
Thesis - Masters thesis
2004Berberich, Eric
Eigenwillig, Arno
[Hemmer, Michael]
[Hert, Susan]
Kettner, Lutz
Mehlhorn, Kurt
Reichel, Joachim
Schmitt, Susanne
[Schömer, Elmar]
Weber, Dennis
Wolpert, Nicola
EXACUS: Efficient and Exact Algorithms for Curves and SurfacesReport
2003Dhiflaoui, Marcel
Funke, Stefan
Kwappik, Carsten
Mehlhorn, Kurt
Seel, Michael
Schömer, Elmar
Schulte, Ralph
Weber, Dennis
Attachment IconCertifying and Repairing Solutions to Large LPs - How Good are LP-Solvers?
In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 255-256
Proceedings Article
12
Hide details for Weber, IngmarWeber, Ingmar
2007Weber, IngmarAttachment IconEfficient Index Structures for and Applications of the CompleteSearch Engine
Universität des Saarlandes
Thesis - PhD thesis
2007Bast, Holger
[Majumdar, Debapriyo]
Weber, Ingmar
Efficient interactive query expansion with CompleteSearch
In: 16th Conference on Information and Knowledge Management (CIKM'07), 857-860
Proceedings Article
2007Bast, 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
2007Bast, Holger
Weber, Ingmar
Managing Helpdesk Tasks with CompleteSearch: A Case Study
In: 4th Conference on Professional Knowledge Management (WM'07), 101-108
Proceedings Article
2007Bast, Holger
Weber, Ingmar
Attachment IconThe CompleteSearch Engine: Interactive, Efficient, and Towards IR & DB integration
In: CIDR 2007 : 3rd Biennial Conference on Innovative Data Systems Research, 88-95
Electronic Proceedings Article
2006Bast, Holger
[Mortensen, Christian Worm]
Weber, Ingmar
Attachment IconOutput-Sensitive Autocompletion Search
In: String Processing and Information Retrieval : 13th International Conference, SPIRE 2006, 150-162
Proceedings Article
2006[Lotker, Zvi]
Majumdar, Debapriyo
[Narayanaswamy, N.S.]
Weber, Ingmar
Sequences Characterizing k-Trees
In: Computing and Combinatorics, 12th Annual International Conference, COCOON 2006, 216-225
Proceedings Article
2006Bast, Holger
Weber, Ingmar
Attachment IconType Less, Find More: Fast Autocompletion Search with a Succinct Index
In: SIGIR 2006: Proceedings of the 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 364-371
Proceedings Article
2006Bast, Holger
Weber, Ingmar
When You're Lost For Words: Faceted Search With Autocompletion
In: SIGIR'06 Workshop on Faceted Search, 31-35
Proceedings Article
2005[Bifet, Albert]
[Castillo, Carlos]
[Chirita, Paul-Elexandru]
Weber, Ingmar
An Analysis of Factors Used in Search Engine Ranking
In: 1st International Workshop on Adversarial Information Retrieval on the Web (AIRWeb'05), 1-10
Electronic Proceedings Article
2005Bast, Holger
Weber, Ingmar
Don't Compare Averages
In: 4th International Workshop on Efficient and Experimental Algorithms (WEA'05), 67-76
Proceedings Article
2005Bast, Holger
Weber, Ingmar
Insights from Viewing Ranked Retrieval as Rank Aggregation
In: Workshop on Challenges in Web Information Retrieval and Integration (WIRI'05), 243-248
Proceedings Article
1
Hide details for Wechner, RalphWechner, Ralph
1995Albers, Susanne
[von Stengel, Bernhard]
[Wechner, Ralph]
A combined BIT and TIMESTAMP algorithm for the list update problem
In: Information Processing Letters [56], 135-139
Journal Article
2
Hide details for Wedelin, DagWedelin, Dag
1999Sanders, Peter
[Takkula, Tuomo]
[Wedelin, Dag]
High performance integer optimization for crew scheduling
In: Proceedings of the 7th International Conference on High-Performance Computing and Networking Europe (HPCN Europe-99), 3-12
Proceedings Article
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
2
Hide details for Wegener, IngoWegener, Ingo
2010Doerr, Benjamin
Neumann, Frank
[Wegener, Ingo]
Editorial
In: Algorithmica [57], 119-120
Journal Article
2007Neumann, Frank
[Wegener, Ingo]
Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem
In: Theoretical Computer Science [378], 32-40
Journal Article
4
Hide details for Wegener, Ingo (ed.)Wegener, Ingo (ed.)
2008GECCO 2008: Proceedings of the 10th Annual Conference on Genetic and Evolutionary ComputationProceedings
2007GECCO 2007: Proceedings of the 9th Annual Conference on Genetic and Evolutionary ComputationProceedings
2006[Hariharan, Ramesh]
[Telikepalli, Kavitha]
Mehlhorn, Kurt
Attachment IconA Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs
In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Part I, 250-261
Proceedings Article
2006Mehlhorn, Kurt
Osbild, Ralf
Sagraloff, Michael
Attachment IconReliable and Efficient Computational Geometry Via Controlled Perturbation
In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Part I, 299-310
Proceedings Article
1
Hide details for Wegener, I. (ed.)Wegener, I. (ed.)
2006Harren, RolfAttachment IconApproximating the Orthogonal Knapsack Problem for Hypercubes
In: Automata, Languages and Programming, 238-249
Proceedings Article
1
Hide details for Wegner, Lutz (ed.)Wegner, Lutz (ed.)
2003Mehlhorn, KurtAttachment IconThe reliable algorithmic software challenge RASC : dedicated to Thomas Ottmann on the occassion of his 60th birthday
In: Computer Science in Perspective : essays dedicated to Thomas Ottmann, 255-263
Part of a Book
1
Hide details for Weickert, JoachimWeickert, Joachim
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
2
Hide details for Weihrauch, Klaus (ed.)Weihrauch, Klaus (ed.)
1979Blum, Norbert
Mehlhorn, Kurt
Attachment IconMittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten Bäumen
In: Theoretical Computer Science, 4th GI-Conference, 67-78
Proceedings Article
1979Mehlhorn, KurtAttachment IconSorting Presorted Files
In: Theoretical Computer Science, 4th GI-Conference, 199-212
Proceedings Article
5
Hide details for Weikum, GerhardWeikum, Gerhard
2007Weikum, Gerhard
Bast, Holger
[Canright, Geoffrey]
[Hales, David]
[Schindelhauer, Christian]
[Triantafillou, Peter]
Towards Peer-to-Peer Web Search
In: 1st European Conference on Complex Systems, ECCS'05, ?
Proceedings Article
2006Bast, Holger
Majumdar, Debapriyo
Schenkel, Ralf
Theobald, Martin
Weikum, Gerhard
IO-Top-k at TREC 2006: Terabyte Track
In: The Fifteenth Text Retrieval Conference Proceedings, TREC 2006, 1-5
Electronic Proceedings Article
2006Bast, Holger
Majumdar, Debapriyo
Schenkel, Ralf
Theobald, Martin
Weikum, Gerhard
Attachment IconIO-Top-k: Index-Access Optimized Top-k Query ProcessingReport
2006Bast, Holger
Majumdar, Debapriyo
Schenkel, Ralf
Theobald, Martin
Weikum, Gerhard
Attachment IconIO-Top-k: Index-Access Optimized Top-k Query Processing
In: Proceedings of the 32nd International Conference on Very Large Data Bases, VLDB 2006, 475-486
Proceedings Article
2005Weikum, Gerhard
Bast, Holger
[Canright, Geoffrey]
[Hales, David]
[Schindelhauer, Christian]
[Triantafillou, Peter]
Towards Self-Organizing Query Routing and Processing for Peer-to-Peer Web Search
In: Workshop on Peer-to-peer Data Management in the Complex Systems Perspective, 7-24
Proceedings Article
1
Hide details for Weikum, Gerhard (ed.)Weikum, Gerhard (ed.)
2007Bast, Holger
Weber, Ingmar
Attachment IconThe CompleteSearch Engine: Interactive, Efficient, and Towards IR & DB integration
In: CIDR 2007 : 3rd Biennial Conference on Innovative Data Systems Research, 88-95
Electronic Proceedings Article
4
Hide details for Weil, Pascal (ed.)Weil, Pascal (ed.)
2008[Meyer, Ulrich]On Dynamic Breadth-First Search in External-Memory
In: Proc. 25th Annual Symposium on Theoretical Aspects (STACS), 551-560
Proceedings Article
2007Funke, Stefan
Laue, Sören
Attachment IconBounded-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
Attachment IconNew Approximation Algorithms for Minimum Cycle Bases of Graphs
In: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, 512-523
Proceedings Article
2007Doerr, BenjaminAttachment IconRandomly Rounding Rationals with Cardinality Constraints and Derandomizations
In: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, 441-452
Proceedings Article
2
Hide details for Weimann, OrenWeimann, Oren
2014Gawrychowski, Pawel
[Mozes, Shay]
[Weimann, Oren]
Improved Submatrix Maximum Queries in Monge Matrices
In: Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I, 525-537
Proceedings Article
2011Hermelin, Danny
[Levy, Avivit]
[Weimann, Oren]
[Yuster, Raphael]
Distance Oracles for Vertex-Labeled Graphs
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 490-501
Proceedings Article
1
Hide details for Weinand, CarolineWeinand, Caroline
2005Weinand, CarolineFill-in Reduction while Solving large, sparse Linear Systems with Graph Theoretical Methods
Universität des Saarlandes
Thesis - Masters thesis
8
Hide details for Wein, RonWein, Ron
2010Berberich, Eric
[Fogel, Efi]
[Halperin, Dan]
Mehlhorn, Kurt
[Wein, Ron]
Arrangements on Parametric Surfaces I: General Framework and Infrastructure
In: Mathematics in Computer Science [4], 45-66
Journal Article
2007[Fogel, Efi]
[Halperin, Dan]
Kettner, Lutz
[Teillaud, Monique]
[Wein, Ron]
Wolpert, Nicola
Attachment IconArrangements
In: Effective Computational Geometry for Curves and Surfaces, 1-66
Part of a Book
2007Berberich, Eric
[Fogel, Efi]
[Halperin, Dan]
Mehlhorn, Kurt
[Wein, Ron]
Sweeping and Maintaining Two-Dimensional Arrangements on QuadricsReport
2007Berberich, Eric
[Fogel, Efi]
[Halperin, Dan]
[Wein, Ron]
Attachment IconSweeping and Maintaining Two-Dimensional Arrangements on Surfaces
In: Proceedings of 23rd European Workshop on Computational Geometry, 223-226
Proceedings Article
2007Berberich, Eric
[Fogel, Efi]
[Halperin, Dan]
Mehlhorn, Kurt
[Wein, Ron]
Attachment IconSweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step
In: Algorithms - ESA 2007, 15th Annual European Symposium, 645-656
Proceedings Article
2004Berberich, Eric
Eigenwillig, Arno
[Emiris, Ioannis]
[Fogel, Efraim]
[Hemmer, Michael]
[Halperin, Dan]
[Kakargias, Athanasios]
Kettner, Lutz
Mehlhorn, Kurt
[Pion, Sylvain]
[Schömer, Elmar]
[Teillaud, Monique]
[Wein, Ron]
Wolpert, Nicola
Attachment IconAn Empirical Comparison of Software for Constructing Arrangements of Curved ArcsReport
2003Berberich, Eric
Eigenwillig, Arno
[Fogel, Efi]
[Halperin, Dan]
Hert, Susan
Kettner, Lutz
[Teillaud, Monique]
[Wein, Ron]
Specification of the traits classes for CGAL arrangements of curvesReport
2001[Bäsken, Matthias]
[Brönnimann, Hervé]
[Frank, Da]
[Devillers, Olivier]
[Ester, Ezra]
[Fabri, Andreas]
[Flato, Eyal]
[Gärtner, Bernd]
[Giezeman, Geert-Jan]
[Halperin, Dan]
[Hanniel, Iddo]
[Har-Peled, Sariel]
[Herrmann, Thomas]
Hert, Susan
[Hirsch, Shai]
[Hoffmann, Michael]
Kettner, Lutz
[Nechushtan, Oren]
[Neyer, Gabriele]
[Pasechnik, Dmitrii]
[Pion, Sylvain]
Schirra, Stefan
[Schönherr, Sven]
Seel, Michael
[Teillaud, Monique]
[Veltkamp, Remco]
[Wein, Ron]
[Wesselink, Wieger]
[Yvinec, Mariette]
CGAL Reference and User ManualsUnknown Form: eBookForm
4
Hide details for Weiskircher, ReneWeiskircher, Rene
2002Weiskircher, ReneNew Applications of SPQR-Trees in Graph Drawing
Universität des Saarlandes
Thesis - PhD thesis
1999Mutzel, Petra
Weiskircher, René
Optimizing Over All Combinatorial Embeddings of a Planar Graph
In: Proceedings of the 7th International Conference on Integer Programming and Combinatorial Optimization (IPCO-99), 361-376
Proceedings Article
1998Mutzel, Petra
Weiskircher, René
Attachment IconTwo-Layer Planarization in Graph Drawing
In: Proceedings of the 9th International Symposium on Algorithms and Computation (ISAAC-98), 69-78
Proceedings Article
1997Weiskircher, ReneAttachment Icon2-Schicht-Planarisierung bipartiter Graphen
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Welling, Max (ed.)Welling, Max (ed.)
2009[Shervashidze, Nino]
Vishwanathan, S .V. N.
[Petri, Tobias H.]
Mehlhorn, Kurt
[Borgwardt, Karsten M.]
Attachment IconEfficient Graphlet Kernels for Large Graph Comparison
In: Proceedings of the Twelfth International Conference on Artificial Intelligence and Statistics (AISTATS), 488-495
Electronic Proceedings Article
1
Hide details for Welsh, Matt (ed.)Welsh, Matt (ed.)
2005Funke, 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
9
Hide details for Welzl, EmoWelzl, Emo
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
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
1993Mehlhorn, Kurt
Sharir, Micha
Welzl, Emo
Attachment IconTail Estimates for the Efficiency of Randomized Incremental Algorithms for Line Segment Intersection
In: Computational Geometry: Theory and Applications [3], 235-246
Journal Article
1992Fleischer, Rudolf
Mehlhorn, Kurt
Rote, Günter
Welzl, Emo
Yap, Chee-Keng
Simultaneous Inner and Outer Approximation of Shapes
In: Algorithmica [8], 365-389
Journal Article
1992Mehlhorn, Kurt
Sharir, Micha
Welzl, Emo
Tail Estimates for the Space Complexity of Randomised Incremental Algorithms
In: Discrete algorithms (SODA-92) : 3rd annual ACM-SIAM symposium, 89-93
Proceedings Article
1990Fleischer, Rudolf
Mehlhorn, Kurt
Rote, Günter
Welzl, Emo
Yap, Chee-Keng
On Simultaneous Inner and Outer Approximation of Shapes
In: Computational geometry (SCG-90) : 6th annual symposium, 216-224
Proceedings Article
1988Alt, Helmut
Mehlhorn, Kurt
Wagener, Hubert
Welzl, Emo
Attachment IconCongruence, Similarity, and Symmetries of Geometric Objects
In: Discrete and Computational Geometry [3], 237-256
Journal Article
1987[Alt, Helmut]
Mehlhorn, Kurt
[Wagener, Hubert]
[Welzl, Emo]
Attachment IconCongruence, similarity and symmetries of geometric objectsReport
1987Alt, Helmut
Mehlhorn, Kurt
Wagener, Hubert
Welzl, Emo
Convergence, Similarity and Symmetries of Geometric Objects
In: Computational geometry (SCG-87) : 3rd symposium, 308-315
Proceedings Article
9
Hide details for Welzl, Emo (ed.)Welzl, Emo (ed.)
2008Berberich, Eric
Kerber, Michael
Sagraloff, Michael
Attachment IconExact Geometric-Topological Analysis of Algebraic Surfaces
In: Proceedings of the 24th ACM Symposium on Computational Geometry, 164-173
Proceedings Article
2008Emeliyanenko, Pavel
Kerber, Michael
Attachment IconVisualizing and Exploring Planar Algebraic Arrangements -- a Web Application
In: Proceedings of the 24th ACM Symposium on Computational Geometry, 224-225
Proceedings Article
2007Elbassioni, Khaled
[Sitters, Rene]
[Zhang, Yan]
A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs
In: Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings, 451-462
Proceedings Article
2007[Bar-Yehuda, Reuven]
[Flysher, Guy]
Mestre, Julián
[Rawitz, Dror]
Approximation of Partial Capacitated Vertex Cover
In: 15th Annual European Symposium on Algorithms, 335-346
Proceedings Article
2007[Dupont, Laurent]
Hemmer, Michael
[Petitjean, Sylvain]
[Schömer, Elmar]
Attachment IconComplete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics
In: 15th Annual European Symposium on Algorithms, 633-644
Proceedings Article
2007Berberich, Eric
[Fogel, Efi]
[Halperin, Dan]
Mehlhorn, Kurt
[Wein, Ron]
Attachment IconSweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step
In: Algorithms - ESA 2007, 15th Annual European Symposium, 645-656
Proceedings Article
2007[Khuller, Samir]
[Malekian, Azarakhsh]
Mestre, Julián
To Fill or Not to Fill: The Gas Station Problem
In: 15th Annual European Symposium on Algorithms, 534-545
Proceedings Article
2000Mehlhorn, KurtAttachment IconConstraint Programming and Graph Algorithms
In: Automata, Languages and Programming, Proceedings of the 27th International Colloquium (ICALP-00), 571-575
Proceedings Article
2000Kumar, V. S. Anil
[Arya, Sunil]
[Ramesh, Hariharan]
Hardness of Set Cover with Intersection 1
In: Automata, Languages and Programming, Proceedings of the 27th International Colloquium (ICALP-00), 624-635
Proceedings Article
4
Hide details for Wendt, UlrichWendt, Ulrich
2004[Smid, Michiel]
Ray, Rahul
[Wendt, Ulrich]
[Lange, Katharina]
Computing Large Planar Regions in Terrains, with an Application to Fracture Surface
In: Discrete Applied Mathematics [139], 253-264
Journal Article
2002Ray, Rahul
[Smid, MIchiel]
[Lange, Katharina]
[Wendt, Ulrich]
Attachment IconComputing Large Planar Regions in Terrains
In: IWCIA 2001, 8th International Workshop on Combinatorial Image Analysis (IWCIA-01), 139-152
Proceedings Article
2002[Wendt, Ulrich]
[Lange, Katharina]
[Smid, Michiel]
Ray, Rahul
[Tönnies, Klaus-Dietz]
Surface Topography Quantification by Integral and Feature-related Parameters
In: Materialwissenschaft und Werkstofftechnik [33], 621-627
Journal Article
2001[Wendt, Ulrich]
[Lange, Katharina]
Ray, Rahul
[Smid, Michiel]
Surface Topography Quantification using Computational GeometryMiscellaneous
2
Hide details for Werneck, Renato (ed.)Werneck, Renato (ed.)
2011Berberich, Eric
Emeliyanenko, Pavel
Sagraloff, Michael
An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks
In: 2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX), 35-47
Proceedings Article
2011Doerr, Benjamin
[Künnemann, Marvin]
Wahlström, Magnus
Dependent Randomized Rounding: The Bipartite Case
In: 2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX), 96-106
Proceedings Article
1
Hide details for Werner, DanielWerner, Daniel
2012[Giannopoulos, Panos]
[Knauer, Christian]
Wahlström, Magnus
[Werner, Daniel]
Hardness of discrepancy computation and ε-net verification in high dimension
In: Journal of Complexity [28], 162-176
Journal Article
1
Hide details for Wernet, NorbertWernet, Norbert
1976Güttler, Reiner
Mehlhorn, Kurt
Schneider, Wolfgang
Wernet, Norbert
Binary Search Trees: Average and Worst Case Behavior
In: GI - 6. Jahrestagung, 301-313
Proceedings Article
1
Hide details for Werth, KaiWerth, Kai
2007Althaus, Ernst
[Baumann, Tobias]
[Schömer, Elmar]
[Werth, Kai]
Trunk Packing Revisited
In: Experimental Algorithms, 6th International Workshop, 420-432
Proceedings Article
1
Hide details for Werth, SörenWerth, Sören
2006Doerr, Benjamin
Hebbinghaus, Nils
[Werth, Sören]
Attachment IconImproved Bounds and Schemes for the Declustering Problem
In: Theoretical Computer Science [359], 123-132
Journal Article
1
Hide details for Wesselink, WiegerWesselink, Wieger
2001[Bäsken, Matthias]
[Brönnimann, Hervé]
[Frank, Da]
[Devillers, Olivier]
[Ester, Ezra]
[Fabri, Andreas]
[Flato, Eyal]
[Gärtner, Bernd]
[Giezeman, Geert-Jan]
[Halperin, Dan]
[Hanniel, Iddo]
[Har-Peled, Sariel]
[Herrmann, Thomas]
Hert, Susan
[Hirsch, Shai]
[Hoffmann, Michael]
Kettner, Lutz
[Nechushtan, Oren]
[Neyer, Gabriele]
[Pasechnik, Dmitrii]
[Pion, Sylvain]
Schirra, Stefan
[Schönherr, Sven]
Seel, Michael
[Teillaud, Monique]
[Veltkamp, Remco]
[Wein, Ron]
[Wesselink, Wieger]
[Yvinec, Mariette]
CGAL Reference and User ManualsUnknown Form: eBookForm
1
Hide details for Westbrook, JefferyWestbrook, Jeffery
1998Albers, Susanne
[Westbrook, Jeffery]
Self-organizing data structures
In: Online Algorithms: The State of the Art, 13-51
Part of a Book
1
Hide details for Westermann, MatthiasWestermann, Matthias
2003[Krick, Christof]
[Meyer auf der Heide, Friedhelm]
[Räcke, Harald]
Vöcking, Berthold
[Westermann, Matthias]
Data Management in Networks: Experimental Evaluation of a Provably Good Strategy
In: Theory of Computing Systems [35], 217-245
Journal Article
1
Hide details for Westphal, StefanWestphal, Stefan
2009[Krumke, Sven]
van Stee, Rob
[Westphal, Stefan]
Attachment IconOnline job admissions
In: Fundamental Problems in Computing : Essays in Honor of Professor Daniel J. Rosenkrantz, 435-454
Part of a Book
1
Hide details for Westphal, StephanWestphal, Stephan
2008[Krumke, Sven Oliver]
[Schwahn, Anne]
van Stee, Rob
[Westphal, Stephan]
Attachment IconA monotone approximation algorithm for scheduling with precedence constraints
In: Operations Research Letters [36], 247-249
Journal Article
1
Hide details for Wetzel, SusanneWetzel, Susanne
2006Meyer, Ulrike
[Wetzel, Susanne]
Introducing History-Enriched Security Context Transfer to Enhance the Security of Subsequent Handover
In: 4th IEEE Conference on Pervasive Computing and Communications Workshops (PerCom 2006 Workshops), 277-282
Proceedings Article
1
Hide details for Whang, Kyu-Young (ed.)Whang, Kyu-Young (ed.)
2006Bast, Holger
Majumdar, Debapriyo
Schenkel, Ralf
Theobald, Martin
Weikum, Gerhard
Attachment IconIO-Top-k: Index-Access Optimized Top-k Query Processing
In: Proceedings of the 32nd International Conference on Very Large Data Bases, VLDB 2006, 475-486
Proceedings Article
4
Hide details for Whitesides, Sue H. (ed.)Whitesides, Sue H. (ed.)
1998Mutzel, Petra
Gutwenger, Carsten
Brockenauer, Ralf
Fialko, Sergej
Klau, Gunnar W.
Krüger, Michael
Ziegler, Thomas
[Näher, Stefan]
[Alberts, David]
[Ambras, Dirk]
[Koch, Gunter]
[Jünger, Michael]
[Buchheim, Christoph]
[Leipert, Sebastian]
AGD: A Library of Algorithms for Graph Drawing
In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 456-457
Proceedings Article
1998[Eades, Peter]
[Marks, Joe]
Mutzel, Petra
[North, Stephen]
Graph Drawing Contest Report
In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 423-435
Proceedings Article
1998[Jünger, Michael]
[Leipert, Sebastian]
Mutzel, Petra
Level Planarity Testing in Linear Time
In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 224-237
Proceedings Article
1998Gutwenger, Carsten
Mutzel, Petra
Planar Polyline Drawings with Good Angular Resolution
In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 167-182
Proceedings Article
2
Hide details for Whitesides, Sue (ed.)Whitesides, Sue (ed.)
2012[Alvarez, Victor]
Bringmann, Karl
[Curticapean, Radu]
Ray, Saurabh
Attachment IconCounting Crossing Free Structures
In: Proceedings of the Twenty-Eight Annual Symposium on Computational Geometry (SCG'12), 61-68
Proceedings Article
1993Dobrindt, Katrin
Mehlhorn, Kurt
Yvinec, Mariette
Attachment IconA Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron
In: Algorithms and data structures (WADS-93) : 3rd workshop, 314-324
Proceedings Article
1
Hide details for Whitley, L. Darrell (ed.)Whitley, L. Darrell (ed.)
2006Doerr, Benjamin
Hebbinghaus, Nils
Neumann, Frank
Attachment IconSpeeding Up Evolutionary Algorithms Through Restricted Mutation Operators
In: Parallel Problem Solving from Nature - PPSN IX, 9th International Conference, 978-987
Proceedings Article
4
Hide details for Widmayer, Peter (ed.)Widmayer, Peter (ed.)
2002Beier, Rene
Sanders, Peter
Sivadasan, Naveen
Energy Optimal Routing in Radio Networks Using Geometric Data Structures
In: Automata, Languages and Programming : 29th International Colloquium, ICALP 2002, 366-376
Proceedings Article
2002[Adler, Micah]
[Räcke, Harald]
Sivadasan, Naveen
[Sohler, Christian]
Vöcking, Berthold
Randomized Pursuit-Evasion in Graphs
In: Automata, Languages and Programming : 29th International Colloquium, ICALP 2002, 901-912
Proceedings Article
2002Fotakis, Dimitris
Kontogiannis, Spyros
[Koutsoupias, Elias]
[Mavronicolas, Marios]
[Spirakis, Paul G.]
Attachment IconThe 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
1997Schirra, StefanPrecision and Robustness in Geometric Computations
In: Algorithmic Foundations of Geographic Information Systems, 255-287
Part of a Book
1
Hide details for Wiedermann, Jiri (ed.)Wiedermann, Jiri (ed.)
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
1
Hide details for Wiedermann, Juraj (ed.)Wiedermann, Juraj (ed.)
1986Alt, Helmut
Hagerup, Torben
Mehlhorn, Kurt
Preparata, Franco P.
Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
In: Mathematical Foundations of Computer Science, 12th Symposium (MFCS 1986), 199-208
Proceedings Article
1
Hide details for Wiedermann, J. (ed.)Wiedermann, J. (ed.)
1999Sanders, PeterAccessing Multiple Sequences Through Set Associative Caches
In: Proceedings of the 26th International Colloquium on Automata, Languages and Programming (ICALP-99), 655-664
Proceedings Article
1
Hide details for Wiegand, R.Paul (ed.)Wiegand, R.Paul (ed.)
2009[Baswana, Surender]
[Biswas, Somenath]
Doerr, Benjamin
[Friedrich, Tobias]
[Kurur, Piyush P.]
Neumann, Frank
Computing Single Source Shortest Paths using Single-Objective Fitness Functions
In: FOGA'09 : revised selected papers from ACM SIGEVO
Foundations of Genetic Algorithms X, 59-66
Proceedings Article
7
Hide details for Wiese, AndreasWiese, Andreas
2013[Günther, Elisabeth]
[Maurer, Olaf]
Megow, Nicole
Wiese, Andreas
A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio
In: 24st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013),
Proceedings Article
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
2013Adamaszek, Anna
Wiese, Andreas
Approximation Schemes for Maximum Weight Independent Set of Rectangles
In: Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2013),
Proceedings Article
2013[Anagnostopoulos, Aris]
[Grandoni, Fabrizio]
[Leonardi, Stefano]
Wiese, Andreas
Constant Integrality Gap LP formulations of Unsplittable Flow on a Path
In: Proceedings of the 16th Conference on Integer Programming and Combinatorial Optimization (IPCO 2013),
Proceedings Article
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
2013[Bonifaci, Vincenzo]
[Marchetti-Spaccamela, Alberto]
Megow, Nicole
Wiese, Andreas
Polynomial-Time Exact Schedulability Tests for Harmonic Real-Time Tasks
In: Proceedings of the 34th IEEE Real-Time Systems Symposium (RTSS 2013),
Proceedings Article
2012Megow, Nicole
[Skutella, Martin]
[Verschae, Jose]
Wiese, Andreas
The Power of Recourse for Online MST and TSP
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 689-700
Proceedings Article
2
Hide details for Wigderson, A.Wigderson, A.
1996[Alt, Helmut]
[Guibas, L.]
Mehlhorn, Kurt
[Karp, Richard M.]
[Wigderson, A.]
Attachment IconA Method for Obtaining Randomized Algorithms with Small Tail Probabilities
In: Algorithmica [16], 543-547
Journal Article
1991Alt, Helmut
Guibas, L.
Mehlhorn, Kurt
Karp, Richard M.
Wigderson, A.
Attachment IconA Method for Obtaining Randomized Algorithms with Small Tail ProbabilitiesReport
1
Hide details for Wilhelmi, HaraldWilhelmi, Harald
1995Wilhelmi, HaraldErzeugung von Pseudozufallszahlen gemäß einer veränderbaren Verteilung
Universität des Saarlandes
Thesis - Masters thesis
3
Hide details for Wilhelm, ReinhardWilhelm, Reinhard
2005Mehlhorn, Kurt
Waldmann, Uwe
[Wilhelm, Reinhard]
Harald Ganzinger : 31.10.1950 - 3.6.2004
In: MPG-Jahrbuch, 107-108
In: Jahrbuch / Max-Planck-Gesellschaft [?], 107-108
Part of a Book
1989Loeckx, Jacques
Mehlhorn, Kurt
Wilhelm, Reinhard
Foundations of Programming LanguagesBook
1986Loeckx, Jacques
Mehlhorn, Kurt
Wilhelm, Reinhard
Grundlagen der ProgrammiersprachenBook
3
Hide details for Wilhelm, Reinhard (ed.)Wilhelm, Reinhard (ed.)
2010[Althaus, Ernst]
[Altmeyer, Sebastian]
Naujoks, Rouven
A New Combinatorial Approach to Parametric Path AnalysisReport
2001Mehlhorn, KurtAttachment IconFrom Algorithm to Program to Software Library
In: Informatics : 10 years back, 10 years ahead, 268-273
Part of a Book
1996[Mehlhorn, Kurt]
Claus, Volker
Thomas, Wolfgang
Komplexitätstheorie und Algorithmik
In: Informatik : Grundlagen - Anwendungen - Perspektiven, 113-116
Proceedings Article
7
Hide details for Wilke, Thomas (ed.)Wilke, Thomas (ed.)
2013Wahlström, MagnusAbusing the Tutte Matrix: An Algebraic Instance Compression for the K-set-cycle Problem
In: 29th International Symposium on Theoretical Aspects of Computer Science (STACS-13),
Electronic Proceedings Article
2013Gawrychowski, 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
2013Jez, ArturAttachment IconRecompression: a simple and powerful technique for word equations
In: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), 233-244
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
2012Doerr, Benjamin
Winzen, Carola
Playing Mastermind with Constant-Size Memory
In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 441-452
Electronic Proceedings Article
2012Elbassioni, Khaled
[Paluch, Katarzyna]
van Zuylen, Anke
Simpler Approximation of the Maximum Asymmetric Traveling Salesman Problem
In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 501-506
Electronic Proceedings Article
2012Gawrychowski, PawelTying up the loose ends in fully LZW-compressed pattern matching
In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 624-635
Electronic Proceedings Article
3
Hide details for Williamson, David P.Williamson, David P.
2012[Schalekamp, Frans]
[Williamson, David P.]
van Zuylen, Anke
A proof of the Boyd-Carr conjecture
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 1477-1486
Proceedings Article
2012[Qian, Jiawei]
[Schalekamp, Frans]
[Williamson, David P.]
van Zuylen, Anke
On the Integrality Gap of the Subtour LP for the 1,2-TSP
In: LATIN 2012: Theoretical Informatics ; 10th Latin American Symposium, 606-617
Proceedings Article
2011van Zuylen, Anke
[Schalekamp, Frans]
[Williamson, David P.]
Popular Ranking
In: 10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2011, 267-270
Electronic Proceedings Article
1
Hide details for Williamson, David P. (ed.)Williamson, David P. (ed.)
2007Beier, René
[Röglin, Heiko]
[Vöcking, Berthold]
Attachment IconThe Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
In: Integer Programming and Combinatorial Optimization : 12th International IPCO Conference, 53-67
Proceedings Article
1
Hide details for Winfield, Alan F. T. (ed.)Winfield, Alan F. T. (ed.)
2008Neumann, 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
1
Hide details for Winlaw, MandaWinlaw, Manda
2011De Sterck, Hans
[Miller, Killian]
[Sanders, Geoff]
[Winlaw, Manda]
Recursively accelerated multilevel aggregation for Markov chains
In: SIAM Journal on Scientific Computing [32], 1652-1671
Journal Article
1
Hide details for Winskel, Glynn (ed.)Winskel, Glynn (ed.)
1998Chaudhuri, Shiva
[Subrahmanyam, K. V.]
[Wagner, Frank]
Zaroliagis, Christos
Computing Mimicking Networks
In: Proceedings of the 25th International Colloquium on Automata, Languages and Programming (ICALP-98), 556-567
Proceedings Article
1
Hide details for Winter, T.Winter, T.
1982Becker, Michael
Degenhardt, W.
Doenhardt, J.
Hertel, S.
Kaninke, G.
Kerber, W.
Mehlhorn, Kurt
Näher, Stefan
Rohnert, H.
Winter, T.
Attachment IconA Probabilistic Algorithm for Vertex Connectivity of Graphs
In: Information Processing Letters [15], 135-136
Journal Article
27
Hide details for Winzen, CarolaWinzen, Carola
2014Doerr, Benjamin
Winzen, Carola
Ranking-Based Black-Box Complexity
In: Algorithmica [?], ?
Journal Article
2013Doerr, Benjamin
Kötzing, Timo
[Lengler, Johannes]
Winzen, Carola
Black-Box Complexities of Combinatorial Problems
In: Theoretical Computer Science [471], 84-106
Journal Article
2013Winzen, CarolaDirection-Reversing Quasi-Random Rumor Spreading with Restarts
In: Information Processing Letters [113], 921-926
Journal Article
2013Doerr, 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
2013Doerr, 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[Gnewuch, Michael]
Wahlström, Magnus
Winzen, Carola
A New Randomized Algorithm to Approximate the Star Discrepancy Based on Threshold Accepting
In: SIAM Journal on Numerical Analysis [50], 781-807
Journal Article
2012Doerr, Benjamin
Winzen, Carola
Black-box complexity: Breaking the O(n logn) barrier of LeadingOnes
In: Artificial Evolution 10th International Conference Evolution Artificielle, EA 2011, 205-216
Proceedings Article
2012Doerr, Benjamin
Winzen, Carola
Memory-restricted black-box complexity of OneMax
In: Information Processing Letters [112], 32-34
Journal Article
2012Doerr, Benjamin
[Johannsen, Daniel]
Winzen, Carola
Multiplicative Drift Analysis
In: Algorithmica [64], 673-697
Journal Article
2012Doerr, Benjamin
[Johannsen, Daniel]
Winzen, Carola
Non-existence of linear universal drift functions
In: Theoretical Computer Science [436], 71-86
Journal Article
2012Doerr, Benjamin
Winzen, Carola
Playing Mastermind with Constant-Size Memory
In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 441-452
Electronic Proceedings Article
2012Doerr, Benjamin
Winzen, Carola
Playing Mastermind with Constant-Size Memory
In: Theory of Computing Systems [Online First], 1-27
Electronic Journal Article
2012Doerr, 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
2012Doerr, Benjamin
Winzen, Carola
Reducing the arity in unbiased black-box complexity
In: GECCO'12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, 1309-1316
Proceedings Article
2012Doerr, Benjamin
Moran, Shay
Moran, Shlomo
Winzen, Carola
Simple and Optimal Fault-Tolerant Rumor Spreading
In: arXiv [abs/1209.6158], 1-18
Electronic Journal Article
2012[Chen, Xujin]
Doerr, Benjamin
[Hu, Xiaodong]
[Ma, Weidong]
van Stee, Rob
Winzen, Carola
Attachment IconThe Price of Anarchy for Selfish Ring Routing is Two
In: Internet and Network Economics : 8th International Workshop, WINE 2012, 420-433
Proceedings Article
2012[Afshani, Peyman]
[Agrawal, Manindra]
Doerr, Benjamin
[Green Larsen, Kasper]
Mehlhorn, Kurt
Winzen, Carola
The Query Complexity of Finding a Hidden Permutation
In: Electronic Colloquium on Computational Complexity (ECCC): Report Series [87 (Revision 1)], 1-36
Electronic Journal Article
2011Doerr, Benjamin
[Lengler, Johannes]
Kötzing, Timo
Winzen, Carola
Black-box complexities of combinatorial problems
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 981-988
Proceedings Article
2011Winzen, CarolaDirection-Reversing Quasi-Random Rumor Spreading with RestartsUnpublished/Draft
2011Doerr, Benjamin
Johannsen, Daniel
Kötzing, Timo
[Lehre, Per Christian]
Wagner, Markus
Winzen, Carola
Faster black-box algorithms through higher arity operators
In: Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI (FOGA 2011), 163-172
Proceedings Article
2011Doerr, Benjamin
Winzen, Carola
Memory-Restricted Black-Box Complexity
In: Electronic Colloquium on Computational Complexity [18], 7
Electronic Journal Article
2011Doerr, Benjamin
Kötzing, Timo
Winzen, Carola
Too fast unbiased black-box algorithms
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 2043-2050
Proceedings Article
2011Winzen, CarolaToward a complexity theory for randomized search heuristics : black box models
Universität des Saarlandes
Thesis - PhD thesis
2011Doerr, Benjamin
Winzen, Carola
Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity
In: Computer Science - Theory and Applications : 6th International Computer Science Symposium in Russia (CSR 2011), 15-28
Proceedings Article
2010Doerr, Benjamin
Johannsen, Daniel
Winzen, Carola
Drift Analysis and Linear Functions Revisited
In: Proceedings of the IEEE Congress on Evolutionary Computation (CEC 2010). - Pt. 3, 1967-1974
Proceedings Article
2010Doerr, Benjamin
Johannsen, Daniel
Winzen, Carola
Multiplicative Drift Analysis
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1449-1456
Proceedings Article
2010Doerr, Benjamin
[Jansen, Thomas]
[Sudholt, Dirk]
Winzen, Carola
[Zarges, Christine]
Optimizing Monotone Functions Can Be Difficult
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 42-51
Proceedings Article
1
Hide details for Wirsing, Martin (ed.)Wirsing, Martin (ed.)
1987Kaufmann, Michael
Mehlhorn, Kurt
On Local Routing of Two-Terminal Nets
In: STACS '87 : 4th Annual Symposium on Theoretical Aspects of Computer Science, 40-52
Proceedings Article
2
Hide details for Wismüller, Roland (ed.)Wismüller, Roland (ed.)
2000Sanders, Peter
Sibeyn, Jop F.
A Bandwidth Latency Tradeoff for Broadcast and Reduction
In: Euro-Par 2000 Parallel Processing, Proceedings of the 6th International Euro-Par Conference (Euro-Par-00), 918-926
Proceedings Article
2000Meyer, Ulrich
Sanders, Peter
Parallel Shortest Path for Arbitrary Graphs
In: Euro-Par 2000 Parallel Processing, Proceedings of the 6th International Euro-Par Conference (Euro-Par-00), 461-470
Proceedings Article
1
Hide details for Wissen, MichaelWissen, Michael
1998Wissen, MichaelAutomatisiertes Zeichnen von Zustandsdiagrammen
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Wittenberg, Peter (ed.)Wittenberg, Peter (ed.)
1997Lenhof, Hans-PeterParallel Protein Puzzle: A New Suite of Protein Docking Tools
In: Forschung und wissenschaftliches Rechnen: Beiträge zum Heinz-Billing-Preis 1996, 31-48
Part of a Book
23
Hide details for Witt, CarstenWitt, Carsten
2013Doerr, 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
2012Kötzing, Timo
[Neumann, Frank]
[Röglin, Heiko]
[Witt, Carsten]
Theoretical analysis of two ACO approaches for the traveling salesman problem
In: Swarm Intelligence [6], 1-21
Journal Article
2011Doerr, 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
2011Doerr, Benjamin
[Fouz, Mahmoud]
[Witt, Carsten]
Sharp bounds by probability-generating functions and variable drift
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 2083-2090
Proceedings Article
2010Neumann, Frank
[Witt, Carsten]
Ant Colony Optimization and the minimum spanning tree problem
In: Theoretical Computer Science [411], 2406-2413
Journal Article
2010Friedrich, Tobias
[He, Jun]
Hebbinghaus, Nils
Neumann, Frank
[Witt, Carsten]
Approximating Covering Problems by Randomized Search Heuristics using Multi-Objective Models
In: Evolutionary Computation [18], 617 - 633
Journal Article
2010Neumann, Frank
[Witt, Carsten]
Bioinspired Computation in Combinatorial Optimization : Algorithms and Their Computational ComplexityBook
2010Doerr, Benjamin
Fouz, Mahmoud
[Witt, Carsten]
Quasirandom Evolutionary Algorithms
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1457-1464
Proceedings Article
2010Kötzing, Timo
Neumann, Frank
[Röglin, Heiko]
[Witt, Carsten]
Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem
In: Swarm Intelligence : 7th International Conference, ANTS 2010, 324-335
Proceedings Article
2009Friedrich, Tobias
[He, Jun]
Hebbinghaus, Nils
Neumann, Frank
[Witt, Carsten]
Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem
In: Evolutionary Computation, [17], 3-19
Journal Article
2009Neumann, 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
2009Neumann, 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
2009Neumann, Frank
[Witt, Carsten]
Runtime Analysis of a Simple Ant Colony Optimization Algorithm
In: Algorithmica [54], 243-255
Journal Article
2009Neumann, Frank
[Oliveto, Pietro Simone]
[Witt, Carsten]
Theoretical Analysis of Fitness-Proportional Selection: Landscapes and Efficiency
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 835-842
Proceedings Article
2008Neumann, Frank
[Witt, Carsten]
Ant Colony Optimization and the Minimum Spanning Tree Problem
In: International Conference on Learning and Intelligent Optimization 2007, 153-166
Proceedings Article
2008Neumann, 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
2008Friedrich, 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
2007Friedrich, Tobias
[He, Jun]
Hebbinghaus, Nils
Neumann, Frank
[Witt, Carsten]
Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models
In: Genetic and Evolutionary Computation Conference 2007, 797-804
Proceedings Article
2007Neumann, Frank
[Sudholt, Dirk]
[Witt, Carsten]
Attachment IconComparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions
In: Engineering Stochastic Local Search Algorithms 2007, 61-75
Proceedings Article
2007Friedrich, Tobias
[He, Jun]
Hebbinghaus, Nils
Neumann, Frank
[Witt, Carsten]
On Improving Approximate Solutions by Evolutionary Algorithms
In: IEEE Congress on Evolutionary Computation 2007, 2614-2621
Proceedings Article
2007Doerr, 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
2006Neumann, Frank
[Witt, Carsten]
Ant Colony Optimization and the Minimum Spanning Tree ProblemReport
3
Hide details for Woeginger, Gerhard J.Woeginger, Gerhard J.
2011Hermelin, Danny
[Mnich, Matthias]
[van Leeuwen, Erik Jan]
[Woeginger, Gerhard J.]
Domination When the Stars Are Out
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 462-473
Proceedings Article
2003[Hoogeveen, Han]
Skutella, Martin
[Woeginger, Gerhard J.]
Attachment IconPreemptive scheduling with rejection
In: Mathematical Programming [94], 361-374
Journal Article
2003[Fekete, Sandor P.]
Skutella, Martin
[Woeginger, Gerhard J.]
Attachment IconThe complexity of economic equilibria for house allocation markets
In: Information Processing Letters [88], 219-223
Journal Article
6
Hide details for Woeginger, Gerhard J. (ed.)Woeginger, Gerhard J. (ed.)
2003[Hall, Alex]
[Hippler, Steffen]
Skutella, Martin
Attachment IconMulticommodity Flows Over Time: Efficient Algorithms and Complexity
In: Automata, languages and programming : 30th International Colloquium, ICALP 2003, 397-409
Proceedings Article
2003Fotakis, DimitrisAttachment IconOn the Competitive Ratio for Online Facility Location
In: Automata, languages and programming : 30th International Colloquium, ICALP 2003, 637-652
Proceedings Article
2003Kärkkäinen, Juha
Sanders, Peter
Simple Linear Work Suffix Array Construction
In: Automata, languages and programming : 30th International Colloquium, ICALP 2003, 943-955
Proceedings Article
1999Klau, Gunnar W.
Mutzel, Petra
Optimal Compaction of Orthogonal Grid Drawings
In: Proceedings of the 7th International Conference on Integer Programming and Combinatorial Optimization (IPCO-99), 304-319
Proceedings Article
1999Mutzel, Petra
Weiskircher, René
Optimizing Over All Combinatorial Embeddings of a Planar Graph
In: Proceedings of the 7th International Conference on Integer Programming and Combinatorial Optimization (IPCO-99), 361-376
Proceedings Article
1998Albers, Susanne
[Westbrook, Jeffery]
Self-organizing data structures
In: Online Algorithms: The State of the Art, 13-51
Part of a Book
1
Hide details for Woelfel, PhilippWoelfel, Philipp
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
1
Hide details for Wojtaszczyk, Jakub OnufryWojtaszczyk, Jakub Onufry
2011[Cygan, Marek]
Philip, Geevarghese
[Pilipczuk, Marcin]
[Pilipczuk, Micha\l{}]
[Wojtaszczyk, Jakub Onufry]
Attachment IconDominating set is fixed parameter tractable in claw-free graphs
In: Theoretical Computer Science [412], 6982-7000
Journal Article
1
Hide details for Wolf, LarsWolf, Lars
2014[Friedrichs, Stephan]
[Kulau, Ulf]
[Wolf, Lars]
Energy-efficient voltage scheduling of peripheral components on wireless sensor nodes
In: Communications Workshops (ICC), 2014 IEEE International Conference on, 860-865
Proceedings Article
1
Hide details for Wolle, ThomasWolle, Thomas
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
20
Hide details for Wolpert, NicolaWolpert, Nicola
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
Attachment IconArrangements
In: Effective Computational Geometry for Curves and Surfaces, 1-66
Part of a Book
2007Berberich, Eric
Caroli, Manuel
[Wolpert, Nicola]
Exact Computation of Arrangements of Rotated ConicsReport
2007Berberich, Eric
Caroli, Manuel
[Wolpert, Nicola]
Attachment IconExact Computation of Arrangements of Rotated Conics
In: Proceedings of 23rd European Workshop on Computational Geometry, 231-234
Proceedings Article
2007Eigenwillig, Arno
Kerber, Michael
[Wolpert, Nicola]
Attachment IconFast and Exact Geometric Analysis of Real Algebraic Plane Curves
In: Proceedings of the 2007 International Symposium on Symbolic and Algebraic Computation, 151-158
Proceedings Article
2007Eigenwillig, Arno
Kettner, Lutz
[Wolpert, Nicola]
Attachment IconSnap Rounding of Bézier CurvesReport
2007Eigenwillig, Arno
Kettner, Lutz
[Wolpert, Nicola]
Attachment IconSnap rounding of Bézier curves
In: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07), 158-167
Proceedings Article
2006[Schömer, Elmar]
Wolpert, Nicola
An Exact and Efficient Approach for Computing a Cell in an Arrangement of Quadrics
In: Computational Geometry [33], 65 - 97
Journal Article
2006Eigenwillig, Arno
Kettner, Lutz
[Schömer, Elmar]
Wolpert, Nicola
Attachment IconExact, Efficient and Complete Arrangement Computation for Cubic Curves
In: Computational Geometry [35], 36-73
Journal Article
2006Funke, Stefan
[Malamatos, Theocharis]
[Matijevic, Domagoj]
Wolpert, Nicola
Attachment Icon(Approximate) Conic Nearest Neighbors and the induced Voronoi Diagram
In: 18th Canadian Conference on Computational Geometry, 23-26
Proceedings Article
2005Eigenwillig, Arno
Kettner, Lutz
[Krandick, Werner]
Mehlhorn, Kurt
Schmitt, Susanne
Wolpert, Nicola
Attachment IconA Descartes algorithm for polynomials with bit-stream coefficients
In: Computer Algebra in Scientific Computing : 8th International Workshop, CASC 2005, 138-149
Proceedings Article
2005Berberich, Eric
[Hemmer, Michael]
Kettner, Lutz
[Schömer, Elmar]
Wolpert, Nicola
An Exact, Complete and Efficient Implementation for Computing Planar Maps of Quadric Intersection Curves
In: 21st Annual Symposium on Computational Geometry (SCG'05), 99-106
Proceedings Article
2005Berberich, Eric
Eigenwillig, Arno
[Hemmer, Michael]
[Hert, Susan]
Kettner, Lutz
Mehlhorn, Kurt
Reichel, Joachim
Schmitt, Susanne
[Schömer, Elmar]
Wolpert, Nicola
Attachment IconEXACUS: Efficient and exact algorithms for curves and surfaces
In: 13th Annual European Symposium on Algorithms (ESA 2005), 155-166
Proceedings Article
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
2004Berberich, Eric
Eigenwillig, Arno
[Emiris, Ioannis]
[Fogel, Efraim]
[Hemmer, Michael]
[Halperin, Dan]
[Kakargias, Athanasios]
Kettner, Lutz
Mehlhorn, Kurt
[Pion, Sylvain]
[Schömer, Elmar]
[Teillaud, Monique]
[Wein, Ron]
Wolpert, Nicola
Attachment IconAn Empirical Comparison of Software for Constructing Arrangements of Curved ArcsReport
2004Eigenwillig, Arno
Kettner, Lutz
[Schömer, Elmar]
Wolpert, Nicola
Complete, Exact and Efficient Computations with Cubic Curves
In: Proceedings of the Twentieth Annual Symposium on Computational Geometry : (SCG'04), 409-418
Proceedings Article
2004Berberich, Eric
Eigenwillig, Arno
[Hemmer, Michael]
[Hert, Susan]
Kettner, Lutz
Mehlhorn, Kurt
Reichel, Joachim
Schmitt, Susanne
[Schömer, Elmar]
Weber, Dennis
Wolpert, Nicola
EXACUS: Efficient and Exact Algorithms for Curves and SurfacesReport
2003Wolpert, NicolaJacobi Curves: Computing the Exact Topology of Arrangements of Non-Singular Algebraic CurvesReport
2002Wolpert, NicolaAn Exact and Efficient Approach for Computing a Cell in an Arrangement of Quadrics
Universität des Saarlandes
Thesis - PhD thesis
2002Eigenwillig, Arno
[Schömer, Elmar]
Wolpert, Nicola
Sweeping Arrangements of Cubic Segments Exactly and EfficientlyReport
1
Hide details for Wong, Ka ChunWong, Ka Chun
2007[Arya, Sunil]
Malamatos, Theocharis
[Mount, David M.]
[Wong, Ka Chun]
Optimal expected-case planar point location
In: SIAM Journal on Computing [37], 584-610
Journal Article
1
Hide details for Wong, Prudence W. H.Wong, Prudence W. H.
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
1
Hide details for Wood, DerickWood, Derick
1982Eisenbarth, Bernhard
Ziviani, Nivio
Gonnet, Gaston H.
Mehlhorn, Kurt
Wood, Derick
Attachment IconThe Theory of Fringe Analysis and Its Application to 2-3 Trees and B-Trees
In: Information and Control [55], 125-174
Journal Article
2
Hide details for Wormald, NicholasWormald, Nicholas
2011[Müller, Tobias]
Perez-Gimenez, Xavier
[Wormald, Nicholas]
Disjoint Hamilton cycles in the random geometric graph
In: Journal of Graph Theory [68], 299-322
Journal Article
2010Gao, Pu (Jane)
[Wormald, Nicholas]
[Su, Yi]
Attachment IconInduced subgraphs in sparse random graphs with given degree sequenceUnpublished/Draft
1
Hide details for Worsch, T.Worsch, T.
2002Sanders, Peter
[Vollmar, R.]
[Worsch, T.]
Feasible models of computation: Three-dimensionality and energy consumption
In: Fundamenta Informaticae [52], 233-248
Journal Article
1
Hide details for Wren, HowardWren, Howard
2008[Froyland, Gary]
[Koch, Thorsten]
Megow, Nicole
[Duane, Emily]
[Wren, Howard]
Optimizing the Landside Operation of a Container Terminal
In: OR Spectrum [30], 53-75
Journal Article
2
Hide details for Wu, Annie S. (ed.)Wu, Annie S. (ed.)
2009[Baswana, Surender]
[Biswas, Somenath]
Doerr, Benjamin
[Friedrich, Tobias]
[Kurur, Piyush P.]
Neumann, Frank
Computing Single Source Shortest Paths using Single-Objective Fitness Functions
In: FOGA'09 : revised selected papers from ACM SIGEVO
Foundations of Genetic Algorithms X, 59-66
Proceedings Article
2009[Bringmann, Karl]
[Friedrich, Tobias]
Don't be greedy when calculating hypervolume contributions
In: FOGA'09 : revised selected papers from ACM SIGEVO
Foundations of Genetic Algorithms X, 103-112
Proceedings Article
1
Hide details for Wu, XiWu, Xi
2012Hermelin, Danny
[Wu, Xi]
Weak compositions and their applications to polynomial lower bounds for kernelization
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 104-113
Proceedings Article
1
Hide details for Xia, MingjiXia, Mingji
2013[Cai, Jin-Yi]
[Lu, Pinyan]
Xia, Mingji
Dichotomy for Holant* Problems with a Function on Domain Size 3
In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 1278-1295
Proceedings Article
7
Hide details for Xu, ChihaoXu, Chihao
2009[Eisenbrand, Friedrich]
Karrenbauer, Andreas
[Skutella, Martin]
[Xu, Chihao]
Multiline Addressing by Network Flow
In: Algorithmica [53], 583-596
Journal Article
2008[Albrecht, Marc]
Karrenbauer, Andreas
[Xu, Chihao]
A clipper-free Algorithm for efficient HW-Implementation of local dimming LED-Backlight
In: Proceedings of the 28th International Display Research Conference (IDRC), 286-289
Proceedings Article
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
2007[Eisenbrand, Friedrich]
Karrenbauer, Andreas
[Xu, Chihao]
Algorithms for longer OLED Lifetime
In: WEA 2007, 338-351
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[Xu, Chihao]
[Wahl, Jürgen]
[Eeisenbrand, Friedrich]
Karrenbauer, Andreas
[Soh, Kian Min]
[Hitzelberger, Christoph]
Verfahren zur Ansteuerung von MatrixanzeigenMiscellaneous
1
Hide details for Xu, Dachuan (ed.)Xu, Dachuan (ed.)
2015Issac, DavisSampling in Space Restricted Settings
In: Computing and Combinatorics 2015,
Proceedings Article
3
Hide details for Xu, Yinfeng (ed.)Xu, Yinfeng (ed.)
2007Althaus, Ernst
[Canzar, Stefan]
A Lagrangian relaxation approach for the multiple sequence alignment problem
In: Combinatorial Optimization and Applications : First International Conference, COCOA 2007, 267-278
Proceedings Article
2007Mehlhorn, KurtAttachment IconMatchings in Graphs Variations of the Problem
In: Combinatorial Optimization and Applications : First International Conference, COCOA 2007, 1-2
Proceedings Article
2007Behle, MarkusAttachment IconOn threshold BDDs and the optimal variable ordering problem
In: Combinatorial Optimization and Applications : First International Conference, COCOA 2007, 124-135
Proceedings Article
1
Hide details for Yamamoto, Tetsuro (ed.)Yamamoto, Tetsuro (ed.)
2001Mehlhorn, Kurt
Schirra, Stefan
Attachment IconExact computation with leda_real - Theory and geometric applications
In: Symbolic Algebraic Methods and Verification Methods, 163-172
Part of a Book
1
Hide details for Yang, Laurence T. (ed.)Yang, Laurence T. (ed.)
2010Emeliyanenko, PavelAttachment IconModular Resultant Algorithm for Graphics Processors
In: Algorithms and Architectures for Parallel Processing : 10th International Conference, ICA3PP 2010. - Pt. 1, 427-440
Proceedings Article
2
Hide details for Yang, Tao (ed.)Yang, Tao (ed.)
1996Träff, Jesper Larsson
Zaroliagis, Christos
A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar Digraphs
In: Parallel Algorithms for Irregularly Structured Problems: 3rd International Workshop (IRREGULAR'96), 183-194
Proceedings Article
1996Hagerup, TorbenAllocating Independent Tasks to Parallel Processors: An Experimental Study
In: Parallel Algorithms for Irregularly Structured Problems: 3rd International Workshop (IRREGULAR'96), 1-33
Proceedings Article
2
Hide details for Yao, Frances (ed.)Yao, Frances (ed.)
1992Baumgarten, Hanna
Jung, Hermann
Mehlhorn, Kurt
Dynamic Point Location in General Subdivisions
In: Discrete algorithms (SODA-92) : 3rd annual ACM-SIAM symposium, 250-258
Proceedings Article
1992Mehlhorn, Kurt
Sharir, Micha
Welzl, Emo
Tail Estimates for the Space Complexity of Randomised Incremental Algorithms
In: Discrete algorithms (SODA-92) : 3rd annual ACM-SIAM symposium, 89-93
Proceedings Article
1
Hide details for Yao, Xin (ed.)Yao, Xin (ed.)
2006Doerr, Benjamin
Hebbinghaus, Nils
Neumann, Frank
Attachment IconSpeeding Up Evolutionary Algorithms Through Restricted Mutation Operators
In: Parallel Problem Solving from Nature - PPSN IX, 9th International Conference, 978-987
Proceedings Article
7
Hide details for Yap, CheeYap, Chee
2013[Yap, Chee]
Sagraloff, Michael
[Sharma, Vikram]
Analytic Root Clustering: A Complete Algorithm using Soft Zero TestsUnpublished/Draft
2011Sagraloff, Michael
[Yap, Chee]
A Simple But Exact and Efficient Algorithm for Complex Root Isolation
In: ISSAC 2011 : Proceedings of the 36th International Symposium on Symbolic and Algebraic Computation, 353-360
Proceedings Article
2008Kettner, Lutz
Mehlhorn, Kurt
[Pion, Sylvain]
[Schirra, Stefan]
[Yap, Chee]
Attachment IconClassroom Examples of Robustness Problems in Geometric Computations
In: Computational Geometry: Theory and Applications [40], 61-78
Journal Article
2006Kettner, Lutz
Mehlhorn, Kurt
[Pion, Sylvain]
[Schirra, Stefan]
[Yap, Chee]
Reply to "Backward Error Analysis ..."
In: Computational Science and Its Applications - ICCSA 2006, I, 60-60
Proceedings Article
2004Kettner, Lutz
Mehlhorn, Kurt
Pion, Sylvain
[Schirra, Stefan]
[Yap, Chee]
Classroom Examples of Robustness Problems in Geometric ComputationsReport
2004Kettner, Lutz
Mehlhorn, Kurt
[Pion, Sylvain]
[Schirra, Stefan]
[Yap, Chee]
Attachment IconClassroom Examples of Robustness Problems in Geometric Computations
In: ESA 2004: 12th Annual European Symposium on Algorithms, 702-713
Proceedings Article
1997Mehlhorn, Kurt
[Shermer, Thomas C.]
[Yap, Chee]
Attachment IconA complete roundness classification procedure
In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 129-138
Proceedings Article
5
Hide details for Yap, Chee-KengYap, Chee-Keng
1992Fleischer, Rudolf
Mehlhorn, Kurt
Rote, Günter
Welzl, Emo
Yap, Chee-Keng
Simultaneous Inner and Outer Approximation of Shapes
In: Algorithmica [8], 365-389
Journal Article
1991Mehlhorn, Kurt
Yap, Chee-Keng
Constructive Whitney-Graustein theorem, or how to untangle closed planar curves
In: SIAM Journal on Computing [20], 603-621
Journal Article
1990Fleischer, Rudolf
Mehlhorn, Kurt
Rote, Günter
Welzl, Emo
Yap, Chee-Keng
On Simultaneous Inner and Outer Approximation of Shapes
In: Computational geometry (SCG-90) : 6th annual symposium, 216-224
Proceedings Article
1988Mehlhorn, Kurt
Yap, Chee-Keng
Constructive Hopf's theorem: or how to untangle closed planar curvesReport
1988Mehlhorn, Kurt
Yap, Chee-Keng
Constructive Hopf's Theorem: Or How to Untangle Closed Planar Curves
In: Automata, languages and programming (ICALP-88) : 15th international colloquium, 410-423
Proceedings Article
1
Hide details for Yap, Chee K.Yap, Chee K.
2006Eigenwillig, Arno
[Sharma, Vikram]
[Yap, Chee K.]
Attachment IconAlmost Tight Recursion Tree Bounds for the Descartes Method
In: ISSAC '06: Proceedings of the 2006 international symposium on Symbolic and algebraic computation, 71-78
Electronic Proceedings Article
1
Hide details for Yap, Chee (ed.)Yap, Chee (ed.)
2009Sagraloff, Michael
Kerber, Michael
Hemmer, Michael
Certified Complex Root Isolation via Adaptive Root Separation Bounds
In: The Joint Conference of ASCM 2009 and MACIS 2009, 151-166
Proceedings Article
1
Hide details for Yeo, Sang-Soo (ed.)Yeo, Sang-Soo (ed.)
2010Emeliyanenko, PavelAttachment IconModular Resultant Algorithm for Graphics Processors
In: Algorithms and Architectures for Parallel Processing : 10th International Conference, ICA3PP 2010. - Pt. 1, 427-440
Proceedings Article
1
Hide details for Ying, Shi (ed.)Ying, Shi (ed.)
2010Mehlhorn, Kurt
Schweitzer, Pascal
Progress on Certifying Algorithms
In: Frontiers in Algorithmics : 4th International Workshop, FAW 2010, 1-5
Proceedings Article
1
Hide details for Yoshida, Hiroshi (ed.)Yoshida, Hiroshi (ed.)
2009Sagraloff, Michael
Kerber, Michael
Hemmer, Michael
Certified Complex Root Isolation via Adaptive Root Separation Bounds
In: The Joint Conference of ASCM 2009 and MACIS 2009, 151-166
Proceedings Article
1
Hide details for Yung, MotiYung, Moti
2000Kontogiannis, Spyros
[Pantziou, Grammati E.]
[Spirakis, Paul G.]
[Yung, Moti]
Attachment IconRobust Parallel Computations through Randomization
In: Theory of Computing Systems [33], 427-464
Journal Article
3
Hide details for Yung, Moti (ed.)Yung, Moti (ed.)
2005Elbassioni, Khaled M.
Fishkin, Aleksei V.
Mustafa, Nabil H.
Sitters, Rene
Approximation algorithms for Euclidean Group TSP
In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, 1115-1126
Proceedings Article
2005Kovács, AnnamáriaPolynomial Time Preemptive Sum-Multicoloring on Paths
In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, 840-852
Proceedings Article
2005Kaligosi, Kanela
Mehlhorn, Kurt
[Munro, J. Ian]
[Sanders, Peter]
Attachment IconTowards Optimal Multiple Selection
In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, 103-114
Proceedings Article
1
Hide details for Yuster, RaphaelYuster, Raphael
2011Hermelin, Danny
[Levy, Avivit]
[Weimann, Oren]
[Yuster, Raphael]
Distance Oracles for Vertex-Labeled Graphs
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 490-501
Proceedings Article
3
Hide details for Yvinec, MarietteYvinec, Mariette
2001[Bäsken, Matthias]
[Brönnimann, Hervé]
[Frank, Da]
[Devillers, Olivier]
[Ester, Ezra]
[Fabri, Andreas]
[Flato, Eyal]
[Gärtner, Bernd]
[Giezeman, Geert-Jan]
[Halperin, Dan]
[Hanniel, Iddo]
[Har-Peled, Sariel]
[Herrmann, Thomas]
Hert, Susan
[Hirsch, Shai]
[Hoffmann, Michael]
Kettner, Lutz
[Nechushtan, Oren]
[Neyer, Gabriele]
[Pasechnik, Dmitrii]
[Pion, Sylvain]
Schirra, Stefan
[Schönherr, Sven]
Seel, Michael
[Teillaud, Monique]
[Veltkamp, Remco]
[Wein, Ron]
[Wesselink, Wieger]
[Yvinec, Mariette]
CGAL Reference and User ManualsUnknown Form: eBookForm
1993Dobrindt, Katrin
Mehlhorn, Kurt
Yvinec, Mariette
A Complete and Efficient Algorithm for the Intersection of a General and a Convex PolyhedronReport
1993Dobrindt, Katrin
Mehlhorn, Kurt
Yvinec, Mariette
Attachment IconA Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron
In: Algorithms and data structures (WADS-93) : 3rd workshop, 314-324
Proceedings Article
2
Hide details for Zafeirakopoulos, ZafeirakisZafeirakopoulos, Zafeirakis
2009Hemmer, Michael
[Tsigaridas, Elias P.]
[Zafeirakopoulos, Zafeirakis]
[Emiris, Ioannis Z.]
[Karavelas, Menelaos I.]
[Mourrain, Bernard]
Experimental evaluation and cross-benchmarking of univariate real solvers
In: Symbolic Numeric Computation 2009 (SNC 2009), 45-54
Proceedings Article
2008[Emiris, Ioannis Z.]
Hemmer, Michael
[Karavelas, Menelaos]
[Mourrain, Bernard]
[Tsigaridas, Elias P.]
[Zafeirakopoulos, Zafeirakis]
Attachment IconExperimental evaluation and cross-benchmarking of univariate real solversReport
1
Hide details for Zafeirakopoulos,ZafeirakisZafeirakopoulos,Zafeirakis
2008[Emiris,Ioannis]
Hemmer, Michael
[Karavelas, Menelaos]
[Limbach, Sebastian]
[Mourrain, Bernard]
[Tsigaridas, Elias]
[Zafeirakopoulos,Zafeirakis]
Cross-benchmarks of univariate algebraic kernelsReport
2
Hide details for Zarges, ChristineZarges, Christine
2013Doerr, 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
2010Doerr, Benjamin
[Jansen, Thomas]
[Sudholt, Dirk]
Winzen, Carola
[Zarges, Christine]
Optimizing Monotone Functions Can Be Difficult
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 42-51
Proceedings Article
28
Hide details for Zaroliagis, ChristosZaroliagis, Christos
2007Pyrga, Evangelia
[Schulz, Frank]
[Wagner, Dorothea]
[Zaroliagis, Christos]
Efficient models for timetable information in public transportation systems
In: ACM Journal of Experimental Algorithmics [12], 1-39
Journal Article
2000Trä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
2000Chaudhuri, Shiva
[Subrahmanyam, K. V.]
[Wagner, Frank]
[Zaroliagis, Christos]
Computing mimicking networks
In: Algorithmica [26], 31-49
Journal Article
2000[Djidjev, Hristo N.]
Pantziou, G. E.
Zaroliagis, Christos
Improved algorithms for dynamic shortest paths
In: Algorithmica [28], 367-389
Journal Article
2000Chaudhuri, Shiva
Zaroliagis, Christos
Shortest paths in digraphs of small treewidth. Part I, Sequential algorithms
In: Algorithmica [27], 212-226
Journal Article
1999Kagaris, Dimitrios
[Pantziou, Grammati E.]
[Tragoudas, Spyros]
Zaroliagis, Christos
Transmissions in a network with capacities and delays
In: Networks [33
], 167-174
Journal Article
1998Brodal, 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[Alberts, David]
[Cattaneo, G]
[Italiano, Giuseppe]
[Nanni, Umberto]
Zaroliagis, Christos
A Software Library of Dynamic Graph Algorithms
In: Proceedings of Workshop on Algorithms and Experiments (ALEX-98), 129-136
Proceedings Article
1998Arikati, Srinivasa Rao
Chaudhuri, Shiva
Zaroliagis, Christos
All-Pairs Min-Cut in Sparse Networks
In: Journal of Algorithms [29], 82-110
Journal Article
1998[Frigioni, Daniele]
Miller, Tobias
[Nanni, Umberto]
[Pasqualone, Giulio]
Schäfer, Guido
Zaroliagis, Christos
An experimental study of dynamic algorithms for directed graphs
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 368-380
Proceedings Article
1998Chaudhuri, Shiva
[Subrahmanyam, K. V.]
[Wagner, Frank]
Zaroliagis, Christos
Computing Mimicking Networks
In: Proceedings of the 25th International Colloquium on Automata, Languages and Programming (ICALP-98), 556-567
Proceedings Article
1998Chaudhuri, Shiva
Zaroliagis, Christos
Shortest paths in digraphs of small treewidth. Part II: Optimal parallel algorithms
In: Theoretical Computer Science [203], 205-223
Journal Article
1997Miller, Tobias
Zaroliagis, Christos
A First Experimental Study of a Dynamic Transitive Closure Algorithm
In: Proceedings of the Workshop on Algorithm Engineering (WAE-97), 64-73
Proceedings Article
1997Brodal, 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
1997Arikati, Srinivasa Rao
Maheshwari, Anil
Zaroliagis, Christos
Efficient Computation of implicit representations of sparse graphs
In: Discrete Applied Mathematics [78], 1-16
Journal Article
1997Zaroliagis, ChristosSimple and Work-Efficient Parallel Algorithms for the Minimum Spanning Tree Problem
In: Parallel Processing Letters [7], 25-37
Journal Article
1996Träff, Jesper Larsson
Zaroliagis, Christos
A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar Digraphs
In: Parallel Algorithms for Irregularly Structured Problems: 3rd International Workshop (IRREGULAR'96), 183-194
Proceedings Article
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
1996Chaudhuri, Shiva
Dimopoulos, Yannis
Zaroliagis, Christos
On the Parallel Complexity of Acyclic Logic Programs
In: Parallel Processing Letters [6], 223-230
Journal Article
1996Arikati, Srinivasa Rao
[Chen, Danny Z.]
[Chew, L. Paul]
[Das, Gautam]
[Smid, Michiel]
Zaroliagis, Christos
Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane
In: Algorithms - ESA '96: 4th Annual European Symposium, 514-528
Proceedings Article
1995Arikati, 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[Djidjev, Hristo N.]
[Pantziou, Grammati E.]
Zaroliagis, Christos
Fast Algorithms for Maintaining Shortest Paths
In: Fundamentals of Computation Theory: 10th International Conference (FCT95), 191-200
Proceedings Article
1995[Djidjev, Hristo N.]
[Pantziou, Grammati E.]
Zaroliagis, Christos
On-line and Dynamic Algorithms for Shortest Path Problems
In: STACS95: 12th Annual Symposium on Theoretical Aspects of Computer Science, 193-204
Proceedings Article
1995[Kagaris, Dimitrios]
[Pantziou, Grammati E.]
[Tragoudas, Spyros]
Zaroliagis, Christos
On the Computation of Fast Data Transmissions in Networks
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 291-302
Proceedings Article
1995Chaudhuri, Shiva
Zaroliagis, Christos
Optimal Parallel Shortest Paths in Small Treewidth Digraphs
In: Algorithms - ESA'95: 3rd Annual European Symposium, 31-45
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
1995Chaudhuri, Shiva
Zaroliagis, Christos
Shortest Path Queries in Digraphs of Small Treewidth
In: Automata, Languages, and Programming: 22nd International Colloquium (ICALP95), 244-255
Proceedings 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
5
Hide details for Zaroliagis, Christos D. (ed.)Zaroliagis, Christos D. (ed.)
1999[Comes, Jochen]
Ziegelmann, Mark
An Easy to Use Implementation of Linear Perturbations within CGAL
In: Algorithm engineering (WAE-99) : 3rd International Workshop, WAE'99, 169-182
Proceedings Article
1999Brengel, Klaus
Crauser, Andreas
Meyer, Ulrich
[Ferragina, Paolo]
An Experimental Study of Priority Queues in External Memory
In: Algorithm engineering (WAE-99) : 3rd International Workshop, WAE'99, 345-359
Proceedings Article
1999Boghossian, Nicolas Pascal
Kohlbacher, Oliver
Lenhof, Hans-Peter
BALL: Biochemical Algorithms Library
In: Algorithm engineering (WAE-99) : 3rd International Workshop, WAE'99, 330-344
Proceedings Article
1999Crauser, Andreas
Mehlhorn, Kurt
Attachment IconLEDA-SM : Extending LEDA to Secondary Memory
In: Algorithm engineering (WAE-99) : 3rd International Workshop, WAE'99, 228-242
Proceedings Article
1999Mehlhorn, KurtTen Years of LEDA Some Thoughts (Abstract)
In: Algorithm engineering (WAE-99) : 3rd International Workshop, 14-14
Proceedings Article
5
Hide details for Zeh, NorbertZeh, Norbert
2006Meyer, Ulrich
[Zeh, Norbert]
I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths
In: Algorithms - ESA 2006, 14th Annual European Symposium, 540-551
Proceedings Article
2004[Brodal, Gerth Stølting]
[Fagerberg, Rolf]
Meyer, Ulrich
[Zeh, Norbert]
Cache-oblivious data structures and algorithms for undirected breadth-first search and shortest paths
In: Algorithm theory, SWAT 2004 : 9th Scandinavian Workshop on Algorithm Theory ; Humlebæk, Denmark, July 8-10, 2004 ; proceedings, 480-492
Proceedings Article
2003Meyer, Ulrich
[Zeh, Norbert]
I/O-Efficient Undirected Shortest Paths
In: Algorithms - ESA 2003: 11th Annual European Symposium, 434-445
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
Hide details for Zeh, Norbert (ed.)Zeh, Norbert (ed.)
2007Ajwani, Deepak
[Ray, Saurabh]
[Seidel, Raimund]
[Tiwary, Hans Raj]
On Computing the Centroid of the Vertices of an Arrangement and Related Problems
In: 10th Workshop on Algorithms and Data Structures (WADS), 519-528
Proceedings Article
3
Hide details for Zelikovsly, AlexanderZelikovsly, Alexander
2006Althaus, 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
2003Althaus, 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
3
Hide details for Zeugmann, Thomas (ed.)Zeugmann, Thomas (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
2011Kötzing, TimoIterative Learning from Positive Data and Counters
In: Algorithmic Learning Theory : 22nd International Conference, ALT 2011, 40-54
Proceedings Article
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
2
Hide details for Zhang, Guochuan (ed.)Zhang, Guochuan (ed.)
2013[Fekete, Sándor P.]
[Friedrichs, Stephan]
[Kröller, Alexander]
[Schmidt, Christiane]
Facets for Art Gallery Problems
In: Computing and Combinatorics, 208-220
Proceedings Article
2013Elbassioni, Khaled M.
Makino, Kazuhisa
Mehlhorn, Kurt
Ramezani, Fahimeh
On Randomized Fictitious Play for Approximating Saddle Points over Convex Sets
In: 19th Annual International Computing and Combinatorics Conference (COCOON-13), 65-76
Proceedings Article
1
Hide details for Zhang, HuiminZhang, Huimin
2008Althaus, Ernst
Canzar, Stefan
[Emmett, Mark]
Karrenbauer, Andreas
[Marshall, Alan]
[Meyer-Bäse, Anke]
[Zhang, Huimin]
Computing H/D-exchange speeds of single residues from data of peptic fragments
In: 23rd Annual ACM Symposium on Applied Computing (SAC), 1273-1277
Proceedings Article
2
Hide details for Zhang, YanZhang, Yan
2007Elbassioni, Khaled M.
[Sitters, Rene]
[Zhang, Yan]
Attachment IconA Quasi-PTAS for Envy-free Pricing on Line GraphsUnpublished/Draft
2007Elbassioni, Khaled
[Sitters, Rene]
[Zhang, Yan]
A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs
In: Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings, 451-462
Proceedings Article
1
Hide details for Zhang, YongZhang, Yong
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
Hide details for Zhao, JihuiZhao, Jihui
2008[Khachiyan, Leonid]
[Boros, Endre]
[Borys, Konrad]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Rudolf, Gabor]
[Zhao, Jihui]
On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction
In: Theory Comput. Syst. [43], 204-233
Journal Article
1
Hide details for Zheng, S. Q. (ed.)Zheng, S. Q. (ed.)
1999Lambert, Oliver
Sibeyn, Jop F.
Parallel and External List Ranking and Connected Components on a Cluster of Workstations
In: Proceedings of the 11th International Conference on Parallel and Distributed Computing and Systems (PDCS-99), 454-460
Proceedings Article
4
Hide details for Zhu, Binhai (ed.)Zhu, Binhai (ed.)
2007Althaus, Ernst
[Canzar, Stefan]
A Lagrangian relaxation approach for the multiple sequence alignment problem
In: Combinatorial Optimization and Applications : First International Conference, COCOA 2007, 267-278
Proceedings Article
2007Mehlhorn, KurtAttachment IconMatchings in Graphs Variations of the Problem
In: Combinatorial Optimization and Applications : First International Conference, COCOA 2007, 1-2
Proceedings Article
2007Behle, MarkusAttachment IconOn threshold BDDs and the optimal variable ordering problem
In: Combinatorial Optimization and Applications : First International Conference, COCOA 2007, 124-135
Proceedings Article
2003Telikepalli, 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
1
Hide details for Zhu, HongZhu, Hong
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
1
Hide details for Zhu, Hong (ed.)Zhu, Hong (ed.)
2007[Diedrich, Florian]
Harren, Rolf
[Jansen, Klaus]
[Thöle, Ralf]
[Thomas, Henning]
Attachment IconApproximation Algorithms for 3D Orthogonal Knapsack
In: Theory and Applications of Models of Computation, 34-45
Proceedings Article
4
Hide details for Ziegelmann, MarkZiegelmann, Mark
2001Mehlhorn, Kurt
Ziegelmann, Mark
Attachment IconCNOP - A Package for Constrained Network Optimization
In: Algorithm engineering and experimentation (ALENEX-01) :Third International Workshop ALENEX 2001 ; revised papers, 17-31
Proceedings Article
2001Ziegelmann, MarkConstrained Shortest Paths and Related Problems
Universität des Saarlandes
Thesis - PhD thesis
2000Mehlhorn, Kurt
Ziegelmann, Mark
Attachment IconResource Constrained Shortest Paths
In: Algorithms - ESA 2000, Proceedings of the 8th Annual European Symposium (ESA-00), 326-337
Proceedings Article
1999[Comes, Jochen]
Ziegelmann, Mark
An Easy to Use Implementation of Linear Perturbations within CGAL
In: Algorithm engineering (WAE-99) : 3rd International Workshop, WAE'99, 169-182
Proceedings Article
1
Hide details for Ziegenbein, KurtZiegenbein, Kurt
1997Ziegenbein, KurtBewertung verschiedener paarweiser Alignment-Methoden, Ersetzungsmatrizen und Gap-Funktionen
Universität des Saarlandes
Thesis - Masters thesis
2
Hide details for Ziegler, JoachimZiegler, Joachim
1998Mehlhorn, Kurt
Müller, Michael
Näher, Stefan
Schirra, Stefan
Seel, Michael
Uhrig, Christian
Ziegler, Joachim
A computational basis for higher-dimensional computational geometry and applications
In: Computational Geometry: Theory and Applications [10], 289-304
Journal Article
1997Mehlhorn, Kurt
Müller, Michael
Näher, Stefan
Schirra, Stefan
Seel, Michael
Uhrig, Christian
Ziegler, Joachim
A Computational Basis for Higher-dimensional Computational Geometry and Applications
In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 254-263
Proceedings Article
5
Hide details for Ziegler, ThomasZiegler, Thomas
2000Ziegler, ThomasCrossing Minimization in Automatic Graph Drawing
Universität des Saarlandes
Thesis - PhD thesis
2000Mutzel, Petra
Ziegler, Thomas
The Constrained Crossing Minimization Problem
In: Graph Drawing, Proceedings of the 7th International Symposium (GD-99), 175-185
Proceedings Article
1999Mutzel, Petra
Ziegler, Thomas
The constrained crossing minimization problem: a first approach
In: Operations Research Proceedings 1998, 125-134
Proceedings Article
1998Mutzel, Petra
Gutwenger, Carsten
Brockenauer, Ralf
Fialko, Sergej
Klau, Gunnar W.
Krüger, Michael
Ziegler, Thomas
[Näher, Stefan]
[Alberts, David]
[Ambras, Dirk]
[Koch, Gunter]
[Jünger, Michael]
[Buchheim, Christoph]
[Leipert, Sebastian]
AGD: A Library of Algorithms for Graph Drawing
In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 456-457
Proceedings Article
1995Ziegler, ThomasMax-Weighted-Matching auf allgemeinen Graphen
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Zimmer, Horst G.Zimmer, Horst G.
2003Schmitt, Susanne
[Zimmer, Horst G.]
Elliptic Curves : A Computational ApproachBook
2
Hide details for Zitzler, EckartZitzler, Eckart
2009[Brockhoff, Dimo]
[Friedrich, Tobias]
Hebbinghaus, Nils
Klein, Christian
Neumann, Frank
[Zitzler, Eckart]
On the Effects of Adding Objectives to Plateau Functions
In: IEEE Transactions on Evolutionary Computation [13], 591-603
Journal Article
2007[Brockhoff, Dimo]
Friedrich, Tobias
Hebbinghaus, Nils
Klein, Christian
Neumann, Frank
[Zitzler, Eckart]
Do Additional Objectives Make a Problem Harder?
In: Genetic and Evolutionary Computation Conference 2007, 765-772
Proceedings Article
1
Hide details for Ziviani, NivioZiviani, Nivio
1982Eisenbarth, Bernhard
Ziviani, Nivio
Gonnet, Gaston H.
Mehlhorn, Kurt
Wood, Derick
Attachment IconThe Theory of Fringe Analysis and Its Application to 2-3 Trees and B-Trees
In: Information and Control [55], 125-174
Journal Article
2
Hide details for Ziviani, Nivio (ed.)Ziviani, Nivio (ed.)
2012Gawrychowski, PawelFaster Algorithm for Computing the Edit Distance between SLP-Compressed Strings
In: String Processing and Information Retrieval : 19th International Symposium, SPIRE 2012, 229-236
Proceedings Article
2005Bast, Holger
Majumdar, Debapriyo
Attachment IconWhy Spectral Retrieval Works
In: 28th Annual International Conference on Research and Development in Information Retrieval (SIGIR'05), 11-18
Proceedings Article
2
Hide details for Zlatuska, Jiri (ed.)Zlatuska, Jiri (ed.)
1998Crauser, Andreas
Mehlhorn, Kurt
Meyer, Ulrich
Sanders, Peter
Attachment IconA Parallelization of Dijkstra's Shortest Path Algorithm
In: Proceedings of the 23rd International Symposium on the Mathematical Foundations of Computer Science (MFCS-98), 722-731
Proceedings Article
1998Mehlhorn, Kurt
Näher, Stefan
Attachment IconFrom Algorithms to Working Programs: On the Use of Program Checking in LEDA
In: Mathematical foundations of computer science (MFCS-98) : 23rd international symposium, 84-93
Proceedings Article
1
Hide details for Zolliker, PeterZolliker, Peter
2007Giesen, Joachim
[Schuberth, Eva]
[Simon, Klaus]
[Zolliker, Peter]
[Zweifel, Oliver]
Image-Dependent Gamut Mapping as Optimization Problem
In: IEEE Transactions on Image Processing [16], 2401-2410
Journal Article
1
Hide details for Zosin, LeonidZosin, Leonid
1997Zosin, LeonidA 2-Approximation Algorithm for the Directed Multiway Cut Problem
In: Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS-97), 548-553
Proceedings Article
1
Hide details for Zotenko, ElenaZotenko, Elena
2008Zotenko, Elena
Mestre, Julián
O'Leary, Dianne
Przytyzka, Teresa
Essential Complex Biological Modules Explain the Centrality-Lethality Rule
In: PLoS Computational Biology [x], x-x
Journal Article
1
Hide details for Zweifel, OliverZweifel, Oliver
2007Giesen, Joachim
[Schuberth, Eva]
[Simon, Klaus]
[Zolliker, Peter]
[Zweifel, Oliver]
Image-Dependent Gamut Mapping as Optimization Problem
In: IEEE Transactions on Image Processing [16], 2401-2410
Journal Article
1
Hide details for Zweig, K.Zweig, K.
2009[Kavitha, T.]
[Liebchen, Ch.]
Mehlhorn, K.
Michail, D.
[Rizzi, R.]
[Ueckerdt, T.]
[Zweig, K.]
Attachment IconCycle Bases in Graphs: Characterization, Algorithms, Complexity, and Applications
In: Computer Science Review [3], 199-243
Journal Article
1
Hide details for Zwick, UriZwick, Uri
1995[Cole, Richard]
Hariharan, Ramesh
[Paterson, Mike]
[Zwick, Uri]
Tighter Lower Bounds on the Exact Complexity of String Matching
In: SIAM Journal on Computing [24], 30-45
Journal Article
7
Hide details for Zwick, Uri (ed.)Zwick, Uri (ed.)
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
2003Katriel, Irit
Sanders, Peter
[Träff, Jesper Larsson]
A Practical Minimum Spanning Tree Algorithm Using the Cycle Property
In: Algorithms - ESA 2003: 11th Annual European Symposium, 679-690
Proceedings Article
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
2003Funke, Stefan
Matijevic, Domagoj
Sanders, Peter
Attachment IconApproximating Energy Efficient Paths in Wireless Multi-hop Networks
In: Algorithms - ESA 2003: 11th Annual European Symposium, 230-241
Proceedings Article
2003Granados, Miguel
Hachenberger, Peter
Hert, Susan
Kettner, Lutz
Mehlhorn, Kurt
Seel, Michael
Attachment IconBoolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation
In: Algorithms - ESA 2003: 11th Annual European Symposium, 654-666
Proceedings Article
2003Meyer, Ulrich
[Zeh, Norbert]
I/O-Efficient Undirected Shortest Paths
In: Algorithms - ESA 2003: 11th Annual European Symposium, 434-445
Proceedings Article
2003Eisenbrand, Friedrich
Funke, Stefan
Reichel, Joachim
[Schömer, Elmar]
Attachment IconPacking a Trunk
In: Algorithms - ESA 2003: 11th Annual European Symposium, 618-629
Proceedings Article
1
Hide details for {{
1
Hide details for O}ystein Haug Olsen (ed.)O}ystein Haug Olsen (ed.)
2007Bast, Holger
[Majumdar, Debapriyo]
Weber, Ingmar
Efficient interactive query expansion with CompleteSearch
In: 16th Conference on Information and Knowledge Management (CIKM'07), 857-860
Proceedings Article
8205
Next Page