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 - 4. with BibTeX cite keys

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

YearTitleBibTeX cite key
Hide details for WahlströmWahlström
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),
Wahlstroem2013a
2011New Plain-Exponential Time Classes for Graph Homomorphism
In: Theory of Computing Systems [49], 273-282
Wahl2010
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
Wahlstroem2009
2008A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances
In: 3rd International Workshop on Parameterized and Exact Computation (IWPEC 2008), 202-213
Wahlstroem2008
Hide details for WangWang
2012Certification of Curve Arrangements
Universität des Saarlandes
MasterWang2012
Hide details for WarkenWarken
2004Collision detection for Curved Rigid Objects in the Context of Dynamics Simulations
Universität des Saarlandes
Warken2004
Hide details for Warken, SchömerWarken, Schömer
2001Rolling Rigid Objects
In: Proceedings of the 9th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision (WSCG-01), 57-62
Warken2001
Hide details for WeberWeber
2007Attachment IconEfficient Index Structures for and Applications of the CompleteSearch Engine
Universität des Saarlandes
WeberPhD
2006Solving large Sparse Linear Systems exactly
Universität des Saarlandes
DiplWeber06
Hide details for Weikum, Bast, Canright, Hales, Schindelhauer, TriantafillouWeikum, Bast, Canright, Hales, Schindelhauer, Triantafillou
2007Towards Peer-to-Peer Web Search
In: 1st European Conference on Complex Systems, ECCS'05, ?
WeikumBCHST05
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
WeikumBCHST05b
Hide details for WeinandWeinand
2005Fill-in Reduction while Solving large, sparse Linear Systems with Graph Theoretical Methods
Universität des Saarlandes
WeinandDipl05
Hide details for WeiskircherWeiskircher
2002New Applications of SPQR-Trees in Graph Drawing
Universität des Saarlandes
WeiskircherDiss02
1997Attachment Icon2-Schicht-Planarisierung bipartiter Graphen
Universität des Saarlandes
Weiskircher97
Hide details for Wendt, Lange, Ray, SmidWendt, Lange, Ray, Smid
2001Surface Topography Quantification using Computational GeometryRahul2002c
Hide details for Wendt, Lange, Smid, Ray, TönniesWendt, Lange, Smid, Ray, Tönnies
2002Surface Topography Quantification by Integral and Feature-related Parameters
In: Materialwissenschaft und Werkstofftechnik [33], 621-627
Rahul2002a
Hide details for WilhelmiWilhelmi
1995Erzeugung von Pseudozufallszahlen gemäß einer veränderbaren Verteilung
Universität des Saarlandes
Wilhelmi95
Hide details for WinzenWinzen
2013Direction-Reversing Quasi-Random Rumor Spreading with Restarts
In: Information Processing Letters [113], 921-926
Winzen2013
2011Direction-Reversing Quasi-Random Rumor Spreading with RestartsWinzen2011b
2011Toward a complexity theory for randomized search heuristics : black box models
Universität des Saarlandes
WinzenDiss2011
Hide details for WissenWissen
1998Automatisiertes Zeichnen von Zustandsdiagrammen
Universität des Saarlandes
Wissen98
Hide details for WolpertWolpert
2003Jacobi Curves: Computing the Exact Topology of Arrangements of Non-Singular Algebraic Curvesw-jccetansal-03
2002An Exact and Efficient Approach for Computing a Cell in an Arrangement of Quadrics
Universität des Saarlandes
WolpertDiss2002
Hide details for Xu, Karrenbauer, Soh, CodreaXu, Karrenbauer, Soh, Codrea
2008Consecutive multiline addressing: A scheme for addressing PMOLEDs
In: Journal of the Society for Information Display [16], 211-219
XKSC2008
Hide details for Xu, Karrenbauer, Soh, WahlXu, Karrenbauer, Soh, Wahl
2007A New Addressing Scheme for PM OLED Display
In: SID 2007 International Symposium Digest of Technical Papers, 97-100
XKSW2007
Hide details for Xu, Wahl, Eeisenbrand, Karrenbauer, Soh, HitzelbergerXu, Wahl, Eeisenbrand, Karrenbauer, Soh, Hitzelberger
2005Verfahren zur Ansteuerung von Matrixanzeigenpatent2005
Hide details for Yap, Sagraloff, SharmaYap, Sagraloff, Sharma
2013Analytic Root Clustering: A Complete Algorithm using Soft Zero TestsYSSSoftpredicates2013
Hide details for ZaroliagisZaroliagis
1997Simple and Work-Efficient Parallel Algorithms for the Minimum Spanning Tree Problem
In: Parallel Processing Letters [7], 25-37
Zaroliagis97PPL
Hide details for ZiegelmannZiegelmann
2001Constrained Shortest Paths and Related Problems
Universität des Saarlandes
Ziegelmann2001
Hide details for ZiegenbeinZiegenbein
1997Bewertung verschiedener paarweiser Alignment-Methoden, Ersetzungsmatrizen und Gap-Funktionen
Universität des Saarlandes
Ziegenbein97
Hide details for ZieglerZiegler
2000Crossing Minimization in Automatic Graph Drawing
Universität des Saarlandes
ZieglerDiss00
1995Max-Weighted-Matching auf allgemeinen Graphen
Universität des Saarlandes
Ziegler95
Hide details for ZosinZosin
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
NZ97
Hide details for Zotenko, Mestre, O'Leary, PrzytyzkaZotenko, Mestre, O'Leary, Przytyzka
2008Essential Complex Biological Modules Explain the Centrality-Lethality Rule
In: PLoS Computational Biology [x], x-x
jounal/ploscb/ZotenkoMOP2008

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