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: 5. Year - 6. Kuratoriumsbericht - 2. Year 2003-2004

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
ACMM04Abraham, David
Cechlárová, Katarina
Manlove, David F.
Mehlhorn, Kurt
2004Attachment IconPareto-optimality in house allocation problems
In: Algorithms and Computation: 15th International Symposium, ISAAC 2004, 3-15
Proceedings Article
ADKMNT03:dominanceAlthaus, Ernst
Duchier, Denys
Koller, Alexander
Mehlhorn, Kurt
Niehren, Joachim
Thiel, Sven
2003Attachment IconAn Efficient Algorithm for the Configuration Problem of Dominance Graphs
In: Journal of Algorithms [48], 194-219
Journal Article
AEFM2004Althaus, Ernst
Eisenbrand, Friedrich
Funke, Stefan
Mehlhorn, Kurt
2004Attachment IconPoint Containment in the Integer Hull of a Polyhedron
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 929-933
Proceedings Article
Agarwal03Agarwal, Amit
Agarwal, Tarun
Chopra, Sumit
Feldmann, Anja
Kammenhuber, Nils
Krysta, Piotr
Vöcking, Berthold
2003An experimental study of k-splittable scheduling for DNS-based traffic allocation
In: Euro-Par 2003 parallel processing : 9th International Euro-Par Conference ; proceedings, 230-235
Proceedings Article
AlPoVa2003-lpimproveAlthaus, Ernst
Polzin, Tobias
Vahdati Daneshmand, Siavash
2003Improving Linear Programming Approaches for the Steiner Tree Problem
In: Experimental and efficient algorithms : Second International Workshop, WEA 2003, 1-14
Proceedings Article
Althaus2003Althaus, Ernst
Calinescu, Gruia
Mandoiu, Ion
Prasad, Sushil
Tchervenski, Nickolay
Zelikovsly, Alexander
2003Power Efficient Range Assignment in Ad-hoc Wireless
In: Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC-03), 1889-1894
Proceedings Article
Althaus2004Althaus, Ernst
Karamanis, Nikiforos
Koller, Alexander
2004Computing Locally Coherent Discourses.
In: Proceedings of the conference and workshops, 42nd annual meeting of the Association for Computational Linguistics, 399-406
Proceedings Article
AMTZ03Arge, Lars
Meyer, Ulrich
Toma, Laura
Zeh, Norbert
2003On external-memory planar depth first search
In: Journal of Graph Algorithms and Applications [7], 105-129
Journal Article
ArMeTo04Arge, Lars
Meyer, Ulrich
Toma, Laura
2004External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs
In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, 146-157
Proceedings Article
bast04selfstarBast, Holger2004Dimension Reduction: A Powerful Principle for Automatically Finding Concepts in Unstructured Data
In: International Workshop on Self-* Properties in Complex Information Systems (SELF-STAR 2004), 113-116
Proceedings Article
bast04stacsBast, Holger
Mehlhorn, Kurt
Schäfer, Guido
Tamaki, Hisao
2004Attachment IconMatching Algorithms Are Fast in Sparse Random Graphs
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 81-92
Proceedings Article
Baswana2004bBaswana, Surender
Sen, Sandeep
2004Randomized graph data-structures for approximate shortest path problem
In: Handbook of Data Structures and Applications, 38.1-38.19
Part of a Book
Baumann2004Baumann, Nadine
Köhler, Ekkehard
2004Approximating Earliest Arrival Flows with Flow-Dependent Transit Times
In: Mathematical foundations of computer science 2004 : 29th International Symposium, MFCS 2004, 599-610
Proceedings Article
Baus/Diplom04Baus, Andreas2004Symbolic Constraints in Linear Integer Programming
Universität des Saarlandes
Thesis - Masters thesis
BCT03:SweepSynchroBeldiceanu, Nicolas
Carlsson, Mats
Thiel, Sven
2003Sweep Synchronization as a Global Propagation Mechanism
In: Fifth International Workshop on Integration of AI and OR Techniques
in Constraint Programming for Combinatorial Optimization Problems, 139-152
Electronic Proceedings Article
Becchetti2003Becchetti, Luca
Leonardi, Stefano
Marchetti-Spaccamela, Alberto
Schäfer, Guido
2003Scheduling to minimize flow time metrics
In: International Parallel and Distributed Processing Symposium (IPDPS-03), 223b-CDROM
Proceedings Article
beef-ecscaca-04Berberich, Eric
Eigenwillig, Arno
Emiris, Ioannis
Fogel, Efraim
Hemmer, Michael
Halperin, Dan
Kakargias, Athanasios
Kettner, Lutz
Mehlhorn, Kurt
Pion, Sylvain
Schömer, Elmar
Teillaud, Monique
Wein, Ron
Wolpert, Nicola
2004Attachment IconAn Empirical Comparison of Software for Constructing Arrangements of Curved ArcsReport
Beier2003Beier, Rene
Vöcking, Berthold
2003Random Knapsack in Expected Polynomial Time
In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC-03), 232-241
Proceedings Article
Beier2003aBanderier, Cyril
Beier, Rene
Mehlhorn, Kurt
2003Attachment IconSmoothed Analysis of Three Combinatorial Problems
In: Mathematical foundations of computer science 2003 : 28th International Symposium, MFCS 2003, 198-207
Proceedings Article
Beier2004aBeier, Rene
Vöcking, Berthold
2004Probabilistic Analysis of Knapsack Core Algorithms
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 461-470
Proceedings Article
Beier2004bBeier, Rene
Krysta, Piotr
Czumaj, Artur
Vöcking, Berthold
2004Computing Equilibria for Congestion Games with (Im)perfect Information
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 739-748
Proceedings Article
Beier2004cBeier, Rene
Vöcking, Berthold
2004Typical Properties of Winners and Losers in Discrete Optimization
In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC-04), 343-352
Proceedings Article
Beier2004eBeier, René
Vöcking, Berthold
2004Random knapsack in expected polynomial time
In: Journal of Computer and System Sciences [69], 306-329
Journal Article
BeierDiss04Beier, Rene2004Probabilistic Analysis of Discrete Optimization Problems
Universität des Saarlandes
Thesis - PhD thesis
BeldiceanuKatrielThiel2004Beldiceanu, Nicolas
Katriel, Irit
Thiel, Sven
2004Attachment IconFiltering algorithms for the Same and UsedBy constraintsReport
Berman2003+Berman, Piotr
Krysta, Piotr
2003Optimizing Misdirection
In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 192-201
Proceedings Article
BFFMSS04Funke, Stefan
Mehlhorn, Kurt
Schmitt, Susanne
Burnikel, Christoph
Fleischer, Rudolf
Schirra, Stefan
2004The LEDA class real number -- extended versionReport
BFMZ04Brodal, Gerth Stølting
Fagerberg, Rolf
Meyer, Ulrich
Zeh, Norbert
2004Cache-oblivious data structures and algorithms for undirected breadth-first search and shortest paths
In: Algorithm theory, SWAT 2004 : 9th Scandinavian Workshop on Algorithm Theory ; Humlebæk, Denmark, July 8-10, 2004 ; proceedings, 480-492
Proceedings Article
BMST03Bast, Holger
Mehlhorn, Kurt
Schäfer, Guido
Tamaki, Hisao
2003Attachment IconA Heuristic for Dijkstra's Algorithm With Many Targets and its Use in Weighted Matching Algorithms
In: Algorithmica [36], 75-88
Journal Article
BramerDipl03Bramer, Andreas2003Zwei Algorithmen zur Bestimmung kostenminimaler Flüsse in Netzwerken
Universität des Saarlandes
Thesis - Masters thesis
BS2004Baswana, Surender
Sen, Sandeep
2004Attachment IconApproximate distance oracle for unweighted graphs in Expected O(n²) time
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 271-280
Proceedings Article
Burkhardt2003Burkhardt, Stefan
Kärkkäinen, Juha
2003Attachment IconFast Lightweight Suffix Array Construction and Checking
In: Combinatorial Pattern Matching: 14th Annual Symposium, CPM 2003, 55-69
Proceedings Article
BurkhardtKarkkainen2003Burkhardt, Stefan
Kärkkäinen, Juha
2003Better Filtering with Gapped q-Grams
In: Fundamenta Informaticae [56], 51-70
Journal Article
CFGKPR2003Cheng, Siu-Wing
Funke, Stefan
Golin, Mordecai J.
Kumar, Piyush
Poon, Sheung-Hung
Ramos, Edgar A.
2003Curve Reconstruction from Noisy Samples
In: Proceedings of the 19th Annual Symposium on Computational Geometry (SCG-03), 420-429
Proceedings Article
ChandranSivadasan2004Chandran, L. Sunil
Sivadasan, Naveen
2004Attachment IconOn the Hadwiger's Conjecture for Graph ProductsReport
CK-PODCChlebus, Bogdan S.
Kowalski, Dariusz
2004A better wake-up in radio networks
In: Proceedings of the 23rd Annual ACM Symposium on Principles of Distributed Computing, PODC 2004, 266-274
Proceedings Article
Csaba2003aCsaba, Bela2003Proof of a conjecture of Bollobas and Eldridge for graphs of maximum degree three
In: Combinatorica [23], 35-72
Journal Article
Dementiev2004SearchTreeDementiev, Roman
Kettner, Lutz
Mehnert, Jens
Sanders, Peter
2004Engineering a Sorted List Data Structure for 32 Bit Key
In: Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics (ALENEX-04), 142-151
Proceedings Article
DemSan03Dementiev, Roman
Sanders, Peter
2003Asynchronous Parallel Disk Sorting
In: Proceedings of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA-03), 138-148
Proceedings Article
Denny03Denny, Markus2003Solving geometric optimization problems using graphics hardware
In: EUROGRAPHICS 2003 : the European Association for Computer Graphics 24th Annual Conference, 441-451
Proceedings Article
dfkmsssw2003Dhiflaoui, Marcel
Funke, Stefan
Kwappik, Carsten
Mehlhorn, Kurt
Seel, Michael
Schömer, Elmar
Schulte, Ralph
Weber, Dennis
2003Attachment IconCertifying and Repairing Solutions to Large LPs - How Good are LP-Solvers?
In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 255-256
Proceedings Article
Dipl03/DingDing, Wei2003Geometric Rounding without changing the Topology
Universität des Saarlandes
Thesis - Masters thesis
Dipl03/EigenwilligEigenwillig, Arno2003Attachment IconExact Arrangement Computation for Cubic Curves
Universität des Saarlandes
Thesis - Masters thesis
Dipl03/FontaineFontaine, Marc2003Computing the Filtration Efficiency of Shape-Index-Filters for Approximate String Matching
Universität des Saarlandes
Thesis - Masters thesis
Dipl04/BerberichBerberich, Eric2004Exact Arrangements of Quadric Intersection Curves
Universität des Saarlandes
Thesis - Masters thesis
DSSS04Dementiev, Roman
Sanders, Peter
Schultes, Dominik
Sibeyn, Jop F.
2004Attachment IconEngineering an External Memory Minimum Spanning Tree Algorithm
In: 3rd IFIP International Conference on Theoretical Computer Science (TSC2004), 195-208
Proceedings Article
ecg:beh-eeeac-04Berberich, Eric
Eigenwillig, Arno
Hemmer, Michael
Hert, Susan
Kettner, Lutz
Mehlhorn, Kurt
Reichel, Joachim
Schmitt, Susanne
Schömer, Elmar
Weber, Dennis
Wolpert, Nicola
2004EXACUS: Efficient and Exact Algorithms for Curves and SurfacesReport
ecg:fhw-stcca-03Berberich, Eric
Eigenwillig, Arno
Fogel, Efi
Halperin, Dan
Hert, Susan
Kettner, Lutz
Teillaud, Monique
Wein, Ron
2003Specification of the traits classes for CGAL arrangements of curvesReport
ecg:ghh-boscd-03Granados, Miguel
Hachenberger, Peter
Hert, Susan
Kettner, Lutz
Mehlhorn, Kurt
Seel, Michael
2003Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and ImplementationReport
ecg:hks-emfga-04Hemmer, Michael
Kettner, Lutz
Schömer, Elmar
2004Effects of a Modular Filter on Geometric ApplicationsReport
ecg:kmp-cerpg-03Kettner, Lutz
Mehlhorn, Kurt
Pion, Sylvain
Schirra, Stefan
Yap, Chee
2004Classroom Examples of Robustness Problems in Geometric ComputationsReport
efgk2003Eisenbrand, Friedrich
Funke, Stefan
Garg, Naveen
Könemann, Jochen
2003A Combinatorial Algorithm for Computing a Maximum Independent Set in a t-perfect Graph
In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 517-522
Proceedings Article
Eigenwillig2004aEigenwillig, Arno
Kettner, Lutz
Schömer, Elmar
Wolpert, Nicola
2004Complete, Exact and Efficient Computations with Cubic Curves
In: Proceedings of the Twentieth Annual Symposium on Computational Geometry : (SCG'04), 409-418
Proceedings Article
Elbassioni2003aBoros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir
2003Attachment IconAn Inequality for Polymatroid Functions and its Applications
In: Discrete Applied mathematics [131], 27
Journal Article
Elbassioni2003bBoros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir
2003Attachment IconExtending the Balas-Yu Bounds on the Number of Maximal Independent Sets in Graphs to Hypergraphs and Lattices
In: Mathematical Programming, Ser. B [98], 14
Journal Article
Elbassioni2003cBoros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
Khachiyan, Leonid
2003Attachment IconAlgorithms for Enumerating Circuits in Matroids.
In: Algorithms and Computation, 14th International Symposium, ISAAC 2003, 485-494
Proceedings Article
Elbassioni2003dBoros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
Khachiyan, Leonid
Makino, Kazuhisa
2003Attachment IconAn Intersection Inequality for Discrete Distributions and Related Generation Problems
In: Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, 543-555
Proceedings Article
Elbassioni2003dzElbassioni, Khaled M.
Elmasry, Amr
Kamel, Ibrahim
2003Attachment IconAn Efficient Indexing Scheme for Multi-dimensional Moving Objects
In: Database Theory - ICDT 2003, 9th International Conference, 425-439
Proceedings Article
Elbassioni2003eBoros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir
2003Attachment IconAn Efficient Implementation of a Quasi-polynomial Algorithm for Generating Hypergraph Transversals
In: Algorithms - ESA 2003, 11th Annual European Symposium, 556-567
Proceedings Article
Elbassioni2004aBoros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
Khachiyan, Leonid
2004Attachment IconAn Efficient Implementation of a Joint Generation Algorithm
In: Experimental and efficient algorithms : Third International Workshop, WEA 2004, 114-128
Proceedings Article
Elbassioni2004bBoros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
Khachiyan, Leonid
Makino, Kazuhisa
2004Attachment IconGenerating Paths and Cuts in Multi-pole (Di)graphs
In: Mathematical foundations of computer science 2004 : 29th International Symposium, MFCS 2004, 298-309
Proceedings Article
Elbassioni2004dBoros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
Khachiyan, Leonid
2004Attachment IconGenerating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections
In: LATIN 2004: Theoretical Informatics, 6th Latin American Symposium, 488-498
Proceedings Article
Elbassioni2004eBoros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
Khachiyan, Leonid
2004Attachment IconEnumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems
In: Integer programming and combinatorial optimization : 10th International IPCO Conference, 152-162
Proceedings Article
Elbassioni2004fMokbel, Mohamed F.
Aref, Walid G.
Elbassioni, Khaled M.
Kamel, Ibrahim
2004Attachment IconScalable Multimedia Disk Scheduling
In: 20th International Conference on Data Engineering, ICDE 2004, 498-509
Proceedings Article
Elbassioni2004gBoros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
2004Attachment IconAlgorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems
In: Algorithms – ESA 2004: 12th Annual European Symposium, 122-133
Proceedings Article
Elbassioni2012dElbassioni, Khaled
Rauf, Imran
Ray, Saurabh
??On Enumerating Minimal Transversals of Geometric HypergraphsUnpublished/Draft
ElKahoui2003El Kahoui, M'hammed2003Attachment IconAn elementary approach to subresultants theory
In: Journal of Symbolic Computation [35], 281-292
Journal Article
ElKahoui2004aEl Kahoui, M'hammed2004Attachment IconContants of derivations in polynomial rings over unique factorization domains
In: Proceedings of the Amercian Mathematical Society [132], 2537-2541
Journal Article
ElKahoui2004bEl Kahoui, M'hammed2004Attachment IconSubresultants and locally nilpotent derivations
In: Linear Algebra and its Applications [380], 253-261
Journal Article
ElKahoui2004cEl Kahoui, M'hammed2004Attachment IconAlgorithms for recognizing coordinates in two variables over UFD's
In: Proceedings of the 2004 International Symposium Symbolic and Algebraic Computation (ISSAC-04), 135-140
Proceedings Article
FKLS2004Funke, Stefan
Kesselman, Alexander
Lotker, Zvi
Segal, Michael
2004Improved Approximation Algorithms for Connected Sensor Cover
In: Ad-hoc, mobil and wireless networks : Third International Conference, ADHOC-NOW 2004, 56-69
Proceedings Article
FleischerSkutella2003Fleischer, Lisa
Skutella, Martin
2003Attachment IconMinimum Cost Flows Over Time without Intermediate Storage
In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 66-75
Proceedings Article
FMR2004Funke, Stefan
Malamatos, Theocharis
Ray, Rahul
2004Finding Planar Regions in a Terrain: In Practice and with a Guarantee
In: Proceedings of the Twentieth Annual Symposium on Computational Geometry : (SCG'04), 96-105
Proceedings Article
FMR2004bFunke, Stefan
Malamatos, Theocharis
Ray, Rahul
2004Finding Planar Regions in a Terrain
In: 20th European Workshop on Computational Geometry (EWCG), 1-4
Proceedings Article
FMS2003Funke, Stefan
Matijevic, Domagoj
Sanders, Peter
2003Attachment IconApproximating Energy Efficient Paths in Wireless Multi-hop Networks
In: Algorithms - ESA 2003: 11th Annual European Symposium, 230-241
Proceedings Article
FMS2004Funke, Stefan
Matijevic, Domagoj
Sanders, Peter
2004Attachment IconConstant Time Queries for Energy Efficient Paths in Multi-Hop Wireless Networks
In: First International Workshop on Algorithms for Wireless and Mobile Networks, 97-111
Proceedings Article
Fot03Fotakis, Dimitris2003Attachment IconOn the Competitive Ratio for Online Facility Location
In: Automata, languages and programming : 30th International Colloquium, ICALP 2003, 637-652
Proceedings Article
Fotakis2004aFotakis, Dimitris2004Attachment IconIncremental Algorithms for Facility Location and k-Median
In: Algorithms – ESA 2004: 12th Annual European Symposium, 347-358
Proceedings Article
FPSS03Fotakis, Dimitris
Pagh, Rasmus
Sanders, Peter
Spirakis, Paul G.
2003Attachment IconSpace Efficient Hash Tables with Worst Case Constant Access Time
In: Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2003), 271-282
Proceedings Article
ghhkms-bo3ds-03Granados, Miguel
Hachenberger, Peter
Hert, Susan
Kettner, Lutz
Mehlhorn, Kurt
Seel, Michael
2003Attachment IconBoolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation
In: Algorithms - ESA 2003: 11th Annual European Symposium, 654-666
Proceedings Article
GKS-DISC2003Georgiou, Chryssis
Kowalski, Dariusz
Shvartsman, Alexander
2003Efficient Gossip and Robust Distributed Computation
In: Distributed Computing, 17th International Conference (DISC 2003), 224-238
Proceedings Article
GoemansSkutella2004Goemans, Michel X.
Skutella, Martin
2004Attachment IconCooperative facility location games
In: Journal of Algorithms [50], 194-214
Journal Article
Hagedoorn2003:nncbfeHagedoorn, Michiel2003Nearest Neighbors Can Be Found Efficiently If the Dimension Is Small Relative to the Input Size
In: Database Theory - ICDT 2003 : 9th International Conference, 440-454
Proceedings Article
HallHipplerSkutella2003Hall, Alex
Hippler, Steffen
Skutella, Martin
2003Attachment IconMulticommodity Flows Over Time: Efficient Algorithms and Complexity
In: Automata, languages and programming : 30th International Colloquium, ICALP 2003, 397-409
Proceedings Article
HallLangkauSkutella2003Hall, Alex
Langkau, Katharina
Skutella, Martin
2003An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, 71-82
Proceedings Article
HMT04:round-robinHenz, Martin
Müller, Tobias
Thiel, Sven
2004Global constraints for round robin tournament scheduling
In: European Journal of Operational Research [153], 92-101
Journal Article
Hoefer03Hoefer, Martin2003Experimental comparison of heuristic and approximation algorithms for uncapacitated facility location
In: 2nd International Workshop on Experimental and Efficient Algorithms (WEA-03), 165-178
Proceedings Article
HoogeveenSkutellaWoeginger2003Hoogeveen, Han
Skutella, Martin
Woeginger, Gerhard J.
2003Attachment IconPreemptive scheduling with rejection
In: Mathematical Programming [94], 361-374
Journal Article
Kaligosi/Master03Kaligosi, Kanela2003Length bounded network flows
Universität des Saarlandes
Thesis - Masters thesis
Karkkainen2003aKärkkäinen, Juha
Rao, S. Srinivasa
2003Full-Text Indexes in External Memory
In: Algorithms for Memory Hierarchies, 149-170
Part of a Book
KarkkainenSanders2003Kärkkäinen, Juha
Sanders, Peter
2003Simple Linear Work Suffix Array Construction
In: Automata, languages and programming : 30th International Colloquium, ICALP 2003, 943-955
Proceedings Article
Karrenbauer2004Karrenbauer, Andreas2004Packing Boxes with Arbitrary Rotations
Universität des Saarlandes
Thesis - other
KatMey03Katriel, Irit
Meyer, Ulrich
2003Elementary Graph Algorithms in External Memory
In: Algorithms for Memory Hierarchies, 62-84
Part of a Book
Katriel2004Katriel, Irit2004Attachment IconOn Algorithms for Online Topological Ordering and SortingReport
Katriel2004aKatriel, Irit2004Dynamic Heaviest Paths in DAGs with Arbitrary Edge Weights
In: Integration of AI and OR techniques in constraint programming for combinatorial optimization problems : First International Conference, CPAIOR 2004, 190-199
Proceedings Article
Katriel2004bKatriel, Irit2004On the Algebraic Complexity of Set Equality and Inclusion
In: Information Processing Letters [92], 175-178
Journal Article
KatrielThesis2004Katriel, Irit2004Constraints and Changes
Universität des Saarlandes
Thesis - PhD thesis
KatSanTra03Katriel, Irit
Sanders, Peter
Träff, Jesper Larsson
2003A Practical Minimum Spanning Tree Algorithm Using the Cycle Property
In: Algorithms - ESA 2003: 11th Annual European Symposium, 679-690
Proceedings Article
Kesselmann2004bKesselman, Alexander
Guez, Dan
Rosen, Adi
2004Packet-Mode Policies for Input-Queued Switches
In: Sixteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-04), 93-102
Proceedings Article
Kesselmann2004cKesselman, Alexander
Lotker, Zvi
Mansour, Yishay
Patt-Shamir, Boaz
Schieber, Baruch
Sviridenko, Maxim
2004Buffer Overflow Management in QoS Switches
In: SIAM Journal on Computing [33], 563-583
Journal Article
Kesselmann2004dKesselman, Alexander
Mansour, Yishay
2004Harmonic Buffer Management for Shared-Memory Switches
In: Theoretical Computer Science [324], 161-182
Journal Article
Kettner2003DegreeBoundKettner, Lutz
Kirkpatrick, David
Mantler, Andrea
Snoeyink, Jack
Speckmann, Bettina
Takeuchi, Fumihiko
2003Tight Degree Bounds for Pseudo-triangulations of Points
In: Computational Geometry - Theory and Applications [25], 3-12
Journal Article
Kettner2003SafariKettner, Lutz
Rossignac, Jarek
Snoeyink, Jack
2003The Safari Interface for Visualizing Time-dependent Volume Data Using Iso-surfaces and Contour Spectra
In: Computational Geometry - Theory and Applications [25], 97-116
Journal Article
Kettner2004ClassroomKettner, Lutz
Mehlhorn, Kurt
Pion, Sylvain
Schirra, Stefan
Yap, Chee
2004Attachment IconClassroom Examples of Robustness Problems in Geometric Computations
In: ESA 2004: 12th Annual European Symposium on Algorithms, 702-713
Proceedings Article
Kettner2004HandbookKettner, Lutz
Näher, Stefan
2004Two Computational Geometry Libraries: LEDA and CGAL
In: Handbook of Discrete and Computational Geometry, 1435-1463
Part of a Book
KKS-DSNKonwar, Kishori
Kowalski, Dariusz
Shvartsman, Alexander
2004The Join problem in dynamic network algorithms
In: 2004 International Conference on Dependable Systems and Networks (DSN 2004), 315-324
Proceedings Article
Klauk/Diplom04Klauk, Mathias2004Ein Algorithmus zur Konstruktion des Voronoidiagramms von Kreisbögen
Universität des Saarlandes
Thesis - Masters thesis
Klein2004Klein, Christian2004Attachment IconControlled Perturbation for Voronoi Diagrams
Universität des Saarlandes
Thesis - Masters thesis
Klein2004bKlein, Christian2004Attachment IconA Fast Root Checking AlgorithmReport
KM03aKlau, Gunnar W.
Mutzel, Petra
2003Automatic Layout and Labelling of State Diagrams
In: Mathematics: Key Technology for the Future : Joint Projects Between Universities and Industry, 584-608
Part of a Book
KM03bMehlhorn, Kurt2003Attachment IconThe reliable algorithmic software challenge RASC : dedicated to Thomas Ottmann on the occassion of his 60th birthday
In: Computer Science in Perspective : essays dedicated to Thomas Ottmann, 255-263
Part of a Book
KMMP2004cKavitha, Telikepalli
Mehlhorn, Kurt
Michail, Dimitrios
Paluch, Katarzyna
2004Attachment IconA Faster Algorithm for Minimum Cycle Basis of Graphs
In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, 846-857
Proceedings Article
Kovacs2004Kovács, Annamária2004Sum-Multicoloring on Paths
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 68-80
Proceedings Article
Kowalski-LATIN-2004Fraigniaud, Pierre
Gasieniec, Leszek
Kowalski, Dariusz
Pelc, Andrzej
2004Collective Tree Exploration
In: LATIN 2004: Theoretical informatics, 6th Latin American Symposium, 141-151
Proceedings Article
Kowalski-SODA-2004Chrobak, Marek
Gasieniec, Leszek
Kowalski, Dariusz
2004The Wake-Up problem in multi-hop radio networks
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 985-993
Proceedings Article
Kowalski-SPAA-2004Kowalski, Dariusz
Shvartsman, Alex
2004Writing-All deterministically and optimally using a non-trivial number of asynchronous processors
In: Sixteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-04), 311-320
Proceedings Article
Kowalski-STOC-2004Chlebus, Bogdan S.
Kowalski, Dariusz
Shvartsman, Alex
2004Collective asynchronous reading with polylogarithmic worst-case overhead
In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC-04), 321-330
Proceedings Article
Kowalski2003aChlebus, Bogdan S.
Kowalski, Dariusz
2004Randomization helps to perform independent tasks reliably
In: Random Structures and Algorithms [24], 11-41
Journal Article
Kowalski2003bKowalski, Dariusz
Pelc, Andrzej
2004Time of deterministic broadcasting in radio networks with local knowledge
In: SIAM Journal on Computing [33], 870-891
Journal Article
KP-APPROXKowalski, Dariusz
Pelc, Andrzej
2004Centralized deterministic broadcasting in undirected multi-hop radio networks
In: Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques. 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004, and 8th International Workshop on Randomization and Computation, RANDOM 2004, 171-182
Proceedings Article
KP-ISAACKowalski, Dariusz
Pelc, Andrzej
2004Polynomial deterministic rendezvous in arbitrary graphs
In: Algorithms and Computation: 15th International Symposium, ISAAC 2004, 644-656
Proceedings Article
KP-SIROCCOKowalski, Dariusz
Pelc, Andrzej
2003Time of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism
In: Proceedings of the 10th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2003), 195-210
Proceedings Article
KrandickMehlhorn2004aKrandick, Werner
Mehlhorn, Kurt
2004New Bounds for the Descartes MethodReport
Kratsch-et-al:intervalKratsch, Dieter
McConnell, Ross
Mehlhorn, Kurt
Spinrad, Jeremy P.
2003Attachment IconCertifying Algorithms for Recognizing Interval Graphs and Permutation Graphs
In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 158-167
Proceedings Article
Krysta2003bKrysta, Piotr2003Approximating Minimum Size 1,2-Connected Networks
In: Discrete Applied Mathematics [125], 267-288
Journal Article
KSV03Krysta, Piotr
Sanders, Peter
Vöcking, Berthold
2003Scheduling and Traffic Allocation for Tasks with Bounded Splittability
In: Mathematical foundations of computer science 2003 : 28th International Symposium, MFCS 2003, 500-510
Proceedings Article
KT03:gccKatriel, Irit
Thiel, Sven
2003Fast Bound-Consistency for the Global Cardinality Constraint
In: Principles and Practice of Constraint Programming - CP 2003 : 9th International Conference, CP 2003, 437-451
Proceedings Article
KwekMehlhorn2003Kwek, St.
Mehlhorn, Kurt
2003Attachment IconOptimal Search for Rationals
In: Information Processing Letters [86], 23-26
Journal Article
Leonardi03Henzinger, Monika R.
Leonardi, Stefano
2003Scheduling multicasts on unit-capacity trees and meshes
In: Journal of Computer and System Sciences [66], 567-611
Journal Article
Leonardi04Leonardi, Stefano
Schäfer, Guido
2004Cross-monotonic cost sharing methods for connected facility location games
In: Theoretical Computer Science [326], 431-442
Journal Article
Leonardi04ECLeonardi, Stefano
Schäfer, Guido
2004Cross-monotonic cost sharing methods for connected facility location games
In: EC'04 : proceedings of the 5th ACM Conference on Electronic Commerce ; New York, New York, USA, May 17-20, 2004, 242-243
Proceedings Article
LLMMS2003Laura, Luigi
Leonardi, Stefano
Millozzi, Stefano
Meyer, Ulrich
Sibeyn, Jop F.
2003Algorithms and Experiments for the Webgraph
In: Algorithms - ESA 2003: 11th Annual European Symposium, 703-714
Proceedings Article
Martens2004Martens, Maren
Skutella, Martin
2004Flows on Few Paths: Algorithms and Lower Bounds
In: Algorithms – ESA 2004: 12th Annual European Symposium, 520-531
Proceedings Article
Master03/ParreiraParreira, Josiane2003Information Retrieval by Dimension Reduction - A Comparative Study
Universität des Saarlandes
Thesis - Masters thesis
mehlhornKonidaris, G.
Mehlhorn, Kurt
Shell, D.A.
2004Attachment IconAn optimal algorithm for finding edge segment adjacencies in configurations of convex polygonsUnpublished/Draft
mehlhorn03Mehlhorn, Kurt2003Attachment IconThe Reliable Algorithmic Software Challenge RASC
In: Experimental and efficient algorithms : Second International Workshop, WEA 2003, 222-222
Proceedings Article
Mehlhorn157Mehlhorn, Kurt
Seel, Michael
2003Attachment IconInfimaximal frames: A technique for making lines look like segments
In: International Journal of Computational Geometry & Applications [13], 241-255
Journal Article
Mehlhorn2004PolylineApproxAranov, Boris
Asano, Tetsuo
Katoh, Naoki
Mehlhorn, Kurt
Tokuyama, Takeshi
2004Attachment IconPolyline Fitting of Planar Points Under Min-sum Criteria
In: Algorithms and Computation: 15th International Symposium, ISAAC 2004, 77-88
Proceedings Article
Mehnert/Diploma04Mehnert, Jens2004External Memory Suffix Array Construction
Universität des Saarlandes
Thesis - Masters thesis
MehSan03jMehlhorn, Kurt
Sanders, Peter
2003Attachment IconScanning Multiple Sequences via Cache Memory
In: Algorithmica [35], 75-93
Journal Article
Meyer2003Meyer, Ulrich2003Average-case complexity of single-source shortest-path algorithms: lower and upper bounds
In: Journal of Algorithms [48], 91-134
Journal Article
Meyer2003aMeyer, Ulrich
Sanders, Peter
2003$\Delta$-stepping: a parallelizable shortest path algorithm
In: Journal of Algorithms [49], 114-152
Journal Article
MeySanSib2003Meyer, Sanders, Sibeyn (ed.)2003Algorithms for Memory HierarchiesBook
MeyZeh2003Meyer, Ulrich
Zeh, Norbert
2003I/O-Efficient Undirected Shortest Paths
In: Algorithms - ESA 2003: 11th Annual European Symposium, 434-445
Proceedings Article
Michail2004aMehlhorn, Kurt
Michail, Dimitrios
Telikepalli, Kavitha
Irving, Robert W.
Paluch, Katarzyna
2004Attachment IconRank-Maximal Matchings
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 68-75
Proceedings Article
Michail2004bKavitha, Telikepalli
Mehlhorn, Kurt
Michail, Dimitrios
Paluch, Katarzyna
2004Attachment IconStrongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents Problem
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 222-233
Proceedings Article
MinLoad2004Ahuja, Nitin
Baltz, Andreas
Doerr, Benjamin
Srivastav, Anand
2004Coloring Graphs with Minimal Load
In: Electronic Notes in Discrete Mathematics [17], 129-133
Journal Article
MoehringSkutellaStork2004Moehring, Rolf H.
Skutella, Martin
Stork, Frederik
2004Attachment IconScheduling with AND/OR Precedence Constraints
In: SIAM Journal on Computing [33], 393-415
Journal Article
MultiColor2004Doerr, Benjamin2004Multi-color discrepancies
In: Oberwolfach Reports [1], 683-685
Journal Article
Naujoks/Diplom04Naujoks, Rouven2004A heuristic for solving interior point Methods exactly
Universität des Saarlandes
Thesis - Masters thesis
Parreira03Parreira, Josiane2003On the Role of the Singular Values in Latent Semantic Indexing
Universität des Saarlandes
Thesis - Masters thesis
PettieSanders2004Pettie, Seth
Sanders, Peter
2004Attachment IconA simpler linear time 2/3 - eps approximation for maximum weight matching
In: Information Processing Letters [91], 271-276
Journal Article
Polzin2002-MSTHPolzin, Tobias
Vahdati Daneshmand, Siavash
2003On Steiner trees and minimum spanning trees in hypergraphs
In: Operations Research Letters [31], 12-20
Journal Article
PolzinPhD03Polzin, Tobias2003Algorithms for the Steiner Problem in Networks
Universität des Saarlandes
Thesis - PhD thesis
PS03Sanders, Peter2003Memory hierarchies - models and lower bounds
In: Algorithms for memory hierarchies, 1-10
Part of a Book
Rahul2003Smid, Michiel
Ray, Rahul
Wendt, Ulrich
Lange, Katharina
2004Computing Large Planar Regions in Terrains, with an Application to Fracture Surface
In: Discrete Applied Mathematics [139], 253-264
Journal Article
RayDiss04Ray, Rahul2004Geometric Algorithms for Object Placement and Planarity in a Terrain
Universität des Saarlandes
Thesis - PhD thesis
Ray/Diploma04Ray, Saurabh2004Counting Straight-Edge Triangulations of Planar Point Sets
Universität des Saarlandes
Thesis - Masters thesis
Reichel2003Eisenbrand, Friedrich
Funke, Stefan
Reichel, Joachim
Schömer, Elmar
2003Attachment IconPacking a Trunk
In: Algorithms - ESA 2003: 11th Annual European Symposium, 618-629
Proceedings Article
s-cssl-03Schmitt, Susanne2003Common Subexpression Search in LEDA_realsReport
s-doran-03Schmitt, Susanne2003The Diamond Operator for Real Algebraic NumbersReport
SameCPAIOR2004Beldiceanu, Nicolas
Katriel, Irit
Thiel, Sven
2004Filtering algorithms for the Same constraint
In: Integration of AI and OR techniques in constraint programming for combinatorial optimization problems : First International Conference, CPAIOR 2004, 65-79
Proceedings Article
Sanders2003Sanders, Peter2003Asynchronous Scheduling of Redundant Disk Arrays
In: IEEE Transactions on Computers [52], 1170-1184
Journal Article
Sanders2004aSanders, Peter2004Algorithms 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
Proceedings Article
SandersPettie2004Sanders, Peter
Pettie, Seth
2004Attachment IconA Simpler Linear Time 2/3 - epsilon Approximation for Maximum
Weight Matching
Report
SandersWinkel2004Sanders, Peter2004Super Scalar Sample Sort
In: Algorithms – ESA 2004: 12th Annual European Symposium, 784-796
Proceedings Article
SanSib03Sanders, Peter
Sibeyn, Jop F.
2003A Bandwidth Latency Tradeoff for Broadcast and Reduction
In: Information Processing Letters [86], 33-38
Journal Article
SanVoe03Sanders, Peter
Vöcking, Berthold
2003Tail bounds and expectations for random arc allocation and applications
In: Combinatorics, Probability and Computing [12], 225-244
Journal Article
Schäfer04Schäfer, Guido2004Worst case instances are fragile: average case and smoothed competitive analysis of algorithms
Universität des Saarlandes
Thesis - PhD thesis
Schäfer2003Becchetti, Luca
Leonardi, Stefano
Marchetti-Spaccamela, Alberto
Schäfer, Guido
Vredeveld, Tjark
2003Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm
In: 44th Annual Symposium on Foundations of Computer Science (FOCS-03), 462-471
Proceedings Article
Schmitt04aSchmitt, Susanne2004Improved separation bounds for the diamond operatorReport
Schmitt04bSchmitt, Susanne2004Common Subexpression Search in LEDA_reals -- a study of the diamond-operatorReport
Schmitt2003Schmitt, Susanne
Zimmer, Horst G.
2003Elliptic Curves : A Computational ApproachBook
SchmittFoussee2004Schmitt, Susanne
Fousse, Laurent
2004Attachment IconA comparison of polynomial evaluation schemesReport
SET03Sanders, Peter
Egner, Sebastian
Tolhuizen, Ludo
2003Polynomial Time Algorithms For Network Information Flow
In: Proceedings of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA-03), 286-294
Proceedings Article
Sivadas2003Adler, Micah
Räcke, Harald
Sivadasan, Naveen
Sohler, Christian
Vöcking, Berthold
2003Attachment IconRandomized Pursuit-Evasion in Graphs
In: Combinatorics, Probability and Computing [12], 225-244
Journal Article
Sivadasan2004Schäfer, Guido
Sivadasan, Naveen
2004Attachment IconTopology matters: Smoothed competitiveness of metrical task systems
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 489-500
Proceedings Article
Sivadasan2004-2Sanders, Peter
Sivadasan, Naveen
Skutella, Martin
2004Attachment IconOnline scheduling with bounded migration
In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, 1111-1122
Proceedings Article
SivadasanDiss04Sivadasan, Naveen2004Online Problems and Two-Player Games: Algorithms and Analysis
Universität des Saarlandes
Thesis - PhD thesis
SivadasanSandersSkutella2004Sivadasan, Naveen
Sanders, Peter
Skutella, Martin
2004Attachment IconOnline Scheduling with Bounded MigrationReport
Skutella2003Fekete, Sandor P.
Skutella, Martin
Woeginger, Gerhard J.
2003Attachment IconThe complexity of economic equilibria for house allocation markets
In: Information Processing Letters [88], 219-223
Journal Article
Telikepalli2003aTelikepalli, Kavitha2003Efficient Algorithms for Abelian group isomorphism and related problems
In: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science : 23rd Conference, 277-288
Proceedings Article
Telikepalli2003bTelikepalli, Kavitha
Varadarajan, Kasturi
2003On Shortest Paths in Line Arrangements
In: 15th Canadian Conference in Computational Geometry (CCCG-03), 170-173
Proceedings Article
Telikepalli2003cTelikepalli, Kavitha
Chandran, Sunil
Subramanian, C. R.
2003Isoperimetric Inequalities and Width Parameters of Graphs
In: Computing and Combinatorics : 9th Annual International Conference, COCOON 2003, 385-393
Proceedings Article
ThielDiss04Thiel, Sven2004Efficient Algorithms for Constraint Propagation and for Processing Tree Descriptions
Universität des Saarlandes
Thesis - PhD thesis
Vöcking2003Krick, Christof
Meyer auf der Heide, Friedhelm
Räcke, Harald
Vöcking, Berthold
Westermann, Matthias
2003Data Management in Networks: Experimental Evaluation of a Provably Good Strategy
In: Theory of Computing Systems [35], 217-245
Journal Article
w-jccetansal-03Wolpert, Nicola2003Jacobi Curves: Computing the Exact Topology of Arrangements of Non-Singular Algebraic CurvesReport
Warken2004Warken, Thomas2004Collision detection for Curved Rigid Objects in the Context of Dynamics Simulations
Universität des Saarlandes
Thesis - PhD thesis

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