Max-Planck-Institut für Informatik
max planck institut
informatik
mpii logo Minerva of the Max Planck Society
 

MPI-INF D1 Publications

MPI-INF D1 Publications

Entries sorted by: 9. Admin - 3. Fachbeiratsbericht 2005-2007

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

BibTeX cite keyAuthor/EditorYearTitleType
FK2006Funke, Stefan
Klein, Christian
2006Attachment IconHole Detection or: "How Much Geometry Hides in Connectivity?"
In: Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06, 377-385
Proceedings Article
FKesselmanMeyerS2006Funke, Stefan
Kesselman, Alexander
Meyer, Ulrich
Segal, Michael
2006A Simple Improved Distributed Algorithm for Minimum CDS in Unit Disk Graphs
In: ACM Transactions on Sensor Networks [2], 444-453
Journal Article
FKKLS07Funke, Stefan
Kesselman, Alexander
Kuhn, Fabian
Lotker, Zvi
Segal, Michael
2007Attachment IconImproved approximation algorithms for connected sensor cover
In: Wireless Networks [13], 153-164
Journal Article
FKMS2005Funke, Stefan
Klein, Christian
Mehlhorn, Kurt
Schmitt, Susanne
2005Attachment IconControlled Perturbation for Delaunay Triangulations
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 1047-1056
Proceedings Article
FKMS2005bFunke, Stefan
Kesselman, Alexander
Meyer, Ulrich
Segal, Michael
2005A Simple Improved Distributed Algorithm for Minimum CDS in Unit Disk Graphs
In: 1st IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob 2005), 220-223
Proceedings Article
FL2007Funke, Stefan
Laue, Sören
2007Attachment IconBounded-Hop Energy-Efficient Broadcast in Low-Dimensional Metrics Via Coresets
In: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, 272-283
Proceedings Article
FLN2007Funke, Stefan
Laue, Sören
Naujoks, Rouven
2007Minimum Energy Broadcast with Few Senders
In: Distributed Computing in Sensor Systems : Third IEEE International Conference, DCOSS 2007, 404-416
Proceedings Article
FM2007Funke, Stefan
Milosavljevic, Nikola
2007Network Sketching or: "How much Geometry hides in Connectivity? - Part II"
In: Proceedings of the eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-07), 958-967
Proceedings Article
FM2007bFunke, Stefan
Milosavljevic, Nikola
2007Guaranteed-delivery Geographic Routing under Uncertain Node Locations
In: IEEE INFOCOM 2007 : 26th IEEE International Conference on Computer Communications, 1244-1252
Proceedings Article
FMMW2006Funke, Stefan
Malamatos, Theocharis
Matijevic, Domagoj
Wolpert, Nicola
2006Attachment Icon(Approximate) Conic Nearest Neighbors and the induced Voronoi Diagram
In: 18th Canadian Conference on Computational Geometry, 23-26
Proceedings Article
Fountoulakis2007Fountoulakis, Nikolaos
Reed, Bruce
2007Faster Mixing and Small Bottlenecks
In: Probability Theory and Related Fields [137], 475-486
Journal Article
Fountoulakis2009aFountoulakis, Nikolaos2007Percolation on sparse random graphs with given degree sequence
In: Internet Mathematics [4], 329-356
Journal Article
Friedrich2005Friedrich, Tobias2005Attachment IconDeterministic Random Walks on Infinite Grids
Friedrich-Schiller-Universität Jena
Thesis - Masters thesis
FriedrichPhD2007Friedrich, Tobias2007Use and Avoidance of Randomness
Universität des Saarlandes
Thesis - PhD thesis
FuGui2006Funke, Stefan
Guibas, Leonidas
Nguyen, An
Wang, Yusu
2006Distance-Sensitive Information Brokerage in Sensor Networks
In: Distributed Computing in Sensor Systems, Second IEEE International Conference, DCOSS 2006, 234-251
Proceedings Article
Funke2007Aronov, Boris
Asano, Tetsuo
Funke, Stefan
2007Optimal Triangulation with Steiner Points
In: Algorithms and Computation : 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007. Proceedings, 681-691
Proceedings Article
FunkeHD2005Funke, Stefan2005Topological Hole Detection in Wireless Sensor Networks and its Applications
In: 3rd ACM/SIGMOBILE International Workshop on foundations of Mobile Computing (DIAL-M-POMC), 44-53
Proceedings Article
FunkeIE2005Funke, Stefan
Milosavljevic, Nikola
2005Infrastructure-Establishment from Scratch in Wireless Sensor Networks
In: Distributed computing in sensor systems : First IEEE International Conference, DCOSS 2005, 354-367
Proceedings Article
FunkeLaueLotkerNaujoks2006Funke, Stefan
Laue, Sören
Naujoks, Rouven
Lotker, Zvi
2006Power Assignment Problems in Wireless Communication
In: ??? [?], 1-14
Miscellaneous
FunkeRauf07Funke, Stefan
Rauf, Imran
2007Information Brokerage Via Location-Free Double Rulings
In: Ad-Hoc, Mobile, and Wireless Networks : 6th International Conference, ADHOC-NOW 2007, Morelia, Mexico, September 24-26, 2007, Proceedings, 87-100
Proceedings Article
Gidenstam2007aGidenstam, Anders
Papatriantafilou, Marina
2007LFthreads: A Lock-Free Thread Library
In: 11th International Conference On Principles Of Distributed Systems (OPODIS), 217-231
Proceedings Article
Giesen2007Giesen, Joachim
Schuberth, Eva
Simon, Klaus
Zolliker, Peter
Zweifel, Oliver
2007Image-Dependent Gamut Mapping as Optimization Problem
In: IEEE Transactions on Image Processing [16], 2401-2410
Journal Article
Giesen2007colGiesen, Joachim
Mitsche, Dieter
Schuberth, Eva
2007Attachment IconCollaborative Ranking: an aggregation algorithm for individuals' preference estimation
In: Algorithmic Aspects in Information and Management : Third International Conference, AAIM 2007, 58-67
Proceedings Article
Giesen2007conjGiesen, Joachim2007The Combinatorial Structure of Polyhedral Choice Based Conjoint Analysis
In: Conjoint Measurement: Methods and Applications, 259-271
Part of a Book
Giesen2007eGiesen, Joachim2007Medial Axis Approximation from Inner Voronoi Balls: A Demo of the Mesecina Tool
In: 23d Annual ACM Symposium on Computational Geometry, 123-124
Proceedings Article
GKMMP06Gotsman, Craig
Kaligosi, Kanela
Mehlhorn, Kurt
Michail, Dimitrios
Pyrga, Evangelia
2007Attachment IconCycle Bases of Graphs and Sampled Manifolds
In: Computer Aided Geometric Design [24], 464
Journal Article
GKSGeorgiou, Chryssis
Kowalski, Dariusz
Shvartsman, Alexander
2005Efficient gossip and robust distributed computation
In: Theoretical Computer Science [347], 130-166
Journal Article
GolumbicMR06Golumbic, Martin Charles
Mintz, Aviad
Rotics, Udi
2006Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial k-trees
In: Discrete Applied Mathematics [154], 1465-1477
Journal Article
HachenbergerKettner2005NefHachenberger, Peter
Kettner, Lutz
2005Boolean Operations on 3D Selective Nef Complexes: Optimized Implementation and Experiments
In: ACM Symposium on Solid and Physical Modeling (SPM 2005), 163-174
Proceedings Article
Harren2006aHarren, Rolf2006Attachment IconApproximating the Orthogonal Knapsack Problem for Hypercubes
In: Automata, Languages and Programming, 238-249
Proceedings Article
Harren2006bHarren, Rolf2006Approximation mehrdimensionaler Packungsprobleme
Universität Dortmund
Thesis - other
Harren2007Diedrich, Florian
Harren, Rolf
Jansen, Klaus
Thöle, Ralf
Thomas, Henning
2007Attachment IconApproximation Algorithms for 3D Orthogonal Knapsack
In: Theory and Applications of Models of Computation, 34-45
Proceedings Article
Harren2007bHarren, Rolf2007Mehrdimensionale Packungsprobleme - Approximation geometrischer Verallgemeinerungen klassischer PackungsproblemeBook
Hebbinghaus2005Doerr, Benjamin
Hebbinghaus, Nils
2005Discrepancy of Products of Hypergraphs
In: 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 323-328
Proceedings Article
Hebbinghaus2006Doerr, Benjamin
Hebbinghaus, Nils
Neumann, Frank
2006Attachment IconSpeeding Up Evolutionary Algorithms Through Restricted Mutation Operators
In: Parallel Problem Solving from Nature - PPSN IX, 9th International Conference, 978-987
Proceedings Article
Hebbinghaus2006aBundy, David
Hebbinghaus, Nils
Stellmacher, Bernd
2006Attachment IconThe Local C(G,T) Theorem
In: Journal of Algebra [300], 741-789
Journal Article
Hebbinghaus2007Hebbinghaus, Nils2007Attachment IconDiscrepancy of Sums of two Arithmetic ProgressionsReport
Hemmer2007Dupont, Laurent
Hemmer, Michael
Petitjean, Sylvain
Schömer, Elmar
2007Attachment IconComplete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics
In: 15th Annual European Symposium on Algorithms, 633-644
Proceedings Article
HTM06aHariharan, Ramesh
Telikepalli, Kavitha
Mehlhorn, Kurt
2006Attachment IconA Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs
In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Part I, 250-261
Proceedings Article
HybridVC07Friedrich, Tobias
He, Jun
Hebbinghaus, Nils
Neumann, Frank
Witt, Carsten
2007On Improving Approximate Solutions by Evolutionary Algorithms
In: IEEE Congress on Evolutionary Computation 2007, 2614-2621
Proceedings Article
ImpBoun2006Doerr, Benjamin
Hebbinghaus, Nils
Werth, Sören
2006Attachment IconImproved Bounds and Schemes for the Declustering Problem
In: Theoretical Computer Science [359], 123-132
Journal Article
inserpoints2006Teramoto, Sachio
Asano, Tetsuo
Katoh, Naoki
Doerr, Benjamin
2006Inserting Points Uniformly at Every Instance
In: IEICE - Transactions on Information and Systems [E89-D], 2348-2356
Journal Article
IntLiar2006Doerr, Benjamin
Lengler, Johannes
Steurer, Daniel
2006Attachment IconThe Interval Liar Game
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 318-327
Proceedings Article
ITMMP2006Irving, Robert W.
Telikepalli, Kavitha
Mehlhorn, Kurt
Michail, Dimitrios
Paluch, Katarzyna
2006Attachment IconRank-Maximal Matchings
In: ACM Transactions on Algorithms [2], 602-610
Journal Article
Johannsen2006aJohannsen, Daniel2006Attachment IconSampling Rooted 3-Connected Planar Graphs in Deterministic Polynomial Time
Humboldt-Universität zu Berlin
Thesis - Masters thesis
Kaligosi2006aKaligosi, Kanela
Sanders, Peter
2006How Branch Mispredictions Affect Quicksort
In: Algorithms - ESA 2006, 14th Annual European Symposium, 780-791
Proceedings Article
Kaligosi2006bBrodal, Gerth Stølting
Kaligosi, Kanela
Katriel, Irit
Kutz, Martin
2006Faster Algorithms for Computing Longest Common Increasing Subsequences
In: Combinatorial Pattern Matching, 17th Annual Symposium, CPM 2006, 330-341
Proceedings Article
KamranDipl05Kamran Azam, Muhammad2005Branch-and-Cut Techniques for Generalized Asymmetric Traveling Salesman Problem
Universität des Saarlandes
Thesis - Masters thesis
KarrenbauerPhDKarrenbauer, Andreas2007Attachment IconEngineering combinatorial optimization algorithms to improve the lifetime of OLED displays
Universität des Saarlandes
Thesis - PhD thesis
KatrielSWC2004Beldiceanu, Nicolas
Katriel, Irit
Thiel, Sven
2005GCC-like Restrictions on the Same constraint
In: Constraint Satisfaction and Constraint Logic Programming : ERCIM/CoLogNet International Workshop, CSCLP 2004, 1-11
In: Recent Advances in Constraints [3419], 1-11
Proceedings Article
KatrielThielGCCKatriel, Irit
Thiel, Sven
2005Complete Bound Consistency for the Global Cardinality Constraint
In: Constraints [10], 191-217
Journal Article
Kavitha2007TCSKavitha, Telikepalli
Mehlhorn, Kurt
2007Attachment IconAlgorithms to compute minimum cycle basis in directed graphs
In: Theory of Computing Systems [40], 485-505
Journal Article
Kerber2006Kerber, Michael2006Attachment IconAnalysis of Real Algebraic Plane Curves
Universität des Saarlandes
Thesis - Masters thesis
Kesselmann2004aKesselman, Alexander
Kogan, Kirill
2005Non-Preemptive Scheduling of Optical Switches
In: 2004 IEEE Global Telecommunications Conference workshops (GLOBECOM'04), 1840-1844
Proceedings Article
Kesselmann2005wonsKesselman, Alexander
Kowalski, Dariusz
2005Fast Distributed Algorithm for Convergecast in Ad Hoc Geometric Radio Networks
In: Second Annual Conference on Wireless On-demand Network Systems and Services (WONS'05), 119-124
Proceedings Article
Kettner2005HandleKettner, Lutz2005Reference Counting in Library Design---Optionally and with Union-Find Optimization
In: Library-Centric Software Design (LCSD'05), 1-10
Electronic Proceedings Article
Kettner2005PseudoTriangEnumBrönnimann, Hervé
Kettner, Lutz
Pocchiola, Michel
Snoeyink, Jack
2005Counting and enumerating pointed pseudo-triangulations with the greedy flip algorithm
In: Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics
(ALENEX/ANALCO 2005), 98-110
Proceedings Article
Kettner2005SocgVideoProceedingsMitchell, Rote, Kettner (ed.)200521st Annual Symposium on Computational Geometry (SCG'05)Proceedings
Kettner2005StxxlDementiev, Roman
Kettner, Lutz
Sanders, Peter
2005STXXL: Standard Template Library for XXL Data Sets
In: Algorithms - ESA 2005 : 13th Annual European Symposium (ESA 2005), 640-651
Proceedings Article
Kettner2005StxxlReportDementiev, Roman
Kettner, Lutz
Sanders, Peter
2005STXXL: Standard Template Library for XXL Data SetsReport
Kettner2006HandleKettner, Lutz2006Reference Counting in Library Design---Optionally and with Union-Find Optimization
In: Proceedings of the First International Workshop on Library-Centric Software Design, LCSD'05, 34-43
Proceedings Article
Kettner2006PseudoTEnumBrönnimann, Hervé
Kettner, Lutz
Pocchiola, Michel
Snoeyink, Jack
2006Attachment IconCounting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm
In: SIAM Journal on Computing [36], 721-739
Journal Article
Kettner2007CGALKernelHert, Susan
Hoffmann, Michael
Kettner, Lutz
Pion, Sylvain
Seel, Michael
2007An adaptable and extensible geometry kernel
In: Computational Geometry: Theory and Applications [38], 16-36
Journal Article
Kettner2007ECGBookMourrain, Bernard
Pion, Sylvain
Schmitt, Susanne
Técourt, Jean-Pierre
Tsigaridas, Elias
Wolpert, Nicola
2007Algebraic Issues in Computational Geometry
In: Effective Computational Geometry for Curves and Surfaces, 117-155
Part of a Book
Kettner2007ECGBookzFogel, Efi
Halperin, Dan
Kettner, Lutz
Teillaud, Monique
Wein, Ron
Wolpert, Nicola
2007Attachment IconArrangements
In: Effective Computational Geometry for Curves and Surfaces, 1-66
Part of a Book
Kettner2007Nef3Hachenberger, Peter
Kettner, Lutz
Mehlhorn, Kurt
2007Attachment IconBoolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, Optimized Implementation and Experiments
In: Computational Geometry: Theory and Applications [38], 64-99
Journal Article
KKSKesselman, Alexander
Kowalski, Dariusz
Segal, Michael
2005Attachment IconEnergy efficient communication in ad hoc networks from user's and designer's perspective
In: Proceedings of the n?th Conference on, 15-26
In: ACM SIGMOBILE Mobile Computing and Communications Review [9], 15-26
Journal Article
KlKu2006aKlein, Rolf
Kutz, Martin
2007Attachment IconComputing Geometric Minimum-Dilation Graphs Is NP-Hard
In: Graph Drawing : 14th International Symposium, GD 2006, 196-207
Proceedings Article
KlKu2006bKlein, Rolf
Kutz, Martin
2006Attachment IconThe Density of Iterated Crossing Points and a Gap Result for Triangulations of Finite Point Sets
In: Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06, 264-272
Proceedings Article
KM2005Kavitha, Telikepalli
Mehlhorn, Kurt
2005Attachment IconA Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs
In: STACS 2005 : 22nd Annual Symposium on Theoretical Aspects of Computer Science, 654-665
Proceedings Article
KMM07Kavitha, Telikepalli
Mehlhorn, Kurt
Michail, Dimitrios
2007Attachment IconNew Approximation Algorithms for Minimum Cycle Bases of Graphs
In: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, 512-523
Proceedings Article
KMS-ICDCSKowalski, Dariusz
Musial, Peter M.
Shvartsman, Alexander
2005Explicit combinatorial structures for cooperative distributed algorithms
In: 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05), 49-58
Proceedings Article
KMV2005Katriel, Irit
Michel, Laurent
Van Hentenryck, Pascal
2005Maintaining Longest Paths Incrementally
In: Constraints [10], 159-183
Journal Article
Kov07Kovács, Annamária2007Fast Algorithms for Two Scheduling Problems
Universität des Saarlandes
Thesis - PhD thesis
Kovacs2005aKovács, Annamária2005Polynomial Time Preemptive Sum-Multicoloring on Paths
In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, 840-852
Proceedings Article
Kovacs2005bKovács, Annamária2005Fast monotone 3-approximation algorithm for scheduling related machines
In: Algorithms - ESA 2005: 13th Annual European Symposium, 616-627
Proceedings Article
Kovacs2006Kovács, Annamária2006Tighter Approximation Bounds for LPT Scheduling in Two Special Cases
In: Algorithms and Complexity : 6th Italian Conference, CIAC 2006, 187-198
Proceedings Article
Kowalik2005Kowalik, Lukasz2006Improved Edge Coloring with Three Colors
In: Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, WG 2006, 90-101
Proceedings Article
Kowalik2006Chrobak, Marek
Dürr, Christoph
Jawor, Wojciech
Kowalik, Lukasz
Kurowski, Maciej
2006A Note on Scheduling Equal-Length Jobs to Maximize Throughput
In: Journal of Scheduling [9], 71-73
Journal Article
KowalikAdjSparseGraphsKowalik, Lukasz2007Adjacency Queries in Dynamic Sparse Graphs
In: Inf. Proc. Lett. [-], -
Journal Article
KowalikISAAC2006Kowalik, Lukasz2006Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 557-566
Proceedings Article
KowalikKotzigCole, Richard
Kowalik, Lukasz
Skrekovski, Riste
2007A Generalization of Kotzig's Theorem and Its Application
In: SIAM Journal on Discrete Mathematics [21], 93-106
Journal Article
KP-TCSKowalski, Dariusz
Pelc, Andrzej
2005Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism
In: Theoretical Computer Science [333], 355-371
Journal Article
Kutz05Kutz, Martin
Pór, Attila
2005Attachment IconAngel, Devil, and King
In: Computing and Combinatorics : 11th Annual International Conference, COCOON 2005, 925-934
Proceedings Article
Kutz2006Kutz, Martin2006Computing Shortest Non-Trivial Cycles on Orientable Surfaces of Bounded Genus in Almost Linear Time.
In: Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06, 430-437
Proceedings Article
Kutz3dAngelKutz, Martin2005Conway's Angel in three dimensions
In: Theoretical Computer Science [349], 443-451
Journal Article
KutzHGames:2004Kutz, Martin2005Weak Positional Games on Hypergraphs of Rank Three
In: 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 31-36
Proceedings Article
KutzSchw2006Kutz, Martin
Schweitzer, Pascal
2007ScrewBox: a Randomized Certifying Graph Non-Isomorphism Algorithm
In: 9th Workshop on Algorithm Engineering and Experiments (ALENEX'07), 150-157
Proceedings Article
LehnSchw2007Lehnert, Jörg
Schweitzer, Pascal
2007The Co-Word Problem for the Higman-Thompson Group is context-free
In: Bulletin of the London Mathematical Society [39], 235-241
Journal Article
LennerzDiss05Lennerz, Christian2005Distance Computation for Extended Quadratic Complexes
Universität des Saarlandes
Thesis - PhD thesis
lotkeretal06cocoonLotker, Zvi
Majumdar, Debapriyo
Narayanaswamy, N.S.
Weber, Ingmar
2006Sequences Characterizing k-Trees
In: Computing and Combinatorics, 12th Annual International Conference, COCOON 2006, 216-225
Proceedings Article
LpDisc2006Doerr, Benjamin2007Attachment IconLp Linear discrepancy of totally unimodular matrices
In: Linear Algebra and Its Applications [420], 663-666
Journal Article
Mal05Elmasry, Amr
Elbassioni, Khaled M.
2005Output-Sensitive Algorithms for Enumerating and Counting Simplices Containing a Given Point in th Plane
In: 17th Canadian Conference on Computational Geometry (CCCG'05), 248-251
Electronic Proceedings Article
Mal05zMalamatos, Theocharis2005Lower bounds for expected-case planar point location
In: 17th Canadian Conference on Computational Geometry (CCCG'05), 191-194
Electronic Proceedings Article
Malamatos2007aArya, Sunil
Malamatos, Theocharis
Mount, David M.
Wong, Ka Chun
2007Optimal expected-case planar point location
In: SIAM Journal on Computing [37], 584-610
Journal Article
Malamatos2007bArya, Sunil
Malamatos, Theocharis
Mount, David M.
2007A simple entropy-based algorithm for planar point location
In: ACM Transactions on Algorithms [3], 17
Journal Article
MastSteurer06Steurer, David2006An Asymptomic Approximation Scheme for Multigraph Edge Coloring
Universität des Saarlandes
Thesis - Masters thesis
MatijevicPhDMatijevic, Domagoj2007Attachment IconGeometric Optimization and Querying - Exact and Approximate
Universität des Saarlandes
Thesis - PhD thesis
Maue2006Maue, Jens2006Attachment IconA Goal-Directed Shortest Path Algorithm Using Precomputed Cluster Distances
Universität des Saarlandes
Thesis - Masters thesis
MaueSandersMatijevic2006Maue, Jens
Sanders, Peter
Matijevic, Domagoj
2006Goal Directed Shortest Path Queries Using Precomputed Cluster Distances
In: Experimental Algorithms, 5th International Workshop, WEA 2006, 316-327
Proceedings Article
Mcbg2006Bárány, Imre
Doerr, Benjamin
2006Attachment IconBalanced partitions of vector sequences
In: Linear Algebra and Its Applications [414], 464-469
Journal Article
mehlhorn05Lars, Bender, Demaine, Leiserson, Mehlhorn (ed.)2005Cache-Oblivious and Cache-Aware AlgorithmsReport
mehlhorn05Mehlhorn, Kurt2005Minimum Cycle Bases and Surface Reconstruction
In: Graph Drawing: 13th International Symposium, GD 2005, ,, 532-532
Proceedings Article
mehlhorn05Mehlhorn, Kurt
Waldmann, Uwe
Wilhelm, Reinhard
2005Harald Ganzinger : 31.10.1950 - 3.6.2004
In: MPG-Jahrbuch, 107-108
In: Jahrbuch / Max-Planck-Gesellschaft [?], 107-108
Part of a Book
mehlhorn05oKaligosi, Kanela
Mehlhorn, Kurt
Munro, J. Ian
Sanders, Peter
2005Attachment IconTowards Optimal Multiple Selection
In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, 103-114
Proceedings Article
mehlhorn05zFunke, Stefan
Mehlhorn, Kurt
Näher, Stefan
2005Attachment IconStructural filtering: a paradigm for efficient and exact geometric programs
In: Computational Geometry [31], 179-194
Journal Article
mehlhorn06Kettner, Lutz
Mehlhorn, Kurt
Pion, Sylvain
Schirra, Stefan
Yap, Chee
2006Reply to "Backward Error Analysis ..."
In: Computational Science and Its Applications - ICCSA 2006, I, 60-60
Proceedings Article
mehlhorn06bKratsch, Dieter
McConnell, Ross
Mehlhorn, Kurt
Spinrad, Jeremy P.
2006Attachment IconCertifying Algorithms for Recognizing Interval Graphs and Permutation Graphs
In: Siam Journal on Computing, 326-353
In: SIAM Journal on Computing [36], 326-353
Journal Article
mehlhorn06eKrandick, Werner
Mehlhorn, Kurt
2006Attachment IconNew bounds for the Descartes method
In: Journal of Symbolic Computation [41], 49-66
Journal Article
mehlhorn06xMehlhorn, Kurt2006Reliable and Efficient Geometric Computing
In: Algorithms and Complexity : 6th Italian Conference, CIAC 2006, 1-2
Proceedings Article
mehlhorn06yAbraham, David J.
Cechlárová, Katarína
Manlove, David
Mehlhorn, Kurt
2005Pareto Optimality in House Allocation Problems
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 1163-1175
Proceedings Article
mehlhorn06zAronov, Boris
Asano, Tetsuo
Katoh, Naoki
Mehlhorn, Kurt
Tokuyama, Takeshi
2006Polyline Fitting of Planar Points under Min-sum Criteria
In: International Journal of Computational Geometry and Applications [16], 97-116
Journal Article
Mehlhorn2007bMehlhorn, Kurt
Michail, Dimitrios
2007Attachment IconImplementing Minimum Cycle Basis Algorithms
In: Journal of Experimental Algorithmics [11], 1-14
Electronic Journal Article
MehlhornMFCS07Mehlhorn, Kurt2007Attachment IconMinimum Cycle Bases in Graphs Algorithms and Applications
In: Mathematical Foundations of Computer Science 2007 : 32nd International Symposium, MFCS 2007, 13-14
Proceedings Article
MeyerWetzel2006Meyer, Ulrike
Wetzel, Susanne
2006Introducing History-Enriched Security Context Transfer to Enhance the Security of Subsequent Handover
In: 4th IEEE Conference on Pervasive Computing and Communications Workshops (PerCom 2006 Workshops), 277-282
Proceedings Article
MeyZeh06Meyer, Ulrich
Zeh, Norbert
2006I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths
In: Algorithms - ESA 2006, 14th Annual European Symposium, 540-551
Proceedings Article
Michail2006Michail, Dimitrios2006Attachment IconMinimum Cycle Basis, Algorithms & Applications
Universität des Saarlandes
Thesis - PhD thesis
MM05Mehlhorn, Kurt
Michail, Dimitrios
2005Attachment IconImplementing Minimum Cycle Basis Algorithms
In: Experimental and Efficient Algorithms, 4th InternationalWorkshop, WEA 2005, 32-43
Proceedings Article
MM05aMehlhorn, Kurt
Michail, Dimitrios
2005Attachment IconNetwork Problems with Non-Polynomial Weights and ApplicationsUnpublished/Draft
MM06Mehlhorn, Kurt
Michail, Dimitrios
2006Attachment IconImplementing Minimum Cycle Basis Algorithms
In: ACM Journal of Experimental Algorithmics [11], 1-14
Electronic Journal Article
MortensenPettie2005Mortensen, Christian Worm
Pettie, Seth
2005The complexity of implicit and space-efficient priority queues
In: Algorithms and data structures : 9th International Workshop, WADS 2005, 49-60
Proceedings Article
MOS06Mehlhorn, Kurt
Osbild, Ralf
Sagraloff, Michael
2006Attachment IconReliable and Efficient Computational Geometry Via Controlled Perturbation
In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Part I, 299-310
Proceedings Article
MultVC07Friedrich, Tobias
He, Jun
Hebbinghaus, Nils
Neumann, Frank
Witt, Carsten
2007Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models
In: Genetic and Evolutionary Computation Conference 2007, 797-804
Proceedings Article
NaRa07Mustafa, Nabil H.
Ray, Saurabh
2007Attachment IconAn Optimal Generalization of the Centerpoint Theorem, and its Extensions
In: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07), 138-141
Proceedings Article
NaRa07bRay, Saurabh
Mustafa, Nabil H.
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
Proceedings Article
Naujoks2006Althaus, Ernst
Naujoks, Rouven
2006Attachment IconComputing Steiner Minimal Trees in Hamming Metric
In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06, 172-181
Proceedings Article
NeuWegMST2007Neumann, Frank
Wegener, Ingo
2007Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem
In: Theoretical Computer Science [378], 32-40
Journal Article
NeuWittMST2006Neumann, Frank
Witt, Carsten
2006Ant Colony Optimization and the Minimum Spanning Tree ProblemReport
NewoDipl05Newo Kenmogne, Regis2005Understanding LSI Via The Truncated Term-Term Matrix
Universität des Saarlandes
Thesis - Masters thesis
NSWSLS2007Neumann, Frank
Sudholt, Dirk
Witt, Carsten
2007Attachment IconComparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions
In: Engineering Stochastic Local Search Algorithms 2007, 61-75
Proceedings Article
nt-hemmer-2007Hemmer, Michael
Hert, Susan
Kettner, Lutz
Pion, Sylvain
Schirra, Stefan
2007Number Types, CGAL - Computational Geometry Algorithms Library, release 3.3Manual
OTO_ISAAC_2007Ajwani, Deepak
Friedrich, Tobias
2007Average-Case Analysis of Online Topological Ordering
In: Algorithms and Computation : 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007. Proceedings, 464-475
Proceedings Article
Paluch2006Paluch, Katarzyna2006Attachment IconA New Approximation Algorithm for Multidimensional Rectangle Tiling
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 712-721
Proceedings Article
patent2005Xu, Chihao
Wahl, Jürgen
Eeisenbrand, Friedrich
Karrenbauer, Andreas
Soh, Kian Min
Hitzelberger, Christoph
2005Verfahren zur Ansteuerung von MatrixanzeigenMiscellaneous
Pettie-sensitivity2005Pettie, Seth2005Sensitivity Analysis of Minimum Spanning Trees in Sub-Inverse-Ackermann Time
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 964-973
Proceedings Article
Pettie2005Pettie, Seth2005Towards a final analysis of pairing heaps
In: 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 174-183
Proceedings Article
PettieSanders2005Pettie, Seth
Sanders, Peter
2005Computing Approximate Matchings in External Memory, Streaming, Parallel, and Distributed Network ModelsUnpublished/Draft
Pyrga2007Pyrga, Evangelia
Schulz, Frank
Wagner, Dorothea
Zaroliagis, Christos
2007Efficient models for timetable information in public transportation systems
In: ACM Journal of Experimental Algorithmics [12], 1-39
Journal Article
PyrgaDipl05Pyrga, Evangelia2005Shortest Paths in Time-Dependent Networks and their Applications
Universität des Saarlandes
Thesis - Masters thesis
RandCol2006Doerr, Benjamin2006Attachment IconNon-independent randomized rounding and coloring
In: Discrete Applied Mathematics [154], 650-659
Journal Article
RaufDiss04Rauf, Imran2005Attachment IconEarliest Arrival Flows with Multiple Sources
Universität des Saarlandes
Thesis - Masters thesis
Reichel2005Eisenbrand, Friedrich
Funke, Stefan
Karrenbauer, Andreas
Reichel, Joachim
Schömer, Elmar
2005Packing a Trunk - now with a Twist!
In: Proceedings SPM 2005 ACM Symposium on Solid and Physical Modeling, 197-206
Proceedings Article
RoundSmSub2006Doerr, Benjamin2006Attachment IconMatrix Rounding With Respect to Small Submatrices
In: Random Structures & Algorithms [28], 107-112
Journal Article
Same2005Beldiceanu, Nicolas
Katriel, Irit
Thiel, Sven
2007Filtering Algorithms for the Same and UsedBy Constraints
In: Archives of Control Sciences [to appear], to appear
Journal Article
Sanders2005Hutchinson, David A.
Sanders, Peter
Vitter, Jeffrey Scott
2005Duality Between Prefetching and Queued Writing with Parallel Disks
In: SIAM Journal on Computing [34], 1443-1463
Journal Article
Sanders2005bFotakis, Dimitris
Pagh, Rasmus
Sanders, Peter
Spirakis, Paul G.
2005Space Efficient Hash Tables With Worst Case Constant Access Time
In: Theory of Computing Systems [38], 229-248
Journal Article
SanSte2005Sanders, Peter
Steurer, David
2005An Asymptotic Approximation Scheme for Multigraph Edge Coloring
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 897-906
Proceedings Article
Schmitt2005Schmitt, Susanne2005Attachment IconThe diamond operator - Implementation of exact real algebraic numbers
In: Computer Algebra in Scientific Computing, 8th International Workshop, CASC 2005, 355-366
Proceedings Article
SchultesDipl05Schultes, Dominik2005Fast and Exact Shortest Path Queries Using Highway Hierachies
Universität des Saarlandes
Thesis - Masters thesis
selection07Friedrich, Tobias
Hebbinghaus, Nils
Neumann, Frank
2007Rigorous Analyses of Simple Diversity Mechanisms
In: Genetic and Evolutionary Computation Conference 2007, 1219-1225
Proceedings Article
SemKielDoerr, Benjamin
Gnewuch, Michael
2006Construction of low-discrepancy point sets of small size by bracketing covers and dependent randomized roundingReport
setcover07Friedrich, Tobias
Hebbinghaus, Nils
Neumann, Frank
2007Plateaus Can Be Harder in Multi-Objective Optimization
In: IEEE Congress on Evolutionary Computation 2007, 2622-2629
Proceedings Article
Sitters2005Sitters, Rene2005Complexity of preemptive minsum scheduling on unrelated parallel machines
In: Journal of Algorithms [57], 37-48
Journal Article
Sitters2005bElbassioni, Khaled M.
Fishkin, Aleksei V.
Mustafa, Nabil H.
Sitters, Rene
2005Approximation algorithms for Euclidean Group TSP
In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, 1115-1126
Proceedings Article
Sitters2006Bodlaender, Hans L.
Feremans, Corinne
Grigoriev, Alexander
Penninkx, Eelko
Sitters, Rene
Wolle, Thomas
2006On the minimum corridor connection and other generalized geometric problems
In: 4th Workshop on Approximation and Online Algorithms, WAOA, 69-82
Proceedings Article
Sitters2006aFeremans, Corinne
Grigoriev, Alexander
Sitters, Rene
2006The geometric generalized minimum spanning tree problem with grid clustering
In: 4OR: A Quarterly Journal of Operations Research [4], 319-329
Journal Article
Sitters2006bSitters, Rene
Stougie, Leen
2006The general two-server problem
In: Journal of the ACM [53], 437-458
Journal Article
Sitters2006cGrigoriev, Alexander
van Loon, Joyce
Sitters, Rene
Uetz, Marc
2006How to Sell a Graph: Guidelines for Graph Retailers
In: Graph-Theoretic Concepts in Computer Science : 32nd International Workshop, WG 2006, 125-136
Proceedings Article
Sitters2006dBartal, Yair
Leonardi, Stefano
Shallom, Gill
Sitters, Rene
2006On the value of preemption in scheduling
In: 9th Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX, 39-48
Proceedings Article
SODATO2004Katriel, Irit
Bodlaender, Hans L.
2005Online Topological Ordering
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 443-450
Proceedings Article
stacs07_randDoerr, Benjamin2007Attachment IconRandomly Rounding Rationals with Cardinality Constraints and Derandomizations
In: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, 441-452
Proceedings Article
sw-ectrac-05Seidel, Raimund
Wolpert, Nicola
2005On the Exact Computation of the Topology of Real Algebraic Curves
In: Proceedings of the 21st ACM Symposium on Computational Geometry, 107-115
Proceedings Article
sw-eeaccaq-05Schömer, Elmar
Wolpert, Nicola
2006An Exact and Efficient Approach for Computing a Cell in an Arrangement of Quadrics
In: Computational Geometry [33], 65 - 97
Journal Article
SymHyp2006Doerr, Benjamin
Gnewuch, Michael
Hebbinghaus, Nils
2006Attachment IconDiscrepancy of Symmetric Products of Hypergraphs
In: The Electronic Journal of Combinatorics [13], 1-12
Electronic Journal Article
TechReportGDF2006Bast, Holger
Majumdar, Debapriyo
Schenkel, Ralf
Theobald, Martin
Weikum, Gerhard
2006Attachment IconIO-Top-k: Index-Access Optimized Top-k Query ProcessingReport
unbiasmatr2006Doerr, Benjamin
Klein, Christian
2006Attachment IconUnbiased Rounding of Rational Matrices
In: FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science: 26th International Conference, 200-211
Proceedings Article
WadsCentroid07Ajwani, Deepak
Ray, Saurabh
Seidel, Raimund
Tiwary, Hans Raj
2007On Computing the Centroid of the Vertices of an Arrangement and Related Problems
In: 10th Workshop on Algorithms and Data Structures (WADS), 519-528
Proceedings Article
weberetal05airwebBifet, Albert
Castillo, Carlos
Chirita, Paul-Elexandru
Weber, Ingmar
2005An Analysis of Factors Used in Search Engine Ranking
In: 1st International Workshop on Adversarial Information Retrieval on the Web (AIRWeb'05), 1-10
Electronic Proceedings Article
WeberPhDWeber, Ingmar2007Attachment IconEfficient Index Structures for and Applications of the CompleteSearch Engine
Universität des Saarlandes
Thesis - PhD thesis
WeikumBCHST05Weikum, Gerhard
Bast, Holger
Canright, Geoffrey
Hales, David
Schindelhauer, Christian
Triantafillou, Peter
2007Towards Peer-to-Peer Web Search
In: 1st European Conference on Complex Systems, ECCS'05, ?
Proceedings Article
WeikumBCHST05bWeikum, Gerhard
Bast, Holger
Canright, Geoffrey
Hales, David
Schindelhauer, Christian
Triantafillou, Peter
2005Towards Self-Organizing Query Routing and Processing for Peer-to-Peer Web Search
In: Workshop on Peer-to-peer Data Management in the Complex Systems Perspective, 7-24
Proceedings Article
WeinandDipl05Weinand, Caroline2005Fill-in Reduction while Solving large, sparse Linear Systems with Graph Theoretical Methods
Universität des Saarlandes
Thesis - Masters thesis
XKSW2007Xu, Chihao
Karrenbauer, Andreas
Soh, Kian Min
Wahl, Jürgen
2007A New Addressing Scheme for PM OLED Display
In: SID 2007 International Symposium Digest of Technical Papers, 97-100
Proceedings Article

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