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 Näher, MehlhornNäher, Mehlhorn
1990LEDA - A Library of Efficient Data Types and Algorithms
In: GI - 20. Jahrestagung I, Informatik auf dem Weg zum Anwender, 35-39
1990LEDA: A Library of Efficient Data Types and Algorithms
In: Automata, languages and programming (ICALP-90) : 17th international colloquium, 1-5
Hide details for NaujoksNaujoks
2008NP-hard Networking Problems - Exact and Approximate Algorithms
Universität des Saarlandes
2004A heuristic for solving interior point Methods exactly
Universität des Saarlandes
Hide details for NestNest
1998Vergleich von praxisnahen seriellen und parallelisierten Verfahren zur Bestimmung der Schnittpunkte von Liniensegmenten in der Ebene
Universität des Saarlandes
Hide details for NeukirchNeukirch
1994Grundlegende geometrische Datenstrukturen und Algorithmen für LEDA
Universität des Saarlandes
Hide details for NeumannNeumann
2011Implementation of Schmidt's algorithm for certifying triconnectivity testing
Universität des Saarlandes
2008Expected Runtimes of Evolutionary Algorithms for the Eulerian Cycle Problem
In: Computers and Operations Research [35], 2750-2759
Hide details for Neumann, Haltner, Lehr, Kohlbacher, LenhofNeumann, Haltner, Lehr, Kohlbacher, Lenhof
1998Investigating the Sugar-Lectin Interaction by Computational Chemistry: Tunneling the Epithelial Barrier
In: Proceedings of the 18th Interlec Meeting, 549
Hide details for Neumann, Kohlbacher, Haltner, Lenhof, LehrNeumann, Kohlbacher, Haltner, Lenhof, Lehr
2000Modeling 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
Hide details for Neumann, Oliveto, WittNeumann, Oliveto, Witt
2009Theoretical Analysis of Fitness-Proportional Selection: Landscapes and Efficiency
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 835-842
Hide details for Neumann, ReichelNeumann, Reichel
2008Approximating Minimum Multicuts by Evolutionary Multi-Objective Algorithms
In: Parallel Problem Solving from Nature (PPSN X), 72-81
Hide details for Neumann, Reichel, SkutellaNeumann, Reichel, Skutella
2011Computing Minimum Cuts by Randomized Search Heuristics
In: Algorithmica [59], 323-342
2008Computing Minimum Cuts by Randomized Search Heuristics
In: Genetic and Evolutionary Computation Conference 2008, 779-786
Hide details for Neumann, Sudholt, WittNeumann, Sudholt, Witt
2009Analysis of Different MMAS ACO Algorithms on Unimodal Functions and Plateaus
In: Swarm Intelligence [3], 35-68
2009Computational Complexity of Ant Colony Optimization and Its Hybridization with Local Search
In: Innovations in Swarm Intelligence, 91-120
2008Rigorous Analyses for the Combination of Ant Colony Optimization and Local Search
In: International Conference on Ant Colony Optimization and Swarm Intelligence 2008, 132-143
2007Attachment IconComparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions
In: Engineering Stochastic Local Search Algorithms 2007, 61-75
Hide details for Neumann, WegenerNeumann, Wegener
2007Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem
In: Theoretical Computer Science [378], 32-40
Hide details for Neumann, WittNeumann, Witt
2010Ant Colony Optimization and the minimum spanning tree problem
In: Theoretical Computer Science [411], 2406-2413
2010Bioinspired Computation in Combinatorial Optimization : Algorithms and Their Computational ComplexityBookNeumannWitt
2009Runtime Analysis of a Simple Ant Colony Optimization Algorithm
In: Algorithmica [54], 243-255
2008Ant Colony Optimization and the Minimum Spanning Tree Problem
In: International Conference on Learning and Intelligent Optimization 2007, 153-166
2006Ant Colony Optimization and the Minimum Spanning Tree ProblemNeuWittMST2006
Hide details for Newo KenmogneNewo Kenmogne
2005Understanding LSI Via The Truncated Term-Term Matrix
Universität des Saarlandes
Hide details for Niedermeier, Reinhard, SandersNiedermeier, Reinhard, Sanders
2002Towards Optimal Locality in Mesh-Indexings
In: Discrete Applied Mathematics [117], 211-237
Hide details for NissenNissen
1998Graph Iterators: Decoupling Graph Structures from Algorithms
Universität des Saarlandes
Hide details for Nor, Hermelin, Charlat, Engelstadter, Reuter, DuronNor, Hermelin, Charlat, Engelstadter, Reuter, Duron
2010Mod/Resc Parsimony Inference
In: Combinatorial Pattern Matching : 21st Annual Symposium, CPM 2010, 202-213
Hide details for Nor, Hermlin, Charlat, Engelstadter, Reuter, Duron, SagotNor, Hermlin, Charlat, Engelstadter, Reuter, Duron, Sagot
2012Mod/Resc Parsimony Inference: Theory and application
In: Information and Computation [213], 23-32
Hide details for Nutov, PennNutov, Penn
2000On Integrality, Stability and Composition of Dicycle Packings and Covers
In: Journal of Combinatorial Optimization [4], 235 - 252
Hide details for OberhauserOberhauser
1997Arithmetik der Transduktoren
Universität des Saarlandes
Hide details for Oliveto, Lehre, NeumannOliveto, Lehre, Neumann
2009Theoretical Analysis of Rank-Based Mutation - Combining Exploration and Exploitation
In: 2009 IEEE Congress on Evolutionary Computation : CEC, 1455-1462
Hide details for OssamyOssamy
2002TSP Cuts Outside the Template Paradigm
Universität des Saarlandes
Hide details for OstOst
1995Algorithmen für das Kantenfärbungsproblem
Universität des Saarlandes
Hide details for OttOtt
2012Thou shalt not lie : on truthfully maximizing the minimum load on selfish related machines
Universität des Saarlandes
Hide details for PaluchPaluch
2006Attachment IconA New Approximation Algorithm for Multidimensional Rectangle Tiling
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 712-721
Hide details for PanagiotouPanagiotou
2009Blocks In Constrained Random Graphs with Fixed Average Degree
In: 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009), 733-744
2009The Degree Sequence of Random Graphs from Subcritical Classes
In: Combinatorics, Probability and Computing [18], 647-681
2009Vertices of Degree k in Random Unlabeled Trees
In: European Conference on Combinatorics, Graph Theory and Applications (EuroComb '09), 41-45
Hide details for Panagiotou, Coja-OghlanPanagiotou, Coja-Oghlan
2012Catching the k-NAESAT Threshold
In: STOC’12 : Proceedings of the 2012 ACM Symposium on Theory of Computing, 899-907
Hide details for Panagiotou, Pourmiri, SauerwaldPanagiotou, Pourmiri, Sauerwald
2013Faster Rumor Spreading with Multiple Calls
In: 24th International Symposium on Algorithms and Computation (ISAAC-13), 446-456
Hide details for Panagiotou, SinhaPanagiotou, Sinha
2012Vertices of degree k in random unlabeled trees
In: Journal of Graph Theory [69], 114-130
Hide details for Panagiotou, Spöhel, Steger, ThomasPanagiotou, Spöhel, Steger, Thomas
2013Explosive percolation in Erdös-Rényi-like random graph processes
In: Combinatorics, Probability and Computing [22], 133-145
2011Explosive 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
Hide details for Panagiotou, StegerPanagiotou, Steger
2011On the Degree Sequence of Random Planar Graphs
In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), 1198-1210
2010Maximal Biconnected Subgraphs of Random Planar Graphs
In: ACM Transactions on Algorithms [6], 31,1-31,21
2009Maximal Biconnected Subgraphs of Random Planar Graphs
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 432-440
Hide details for Panconesi, Papatriantafilou, Tsigas, VitanyiPanconesi, Papatriantafilou, Tsigas, Vitanyi
1998Randomized Naming Using Wait-Free Shared Variables
In: Distributed Computing [11], 113-124
Hide details for Papatriantafilou, TsigasPapatriantafilou, Tsigas
1997Self-Stabilizing Wait-Free Clock Synchronization
In: Parallel Processing Letters [7], 321-328
1995Wait-Free Consensus in ``In-Phase'' Multiprocessor Systems
In: Seventh IEEE Symposium on Parallel and Distributed Processing, 312-319
Hide details for Park, Lee, ChwaPark, Lee, Chwa
2001Visibility-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
2000Characterization of Rooms Searchable by Two Guards
In: Proceedings of the 11th Conference on Algorithms and Computation, 515-526
Hide details for ParreiraParreira
2003Information Retrieval by Dimension Reduction - A Comparative Study
Universität des Saarlandes
2003On the Role of the Singular Values in Latent Semantic Indexing
Universität des Saarlandes
Hide details for Pemmaraju, Raman, VaradarajanPemmaraju, Raman, Varadarajan
2011Max-coloring and online coloring with bandwidths on interval graphs
In: ACM Transactions on Algorithms [7], 35:1-35:21
Hide details for PettiePettie
2005Sensitivity Analysis of Minimum Spanning Trees in Sub-Inverse-Ackermann Time
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 964-973
2005Towards a final analysis of pairing heaps
In: 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 174-183
Hide details for Pettie, SandersPettie, Sanders
2005Computing Approximate Matchings in External Memory, Streaming, Parallel, and Distributed Network ModelsPettieSanders2005
2004Attachment IconA simpler linear time 2/3 - eps approximation for maximum weight matching
In: Information Processing Letters [91], 271-276
Hide details for PhilipPhilip
2011Attachment IconThe Kernelization Complexity of some Domination and Covering Problems
Homi Bhabha National Institute
2008Attachment IconFixed-Parameter Algorithms for Graph Problems Using Graph Minor Theory
Homi Bhabha National Institute
Hide details for Philip, Raman, SikdarPhilip, Raman, Sikdar
2012Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond
In: ACM Transactions on Algorithms [9], 23
2009Attachment IconSolving 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
Hide details for Philip, Raman, VillangerPhilip, Raman, Villanger
2010Attachment IconA 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
Hide details for PiskorskiPiskorski
1994Parallele Graphenalgorithmen für den Hypercube
Universität des Saarlandes
Hide details for PohlPohl
2006Exact Integer Linear Programming with Bounded Variables in a Branch- and Cut Algorithm
Universität des Saarlandes
Hide details for PolzinPolzin
2003Algorithms for the Steiner Problem in Networks
Universität des Saarlandes
Hide details for Polzin, Vahdati DaneshmandPolzin, Vahdati Daneshmand
2003On Steiner trees and minimum spanning trees in hypergraphs
In: Operations Research Letters [31], 12-20
2002Extending Reduction Techniques for the Steiner Tree Problem
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 795-807
2001A Comparison of Steiner Tree Relaxations
In: Discrete Applied Mathematics [112], 241-261
2001Improved Algorithms for the Steiner Problem in Networks
In: Discrete Applied Mathematics [112], 263-300
2000Primal-Dual Approaches to the Steiner Problem
In: Approximation Algorithms for Combinatorial Optimization, 214-225
Hide details for Porkolab, KhachiyanPorkolab, Khachiyan
1997Computing Integral Points in Convex Semi-algebraic Sets
In: Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS-97), 162-171
Hide details for PortzPortz
1994Darstellung und Implementierung polynomieller und streng polynomieller Algorithmen für das Minimum-Cost-Flow-Problem
Universität des Saarlandes
Hide details for PotikoglouPotikoglou
1999Parallele Algorithmen zur Lösung des Single-Source Shortest Path Problems
Universität des Saarlandes
Hide details for PouchkarevPouchkarev
2000ArchEd: Ein interaktives Zeichensystem für die Archäologie
Universität des Saarlandes
Hide details for Pountourakis, VidaliPountourakis, Vidali
2010A complete characterization of group-strategyproof mechanisms of cost-sharing.
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. I, 146-157
Hide details for Preetham, Krithivasan, Rangan, SibeynPreetham, Krithivasan, Rangan, Sibeyn
1996Parallel algorithm for maximum empty L-shaped polygon
In: 3rd Conference on High-Performance Computing, -
Hide details for PriebePriebe
2001Average-case complexity of shortest-paths problems
Universität des Saarlandes
Hide details for Pruhs, van Stee, UthaisombutPruhs, van Stee, Uthaisombut
2008Attachment IconSpeed Scaling of Tasks with Precedence Constraints
In: Theory of Computing Systems [43], 67-80
Hide details for PyrgaPyrga
2010Algorithmic Game Theory and Networks
Universität des Saarlandes
2005Shortest Paths in Time-Dependent Networks and their Applications
Universität des Saarlandes
Hide details for Pyrga, ChungPyrga, Chung
2009Stochastic Stability in Internet Router Congestion Games
In: Algorithmic Game Theory : Second International Symposium, SAGT 2009, 183-195
Hide details for Pyrga, RayPyrga, Ray
2008New existence Proofs for epsilon-nets
In: Proceedings of the twenty-fourth annual symposium on Computational geometry, 199-207
Hide details for Pyrga, Schulz, Wagner, ZaroliagisPyrga, Schulz, Wagner, Zaroliagis
2007Efficient models for timetable information in public transportation systems
In: ACM Journal of Experimental Algorithmics [12], 1-39
Hide details for P. GaoP. Gao
2012Distribution of the number of spanning regular subgraphs in random graphsG6
2012Distributions of sparse spanning subgraphs in random graphsG4
2012Uniform generation of d-factors in dense host graphsG7
Hide details for Qian, Schalekamp, Williamson, van ZuylenQian, Schalekamp, Williamson, van Zuylen
2012On the Integrality Gap of the Subtour LP for the 1,2-TSP
In: LATIN 2012: Theoretical Informatics ; 10th Latin American Symposium, 606-617
Hide details for Raidl, Alba, Bacardit, Beyer, Birattari, Blum, Bosman, Congdon, Corne, Cotta, Di Penta, Doerr, Drechsle, EbnerRaidl, 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.)
2009GECCO 2009: Proceedings of the 11th Annual conference on Genetic and evolutionary computation.gecco2009
Hide details for Rajaraman, Richa, Vöcking, VuppuluriRajaraman, Richa, Vöcking, Vuppuluri
2001A Data Tracking Scheme for General Networks
In: Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-01), 247-254
Hide details for RamosRamos
2001An Optimal Deterministic Algorithm for Computing the Diameter of a Three-Dimensional Point Set
In: Discrete and Computational Geometry [26], 233-244
2001Solving Some Discrepancy Problems in NC
In: Algorithmica [29], 371-395
2000Deterministic 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
2000Linear Programming Queries Revisited
In: Proceedings of the 16th Annual Symposium on Computational Geometry (SCG-00), 176-181
1999On range reporting, ray shooting and $k$-level construction
In: Proceedings of the 15th Annual Symposium on Computational Geometry (SCG-99), 390-399
1997Construction of 1-d lower envelopes and applications
In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 57-66
1997Intersection of unit-balls and diameter of a point set in R³
In: Computational Geometry Theory and Applications [8], 57-65
Hide details for Ramos, Amato, GoodrichRamos, Amato, Goodrich
2001A Randomized Algorithm for Triangulating a Simple Polygon in Linear Time
In: Discrete and Computational Geometry [26], 246-265
2000Computing 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
Hide details for RaschRasch
1994Furthest Site Abstract Voronoi Diagrams
Universität des Saarlandes
Hide details for Rathe, Sanders, KnightRathe, Sanders, Knight
1999A case study in scalability: an ADI method for the two-dimensional time-dependent Dirac equation
In: Parallel Computing [25], 525-534
Hide details for RauRau
1997Ein experimenteller Vergleich von zwei Algorithmen zur Berechnung des maximalen Flusses in einem asymmetrischen Netzwerk mit reellen Kapazitäten
Universität des Saarlandes
Hide details for RaufRauf
2005Attachment IconEarliest Arrival Flows with Multiple Sources
Universität des Saarlandes
Hide details for RayRay
2004Counting Straight-Edge Triangulations of Planar Point Sets
Universität des Saarlandes
2004Geometric Algorithms for Object Placement and Planarity in a Terrain
Universität des Saarlandes
2002An O(nlogn) Algorithm for Classifying Identical CurvesRahul2002d
Hide details for Ray, MustafaRay, Mustafa
2007Attachment IconWeak $\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
Hide details for Ray, Smid, Lange, WendtRay, Smid, Lange, Wendt
2002Attachment IconComputing Large Planar Regions in Terrains
In: IWCIA 2001, 8th International Workshop on Combinatorial Image Analysis (IWCIA-01), 139-152
Hide details for ReichelReichel
2006Attachment IconCombinatorial Approaches for the Trunk Packing Problem
Universität des Saarlandes
2001Attachment IconOptimale Hüllkörper für Objekte mit gekrümmten Oberflächen
Universität des Saarlandes
Hide details for ReinertReinert
1999A polyhedral approach to sequence alignment problems
Universität des Saarlandes
1994Deferred Data Structuring
Universität des Saarlandes
Hide details for Reinert, Lenhof, Mehlhorn, Mutzel, KececiogluReinert, Lenhof, Mehlhorn, Mutzel, Kececioglu
1997Attachment IconA Branch-And-Cut algorithm for multiple sequence alignment
In: Proceedings of the 1st Annual International Conference on Computational Molecular Biology (RECOMB-97), 241-250
Hide details for ReinstädtlerReinstädtler
1998Verlustfreie Datenkompression mit selbstorganisierenden Listen
Universität des Saarlandes
Hide details for RiegerRieger
1995Generic Evolutions of Edges on Families of Diffused Greyvalue Surfaces
In: Journal of Mathematical Imaging and Vision [5], 207-217
Hide details for RizkallahRizkallah
2011Attachment IconGlivenko and Kuroda for Simple Type TheoryBrownRizkallah2011
2011Maximum Cardinality Matching
In: Archive of Formal Proofs,
Hide details for RöhrigRöhrig
1998Tree Decomposition: A Feasibility Study
Universität des Saarlandes
Hide details for RottmannRottmann
1996Bewegung eines Polygons zwischen polygonalen Hindernisse
Universität des Saarlandes
Hide details for RübRüb
1998On 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
1997On the average running time of odd-even merge sort
In: Journal of Algorithms [22], 329-346
1995On the Average Running Time of Odd-Even Merge Sort
In: STACS95: 12th Annual Symposium on Theoretical Aspects of Computer Science, 491-501
Hide details for RuppertRuppert
1999Polygontriangulierung in Linearzeit
Universität des Saarlandes
Hide details for Rusinov, SchweitzerRusinov, Schweitzer
2010Homomorphism -- homogeneous graphs
In: Journal of Graph Theory [65], 253-262
Hide details for SaboSabo
1999Ein schnelles Verfahren zur exakten Berechnung von Skalarprodukten
Universität des Saarlandes
Hide details for SagraloffSagraloff
2012Exaktes geometrisches RechnenSagraloffMPGJahrbuch2012
2012When 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
2011When Newton meets Descartes: A Simple and Fast Algorithm to Isolate the Real Roots of a Polynomial
In: arXiv [abs/1109.6279v1], 1-21
2010A General Approach to Isolating Roots of a Bitstream Polynomial
In: Mathematics in Computer Science [4], 481-506
2010On the Complexity of Real Root Isolation
In: CoRR [abs/1011.0344], 1-33
Hide details for Sagraloff, Kerber, HemmerSagraloff, Kerber, Hemmer
2009Certified Complex Root Isolation via Adaptive Root Separation Bounds
In: The Joint Conference of ASCM 2009 and MACIS 2009, 151-166
Hide details for Sagraloff, YapSagraloff, Yap
2011A 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
Hide details for Saha, Saptharishi, SaxenaSaha, Saptharishi, Saxena
2013Attachment IconA Case of Depth-3 Identity Testing, Sparse Factorization and Duality
In: Computational Complexity [22], 39-69
Hide details for SandersSanders
2004Algorithms 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
2004Super Scalar Sample Sort
In: Algorithms – ESA 2004: 12th Annual European Symposium, 784-796
2003Asynchronous Scheduling of Redundant Disk Arrays
In: IEEE Transactions on Computers [52], 1170-1184
2003Memory hierarchies - models and lower bounds
In: Algorithms for memory hierarchies, 1-10
2002Presenting Data from Experiments in Algorithmics
In: Experimental Algorithmics, 181-196
2002Randomized Receiver Initiated Load Balancing Algorithms for Tree Shaped Computations
In: The Computer Journal [45], 561-573
2002Reconciling simplicity and realism in parallel disk models
In: Parallel Computing [28], 705-723
2001Reconciling Simplicity and Realism in Parallel Disk Models
In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), 67-76
2000Asynchronous Scheduling of Redundant Disk Arrays
In: Proceedings of the 12th Annual ACM Symposium on Parallel Algorithms and Architecture (SPAA-00), 89-98
2000Fast Priority Queues for Cached Memory
In: Journal of Experimental Algorithmics [5], 1-25
1999Accessing Multiple Sequences Through Set Associative Caches
In: Proceedings of the 26th International Colloquium on Automata, Languages and Programming (ICALP-99), 655-664
1999Analysis of nearest neighbor load balancing algorithms for random loads
In: Parallel Computing [25], 1013-1033
1999Asynchronous Random Polling Dynamic Load Balancing
In: Algorithms and computation : 10th International Symposium, ISAAC'99, 37-48
1999Berechnungen mit großen Datenmengen
In: Jahrbuch der Max-Planck-Gesellschaft 1999, 534-540
1999Fast Priority Queues for Cached Memory
In: Selected papers of the International Workshop on Algorithm Engineering and Experimentation (ALENEX-99), 312-327
1998Random Permutations on Distributed, External and Hierarchical Memory
In: Information Processing Letters [67], 305-309
1998Random Permutations on Distributed, External and Hierarchical Memory
In: PARS-Mitteilungen, 160-165
In: PARS-Mitteilungen [1998], 160-165
1998Randomized Priority Queues for Fast Parallel Access
In: Journal Parallel and Distributed Computing [49], 86-97
1998Tree Shaped Computations as a Model for Parallel Applications
In: Anwendungsbezogene Lastverteilung (ALV), 123-132
Hide details for Sanders, Egner, KorstSanders, Egner, Korst
2000Fast Concurrent Access to Parallel Disks
In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00), 849-858
Hide details for Sanders, Egner, TolhuizenSanders, Egner, Tolhuizen
2003Polynomial Time Algorithms For Network Information Flow
In: Proceedings of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA-03), 286-294
Hide details for Sanders, PettieSanders, Pettie
2004Attachment IconA Simpler Linear Time 2/3 - epsilon Approximation for Maximum
Weight Matching
Hide details for Sanders, Reussner, Prechelt, MüllerSanders, Reussner, Prechelt, Müller
1998SKaMPI: A Detailed, Accurate MPI Benchmark
In: Proceedings of the 5th European PVM/MPI Users' Group Meeting, 52-59
Hide details for Sanders, SibeynSanders, Sibeyn
2003A Bandwidth Latency Tradeoff for Broadcast and Reduction
In: Information Processing Letters [86], 33-38
2000A 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
Hide details for Sanders, Singler, van SteeSanders, Singler, van Stee
2013Attachment IconReal-time prefetching and caching
In: Journal of Scheduling [16], 47-58
Hide details for Sanders, Sivadasan, SkutellaSanders, Sivadasan, Skutella
2009Online scheduling with bounded migration
In: Mathematics of Operations Research [34], 481-498
2004Attachment IconOnline scheduling with bounded migration
In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, 1111-1122
Hide details for Sanders, Solis-ObaSanders, Solis-Oba
2001How Helpers Hasten h-Relations
In: Journal of Algorithms [41], 86-98
2000How Helpers Hasten h-Relations
In: Algorithms - ESA 2000, Proceedings of the 8th Annual European Symposium (ESA-00), 392-402
Hide details for Sanders, SteurerSanders, Steurer
2005An Asymptotic Approximation Scheme for Multigraph Edge Coloring
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 897-906
Hide details for Sanders, Takkula, WedelinSanders, Takkula, Wedelin
1999High 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
Hide details for Sanders, TräffSanders, Träff
2002The factor algorithm for regular all-to-all communication on clusters of SMP nodes
In: Proceedings of the 8th International Euro-Par Conference, 799-803
Hide details for Sanders, VöckingSanders, Vöcking
2003Tail bounds and expectations for random arc allocation and applications
In: Combinatorics, Probability and Computing [12], 225-244
2002Random Arc Allocation and Applications to Disks, Drums and DRAMs
In: Algorithm theory, SWAT 2002 : 8th Scandinavian Workshop on Algorithm Theory, 121-130
Hide details for Sanders, Vollmar, WorschSanders, Vollmar, Worsch
2002Feasible models of computation: Three-dimensionality and energy consumption
In: Fundamenta Informaticae [52], 233-248
Hide details for Sauerwald, StaufferSauerwald, Stauffer
2011Rumor Spreading and Vertex Expansion on Regular Graphs
In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 462-475
Hide details for Sauerwald, SunSauerwald, Sun
2012Tight Bounds For Randomized Load Balancing on Arbitrary Network Topologies
In: IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS-12), 341-350
Hide details for SchäferSchäfer
2004Worst case instances are fragile: average case and smoothed competitive analysis of algorithms
Universität des Saarlandes
2000Weighted Matchings in General Graphs
Universität des Saarlandes
Hide details for Schäfer, SivadasanSchäfer, Sivadasan
2004Attachment IconTopology matters: Smoothed competitiveness of metrical task systems
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 489-500
Hide details for Schalekamp, Williamson, van ZuylenSchalekamp, Williamson, van Zuylen
2012A proof of the Boyd-Carr conjecture
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 1477-1486
Hide details for SchanneSchanne
2001Visualisierung der Dialektgeographie und Topographie im deutschen Dialektraum
Universität des Saarlandes
Hide details for SchilzSchilz
2000Effiziente Algorithmen für das verteilte Rechnen auf Workstation-Clustern
Universität des Saarlandes
Hide details for SchirraSchirra
2000Robustness and Precision Issues in Geometric Computation
In: Handbook of Computational Geometry, 597-632
1999A Case Study on the Cost of Geometric Computing
In: Selected papers of the International Workshop on Algorithm Engineering and Experimentation (ALENEX-99), 156-176
1998Computational Geometry: Theory and Implementation
Universität des Saarlandes
1997Precision and Robustness in Geometric Computations
In: Algorithmic Foundations of Geographic Information Systems, 255-287
Hide details for SchmidtSchmidt
2013A Planarity Test via Construction Sequences
In: 38th International Symposium on Mathematical Foundations of Computer Science (MFCS'13), 765-776
2013A Simple Test on 2-Vertex- and 2-Edge-Connectivity
In: Information Processing Letters [113], 241-244
2013Contractions, Removals and Certifying 3-Connectivity in Linear Time
In: SIAM Journal on Computing [42], 494-535
2013Contractions, Removals and How to Certify 3-Connectivity in Linear TimeSchmidt2013
2012Certifying 3-Connectivity in Linear Time
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 786-797
2012Construction Sequences and Certifying 3-Connectivity
In: Algorithmica [62], 192-208
Hide details for Schmidt, ValtrSchmidt, Valtr
2012Cubic Plane Graphs on a Given Point Set
In: Proceedings of the Twenty-Eighth Annual Symposium on Computational Geometry (SCG'12), 201-208
Hide details for SchmittSchmitt
2006Implementierung einer Überlagerungvon konvexen Arrangements der Kugeloberfläche
Universität des Saarlandes
2005Attachment IconThe diamond operator - Implementation of exact real algebraic numbers
In: Computer Algebra in Scientific Computing, 8th International Workshop, CASC 2005, 355-366
2004Common Subexpression Search in LEDA_reals -- a study of the diamond-operatorSchmitt04b
2004Improved separation bounds for the diamond operatorSchmitt04a
2003Common Subexpression Search in LEDA_realss-cssl-03
2003The Diamond Operator for Real Algebraic Numberss-doran-03
Hide details for Schmitt, FousseSchmitt, Fousse
2004Attachment IconA comparison of polynomial evaluation schemesSchmittFoussee2004
Hide details for Schmitt, ZimmerSchmitt, Zimmer
2003Elliptic Curves : A Computational ApproachSchmitt2003
Hide details for SchmitzSchmitz
1995Analyse von Branch-and-Bound Algorithmen zum Problem des Handlungsreisenden
Universität des Saarlandes
Hide details for Schnorr, SubramanianSchnorr, Subramanian
1998Almost 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
Hide details for Schömer, Reichel, Warken, LennerzSchömer, Reichel, Warken, Lennerz
2002Efficient Collision Detection for Curved Solid Objects
In: Proceedings of the Seventh ACM Symposium on Solid Modeling and Applications, 321-328
Hide details for Schömer, ThielSchömer, Thiel
1995Efficient Collision Detection for Moving Polyhedra
In: 11th Annual ACM Symposium on Computational Geometry (SCG95), 51-60
Hide details for Schömer, WolpertSchömer, Wolpert
2006An Exact and Efficient Approach for Computing a Cell in an Arrangement of Quadrics
In: Computational Geometry [33], 65 - 97
Hide details for SchröderSchröder
1998Upper and Lower Bounds for Basic Scheduling Problems
Universität des Saarlandes
Hide details for SchulteSchulte
2001Exaktes Lösen von Linearen Programmen
Universität des Saarlandes
Hide details for SchultesSchultes
2005Fast and Exact Shortest Path Queries Using Highway Hierachies
Universität des Saarlandes
Hide details for SchwarzeneckerSchwarzenecker
1995Ein NP-schweres Plazierungsproblem
Universität des Saarlandes
Hide details for Schwarz, Karrenbauer, Schehr, RiegerSchwarz, Karrenbauer, Schehr, Rieger
2009Domain walls and chaos in the disordered SOS model
In: Journal of statistical mechanics : theory and experiment [P08022], 1-23
Hide details for SchweitzerSchweitzer
2009Problems of Unknown Complexity: Graph isomorphism and Ramsey theoretic numbers
Universität des Saarlandes
2009Using the Incompressibility Method to obtain Local Lemma results for Ramsey-type Problems
In: Information Processing Letters [109], 229-232
Hide details for Schweitzer, SchweitzerSchweitzer, Schweitzer
2010Connecting face hitting sets in planar graphs
In: Information Processing Letters [111], 11-15
Hide details for Schwerdt, Smid, SchirraSchwerdt, Smid, Schirra
1997Computing 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
1997Computing 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
Hide details for SeelSeel
2001Planar Nef Polyhedra and Generic Higher-dimensional Geometry
Universität des Saarlandes
1994Eine Implementierung abstrakter Voronoidiagramme
Universität des Saarlandes
Hide details for SeidelSeidel
1997Paralleles List Ranking
Universität des Saarlandes
Hide details for Seidel, WolpertSeidel, Wolpert
2005On the Exact Computation of the Topology of Real Algebraic Curves
In: Proceedings of the 21st ACM Symposium on Computational Geometry, 107-115
Hide details for SeidenSeiden
2000Online randomized multiprocessor scheduling
In: Algorithmica [28], 173-216
1999Randomized online scheduling with delivery times
In: Journal of Combinatorial Optimization [3], 399-416
Hide details for SemeloglouSemeloglou
2000Kürzeste Wege in planare Graphen. Implementierung eines parallelen Algorithmus mithilfe von PAD
Universität des Saarlandes
Hide details for SharmaSharma
2008Complexity of real root isolation using continued fractions
In: Theoretical Computer Science [409], 292-310
Hide details for Shervashidze, Schweitzer, van Leeuwen, Mehlhorn, BorgwardtShervashidze, Schweitzer, van Leeuwen, Mehlhorn, Borgwardt
2011Weisfeiler-Lehman graph kernels
In: Journal of Machine Learning Research [12], 2539-2561
Hide details for Shervashidze, Vishwanathan, Petri, Mehlhorn, BorgwardtShervashidze, Vishwanathan, Petri, Mehlhorn, Borgwardt
2009Attachment IconEfficient Graphlet Kernels for Large Graph Comparison
In: Proceedings of the Twelfth International Conference on Artificial Intelligence and Statistics (AISTATS), 488-495
Hide details for SibeynSibeyn
2000Solving fundamental problems on sparse-meshes
In: IEEE Transactions on Parallel & Distributed Systems [11], 1324-1332
1999Better 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
1999Effiziente parallele Algorithmen
Universität des Saarlandes
1999External Selection
In: Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science (STACS-99), 291-301
1999Power and Limitations of Optical Reconfigurable Arrays
In: Proceedings of the 6th International Colloquium on Structural Information and Communication Complexity (SIROCCO 6), 249-263
1999Row-Major Sorting on Meshes
In: SIAM Journal on Computing [28], 847-863
1999Ultimate Parallel List Ranking?
In: Proceedings of the 6th International Conference on High Performance Computing (HiPC-99), 197-201
1998List Ranking on Meshes
In: Acta Informatica [35], 543-566
1998Solving Fundamental Problems on Sparse-Meshes
In: Proceedings of the 6th Scandinavian Workshop on Algorithm Theory (SWAT-98), 288-299
1997Better Trade-offs for Parallel List Ranking
In: Proceedings of the 9th Symposium on Parallel Algorithms and Architectures (SPAA-97), 221-230
1997Routing on Triangles, Tori and Honeycombs
In: International Journal on the Foundations of Computer Science [8], 269-287
1997Routing with Finite Speeds of Memory and Network
In: Proceedings of the 22nd Symposium on the Mathematical Foundations of Computer Science (MFCS-97), 488-497
1997Sample Sort on Meshes
In: Proceedings of the 3rd International Euro-Par Conference on Parallel Processing (Euro-Par-97), 389-398
1996List Ranking on Interconnection Networks
In: 2nd Euro-Par Conference, 529-541
1996Routing on Triangles, Tori and Honeycombs
In: Mathematical Foundations of Computer Science 1996: 21st International Symposium (MFCS'96), 529-541
1995Sample Sort on Meshes
In: Proceedings of Computing Science in the Netherlands, SION, 217-228
Hide details for Sibeyn, Abello, MeyerSibeyn, Abello, Meyer
2002Heuristics for Semi-External Depth First Search on Directed Graphs
In: SPAA 2002 : Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 282-292
Hide details for Sibeyn, Grammatikakis, Hsu, KraetzlSibeyn, Grammatikakis, Hsu, Kraetzl
1998Packet Routing in Fixed-Connection Networks: A Survey
In: Journal of Parallel and Distributed Computing [54], 77-132
Hide details for Sibeyn, Guillaume, SeidelSibeyn, Guillaume, Seidel
1999Practical Parallel List Ranking
In: Journal of Parallel and Distributed Computing [56], 156-180
1997Practical Parallel List Ranking
In: Proceedings of the 4th Symposium on Solving Irregularly Structured Problems in Parallel (IRREGULAR-97), 25-36
Hide details for Sibeyn, Juurlink, RaoSibeyn, Juurlink, Rao
1998Gossiping on Meshes and Tori
In: IEEE Transactions on Parallel and Distributed Systems [9], 513-525
Hide details for Sibeyn, KaufmannSibeyn, Kaufmann
1997BSP-Like External-Memory Computation
In: Proceedings of the 3rd Italian Conference on Algorithms and Complexity (CIAC-97), 229-240
1997Randomized Multipacket Routing and Sorting on Meshes
In: Algorithmica [17], 224-244
Hide details for Sibeyn, Kaufmann, ChlebusSibeyn, Kaufmann, Chlebus
1997Deterministic Permutation Routing on Meshes
In: Journal of Algorithms [22], 111-141
Hide details for SittersSitters
2005Complexity of preemptive minsum scheduling on unrelated parallel machines
In: Journal of Algorithms [57], 37-48
Hide details for Sitters, StougieSitters, Stougie
2006The general two-server problem
In: Journal of the ACM [53], 437-458
Hide details for SivadasanSivadasan
2004Online Problems and Two-Player Games: Algorithms and Analysis
Universität des Saarlandes
Hide details for Sivadasan, Sanders, SkutellaSivadasan, Sanders, Skutella
2004Attachment IconOnline Scheduling with Bounded MigrationSivadasanSandersSkutella2004
Hide details for SmidSmid
1995Dynamic rectangular point location, with an application to the closest pair problem
In: Information and Computation [16], 1-9
Hide details for Smid, Ray, Wendt, LangeSmid, Ray, Wendt, Lange
2004Computing Large Planar Regions in Terrains, with an Application to Fracture Surface
In: Discrete Applied Mathematics [139], 253-264
Hide details for Solis-ObaSolis-Oba
19982-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
Hide details for Solis-Oba, FredericksonSolis-Oba, Frederickson
1998Rooted Spanning Trees with Small Weight and Average Length
In: Theoretical Computer Science, 114-125
Hide details for Solis-Oba, Jansen, SviridenkoSolis-Oba, Jansen, Sviridenko
1999A 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
1999Makespan 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
Hide details for SonSon
1999Berechnung konvexer Hüllen in erwarteter Linearzeit
Universität des Saarlandes
Hide details for Soranzo, Ramezani, Iacono, AltafiniSoranzo, Ramezani, Iacono, Altafini
2012Decompositions of large-scale biological systems based on dynamical properties
In: Bioinformatics [28], 76-83
Hide details for Sridharan, Subramanian, SudhaSridharan, Subramanian, Sudha
1998Some Properties of Touching Distances for Polygons and Polyhedra
In: Applied Mathematics Letters [11], 1-7
Hide details for SrivastavaSrivastava
1996Entwicklung und Implementierung eines Entscheidungsalgorithmus zur Zuordnung von Probleminstanzen an Hierarchieebenen
Universität des Saarlandes
Hide details for StephanStephan
2000Implementierung eines heuristischen und eines exakten Ansatzes zur Berechnung minimaler Steinerbäume in Netzwerken
Universität des Saarlandes
Hide details for SteurerSteurer
2006An Asymptomic Approximation Scheme for Multigraph Edge Coloring
Universität des Saarlandes
2006Tight Bounds on the Min-Max Boundary Decomposition Cost of Weighted Graphs
Universität des Saarlandes
Hide details for StormerStormer
1998Ein Programm zum visuellen Erlernen von Graphalgorithmen
Universität des Saarlandes
Hide details for SubramanianSubramanian
2000Algorithms for Colouring Random k-colourable Graphs
In: Combinatorics, Probability and Computing [9], 45-77
1999A 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
1999Minimum Coloring k-Colorable Graphs in Polynomial Average Time
In: Journal of Algorithms [33], 112-123
Hide details for Subramanian, Fürer, Veni MadhavanSubramanian, Fürer, Veni Madhavan
1998Algorithms for Coloring Semi-random Graphs
In: Random Structures & Algorithms [13], 125-158
Hide details for Sviridenko, WieseSviridenko, Wiese
2013Approximating 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),
Hide details for TelikepalliTelikepalli
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
Hide details for Telikepalli, Chandran, SubramanianTelikepalli, Chandran, Subramanian
2003Isoperimetric Inequalities and Width Parameters of Graphs
In: Computing and Combinatorics : 9th Annual International Conference, COCOON 2003, 385-393
Hide details for Telikepalli, VaradarajanTelikepalli, Varadarajan
2003On Shortest Paths in Line Arrangements
In: 15th Canadian Conference in Computational Geometry (CCCG-03), 170-173
Hide details for Teramoto, Asano, Katoh, DoerrTeramoto, Asano, Katoh, Doerr
2006Inserting Points Uniformly at Every Instance
In: IEICE - Transactions on Information and Systems [E89-D], 2348-2356
Hide details for ThielThiel
2004Efficient Algorithms for Constraint Propagation and for Processing Tree Descriptions
Universität des Saarlandes
1999Attachment IconPersistente Suchbäume
Universität des Saarlandes
1996Effiziente Algorithmen für Probleme der Kollisionserkennung und der geometrischen Optimierung
Universität des Saarlandes
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.)
2007GECCO 2007: Proceedings of the 9th Annual Conference on Genetic and Evolutionary ComputationDoerr2007GeccoProc
Hide details for ThomeThome
2000Erweiterung des hierarchischen Zeichenmodells in ArchEd
Universität des Saarlandes
Hide details for ThorupThorup
2000Floats, Integers, and Single Source Shortest Paths
In: Journal of Algorithms [35], 189 -201
Hide details for Tiwary, ElbassioniTiwary, Elbassioni
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
Hide details for TräffTräff
1996A Heuristic for Blocking Flow Algorithms
In: European Journal of Operational Research [89], 564-569
1995An Experimental Comparison of two Distributed Singel-Source Shortest Path Algorithm
In: Parallel Computing [21], 1505-1532
Hide details for Träff, ZaroliagisTrä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
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
Hide details for van Leeuwen, Mehlhorn, Reps (ed.)van Leeuwen, Mehlhorn, Reps (ed.)
1994Attachment IconIncremental Computation and Dynamic Algorithms 02.05.-06.05.94mehlhorn94j
Hide details for van Steevan Stee
2013SIGACT News Online Algorithms Column 22
In: SIGACT News [44], 125
2012Attachment IconAn improved algorithm for online rectangle filling
In: Theoretical Computer Science [423], 59-74
2012Attachment IconSIGACT News Online Algorithms Column 20: The Power of Harmony
In: SIGACT News [43], 127-136
2012Attachment IconSIGACT News Online Algorithms Column 21: APPROX and ALGO
In: SIGACT News [43], 123-129
2011Attachment IconAn improved algorithm for online rectangle filling
In: Approximation and Online Algorithms : 8th International Workshop, WAOA 2010, 249-260
2008Attachment IconCombinatorial algorithms for packing and scheduling problems
Universität Karlsruhe
2008Attachment IconPacket Switching in Single Buffer
In: Encyclopedia of Algorithms, 1-99
2008Attachment IconPaging
In: Encyclopedia of Algorithms, 1-99
Hide details for van Zuylenvan Zuylen
2012Simpler 3/4-approximation algorithms for MAX SAT
In: Approximation and Online Algorithms : 9th International Workshop, WAOA 2011, 188-197
2011An improved monotone algorithm for scheduling related machines with precedence constraints
In: Operations Research Letters [39], 423-427
2011Deterministic Sampling Algorithms for Network Design
In: Algorithmica [60], 110-151
2011Linear programming based approximation algorithms for feedback set problems in bipartite tournaments.
In: Theoretical Computer Science [412], 2556-2561
Hide details for van Zuylen, Schalekamp, Williamsonvan Zuylen, Schalekamp, Williamson
2011Popular Ranking
In: 10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2011, 267-270
Hide details for VidaliVidali
2009The Geometry of Truthfulness
In: Internet and Network Economics : 5th International Workshop, WINE 2009, 340-350
Hide details for Vingron, Lenhof, MutzelVingron, Lenhof, Mutzel
1997Computational Molecular Biology
In: Annotated Bibliographies in Combinatorial Optimization, 445-471
Hide details for VöckingVöcking
2001Almost Optimal Permutation Routing on Hypercubes
In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC-01), 530-539
2001Symmetric vs. Asymmetric Multiple-Choice Algorithms
In: Proceedings of the 2nd International Workshop on Approximation and Randomized Algorithms in Communication Networks (ARACNE), 1-10
Hide details for von Braunmühl, Cook, Mehlhorn, Verbeekvon Braunmühl, Cook, Mehlhorn, Verbeek
1983The Recognition of Deterministic CFL's in Small Time and Space
In: Information and Control [56], 34-51
Hide details for von Zülowvon Zülow
1994Das k-Closest-Pair-Problem
Universität des Saarlandes
Hide details for Wagner, Veeramachaneni, Neumann, O'ReillyWagner, Veeramachaneni, Neumann, O'Reilly
2011Attachment IconOptimizing the Layout of 1000 Wind Turbines
In: European Wind Energy Association Annual Event, 1-10
Hide details for WahlWahl
2000Ein neuer Algorithmus für Online-Scheduling
Universität des Saarlandes
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),
2011New Plain-Exponential Time Classes for Graph Homomorphism
In: Theory of Computing Systems [49], 273-282
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
2008A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances
In: 3rd International Workshop on Parameterized and Exact Computation (IWPEC 2008), 202-213
Hide details for WangWang
2012Certification of Curve Arrangements
Universität des Saarlandes
Hide details for WarkenWarken
2004Collision detection for Curved Rigid Objects in the Context of Dynamics Simulations
Universität des Saarlandes
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
Hide details for WeberWeber
2007Attachment IconEfficient Index Structures for and Applications of the CompleteSearch Engine
Universität des Saarlandes
2006Solving large Sparse Linear Systems exactly
Universität des Saarlandes
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, ?
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
Hide details for WeinandWeinand
2005Fill-in Reduction while Solving large, sparse Linear Systems with Graph Theoretical Methods
Universität des Saarlandes
Hide details for WeiskircherWeiskircher
2002New Applications of SPQR-Trees in Graph Drawing
Universität des Saarlandes
1997Attachment Icon2-Schicht-Planarisierung bipartiter Graphen
Universität des Saarlandes
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
Hide details for WilhelmiWilhelmi
1995Erzeugung von Pseudozufallszahlen gemäß einer veränderbaren Verteilung
Universität des Saarlandes
Hide details for WinzenWinzen
2013Direction-Reversing Quasi-Random Rumor Spreading with Restarts
In: Information Processing Letters [113], 921-926
2011Direction-Reversing Quasi-Random Rumor Spreading with RestartsWinzen2011b
2011Toward a complexity theory for randomized search heuristics : black box models
Universität des Saarlandes
Hide details for WissenWissen
1998Automatisiertes Zeichnen von Zustandsdiagrammen
Universität des Saarlandes
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
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
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
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
Hide details for ZiegelmannZiegelmann
2001Constrained Shortest Paths and Related Problems
Universität des Saarlandes
Hide details for ZiegenbeinZiegenbein
1997Bewertung verschiedener paarweiser Alignment-Methoden, Ersetzungsmatrizen und Gap-Funktionen
Universität des Saarlandes
Hide details for ZieglerZiegler
2000Crossing Minimization in Automatic Graph Drawing
Universität des Saarlandes
1995Max-Weighted-Matching auf allgemeinen Graphen
Universität des Saarlandes
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
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

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