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

	Year		Title	BibTeX cite key
Näher, Mehlhorn
	1990		LEDA - A Library of Efficient Data Types and Algorithms In: GI - 20. Jahrestagung I, Informatik auf dem Weg zum Anwender, 35-39	DBLP:conf/gi/NaherM90
	1990		LEDA: A Library of Efficient Data Types and Algorithms In: Automata, languages and programming (ICALP-90) : 17th international colloquium, 1-5	Mehlhorn90b
Naujoks
	2008		NP-hard Networking Problems - Exact and Approximate Algorithms Universität des Saarlandes	NaujoksPhD
	2004		A heuristic for solving interior point Methods exactly Universität des Saarlandes	Naujoks/Diplom04
Nest
	1998		Vergleich von praxisnahen seriellen und parallelisierten Verfahren zur Bestimmung der Schnittpunkte von Liniensegmenten in der Ebene Universität des Saarlandes	Nest98
Neukirch
	1994		Grundlegende geometrische Datenstrukturen und Algorithmen für LEDA Universität des Saarlandes	Neukirch94
Neumann
	2011		Implementation of Schmidt's algorithm for certifying triconnectivity testing Universität des Saarlandes	NeumannMaster2011
	2008		Expected Runtimes of Evolutionary Algorithms for the Eulerian Cycle Problem In: Computers and Operations Research [35], 2750-2759	NeuEul07
Neumann, Haltner, Lehr, Kohlbacher, Lenhof
	1998		Investigating the Sugar-Lectin Interaction by Computational Chemistry: Tunneling the Epithelial Barrier In: Proceedings of the 18th Interlec Meeting, 549	NeumannHaltnerLehr1998
Neumann, Kohlbacher, Haltner, Lenhof, Lehr
	2000		Modeling the Sugar Lectin Interaction by Computational Chemistry Relevant to Drug Design In: Proceedings of the 3rd World Meeting on Pharmaceutics, Biopharmaceutics and Pharmaceutical Technology, 233	NKH+2000
Neumann, Oliveto, Witt
	2009		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	NeuOliWitGECCO2009
Neumann, Reichel
	2008		Approximating Minimum Multicuts by Evolutionary Multi-Objective Algorithms In: Parallel Problem Solving from Nature (PPSN X), 72-81	NeuReiPPSN2008
Neumann, Reichel, Skutella
	2011		Computing Minimum Cuts by Randomized Search Heuristics In: Algorithmica [59], 323-342	Neumann2011
	2008		Computing Minimum Cuts by Randomized Search Heuristics In: Genetic and Evolutionary Computation Conference 2008, 779-786	NeuReiSku2008
Neumann, Sudholt, Witt
	2009		Analysis of Different MMAS ACO Algorithms on Unimodal Functions and Plateaus In: Swarm Intelligence [3], 35-68	NeuSudWitSwarm2009
	2009		Computational Complexity of Ant Colony Optimization and Its Hybridization with Local Search In: Innovations in Swarm Intelligence, 91-120	NSWACOchapter09
	2008		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	NeuSudWit2008
	2007		Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions In: Engineering Stochastic Local Search Algorithms 2007, 61-75	NSWSLS2007
Neumann, Wegener
	2007		Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem In: Theoretical Computer Science [378], 32-40	NeuWegMST2007
Neumann, Witt
	2010		Ant Colony Optimization and the minimum spanning tree problem In: Theoretical Computer Science [411], 2406-2413	NeumannWitt2010
	2010		Bioinspired Computation in Combinatorial Optimization : Algorithms and Their Computational Complexity	BookNeumannWitt
	2009		Runtime Analysis of a Simple Ant Colony Optimization Algorithm In: Algorithmica [54], 243-255	Neumann2008
	2008		Ant Colony Optimization and the Minimum Spanning Tree Problem In: International Conference on Learning and Intelligent Optimization 2007, 153-166	NeuWitLion2008
	2006		Ant Colony Optimization and the Minimum Spanning Tree Problem	NeuWittMST2006
Newo Kenmogne
	2005		Understanding LSI Via The Truncated Term-Term Matrix Universität des Saarlandes	NewoDipl05
Niedermeier, Reinhard, Sanders
	2002		Towards Optimal Locality in Mesh-Indexings In: Discrete Applied Mathematics [117], 211-237	Sanders2002f
Nissen
	1998		Graph Iterators: Decoupling Graph Structures from Algorithms Universität des Saarlandes	Nissen98
Nor, Hermelin, Charlat, Engelstadter, Reuter, Duron
	2010		Mod/Resc Parsimony Inference In: Combinatorial Pattern Matching : 21st Annual Symposium, CPM 2010, 202-213	HermelinCulex2010
Nor, Hermlin, Charlat, Engelstadter, Reuter, Duron, Sagot
	2012		Mod/Resc Parsimony Inference: Theory and application In: Information and Computation [213], 23-32	Nor2012
Nutov, Penn
	2000		On Integrality, Stability and Composition of Dicycle Packings and Covers In: Journal of Combinatorial Optimization [4], 235 - 252	Nutov/Penn/2000
Oberhauser
	1997		Arithmetik der Transduktoren Universität des Saarlandes	Oberhauser97
Oliveto, Lehre, Neumann
	2009		Theoretical Analysis of Rank-Based Mutation - Combining Exploration and Exploitation In: 2009 IEEE Congress on Evolutionary Computation : CEC, 1455-1462	LehNeuOliCEC2009
Ossamy
	2002		TSP Cuts Outside the Template Paradigm Universität des Saarlandes	OssamyDipl02
Ost
	1995		Algorithmen für das Kantenfärbungsproblem Universität des Saarlandes	Ost95
Ott
	2012		Thou shalt not lie : on truthfully maximizing the minimum load on selfish related machines Universität des Saarlandes	OttMaster2012
Paluch
	2006		A New Approximation Algorithm for Multidimensional Rectangle Tiling In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 712-721	Paluch2006
Panagiotou
	2009		Blocks In Constrained Random Graphs with Fixed Average Degree In: 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009), 733-744	Panagiotou2008
	2009		The Degree Sequence of Random Graphs from Subcritical Classes In: Combinatorics, Probability and Computing [18], 647-681	BernasconiPanagiotouSteger2009
	2009		Vertices of Degree k in Random Unlabeled Trees In: European Conference on Combinatorics, Graph Theory and Applications (EuroComb '09), 41-45	PanagiotouSinhaProc2009
Panagiotou, Coja-Oghlan
	2012		Catching the k-NAESAT Threshold In: STOC’12 : Proceedings of the 2012 ACM Symposium on Theory of Computing, 899-907	ACO-P2012
Panagiotou, Pourmiri, Sauerwald
	2013		Faster Rumor Spreading with Multiple Calls In: 24th International Symposium on Algorithms and Computation (ISAAC-13), 446-456	Pourmiri2013
Panagiotou, Sinha
	2012		Vertices of degree k in random unlabeled trees In: Journal of Graph Theory [69], 114-130	Panagiotou2012b
Panagiotou, Spöhel, Steger, Thomas
	2013		Explosive percolation in Erdös-Rényi-like random graph processes In: Combinatorics, Probability and Computing [22], 133-145	SpoehelPST2013
	2011		Explosive percolation in Erdős-Rényi-like random graph processes In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 699-704	Spoehel2011c
Panagiotou, Steger
	2011		On the Degree Sequence of Random Planar Graphs In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), 1198-1210	PanagiotouSteger2011
	2010		Maximal Biconnected Subgraphs of Random Planar Graphs In: ACM Transactions on Algorithms [6], 31,1-31,21	PanagiotouStegerJournal2010
	2009		Maximal Biconnected Subgraphs of Random Planar Graphs In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 432-440	PanagiotouSteger2008
Panconesi, Papatriantafilou, Tsigas, Vitanyi
	1998		Randomized Naming Using Wait-Free Shared Variables In: Distributed Computing [11], 113-124	ptrianta-tsigas98-1
Papatriantafilou, Tsigas
	1997		Self-Stabilizing Wait-Free Clock Synchronization In: Parallel Processing Letters [7], 321-328	ptrianta-tsigas97-1
	1995		Wait-Free Consensus in ``In-Phase'' Multiprocessor Systems In: Seventh IEEE Symposium on Parallel and Distributed Processing, 312-319	Papatr-Tsigas95
Park, Lee, Chwa
	2001		Visibility-Based Pursuit-Evasion in a Polygonal Region by a Searcher In: Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP-01), 456-468	Leejha2001
	2000		Characterization of Rooms Searchable by Two Guards In: Proceedings of the 11th Conference on Algorithms and Computation, 515-526	Leejhd2000
Parreira
	2003		Information Retrieval by Dimension Reduction - A Comparative Study Universität des Saarlandes	Master03/Parreira
	2003		On the Role of the Singular Values in Latent Semantic Indexing Universität des Saarlandes	Parreira03
Pemmaraju, Raman, Varadarajan
	2011		Max-coloring and online coloring with bandwidths on interval graphs In: ACM Transactions on Algorithms [7], 35:1-35:21	Pemmaraju2011
Pettie
	2005		Sensitivity Analysis of Minimum Spanning Trees in Sub-Inverse-Ackermann Time In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 964-973	Pettie-sensitivity2005
	2005		Towards a final analysis of pairing heaps In: 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 174-183	Pettie2005
Pettie, Sanders
	2005		Computing Approximate Matchings in External Memory, Streaming, Parallel, and Distributed Network Models	PettieSanders2005
	2004		A simpler linear time 2/3 - eps approximation for maximum weight matching In: Information Processing Letters [91], 271-276	PettieSanders2004
Philip
	2011		The Kernelization Complexity of some Domination and Covering Problems Homi Bhabha National Institute	PhilipPhDThesis
	2008		Fixed-Parameter Algorithms for Graph Problems Using Graph Minor Theory Homi Bhabha National Institute	PhilipMScThesis2008
Philip, Raman, Sikdar
	2012		Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond In: ACM Transactions on Algorithms [9], 23	PhilipRamanSikdar2012
	2009		Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, 694-705	PhilipRamanSikdar2009
Philip, Raman, Villanger
	2010		A 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	PhilipRamanVillanger2010
Piskorski
	1994		Parallele Graphenalgorithmen für den Hypercube Universität des Saarlandes	Piskorski94
Pohl
	2006		Exact Integer Linear Programming with Bounded Variables in a Branch- and Cut Algorithm Universität des Saarlandes	DiplPohl06
Polzin
	2003		Algorithms for the Steiner Problem in Networks Universität des Saarlandes	PolzinPhD03
Polzin, Vahdati Daneshmand
	2003		On Steiner trees and minimum spanning trees in hypergraphs In: Operations Research Letters [31], 12-20	Polzin2002-MSTH
	2002		Extending Reduction Techniques for the Steiner Tree Problem In: Algorithms - ESA 2002 : 10th Annual European Symposium, 795-807	Polzin2002-ESA
	2001		A Comparison of Steiner Tree Relaxations In: Discrete Applied Mathematics [112], 241-261	PolzinVahdati2001a
	2001		Improved Algorithms for the Steiner Problem in Networks In: Discrete Applied Mathematics [112], 263-300	PolzinVahdati2001b
	2000		Primal-Dual Approaches to the Steiner Problem In: Approximation Algorithms for Combinatorial Optimization, 214-225	PolzinVahdati2000
Porkolab, Khachiyan
	1997		Computing Integral Points in Convex Semi-algebraic Sets In: Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS-97), 162-171	Porkolab97a
Portz
	1994		Darstellung und Implementierung polynomieller und streng polynomieller Algorithmen für das Minimum-Cost-Flow-Problem Universität des Saarlandes	Portz94
Potikoglou
	1999		Parallele Algorithmen zur Lösung des Single-Source Shortest Path Problems Universität des Saarlandes	Potikoglou99
Pouchkarev
	2000		ArchEd: Ein interaktives Zeichensystem für die Archäologie Universität des Saarlandes	Pouchkarev2000
Pountourakis, Vidali
	2010		A complete characterization of group-strategyproof mechanisms of cost-sharing. In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. I, 146-157	Vidali2010
Preetham, Krithivasan, Rangan, Sibeyn
	1996		Parallel algorithm for maximum empty L-shaped polygon In: 3rd Conference on High-Performance Computing, -	Sibeyn-et-al96
Priebe
	2001		Average-case complexity of shortest-paths problems Universität des Saarlandes	PriebeDiss01
Pruhs, van Stee, Uthaisombut
	2008		Speed Scaling of Tasks with Precedence Constraints In: Theory of Computing Systems [43], 67-80	vanStee2008h
Pyrga
	2010		Algorithmic Game Theory and Networks Universität des Saarlandes	PyrgaPhD2010
	2005		Shortest Paths in Time-Dependent Networks and their Applications Universität des Saarlandes	PyrgaDipl05
Pyrga, Chung
	2009		Stochastic Stability in Internet Router Congestion Games In: Algorithmic Game Theory : Second International Symposium, SAGT 2009, 183-195	Pyrga2009
Pyrga, Ray
	2008		New existence Proofs for epsilon-nets In: Proceedings of the twenty-fourth annual symposium on Computational geometry, 199-207	Pyrga2008
Pyrga, Schulz, Wagner, Zaroliagis
	2007		Efficient models for timetable information in public transportation systems In: ACM Journal of Experimental Algorithmics [12], 1-39	Pyrga2007
P. Gao
	2012		Distribution of the number of spanning regular subgraphs in random graphs	G6
	2012		Distributions of sparse spanning subgraphs in random graphs	G4
	2012		Uniform generation of d-factors in dense host graphs	G7
Qian, Schalekamp, Williamson, van Zuylen
	2012		On the Integrality Gap of the Subtour LP for the 1,2-TSP In: LATIN 2012: Theoretical Informatics ; 10th Latin American Symposium, 606-617	QianSWvZ12
Raidl, Alba, Bacardit, Beyer, Birattari, Blum, Bosman, Congdon, Corne, Cotta, Di Penta, Doerr, Drechsle, Ebner, Grahl, Jansen, Knowles, Lenaerts, Middendorf, Miller, O'Neill, Poli, Squillero, Stanley, Stützle, van Hemert (ed.)
	2009		GECCO 2009: Proceedings of the 11th Annual conference on Genetic and evolutionary computation.	gecco2009
Rajaraman, Richa, Vöcking, Vuppuluri
	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	Voecking2001a
Ramos
	2001		An Optimal Deterministic Algorithm for Computing the Diameter of a Three-Dimensional Point Set In: Discrete and Computational Geometry [26], 233-244	Ramos00
	2001		Solving Some Discrepancy Problems in NC In: Algorithmica [29], 371-395	MaRaSu00
	2000		Deterministic Algorithms for 3-D Diameter and some 2-D Lower Envelopes In: Proceedings of the 16th Annual Symposium on Computational Geometry (SCG-00), 290-299	Ramos2000c
	2000		Linear Programming Queries Revisited In: Proceedings of the 16th Annual Symposium on Computational Geometry (SCG-00), 176-181	Ramos2000d
	1999		On range reporting, ray shooting and $k$-level construction In: Proceedings of the 15th Annual Symposium on Computational Geometry (SCG-99), 390-399	Ramos1999
	1997		Construction of 1-d lower envelopes and applications In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 57-66	Ramos97
	1997		Intersection of unit-balls and diameter of a point set in R³ In: Computational Geometry Theory and Applications [8], 57-65	Ramos97a
Ramos, Amato, Goodrich
	2001		A Randomized Algorithm for Triangulating a Simple Polygon in Linear Time In: Discrete and Computational Geometry [26], 246-265	AmGoRa01
	2000		Computing the arrangement of curve segments: Divide-and-conquer algorithms via sampling In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00), 705-706	Ramos2000e
Rasch
	1994		Furthest Site Abstract Voronoi Diagrams Universität des Saarlandes	Rasch94
Rathe, Sanders, Knight
	1999		A case study in scalability: an ADI method for the two-dimensional time-dependent Dirac equation In: Parallel Computing [25], 525-534	RatSanKni99
Rau
	1997		Ein experimenteller Vergleich von zwei Algorithmen zur Berechnung des maximalen Flusses in einem asymmetrischen Netzwerk mit reellen Kapazitäten Universität des Saarlandes	Rau97
Rauf
	2005		Earliest Arrival Flows with Multiple Sources Universität des Saarlandes	RaufDiss04
Ray
	2004		Counting Straight-Edge Triangulations of Planar Point Sets Universität des Saarlandes	Ray/Diploma04
	2004		Geometric Algorithms for Object Placement and Planarity in a Terrain Universität des Saarlandes	RayDiss04
	2002		An O(nlogn) Algorithm for Classifying Identical Curves	Rahul2002d
Ray, Mustafa
	2007		Weak $\epsilon$-nets have a basis of size $O(1/\epsilon\log 1/\epsilon)$ in any dimension In: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07), 239-244	NaRa07b
Ray, Smid, Lange, Wendt
	2002		Computing Large Planar Regions in Terrains In: IWCIA 2001, 8th International Workshop on Combinatorial Image Analysis (IWCIA-01), 139-152	Rahul2001
Reichel
	2006		Combinatorial Approaches for the Trunk Packing Problem Universität des Saarlandes	DissReichel06
	2001		Optimale Hüllkörper für Objekte mit gekrümmten Oberflächen Universität des Saarlandes	ReichelDipl01
Reinert
	1999		A polyhedral approach to sequence alignment problems Universität des Saarlandes	ReinertDiss99
	1994		Deferred Data Structuring Universität des Saarlandes	Reinert94
Reinert, Lenhof, Mehlhorn, Mutzel, Kececioglu
	1997		A Branch-And-Cut algorithm for multiple sequence alignment In: Proceedings of the 1st Annual International Conference on Computational Molecular Biology (RECOMB-97), 241-250	Lenhof-et-al-1-97
Reinstädtler
	1998		Verlustfreie Datenkompression mit selbstorganisierenden Listen Universität des Saarlandes	Reinstaedtler-Dipl98
Rieger
	1995		Generic Evolutions of Edges on Families of Diffused Greyvalue Surfaces In: Journal of Mathematical Imaging and Vision [5], 207-217	Rieger95
Rizkallah
	2011		Glivenko and Kuroda for Simple Type Theory	BrownRizkallah2011
	2011		Maximum Cardinality Matching In: Archive of Formal Proofs,	rizkallah:2011:matching
Röhrig
	1998		Tree Decomposition: A Feasibility Study Universität des Saarlandes	Roehrig1998Diplom
Rottmann
	1996		Bewegung eines Polygons zwischen polygonalen Hindernisse Universität des Saarlandes	Rottmann96
Rüb
	1998		On Batcher's Merge Sorts as Parallel Sorting Algorithms In: Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS-98), 410-420	Rüb98
	1997		On the average running time of odd-even merge sort In: Journal of Algorithms [22], 329-346	Rueb-1-97
	1995		On the Average Running Time of Odd-Even Merge Sort In: STACS95: 12th Annual Symposium on Theoretical Aspects of Computer Science, 491-501	Rueb95
Ruppert
	1999		Polygontriangulierung in Linearzeit Universität des Saarlandes	Ruppert1999
Rusinov, Schweitzer
	2010		Homomorphism -- homogeneous graphs In: Journal of Graph Theory [65], 253-262	RusinovSchweitzer2010
Sabo
	1999		Ein schnelles Verfahren zur exakten Berechnung von Skalarprodukten Universität des Saarlandes	Sabo1999
Sagraloff
	2012		Exaktes geometrisches Rechnen	SagraloffMPGJahrbuch2012
	2012		When 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	Sagraloff_ISSAC_2012
	2011		When Newton meets Descartes: A Simple and Fast Algorithm to Isolate the Real Roots of a Polynomial In: arXiv [abs/1109.6279v1], 1-21	S:NEWDSC:2011
	2010		A General Approach to Isolating Roots of a Bitstream Polynomial In: Mathematics in Computer Science [4], 481-506	Sagraloff-BitstreamPrecision2011
	2010		On the Complexity of Real Root Isolation In: CoRR [abs/1011.0344], 1-33	Sagraloff-BitstreamComplexity2010a
Sagraloff, Kerber, Hemmer
	2009		Certified Complex Root Isolation via Adaptive Root Separation Bounds In: The Joint Conference of ASCM 2009 and MACIS 2009, 151-166	SKH-CCRI-2009
Sagraloff, Yap
	2011		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	SagraloffYap:CEVAL:2011
Saha, Saptharishi, Saxena
	2013		A Case of Depth-3 Identity Testing, Sparse Factorization and Duality In: Computational Complexity [22], 39-69	SSS12
Sanders
	2004		Algorithms 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	Sanders2004a
	2004		Super Scalar Sample Sort In: Algorithms – ESA 2004: 12th Annual European Symposium, 784-796	SandersWinkel2004
	2003		Asynchronous Scheduling of Redundant Disk Arrays In: IEEE Transactions on Computers [52], 1170-1184	Sanders2003
	2003		Memory hierarchies - models and lower bounds In: Algorithms for memory hierarchies, 1-10	PS03
	2002		Presenting Data from Experiments in Algorithmics In: Experimental Algorithmics, 181-196	Sanders2002c
	2002		Randomized Receiver Initiated Load Balancing Algorithms for Tree Shaped Computations In: The Computer Journal [45], 561-573	Sanders2002d
	2002		Reconciling simplicity and realism in parallel disk models In: Parallel Computing [28], 705-723	Sanders2002i
	2001		Reconciling Simplicity and Realism in Parallel Disk Models In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), 67-76	San2001a
	2000		Asynchronous Scheduling of Redundant Disk Arrays In: Proceedings of the 12th Annual ACM Symposium on Parallel Algorithms and Architecture (SPAA-00), 89-98	Sanders2000b
	2000		Fast Priority Queues for Cached Memory In: Journal of Experimental Algorithmics [5], 1-25	Sanders2000
	1999		Accessing Multiple Sequences Through Set Associative Caches In: Proceedings of the 26th International Colloquium on Automata, Languages and Programming (ICALP-99), 655-664	San99c
	1999		Analysis of nearest neighbor load balancing algorithms for random loads In: Parallel Computing [25], 1013-1033	Sanders1999
	1999		Asynchronous Random Polling Dynamic Load Balancing In: Algorithms and computation : 10th International Symposium, ISAAC'99, 37-48	San99d
	1999		Berechnungen mit großen Datenmengen In: Jahrbuch der Max-Planck-Gesellschaft 1999, 534-540	San99e
	1999		Fast Priority Queues for Cached Memory In: Selected papers of the International Workshop on Algorithm Engineering and Experimentation (ALENEX-99), 312-327	San99a
	1998		Random Permutations on Distributed, External and Hierarchical Memory In: Information Processing Letters [67], 305-309	San98c
	1998		Random Permutations on Distributed, External and Hierarchical Memory In: PARS-Mitteilungen, 160-165 In: PARS-Mitteilungen [1998], 160-165	San98d
	1998		Randomized Priority Queues for Fast Parallel Access In: Journal Parallel and Distributed Computing [49], 86-97	Sand98a
	1998		Tree Shaped Computations as a Model for Parallel Applications In: Anwendungsbezogene Lastverteilung (ALV), 123-132	San98b
Sanders, Egner, Korst
	2000		Fast Concurrent Access to Parallel Disks In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00), 849-858	SanEgnKor2000
Sanders, Egner, Tolhuizen
	2003		Polynomial Time Algorithms For Network Information Flow In: Proceedings of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA-03), 286-294	SET03
Sanders, Pettie
	2004		A Simpler Linear Time 2/3 - epsilon Approximation for Maximum Weight Matching	SandersPettie2004
Sanders, Reussner, Prechelt, Müller
	1998		SKaMPI: A Detailed, Accurate MPI Benchmark In: Proceedings of the 5th European PVM/MPI Users' Group Meeting, 52-59	RSPM98
Sanders, Sibeyn
	2003		A Bandwidth Latency Tradeoff for Broadcast and Reduction In: Information Processing Letters [86], 33-38	SanSib03
	2000		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	SanSib2000
Sanders, Singler, van Stee
	2013		Real-time prefetching and caching In: Journal of Scheduling [16], 47-58	SaSiSt13
Sanders, Sivadasan, Skutella
	2009		Online scheduling with bounded migration In: Mathematics of Operations Research [34], 481-498	Sivadasan2009
	2004		Online scheduling with bounded migration In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, 1111-1122	Sivadasan2004-2
Sanders, Solis-Oba
	2001		How Helpers Hasten h-Relations In: Journal of Algorithms [41], 86-98	SanSol2001
	2000		How Helpers Hasten h-Relations In: Algorithms - ESA 2000, Proceedings of the 8th Annual European Symposium (ESA-00), 392-402	Sanders2000a
Sanders, Steurer
	2005		An Asymptotic Approximation Scheme for Multigraph Edge Coloring In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 897-906	SanSte2005
Sanders, Takkula, Wedelin
	1999		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	San99b
Sanders, Träff
	2002		The factor algorithm for regular all-to-all communication on clusters of SMP nodes In: Proceedings of the 8th International Euro-Par Conference, 799-803	Sanders2002
Sanders, Vöcking
	2003		Tail bounds and expectations for random arc allocation and applications In: Combinatorics, Probability and Computing [12], 225-244	SanVoe03
	2002		Random Arc Allocation and Applications to Disks, Drums and DRAMs In: Algorithm theory, SWAT 2002 : 8th Scandinavian Workshop on Algorithm Theory, 121-130	Sanders2002g
Sanders, Vollmar, Worsch
	2002		Feasible models of computation: Three-dimensionality and energy consumption In: Fundamenta Informaticae [52], 233-248	Sanders2002e
Sauerwald, Stauffer
	2011		Rumor Spreading and Vertex Expansion on Regular Graphs In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 462-475	Sauerwald2010
Sauerwald, Sun
	2012		Tight Bounds For Randomized Load Balancing on Arbitrary Network Topologies In: IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS-12), 341-350	Sun2012c
Schäfer
	2004		Worst case instances are fragile: average case and smoothed competitive analysis of algorithms Universität des Saarlandes	Schäfer04
	2000		Weighted Matchings in General Graphs Universität des Saarlandes	Schaefer2000
Schäfer, Sivadasan
	2004		Topology matters: Smoothed competitiveness of metrical task systems In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 489-500	Sivadasan2004
Schalekamp, Williamson, van Zuylen
	2012		A proof of the Boyd-Carr conjecture In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 1477-1486	SchalekampWvZ12
Schanne
	2001		Visualisierung der Dialektgeographie und Topographie im deutschen Dialektraum Universität des Saarlandes	SchanneDipl01
Schilz
	2000		Effiziente Algorithmen für das verteilte Rechnen auf Workstation-Clustern Universität des Saarlandes	SchilzPhD2000
Schirra
	2000		Robustness and Precision Issues in Geometric Computation In: Handbook of Computational Geometry, 597-632	Schirra2000
	1999		A Case Study on the Cost of Geometric Computing In: Selected papers of the International Workshop on Algorithm Engineering and Experimentation (ALENEX-99), 156-176	Schirra1999a
	1998		Computational Geometry: Theory and Implementation Universität des Saarlandes	Schirra_habil
	1997		Precision and Robustness in Geometric Computations In: Algorithmic Foundations of Geographic Information Systems, 255-287	Schirra97a
Schmidt
	2013		A Planarity Test via Construction Sequences In: 38th International Symposium on Mathematical Foundations of Computer Science (MFCS'13), 765-776	Schmidt2013b
	2013		A Simple Test on 2-Vertex- and 2-Edge-Connectivity In: Information Processing Letters [113], 241-244	Schmidt2013a
	2013		Contractions, Removals and Certifying 3-Connectivity in Linear Time In: SIAM Journal on Computing [42], 494-535	Schmidt2013
	2013		Contractions, Removals and How to Certify 3-Connectivity in Linear Time	Schmidt2013
	2012		Certifying 3-Connectivity in Linear Time In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 786-797	Schmidt2012b
	2012		Construction Sequences and Certifying 3-Connectivity In: Algorithmica [62], 192-208	Schmidt2012
Schmidt, Valtr
	2012		Cubic Plane Graphs on a Given Point Set In: Proceedings of the Twenty-Eighth Annual Symposium on Computational Geometry (SCG'12), 201-208	Schmidt2012a
Schmitt
	2006		Implementierung einer Überlagerungvon konvexen Arrangements der Kugeloberfläche Universität des Saarlandes	BachSchmitt06
	2005		The diamond operator - Implementation of exact real algebraic numbers In: Computer Algebra in Scientific Computing, 8th International Workshop, CASC 2005, 355-366	Schmitt2005
	2004		Common Subexpression Search in LEDA_reals -- a study of the diamond-operator	Schmitt04b
	2004		Improved separation bounds for the diamond operator	Schmitt04a
	2003		Common Subexpression Search in LEDA_reals	s-cssl-03
	2003		The Diamond Operator for Real Algebraic Numbers	s-doran-03
Schmitt, Fousse
	2004		A comparison of polynomial evaluation schemes	SchmittFoussee2004
Schmitt, Zimmer
	2003		Elliptic Curves : A Computational Approach	Schmitt2003
Schmitz
	1995		Analyse von Branch-and-Bound Algorithmen zum Problem des Handlungsreisenden Universität des Saarlandes	Schmitz95
Schnorr, Subramanian
	1998		Almost optimal (on the average) algorithms for boolean matrix product witnesses, computing the diameter In: Proceedings of the 2nd International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM-98), 218-231	crs98c
Schömer, Reichel, Warken, Lennerz
	2002		Efficient Collision Detection for Curved Solid Objects In: Proceedings of the Seventh ACM Symposium on Solid Modeling and Applications, 321-328	SRWLSM02
Schömer, Thiel
	1995		Efficient Collision Detection for Moving Polyhedra In: 11th Annual ACM Symposium on Computational Geometry (SCG95), 51-60	Schoemer-Thiel95
Schömer, Wolpert
	2006		An Exact and Efficient Approach for Computing a Cell in an Arrangement of Quadrics In: Computational Geometry [33], 65 - 97	sw-eeaccaq-05
Schröder
	1998		Upper and Lower Bounds for Basic Scheduling Problems Universität des Saarlandes	Schröder98
Schulte
	2001		Exaktes Lösen von Linearen Programmen Universität des Saarlandes	SchulteDipl01
Schultes
	2005		Fast and Exact Shortest Path Queries Using Highway Hierachies Universität des Saarlandes	SchultesDipl05
Schwarzenecker
	1995		Ein NP-schweres Plazierungsproblem Universität des Saarlandes	Schwarzenecker95
Schwarz, Karrenbauer, Schehr, Rieger
	2009		Domain walls and chaos in the disordered SOS model In: Journal of statistical mechanics : theory and experiment [P08022], 1-23	Schwarzetal2009
Schweitzer
	2009		Problems of Unknown Complexity: Graph isomorphism and Ramsey theoretic numbers Universität des Saarlandes	SchweitzerPhD2009
	2009		Using the Incompressibility Method to obtain Local Lemma results for Ramsey-type Problems In: Information Processing Letters [109], 229-232	Schweitzer2008
Schweitzer, Schweitzer
	2010		Connecting face hitting sets in planar graphs In: Information Processing Letters [111], 11-15	SchweitzerSchweitzer2010
Schwerdt, Smid, Schirra
	1997		Computing the Minimum Diameter for Moving Points: An Exact Implementation using Parametric Search In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 466-468	Schirra97b
	1997		Computing the Minimum Diameter for Moving Points: An Exact Implementation using Parametric Search In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 466-468	Schirra97c
Seel
	2001		Planar Nef Polyhedra and Generic Higher-dimensional Geometry Universität des Saarlandes	SeelDiss01
	1994		Eine Implementierung abstrakter Voronoidiagramme Universität des Saarlandes	Seel94
Seidel
	1997		Paralleles List Ranking Universität des Saarlandes	TSeidel97
Seidel, Wolpert
	2005		On the Exact Computation of the Topology of Real Algebraic Curves In: Proceedings of the 21st ACM Symposium on Computational Geometry, 107-115	sw-ectrac-05
Seiden
	2000		Online randomized multiprocessor scheduling In: Algorithmica [28], 173-216	Seiden2000
	1999		Randomized online scheduling with delivery times In: Journal of Combinatorial Optimization [3], 399-416	Seiden1999
Semeloglou
	2000		Kürzeste Wege in planare Graphen. Implementierung eines parallelen Algorithmus mithilfe von PAD Universität des Saarlandes	Semeloglou2000
Sharma
	2008		Complexity of real root isolation using continued fractions In: Theoretical Computer Science [409], 292-310	Sharma2008
Shervashidze, Schweitzer, van Leeuwen, Mehlhorn, Borgwardt
	2011		Weisfeiler-Lehman graph kernels In: Journal of Machine Learning Research [12], 2539-2561	Shervashidze2011
Shervashidze, Vishwanathan, Petri, Mehlhorn, Borgwardt
	2009		Efficient Graphlet Kernels for Large Graph Comparison In: Proceedings of the Twelfth International Conference on Artificial Intelligence and Statistics (AISTATS), 488-495	Graphlets
Sibeyn
	2000		Solving fundamental problems on sparse-meshes In: IEEE Transactions on Parallel & Distributed Systems [11], 1324-1332	Sibeyn2000
	1999		Better Deterministic Routing on Meshes In: Proceedings of the 13th International Parallel Processing Symposium, and 10th Symposium on Parallel and Distributed Processing (IPPS/SPDP-99), 420-425	F.Sibeyn-IPPS-1999
	1999		Effiziente parallele Algorithmen Universität des Saarlandes	F.Sibeyn-HabilThesis-1999
	1999		External Selection In: Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science (STACS-99), 291-301	F.Sibeyn-STACS-1999
	1999		Power and Limitations of Optical Reconfigurable Arrays In: Proceedings of the 6th International Colloquium on Structural Information and Communication Complexity (SIROCCO 6), 249-263	F.Sibeyn-SIROCCO-1999
	1999		Row-Major Sorting on Meshes In: SIAM Journal on Computing [28], 847-863	F.Sibeyn-SIAM-1999
	1999		Ultimate Parallel List Ranking? In: Proceedings of the 6th International Conference on High Performance Computing (HiPC-99), 197-201	F.Sibeyn-HiPC-1999
	1998		List Ranking on Meshes In: Acta Informatica [35], 543-566	F.Sibeyn-ActaInformatica38-1998
	1998		Solving Fundamental Problems on Sparse-Meshes In: Proceedings of the 6th Scandinavian Workshop on Algorithm Theory (SWAT-98), 288-299	F.SibeynSWAT1998
	1997		Better Trade-offs for Parallel List Ranking In: Proceedings of the 9th Symposium on Parallel Algorithms and Architectures (SPAA-97), 221-230	Sibeyn97a
	1997		Routing on Triangles, Tori and Honeycombs In: International Journal on the Foundations of Computer Science [8], 269-287	Sibeyn97b
	1997		Routing with Finite Speeds of Memory and Network In: Proceedings of the 22nd Symposium on the Mathematical Foundations of Computer Science (MFCS-97), 488-497	Sibeyn97c
	1997		Sample Sort on Meshes In: Proceedings of the 3rd International Euro-Par Conference on Parallel Processing (Euro-Par-97), 389-398	Sibeyn97d
	1996		List Ranking on Interconnection Networks In: 2nd Euro-Par Conference, 529-541	Sibeyn-et-al-1-96
	1996		Routing on Triangles, Tori and Honeycombs In: Mathematical Foundations of Computer Science 1996: 21st International Symposium (MFCS'96), 529-541	Sibeyn-et-al-2-96
	1995		Sample Sort on Meshes In: Proceedings of Computing Science in the Netherlands, SION, 217-228	Sibeyn95
Sibeyn, Abello, Meyer
	2002		Heuristics for Semi-External Depth First Search on Directed Graphs In: SPAA 2002 : Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 282-292	SiAbMe02
Sibeyn, Grammatikakis, Hsu, Kraetzl
	1998		Packet Routing in Fixed-Connection Networks: A Survey In: Journal of Parallel and Distributed Computing [54], 77-132	F.Sibeyn-JParallelDistributedComp-1998
Sibeyn, Guillaume, Seidel
	1999		Practical Parallel List Ranking In: Journal of Parallel and Distributed Computing [56], 156-180	SibeynGuillaumeSeidel99
	1997		Practical Parallel List Ranking In: Proceedings of the 4th Symposium on Solving Irregularly Structured Problems in Parallel (IRREGULAR-97), 25-36	SibeynGuillaumeSeidel1997
Sibeyn, Juurlink, Rao
	1998		Gossiping on Meshes and Tori In: IEEE Transactions on Parallel and Distributed Systems [9], 513-525	F.Sibeyn-IEEETransParaDistri-1998
Sibeyn, Kaufmann
	1997		BSP-Like External-Memory Computation In: Proceedings of the 3rd Italian Conference on Algorithms and Complexity (CIAC-97), 229-240	SibeynKaufmann1997
	1997		Randomized Multipacket Routing and Sorting on Meshes In: Algorithmica [17], 224-244	Sibeyn97e
Sibeyn, Kaufmann, Chlebus
	1997		Deterministic Permutation Routing on Meshes In: Journal of Algorithms [22], 111-141	Sibeyn-et-al-1-97
Sitters
	2005		Complexity of preemptive minsum scheduling on unrelated parallel machines In: Journal of Algorithms [57], 37-48	Sitters2005
Sitters, Stougie
	2006		The general two-server problem In: Journal of the ACM [53], 437-458	Sitters2006b
Sivadasan
	2004		Online Problems and Two-Player Games: Algorithms and Analysis Universität des Saarlandes	SivadasanDiss04
Sivadasan, Sanders, Skutella
	2004		Online Scheduling with Bounded Migration	SivadasanSandersSkutella2004
Smid
	1995		Dynamic rectangular point location, with an application to the closest pair problem In: Information and Computation [16], 1-9	Smid95
Smid, Ray, Wendt, Lange
	2004		Computing Large Planar Regions in Terrains, with an Application to Fracture Surface In: Discrete Applied Mathematics [139], 253-264	Rahul2003
Solis-Oba
	1998		2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 441-452	Solis-Oba1998a
Solis-Oba, Frederickson
	1998		Rooted Spanning Trees with Small Weight and Average Length In: Theoretical Computer Science, 114-125	Solis-Oba1998b
Solis-Oba, Jansen, Sviridenko
	1999		A linear time approximation scheme for the job shop scheduling problem In: Proceedings of the 3rd International Workshop on Randomization and Approximation Techniques in Computer Science, and 2nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (RANDOM-APPROX-99), 177-188	Solis-Oba1999f
	1999		Makespan minimization in job shops: a polynomial time approximation scheme In: Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC-99), 394-399	Solis-Oba1999a
Son
	1999		Berechnung konvexer Hüllen in erwarteter Linearzeit Universität des Saarlandes	Son1999
Soranzo, Ramezani, Iacono, Altafini
	2012		Decompositions of large-scale biological systems based on dynamical properties In: Bioinformatics [28], 76-83	Ramezani2011
Sridharan, Subramanian, Sudha
	1998		Some Properties of Touching Distances for Polygons and Polyhedra In: Applied Mathematics Letters [11], 1-7	crs98a
Srivastava
	1996		Entwicklung und Implementierung eines Entscheidungsalgorithmus zur Zuordnung von Probleminstanzen an Hierarchieebenen Universität des Saarlandes	Srivastava96
Stephan
	2000		Implementierung eines heuristischen und eines exakten Ansatzes zur Berechnung minimaler Steinerbäume in Netzwerken Universität des Saarlandes	Stephan2000
Steurer
	2006		An Asymptomic Approximation Scheme for Multigraph Edge Coloring Universität des Saarlandes	MastSteurer06
	2006		Tight Bounds on the Min-Max Boundary Decomposition Cost of Weighted Graphs Universität des Saarlandes	BachSteurer06
Stormer
	1998		Ein Programm zum visuellen Erlernen von Graphalgorithmen Universität des Saarlandes	Stormer98
Subramanian
	2000		Algorithms for Colouring Random k-colourable Graphs In: Combinatorics, Probability and Computing [9], 45-77	crscpc
	1999		A Generalization of Janson inequalities and its application to finding shortest paths In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), 795-804	crsoda99
	1999		Minimum Coloring k-Colorable Graphs in Polynomial Average Time In: Journal of Algorithms [33], 112-123	crsjalg
Subramanian, Fürer, Veni Madhavan
	1998		Algorithms for Coloring Semi-random Graphs In: Random Structures & Algorithms [13], 125-158	CRS98b
Sviridenko, Wiese
	2013		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),	SviridenkoWiese2013
Telikepalli
	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	Telikepalli2003a
Telikepalli, Chandran, Subramanian
	2003		Isoperimetric Inequalities and Width Parameters of Graphs In: Computing and Combinatorics : 9th Annual International Conference, COCOON 2003, 385-393	Telikepalli2003c
Telikepalli, Varadarajan
	2003		On Shortest Paths in Line Arrangements In: 15th Canadian Conference in Computational Geometry (CCCG-03), 170-173	Telikepalli2003b
Teramoto, Asano, Katoh, Doerr
	2006		Inserting Points Uniformly at Every Instance In: IEICE - Transactions on Information and Systems [E89-D], 2348-2356	inserpoints2006
Thiel
	2004		Efficient Algorithms for Constraint Propagation and for Processing Tree Descriptions Universität des Saarlandes	ThielDiss04
	1999		Persistente Suchbäume Universität des Saarlandes	ThielMasterThesis99
	1996		Effiziente Algorithmen für Probleme der Kollisionserkennung und der geometrischen Optimierung Universität des Saarlandes	Thiel-Diss96
Thierens, Beyer, Bongard, Branke, Clark, Cliff, Congdon, Deb, Doerr, Kovacs, Kumar, Miller, Moore, Neumann, Pelikan, Poli, Sastry, Stanley, Stützle, Watson, Wegener (ed.)
	2007		GECCO 2007: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation	Doerr2007GeccoProc
Thome
	2000		Erweiterung des hierarchischen Zeichenmodells in ArchEd Universität des Saarlandes	Thome2000
Thorup
	2000		Floats, Integers, and Single Source Shortest Paths In: Journal of Algorithms [35], 189 -201	Thorup/2000
Tiwary, Elbassioni
	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	Elbassioni2008a
Träff
	1996		A Heuristic for Blocking Flow Algorithms In: European Journal of Operational Research [89], 564-569	Traeff96
	1995		An Experimental Comparison of two Distributed Singel-Source Shortest Path Algorithm In: Parallel Computing [21], 1505-1532	Traeff95
Träff, Zaroliagis
	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	TraeffZaroliagis2000
	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	Traeff-Zaroliagis96
van Leeuwen, Mehlhorn, Reps (ed.)
	1994		Incremental Computation and Dynamic Algorithms 02.05.-06.05.94	mehlhorn94j
van Stee
	2013		SIGACT News Online Algorithms Column 22 In: SIGACT News [44], 125	vanStee2013
	2012		An improved algorithm for online rectangle filling In: Theoretical Computer Science [423], 59-74	Stee12
	2012		SIGACT News Online Algorithms Column 20: The Power of Harmony In: SIGACT News [43], 127-136	Stee12a
	2012		SIGACT News Online Algorithms Column 21: APPROX and ALGO In: SIGACT News [43], 123-129	Stee12b
	2011		An improved algorithm for online rectangle filling In: Approximation and Online Algorithms : 8th International Workshop, WAOA 2010, 249-260	vanStee2010
	2008		Combinatorial algorithms for packing and scheduling problems Universität Karlsruhe	vanStee2008i
	2008		Packet Switching in Single Buffer In: Encyclopedia of Algorithms, 1-99	vanStee2008b
	2008		Paging In: Encyclopedia of Algorithms, 1-99	vanStee2008d
van Zuylen
	2012		Simpler 3/4-approximation algorithms for MAX SAT In: Approximation and Online Algorithms : 9th International Workshop, WAOA 2011, 188-197	vanZuylenWAOA2011
	2011		An improved monotone algorithm for scheduling related machines with precedence constraints In: Operations Research Letters [39], 423-427	vanZuylenORL2011
	2011		Deterministic Sampling Algorithms for Network Design In: Algorithmica [60], 110-151	vanZuylenALG2011
	2011		Linear programming based approximation algorithms for feedback set problems in bipartite tournaments. In: Theoretical Computer Science [412], 2556-2561	vanZuylenTCS2011
van Zuylen, Schalekamp, Williamson
	2011		Popular Ranking In: 10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2011, 267-270	vanZuylenCTW2011
Vidali
	2009		The Geometry of Truthfulness In: Internet and Network Economics : 5th International Workshop, WINE 2009, 340-350	Vidali2009
Vingron, Lenhof, Mutzel
	1997		Computational Molecular Biology In: Annotated Bibliographies in Combinatorial Optimization, 445-471	VLM97
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	Voecking2001b
	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	Voecking2001c
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	mehlhorn83e
von Zülow
	1994		Das k-Closest-Pair-Problem Universität des Saarlandes	Zuelow94
Wagner, Veeramachaneni, Neumann, O'Reilly
	2011		Optimizing the Layout of 1000 Wind Turbines In: European Wind Energy Association Annual Event, 1-10	Wagner2011EWEA
Wahl
	2000		Ein neuer Algorithmus für Online-Scheduling Universität des Saarlandes	Wahl2000
Wahlström
	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),	Wahlstroem2013a
	2011		New Plain-Exponential Time Classes for Graph Homomorphism In: Theory of Computing Systems [49], 273-282	Wahl2010
	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	Wahlstroem2009
	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	Wahlstroem2008
Wang
	2012		Certification of Curve Arrangements Universität des Saarlandes	MasterWang2012
Warken
	2004		Collision detection for Curved Rigid Objects in the Context of Dynamics Simulations Universität des Saarlandes	Warken2004
Warken, Schömer
	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	Warken2001
Weber
	2007		Efficient Index Structures for and Applications of the CompleteSearch Engine Universität des Saarlandes	WeberPhD
	2006		Solving large Sparse Linear Systems exactly Universität des Saarlandes	DiplWeber06
Weikum, Bast, Canright, Hales, Schindelhauer, Triantafillou
	2007		Towards Peer-to-Peer Web Search In: 1st European Conference on Complex Systems, ECCS'05, ?	WeikumBCHST05
	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	WeikumBCHST05b
Weinand
	2005		Fill-in Reduction while Solving large, sparse Linear Systems with Graph Theoretical Methods Universität des Saarlandes	WeinandDipl05
Weiskircher
	2002		New Applications of SPQR-Trees in Graph Drawing Universität des Saarlandes	WeiskircherDiss02
	1997		2-Schicht-Planarisierung bipartiter Graphen Universität des Saarlandes	Weiskircher97
Wendt, Lange, Ray, Smid
	2001		Surface Topography Quantification using Computational Geometry	Rahul2002c
Wendt, Lange, Smid, Ray, Tönnies
	2002		Surface Topography Quantification by Integral and Feature-related Parameters In: Materialwissenschaft und Werkstofftechnik [33], 621-627	Rahul2002a
Wilhelmi
	1995		Erzeugung von Pseudozufallszahlen gemäß einer veränderbaren Verteilung Universität des Saarlandes	Wilhelmi95
Winzen
	2013		Direction-Reversing Quasi-Random Rumor Spreading with Restarts In: Information Processing Letters [113], 921-926	Winzen2013
	2011		Direction-Reversing Quasi-Random Rumor Spreading with Restarts	Winzen2011b
	2011		Toward a complexity theory for randomized search heuristics : black box models Universität des Saarlandes	WinzenDiss2011
Wissen
	1998		Automatisiertes Zeichnen von Zustandsdiagrammen Universität des Saarlandes	Wissen98
Wolpert
	2003		Jacobi Curves: Computing the Exact Topology of Arrangements of Non-Singular Algebraic Curves	w-jccetansal-03
	2002		An Exact and Efficient Approach for Computing a Cell in an Arrangement of Quadrics Universität des Saarlandes	WolpertDiss2002
Xu, Karrenbauer, Soh, Codrea
	2008		Consecutive multiline addressing: A scheme for addressing PMOLEDs In: Journal of the Society for Information Display [16], 211-219	XKSC2008
Xu, Karrenbauer, Soh, Wahl
	2007		A New Addressing Scheme for PM OLED Display In: SID 2007 International Symposium Digest of Technical Papers, 97-100	XKSW2007
Xu, Wahl, Eeisenbrand, Karrenbauer, Soh, Hitzelberger
	2005		Verfahren zur Ansteuerung von Matrixanzeigen	patent2005
Yap, Sagraloff, Sharma
	2013		Analytic Root Clustering: A Complete Algorithm using Soft Zero Tests	YSSSoftpredicates2013
Zaroliagis
	1997		Simple and Work-Efficient Parallel Algorithms for the Minimum Spanning Tree Problem In: Parallel Processing Letters [7], 25-37	Zaroliagis97PPL
Ziegelmann
	2001		Constrained Shortest Paths and Related Problems Universität des Saarlandes	Ziegelmann2001
Ziegenbein
	1997		Bewertung verschiedener paarweiser Alignment-Methoden, Ersetzungsmatrizen und Gap-Funktionen Universität des Saarlandes	Ziegenbein97
Ziegler
	2000		Crossing Minimization in Automatic Graph Drawing Universität des Saarlandes	ZieglerDiss00
	1995		Max-Weighted-Matching auf allgemeinen Graphen Universität des Saarlandes	Ziegler95
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	NZ97
Zotenko, Mestre, O'Leary, Przytyzka
	2008		Essential Complex Biological Modules Explain the Centrality-Lethality Rule In: PLoS Computational Biology [x], x-x	jounal/ploscb/ZotenkoMOP2008