| BibTeX cite key | Author/Editor | Year | | Title | Type |
|---|
| unbiasmatr2006 | Doerr, Benjamin
Klein, Christian | 2006 |  | Unbiased Rounding of Rational Matrices
In: FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science: 26th International Conference, 200-211 | Proceedings Article |
| vanStee2008 | Epstein, Leah
van Stee, Rob | 2008 | | The price of anarchy on uniformly related machines revisited
In: Algorithmic Game Theory, First International Symposium, SAGT 2008, 46-57 | Proceedings Article |
| vanStee2008a | Epstein, Leah
van Stee, Rob | 2008 | | Maximizing the minimum load for selfish agents
In: LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, 264-275 | Proceedings Article |
| vanStee2008b | van Stee, Rob | 2008 | | Packet Switching in Single Buffer
In: Encyclopedia of Algorithms, 1-99 | Part of a Book |
| vanStee2008d | van Stee, Rob | 2008 | | Paging
In: Encyclopedia of Algorithms, 1-99 | Part of a Book |
| vanStee2008e | Epstein, Leah
Levin, Asaf
van Stee, Rob | 2008 | | Two-dimensional packing with conflicts
In: Acta Informatica [45], 155-175 | Journal Article |
| vanStee2008f | Krumke, Sven Oliver
Schwahn, Anne
van Stee, Rob
Westphal, Stephan | 2008 | | A monotone approximation algorithm for scheduling with precedence constraints
In: Operations Research Letters [36], 247-249 | Journal Article |
| vanStee2008g | Epstein, Leah
Levin, Asaf
van Stee, Rob | 2008 | | Online unit clustering: Variations on a theme
In: Theoretical Computer Science [407], 85-96 | Journal Article |
| vanStee2008h | Pruhs, Kirk
van Stee, Rob
Uthaisombut, Patchrawat | 2008 | | Speed Scaling of Tasks with Precedence Constraints
In: Theory of Computing Systems [43], 67-80 | Journal Article |
| vanStee2008i | van Stee, Rob | 2008 | | Combinatorial algorithms for packing and scheduling problems
Universität Karlsruhe | Thesis - Habilitation thesis |
| vanStee2008j | Epstein, Leah
van Stee, Rob | 2008 | | Approximation schemes for packing splittable items with cardinality constraints
In: Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, 232-245 | Proceedings Article |
| vanStee2008k | Epstein, Leah
van Stee, Rob | 2008 | | On the Online Unit Clustering Problem
In: Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, 193-206 | Proceedings Article |
| vanStee2009a | Epstein, Leah
van Stee, Rob | 2010 | | On the online unit clustering problem
In: ACM Transactions on Algorithms [7], 1-18 | Journal Article |
| vanStee2010 | van Stee, Rob | 2011 | | An improved algorithm for online rectangle filling
In: Approximation and Online Algorithms : 8th International Workshop, WAOA 2010, 249-260 | Proceedings Article |
| vanStee2013 | van Stee, Rob | 2013 | | SIGACT News Online Algorithms Column 22
In: SIGACT News [44], 125 | Journal Article |
| vanSteeTALG2011 | Epstein, Leah
van Stee, Rob | 2011 | | On the online unit clustering problem
In: ACM Transactions on Algorithms [7], 7:1-7:1 | Journal Article |
| vanZuylenALG2011 | van Zuylen, Anke | 2011 | | Deterministic Sampling Algorithms for Network Design
In: Algorithmica [60], 110-151 | Journal Article |
| vanZuylenCTW2011 | van Zuylen, Anke
Schalekamp, Frans
Williamson, David P. | 2011 | | Popular Ranking
In: 10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2011, 267-270 | Electronic Proceedings Article |
| vanZuylenORL2011 | van Zuylen, Anke | 2011 | | An improved monotone algorithm for scheduling related machines with precedence constraints
In: Operations Research Letters [39], 423-427 | Journal Article |
| vanZuylenTCS2011 | van Zuylen, Anke | 2011 | | Linear programming based approximation algorithms for feedback set problems in bipartite tournaments.
In: Theoretical Computer Science [412], 2556-2561 | Journal Article |
| vanZuylenWAOA2011 | van Zuylen, Anke | 2012 | | Simpler 3/4-approximation algorithms for MAX SAT
In: Approximation and Online Algorithms : 9th International Workshop, WAOA 2011, 188-197 | Proceedings Article |
| VAT2013 | Jurkiewicz, Tomasz
Mehlhorn, Kurt | 2013 | | The cost of address translation
In: Proceedings of the Meeting on Algorithm Engineering & Experiments, | Proceedings Article |
| VerificationCertComp12 | Alkassar, Eyad
Böhme, Sascha
Mehlhorn, Kurt
Rizkallah, Christine | 2013 | | A Framework for the Verification of Certifying Computations | Unpublished/Draft |
| Vidali2009 | Vidali, Angelina | 2009 | | The Geometry of Truthfulness
In: Internet and Network Economics : 5th International Workshop, WINE 2009, 340-350 | Proceedings Article |
| Vidali2010 | Pountourakis, Emmanouil
Vidali, Angelina | 2010 | | A complete characterization of group-strategyproof mechanisms of cost-sharing.
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. I, 146-157 | Proceedings Article |
| VLM97 | Vingron, Martin
Lenhof, Hans-Peter
Mutzel, Petra | 1997 | | Computational Molecular Biology
In: Annotated Bibliographies in Combinatorial Optimization, 445-471 | Part of a Book |
| Vocking2000 | Maggs, Bruce M.
Vöcking, Berthold | 2000 | | Improved Routing and Sorting on Multibutterflies
In: Algorithmica [28], 438-464 | Journal Article |
| Vöcking2003 | Krick, Christof
Meyer auf der Heide, Friedhelm
Räcke, Harald
Vöcking, Berthold
Westermann, Matthias | 2003 | | Data Management in Networks: Experimental Evaluation of a Provably Good Strategy
In: Theory of Computing Systems [35], 217-245 | Journal Article |
| Voecking2000 | Karp, Richard
Schindelhauer, Christian
Shenker, Scott
Vöcking, Berthold | 2000 | | Randomized Rumor Spreading
In: 41th Annual Symposium on Foundations of Computer Science (FOCS-00), 565-574 | Proceedings Article |
| Voecking2001a | Rajaraman, Rajmohan
Richa, Andrea W.
Vöcking, Berthold
Vuppuluri, Gayathri | 2001 | | A Data Tracking Scheme for General Networks
In: Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-01), 247-254 | Proceedings Article |
| Voecking2001b | Vöcking, Berthold | 2001 | | Almost Optimal Permutation Routing on Hypercubes
In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC-01), 530-539 | Proceedings Article |
| Voecking2001c | Vöcking, Berthold | 2001 | | Symmetric vs. Asymmetric Multiple-Choice Algorithms
In: Proceedings of the 2nd International Workshop on Approximation and Randomized Algorithms in Communication Networks (ARACNE), 1-10 | Proceedings Article |
| w-jccetansal-03 | Wolpert, Nicola | 2003 | | Jacobi Curves: Computing the Exact Topology of Arrangements of Non-Singular Algebraic Curves | Report |
| WadsCentroid07 | Ajwani, Deepak
Ray, Saurabh
Seidel, Raimund
Tiwary, Hans Raj | 2007 | | On Computing the Centroid of the Vertices of an Arrangement and Related Problems
In: 10th Workshop on Algorithms and Data Structures (WADS), 519-528 | Proceedings Article |
| Wagner2011EWEA | Wagner, Markus
Veeramachaneni, Kalyan
Neumann, Frank
O'Reilly, Una-May | 2011 | | Optimizing the Layout of 1000 Wind Turbines
In: European Wind Energy Association Annual Event, 1-10 | Proceedings Article |
| Wahl2000 | Wahl, Michaela | 2000 | | Ein neuer Algorithmus für Online-Scheduling
Universität des Saarlandes | Thesis - Masters thesis |
| Wahl2010 | Wahlström, Magnus | 2011 | | New Plain-Exponential Time Classes for Graph Homomorphism
In: Theory of Computing Systems [49], 273-282 | Journal Article |
| Wahlstroem2008 | Wahlström, Magnus | 2008 | | A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances
In: 3rd International Workshop on Parameterized and Exact Computation (IWPEC 2008), 202-213 | Proceedings Article |
| Wahlstroem2009 | Wahlström, Magnus | 2009 | | New Plain-Exponential Time Classes for Graph Homomorphism
In: Computer Science – Theory and Applications : 4th International Computer Science Symposium in Russia, CSR 2009, 346-355 | Proceedings Article |
| Wahlstroem2013a | Wahlström, Magnus | 2013 | | Abusing the Tutte Matrix: An Algebraic Instance Compression for the K-set-cycle Problem
In: 29th International Symposium on Theoretical Aspects of Computer Science (STACS-13), | Electronic Proceedings Article |
| Warken2001 | Warken, Thomas
Schömer, Elmar | 2001 | | Rolling Rigid Objects
In: Proceedings of the 9th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision (WSCG-01), 57-62 | Proceedings Article |
| Warken2004 | Warken, Thomas | 2004 | | Collision detection for Curved Rigid Objects in the Context of Dynamics Simulations
Universität des Saarlandes | Thesis - PhD thesis |
| weberetal05airweb | Bifet, Albert
Castillo, Carlos
Chirita, Paul-Elexandru
Weber, Ingmar | 2005 | | An Analysis of Factors Used in Search Engine Ranking
In: 1st International Workshop on Adversarial Information Retrieval on the Web (AIRWeb'05), 1-10 | Electronic Proceedings Article |
| WeberPhD | Weber, Ingmar | 2007 | | Efficient Index Structures for and Applications of the CompleteSearch Engine
Universität des Saarlandes | Thesis - PhD thesis |
| WeikumBCHST05 | Weikum, Gerhard
Bast, Holger
Canright, Geoffrey
Hales, David
Schindelhauer, Christian
Triantafillou, Peter | 2007 | | Towards Peer-to-Peer Web Search
In: 1st European Conference on Complex Systems, ECCS'05, ? | Proceedings Article |
| WeikumBCHST05b | Weikum, Gerhard
Bast, Holger
Canright, Geoffrey
Hales, David
Schindelhauer, Christian
Triantafillou, Peter | 2005 | | Towards Self-Organizing Query Routing and Processing for Peer-to-Peer Web Search
In: Workshop on Peer-to-peer Data Management in the Complex Systems Perspective, 7-24 | Proceedings Article |
| WeinandDipl05 | Weinand, Caroline | 2005 | | Fill-in Reduction while Solving large, sparse Linear Systems with Graph Theoretical Methods
Universität des Saarlandes | Thesis - Masters thesis |
| Weiskircher1998 | Mutzel, Petra
Weiskircher, René | 1998 | | Two-Layer Planarization in Graph Drawing
In: Proceedings of the 9th International Symposium on Algorithms and Computation (ISAAC-98), 69-78 | Proceedings Article |
| Weiskircher1999 | Mutzel, Petra
Weiskircher, René | 1999 | | Optimizing Over All Combinatorial Embeddings of a Planar Graph
In: Proceedings of the 7th International Conference on Integer Programming and Combinatorial Optimization (IPCO-99), 361-376 | Proceedings Article |
| Weiskircher97 | Weiskircher, Rene | 1997 | | 2-Schicht-Planarisierung bipartiter Graphen
Universität des Saarlandes | Thesis - Masters thesis |
| WeiskircherDiss02 | Weiskircher, Rene | 2002 | | New Applications of SPQR-Trees in Graph Drawing
Universität des Saarlandes | Thesis - PhD thesis |
| Welzl87a | Alt, Helmut
Mehlhorn, Kurt
Wagener, Hubert
Welzl, Emo | 1987 | | Convergence, Similarity and Symmetries of Geometric Objects
In: Computational geometry (SCG-87) : 3rd symposium, 308-315 | Proceedings Article |
| Wilhelmi95 | Wilhelmi, Harald | 1995 | | Erzeugung von Pseudozufallszahlen gemäß einer veränderbaren Verteilung
Universität des Saarlandes | Thesis - Masters thesis |
| Winzen2011b | Winzen, Carola | 2011 | | Direction-Reversing Quasi-Random Rumor Spreading with Restarts | Unpublished/Draft |
| Winzen2013 | Winzen, Carola | 2013 | | Direction-Reversing Quasi-Random Rumor Spreading with Restarts
In: Information Processing Letters [113], 921-926 | Journal Article |
| Winzen2013z | Clementi, Andrea
Crescenzi, Pierluigi
Doerr, Carola
Fraigniaud, Pierre
Isopi, Marc
Panconesi, Alessandro
Pasquale, Francesco
Silvestri, Riccardo | 2013 | | Rumor Spreading in Random Evolving Graphs
In: Proc. of the 21st European Symposium on Algorithms (ESA 2013), 325-336 | Proceedings Article |
| WinzenDiss2011 | Winzen, Carola | 2011 | | Toward a complexity theory for randomized search heuristics : black box models
Universität des Saarlandes | Thesis - PhD thesis |
| Wissen98 | Wissen, Michael | 1998 | | Automatisiertes Zeichnen von Zustandsdiagrammen
Universität des Saarlandes | Thesis - Masters thesis |
| WolpertDiss2002 | Wolpert, Nicola | 2002 | | An Exact and Efficient Approach for Computing a Cell in an Arrangement of Quadrics
Universität des Saarlandes | Thesis - PhD thesis |
| Xia2013-soda-clx | Cai, Jin-Yi
Lu, Pinyan
Xia, Mingji | 2013 | | Dichotomy for Holant* Problems with a Function on Domain Size 3
In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 1278-1295 | Proceedings Article |
| XKSC2008 | Xu, Chihao
Karrenbauer, Andreas
Soh, Kian Min
Codrea, Cosmin | 2008 | | Consecutive multiline addressing: A scheme for addressing PMOLEDs
In: Journal of the Society for Information Display [16], 211-219 | Journal Article |
| XKSW2007 | Xu, Chihao
Karrenbauer, Andreas
Soh, Kian Min
Wahl, Jürgen | 2007 | | A New Addressing Scheme for PM OLED Display
In: SID 2007 International Symposium Digest of Technical Papers, 97-100 | Proceedings Article |
| YSSSoftpredicates2013 | Yap, Chee
Sagraloff, Michael
Sharma, Vikram | 2013 | | Analytic Root Clustering: A Complete Algorithm using Soft Zero Tests | Unpublished/Draft |
| Zaro-et-al-1-95 | Dubhashi, Devdatt
Pantziou, Grammati E.
Spirakis, Paul G.
Zaroliagis, Christos | 1995 | | The Fourth Moment in Luby's Distribution
In: Theoretical Computer Science [148], 133-140 | Journal Article |
| Zaro-et-al-1-97 | Kagaris, Dimitrios
Pantziou, Grammati E.
Tragoudas, Spyros
Zaroliagis, Christos | 1999 | | Transmissions in a network with capacities and delays
In: Networks [33
], 167-174 | Journal Article |
| Zaro-et-al-2-95 | Kagaris, Dimitrios
Pantziou, Grammati E.
Tragoudas, Spyros
Zaroliagis, Christos | 1995 | | Quickest Paths: Parallelization and Dynamization
In: 28th Annual Hawaii International Conference on System Sciences (HICSS-28), 39-44 | Proceedings Article |
| Zaro-et-al-3-95 | Kagaris, Dimitrios
Pantziou, Grammati E.
Tragoudas, Spyros
Zaroliagis, Christos | 1995 | | On the Computation of Fast Data Transmissions in Networks
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 291-302 | Proceedings Article |
| Zaroliagis96 | Arikati, Srinivasa Rao
Chen, Danny Z.
Chew, L. Paul
Das, Gautam
Smid, Michiel
Zaroliagis, Christos | 1996 | | Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane
In: Algorithms - ESA '96: 4th Annual European Symposium, 514-528 | Proceedings Article |
| Zaroliagis97PPL | Zaroliagis, Christos | 1997 | | Simple and Work-Efficient Parallel Algorithms for the Minimum Spanning Tree Problem
In: Parallel Processing Letters [7], 25-37 | Journal Article |
| Ziad94 | Abo-Hasna, Ziad | 1994 | | Verdrahtung von Kanälen mit Seitenanschlüssen
Universität des Saarlandes | Thesis - Masters thesis |
| Ziegelmann1999 | Comes, Jochen
Ziegelmann, Mark | 1999 | | An Easy to Use Implementation of Linear Perturbations within CGAL
In: Algorithm engineering (WAE-99) : 3rd International Workshop, WAE'99, 169-182 | Proceedings Article |
| Ziegelmann2001 | Ziegelmann, Mark | 2001 | | Constrained Shortest Paths and Related Problems
Universität des Saarlandes | Thesis - PhD thesis |
| Ziegenbein97 | Ziegenbein, Kurt | 1997 | | Bewertung verschiedener paarweiser Alignment-Methoden, Ersetzungsmatrizen und Gap-Funktionen
Universität des Saarlandes | Thesis - Masters thesis |
| Ziegler95 | Ziegler, Thomas | 1995 | | Max-Weighted-Matching auf allgemeinen Graphen
Universität des Saarlandes | Thesis - Masters thesis |
| ZieglerDiss00 | Ziegler, Thomas | 2000 | | Crossing Minimization in Automatic Graph Drawing
Universität des Saarlandes | Thesis - PhD thesis |
| Zuelow94 | von Zülow, Max Henning | 1994 | | Das k-Closest-Pair-Problem
Universität des Saarlandes | Thesis - Masters thesis |
