| # |  | Year | | Title | Type | |
|---|
| 1 |
![Hide details for Telikepalli [Pandya, Radhakrishnan]](/intranet/ag1/ag1publ.nsf/$PlusMinus?OpenImageResource&ImgIndex=1) | Telikepalli [Pandya, Radhakrishnan] |
| |
| | 2003 | | Efficient Algorithms for Abelian group isomorphism and related problems
In: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science : 23rd Conference, 277-288 | Proceedings Article | |
| 1 |
| Telikepalli, Chandran, Subramanian [Subramanian, Warnow, Zhu] |
| |
| | 2003 | | Isoperimetric Inequalities and Width Parameters of Graphs
In: Computing and Combinatorics : 9th Annual International Conference, COCOON 2003, 385-393 | Proceedings Article | |
| 1 |
| Telikepalli, Varadarajan [Varadarajan, McAllister] |
| |
| | 2003 | | On Shortest Paths in Line Arrangements
In: 15th Canadian Conference in Computational Geometry (CCCG-03), 170-173 | Proceedings Article | |
| 1 |
| Teramoto, Asano, Katoh, Doerr [Teramoto, Asano, Katoh] |
| |
| | 2006 | | Inserting Points Uniformly at Every Instance
In: IEICE - Transactions on Information and Systems [E89-D], 2348-2356 | Journal Article | |
| 3 |
| Thiel [-] |
| |
| | 2004 | | Efficient Algorithms for Constraint Propagation and for Processing Tree Descriptions
Universität des Saarlandes | Thesis - PhD thesis | |
| | 1999 |  | Persistente Suchbäume
Universität des Saarlandes | Thesis - Masters thesis | |
| | 1996 | | Effiziente Algorithmen für Probleme der Kollisionserkennung und der geometrischen Optimierung
Universität des Saarlandes | Thesis - PhD thesis | |
| 1 |
| Thierens, Beyer, Bongard, Branke, Clark, Cliff, Congdon, Deb, Doerr, Kovacs, Kumar, Miller, Moore, Neumann, Pelikan, Poli, Sastry, Stanley, Stützle, Watson, Wegener (ed.) [Thierens, Beyer, Bongard, Branke, Clark, Cliff, Congdon, Deb, Kovacs, Kumar, Miller, Moore, Pelikan, Poli, Sastry, Stanley, Stützle, Watson, Wegener] |
| |
| | 2007 | | GECCO 2007: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation | Proceedings | |
| 1 |
| Thome [-] |
| |
| | 2000 | | Erweiterung des hierarchischen Zeichenmodells in ArchEd
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Thorup [-] |
| |
| | 2000 | | Floats, Integers, and Single Source Shortest Paths
In: Journal of Algorithms [35], 189 -201 | Journal Article | |
| 1 |
| Tiwary, Elbassioni [Tiwary] |
| |
| | 2008 | | On the complexity of checking self-duality of polytopes and its relations to vertex enumeration and graph isomorphism
In: Symposium on Computational Geometry 2008, 192-198 | Proceedings Article | |
| 2 |
| Träff [-] |
| |
| | 1996 | | A Heuristic for Blocking Flow Algorithms
In: European Journal of Operational Research [89], 564-569 | Journal Article | |
| | 1995 | | An Experimental Comparison of two Distributed Singel-Source Shortest Path Algorithm
In: Parallel Computing [21], 1505-1532 | Journal Article | |
| 1 |
| |
| | 2000 | | 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 | |
| 1 |
| Träff, Zaroliagis [Ferreira, Rolim, Saad, Yang] |
| |
| | 1996 | | 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 | |
| 1 |
| van Leeuwen, Mehlhorn, Reps (ed.) [-] |
| |
| | 1994 | | Incremental Computation and Dynamic Algorithms 02.05.-06.05.94 | Report | |
| 5 |
| |
| | 2013 | | SIGACT News Online Algorithms Column 22
In: SIGACT News [44], 125 | Journal Article | |
| | 2012 | | An improved algorithm for online rectangle filling
In: Theoretical Computer Science [423], 59-74 | Journal Article | |
| | 2012 | | SIGACT News Online Algorithms Column 20: The Power of Harmony
In: SIGACT News [43], 127-136 | Journal Article | |
| | 2012 | | SIGACT News Online Algorithms Column 21: APPROX and ALGO
In: SIGACT News [43], 123-129 | Journal Article | |
| | 2008 | | Combinatorial algorithms for packing and scheduling problems
Universität Karlsruhe | Thesis - Habilitation thesis | |
| 1 |
| van Stee [Jansen, Solis-Oba] |
| |
| | 2011 | | An improved algorithm for online rectangle filling
In: Approximation and Online Algorithms : 8th International Workshop, WAOA 2010, 249-260 | Proceedings Article | |
| 2 |
| |
| | 2008 | | Packet Switching in Single Buffer
In: Encyclopedia of Algorithms, 1-99 | Part of a Book | |
| | 2008 | | Paging
In: Encyclopedia of Algorithms, 1-99 | Part of a Book | |
| 3 |
| van Zuylen [-] |
| |
| | 2011 | | An improved monotone algorithm for scheduling related machines with precedence constraints
In: Operations Research Letters [39], 423-427 | Journal Article | |
| | 2011 | | Deterministic Sampling Algorithms for Network Design
In: Algorithmica [60], 110-151 | Journal Article | |
| | 2011 | | Linear programming based approximation algorithms for feedback set problems in bipartite tournaments.
In: Theoretical Computer Science [412], 2556-2561 | Journal Article | |
| 1 |
| van Zuylen [Solis-Oba, Persiano] |
| |
| | 2012 | | Simpler 3/4-approximation algorithms for MAX SAT
In: Approximation and Online Algorithms : 9th International Workshop, WAOA 2011, 188-197 | Proceedings Article | |
| 1 |
| van Zuylen, Schalekamp, Williamson [Schalekamp, Williamson, Adacher, Flamini, Leo, Nicosia, Pacifici, Piccialli] |
| |
| | 2011 | | Popular Ranking
In: 10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2011, 267-270 | Electronic Proceedings Article | |
| 1 |
| Vidali [Leonardi] |
| |
| | 2009 | | The Geometry of Truthfulness
In: Internet and Network Economics : 5th International Workshop, WINE 2009, 340-350 | Proceedings Article | |
| 1 |
| Vingron, Lenhof, Mutzel [Vingron] |
| |
| | 1997 | | Computational Molecular Biology
In: Annotated Bibliographies in Combinatorial Optimization, 445-471 | Part of a Book | |
| 2 |
| Vöcking [-] |
| |
| | 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 | |
| | 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 | |
| 1 |
| von Braunmühl, Cook, Mehlhorn, Verbeek [-] |
| |
| | 1983 | | The Recognition of Deterministic CFL's in Small Time and Space
In: Information and Control [56], 34-51 | Journal Article | |
| 1 |
| |
| | 1994 | | Das k-Closest-Pair-Problem
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Wagner, Veeramachaneni, Neumann, O'Reilly [Veeramachaneni, Neumann, O'Reilly] |
| |
| | 2011 | | Optimizing the Layout of 1000 Wind Turbines
In: European Wind Energy Association Annual Event, 1-10 | Proceedings Article | |
| 1 |
| |
| | 2000 | | Ein neuer Algorithmus für Online-Scheduling
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| |
| | 2011 | | New Plain-Exponential Time Classes for Graph Homomorphism
In: Theory of Computing Systems [49], 273-282 | Journal Article | |
| 1 |
| Wahlström [Frid, Morozov, Rybalchenko, Wagner] |
| |
| | 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 | |
| 1 |
| Wahlström [Grohe, Niedermeier] |
| |
| | 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 | |
| 1 |
| Wahlström [Portier, Wilke] |
| |
| | 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 | |
| 1 |
| |
| | 2012 | | Certification of Curve Arrangements
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| |
| | 2004 | | Collision detection for Curved Rigid Objects in the Context of Dynamics Simulations
Universität des Saarlandes | Thesis - PhD thesis | |
| 1 |
| |
| | 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 | |
| 2 |
| |
| | 2007 | | Efficient Index Structures for and Applications of the CompleteSearch Engine
Universität des Saarlandes | Thesis - PhD thesis | |
| | 2006 | | Solving large Sparse Linear Systems exactly
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Weikum, Bast, Canright, Hales, Schindelhauer, Triantafillou [Canright, Hales, Schindelhauer, Triantafillou, Schindelhauer] |
| |
| | 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 | |
| 1 |
| Weikum, Bast, Canright, Hales, Schindelhauer, Triantafillou [Canright, Hales, Schindelhauer, Triantafillou] |
| |
| | 2007 | | Towards Peer-to-Peer Web Search
In: 1st European Conference on Complex Systems, ECCS'05, ? | Proceedings Article | |
| 1 |
| Weinand [-] |
| |
| | 2005 | | Fill-in Reduction while Solving large, sparse Linear Systems with Graph Theoretical Methods
Universität des Saarlandes | Thesis - Masters thesis | |
| 2 |
| Weiskircher [-] |
| |
| | 2002 | | New Applications of SPQR-Trees in Graph Drawing
Universität des Saarlandes | Thesis - PhD thesis | |
| | 1997 | | 2-Schicht-Planarisierung bipartiter Graphen
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Wendt, Lange, Ray, Smid [Wendt, Lange, Smid] |
| |
| | 2001 | | Surface Topography Quantification using Computational Geometry | Miscellaneous | |
| 1 |
| Wendt, Lange, Smid, Ray, Tönnies [Tönnies, Wendt, Lange, Smid] |
| |
| | 2002 | | Surface Topography Quantification by Integral and Feature-related Parameters
In: Materialwissenschaft und Werkstofftechnik [33], 621-627 | Journal Article | |
| 1 |
| |
| | 1995 | | Erzeugung von Pseudozufallszahlen gemäß einer veränderbaren Verteilung
Universität des Saarlandes | Thesis - Masters thesis | |
| 3 |
| |
| | 2013 | | Direction-Reversing Quasi-Random Rumor Spreading with Restarts
In: Information Processing Letters [113], 921-926 | Journal Article | |
| | 2011 | | Direction-Reversing Quasi-Random Rumor Spreading with Restarts | Unpublished/Draft | |
| | 2011 | | Toward a complexity theory for randomized search heuristics : black box models
Universität des Saarlandes | Thesis - PhD thesis | |
| 1 |
| |
| | 1998 | | Automatisiertes Zeichnen von Zustandsdiagrammen
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| |
| | 2002 | | An Exact and Efficient Approach for Computing a Cell in an Arrangement of Quadrics
Universität des Saarlandes | Thesis - PhD thesis | |
| 1 |
| Wolpert [Di Battista, Zwick] |
| |
| | 2003 | | Jacobi Curves: Computing the Exact Topology of Arrangements of Non-Singular Algebraic Curves | Report | |
| 1 |
| Xu, Karrenbauer, Soh, Codrea [Xu, Soh, Codrea] |
| |
| | 2008 | | Consecutive multiline addressing: A scheme for addressing PMOLEDs
In: Journal of the Society for Information Display [16], 211-219 | Journal Article | |
| 1 |
| Xu, Karrenbauer, Soh, Wahl [Xu, Soh, Wahl, Morreale] |
| |
| | 2007 | | A New Addressing Scheme for PM OLED Display
In: SID 2007 International Symposium Digest of Technical Papers, 97-100 | Proceedings Article | |
| 1 |
| Xu, Wahl, Eeisenbrand, Karrenbauer, Soh, Hitzelberger [Xu, Wahl, Eeisenbrand, Soh, Hitzelberger] |
| |
| | 2005 | | Verfahren zur Ansteuerung von Matrixanzeigen | Miscellaneous | |
| 1 |
| Yap, Sagraloff, Sharma [Yap, Sharma] |
| |
| | 2013 | | Analytic Root Clustering: A Complete Algorithm using Soft Zero Tests | Unpublished/Draft | |
| 1 |
| |
| | 1997 | | Simple and Work-Efficient Parallel Algorithms for the Minimum Spanning Tree Problem
In: Parallel Processing Letters [7], 25-37 | Journal Article | |
| 1 |
| |
| | 2001 | | Constrained Shortest Paths and Related Problems
Universität des Saarlandes | Thesis - PhD thesis | |
| 1 |
| |
| | 1997 | | Bewertung verschiedener paarweiser Alignment-Methoden, Ersetzungsmatrizen und Gap-Funktionen
Universität des Saarlandes | Thesis - Masters thesis | |
| 2 |
| |
| | 2000 | | Crossing Minimization in Automatic Graph Drawing
Universität des Saarlandes | Thesis - PhD thesis | |
| | 1995 | | Max-Weighted-Matching auf allgemeinen Graphen
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Zosin [] |
| |
| | 1997 | | A 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 |
| Zotenko, Mestre, O'Leary, Przytyzka [-] |
| |
| | 2008 | | Essential Complex Biological Modules Explain the Centrality-Lethality Rule
In: PLoS Computational Biology [x], x-x | Journal Article | |
| 2359 |
| |
