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 - 2. by Group - 3. by Names Including [Non Members]

Login to this database


 

Previous Page | Next Page | Expand All | Collapse All | Search (Full Text)
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

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

Previous Page | Next Page | Expand All | Collapse All | Search (Full Text)