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 - 1. Year 2005-2008

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/EditorAuthor/EditorYearTitleType
2006CTW_ProppDoerr, Benjamin
Friedrich, Tobias
Doerr, Friedrich2006Attachment IconQuasirandomness in Graphs
In: Electronic Notes in Discrete Mathematics [25], 61-64
Journal Article
a15-kavithaKavitha, Telikepalli
Mehlhorn, Kurt
Michail, Dimitrios
Paluch, Katarzyna E.
Kavitha, Mehlhorn, Michail, Paluch2007Attachment IconStrongly stable matchings in time O(nm) and extension to the hospitals-residents problem
In: ACM Transactions on Algorithms [3], 15.1-15.18
Journal Article
Abraham2007PopularAbraham, David J.
Irving, Robert W.
Kavitha, Telikepalli
Mehlhorn, Kurt
Abraham, Irving, Kavitha, Mehlhorn2007Attachment IconPopular Matchings
In: SIAM Journal on Computing [37], 1030-1045
Journal Article
ACS-TR-121108-01Eigenwillig, Arno
Kettner, Lutz
Wolpert, Nicola
Eigenwillig, Kettner, Wolpert2007Attachment IconSnap Rounding of Bézier CurvesReport
ACS-TR-121202-01Berberich, Eric
Hemmer, Michael
Berberich, Hemmer2006Prototype implementation of the algebraic kernelReport
ACS-TR-121202-01Berberich, Eric
Hemmer, Michael
Karavelas, Menelaos
Pion, Sylvain
Teillaud, Monique
Tsigaridas, Elias
Berberich, Hemmer, Karavelas, Pion, Teillaud, Tsigaridas2008Prototype implementation of the algebraic kernelReport
ACS-TR-123101-01Berberich, Eric
Hemmer, Michael
Karavelas, Menelaos
Pion, Sylvain
Teillaud, Monique
Tsigaridas, Elias
Berberich, Hemmer, Karavelas, Pion, Teillaud, Tsigaridas2006Interface specification of algebraic kernelReport
ACS-TR-241402-01Hemmer, Michael
Dupont, Laurent
Petitjean, Sylvain
Schömer, Elmar
Hemmer, Dupont, Petitjean, Schömer2008Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangment of QuadricsReport
ACS-TR-241405-03Hemmer, Michael
Hülse, Dominik
Hemmer, Hülse2007Traits classes for polynomial gcd computation over algebraic extensionsReport
ACS-TR-243306-03Hemmer, Michael
Limbach, Sebastian
Hemmer, Limbach2007Benchmarks on a generic univariate algebraic kernelReport
ACS-TR-243400-04Hemmer, MichaelHemmer2008CGAL package: Algebraic FoundationsReport
acs-tr-243404-03Kerber, MichaelKerber2008Attachment IconOn filter methods in CGAL's 2D curved kernelReport
ACS-TR-243406-01Hemmer, MichaelHemmer2008CGAL package for modular arithmetic operationsReport
ACS-TR-361502-02Mehlhorn, Kurt
Osbild, Ralf
Sagraloff, Michael
Mehlhorn, Osbild, Sagraloff2008A General Approach to the Analysis of Controlled Perturbation AlgorithmsReport
ACS-TR-361502-03Mehlhorn, Kurt
Sagraloff, Michael
Mehlhorn, Sagraloff2008A deterministic Bitstream Descartes AlgorithmReport
ACS-TR-363501-01Hemmer, MichaelHemmer2008Evaluation of different approaches in 3D curved kernel for arrangements of quadricsReport
acs-tr-363602-01Emeliyanenko, Pavel
Kerber, Michael
Emeliyanenko, Kerber2008Attachment IconAn implementation of the 2D Algebraic KernelReport
ACS-TR-363602-02Emiris,Ioannis
Hemmer, Michael
Karavelas, Menelaos
Limbach, Sebastian
Mourrain, Bernard
Tsigaridas, Elias
Zafeirakopoulos,Zafeirakis
Emiris, Hemmer, Karavelas, Limbach, Mourrain, Tsigaridas, Zafeirakopoulos2008Cross-benchmarks of univariate algebraic kernelsReport
ACS-TR-363603-01Emiris, Ioannis
Hemmer, Michael
Tsigaridas, Elias
Tzoumas, Georg
Emiris, Hemmer, Tsigaridas, Tzoumas2008Voronoi diagram of ellipses: CGAL-based implementationReport
ACS-TR-363606-01Hemmer, Michael
Limbach, Sebastian
Hemmer, Limbach2008Arrangements of quadrics in 3D: continued work on experimental implementationReport
acs-tr-363608-02Emeliyanenko, Pavel
Kerber, Michael
Emeliyanenko, Kerber2008Attachment IconVisualizing and Exploring Planar Algebraic Arrangements - a Web ApplicationReport
acstr123109-01Funke, Stefan
Klein, Christian
Mehlhorn, Kurt
Schmitt, Susanne
Funke, Klein, Mehlhorn, Schmitt2006Attachment IconControlled Perturbation for Delaunay TriangulationsReport
acs:bcw-carc-07Berberich, Eric
Caroli, Manuel
Wolpert, Nicola
Berberich, Caroli, Wolpert2007Exact Computation of Arrangements of Rotated ConicsReport
acs:bek-dffbiaq-06Berberich, Eric
Ebert, Franziska
Kettner, Lutz
Berberich, Ebert, Kettner2006Definition of file format for benchmark instances for arrangements of QuadricsReport
acs:bek-wbipca-06Berberich, Eric
Ebert, Franziska
Fogel, Efi
Kettner, Lutz
Berberich, Ebert, Fogel, Kettner2006Web-site with benchmark instances for planar curve arrangementsReport
acs:bfhmw-smtaoq-07Berberich, Eric
Fogel, Efi
Halperin, Dan
Mehlhorn, Kurt
Wein, Ron
Berberich, Fogel, Halperin, Mehlhorn, Wein2007Sweeping and Maintaining Two-Dimensional Arrangements on QuadricsReport
acs:bfm-uwibaqpac-07Berberich, Eric
Fogel, Efi
Meyer, Andreas
Berberich, Fogel, Meyer2007Updated Website to include Benchmark Instances for Arrangements of Quadrics and Planar Algebraic CurvesReport
acs:bh-dtqkc-07Berberich, Eric
Hemmer, Michael
Berberich, Hemmer2007Definition of the 3D Quadrical Kernel ContentReport
acs:bhkt-risak-06Berberich, Eric
Hemmer, Michael
Karavelas, Menelaos I.
Teillaud, Monique
Berberich, Hemmer, Karavelas, Teillaud2007Revision of interface specification of algebraic kernelReport
acs:bm-ceq-07Berberich, Eric
Meyerovitch, Michal
Berberich, Meyerovitch2007Computing Envelopes of QuadricsReport
acs:tr123203-04-08Berberich, Eric
Emeliyanenko, Pavel
Berberich, Emeliyanenko2008CGAL's Curved Kernel via AnalysisReport
addobj07Brockhoff, Dimo
Friedrich, Tobias
Hebbinghaus, Nils
Klein, Christian
Neumann, Frank
Zitzler, Eckart
Brockhoff, Friedrich, Hebbinghaus, Klein, Neumann, Zitzler2007Do Additional Objectives Make a Problem Harder?
In: Genetic and Evolutionary Computation Conference 2007, 765-772
Proceedings Article
ADLO:08.listupdateAngelopoulos, Spyros
Dorrigiv, Reza
Lopez-Ortiz, Alejandro
Angelopoulos, Dorrigiv, Lopez-Ortiz2008List Update with Locality of Reference
In: 8th Latin American Symposium on Theoretical Informatics (LATIN 2008), 399-410
Proceedings Article
af-hemmer-2007Hemmer, MichaelHemmer2007Algebraic Foundations, CGAL - Computational Geometry Algorithms Library, release 3.3Manual
AFHKRS05Althaus, Ernst
Funke, Stefan
Har-Peled, Sariel
Könemann, Jochen
Ramos, Edgar A.
Skutella, Martin
Althaus, Funke, Har-Peled, Könemann, Ramos, Skutella2005Approximating k-Hop Minimum-Spanning Trees
In: Operations Research Letters [33], 115-120
Journal Article
AFM06Ajwani, Deepak
Friedrich, Tobias
Meyer, Ulrich
Ajwani, Friedrich, Meyer2006Attachment IconAn $O(n^2.75)$ algorithm for online topological ordering
In: Algorithm theory - SWAT 2006 : 10th Scandinavian Workshop on Algorithm Theory, 53-64
Proceedings Article
AFM08Ajwani, Deepak
Friedrich, Tobias
Meyer, Ulrich
Ajwani, Friedrich, Meyer2008An $O(n^2.75)$ algorithm for incremental topological ordering
In: ACM Transactions on Algorithms [4], 1-14
Journal Article
AIKM05Abraham, David
Irving, Robert W.
Mehlhorn, Kurt
Telikepalli, Kavitha
Abraham, Irving, Mehlhorn, Telikepalli2005Attachment IconPopular Matchings
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 424-432
Proceedings Article
Ajwani05Ajwani, DeepakAjwani2005Design, Implementation and Experimental Study of External Memory BFS Algorithms
Universität des Saarlandes
Thesis - Masters thesis
Ajwani06Ajwani, Deepak
Dementiev, Roman
Meyer, Ulrich
Ajwani, Dementiev, Meyer2006Attachment IconA computational study of external memory BFS algorithms
In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06, 601-610
Proceedings Article
Ajwani07Ajwani, Deepak
Meyer, Ulrich
Osipov, Vitaly
Ajwani, Meyer, Osipov2007Improved external memory BFS implementations
In: 9th Workshop on Algorithm Engineering and Experiments (ALENEX), 3-12
Proceedings Article
AKX08Albrecht, Marc
Karrenbauer, Andreas
Xu, Chihao
Albrecht, Karrenbauer, Xu2008A clipper-free Algorithm for efficient HW-Implementation of local dimming LED-Backlight
In: Proceedings of the 28th International Display Research Conference (IDRC), 286-289
Proceedings Article
ALNA2008Althaus, Ernst
Naujoks, Rouven
Althaus, Naujoks2008Reconstructing Phylogenetic Networks with One Recombination
In: Experimental Algorithms, 7th International Workshop, WEA 2008, 275-288
Proceedings Article
ALOH:08.softAngelopoulos, Spyros
Lopez-Ortiz, Alejandro
Hamel,Angele
Angelopoulos, Lopez-Ortiz, Hamel2008Optimal Scheduling of Contract Algorithms with Soft Deadlines
In: 23rd National Conference on Artificial Intelligence (AAAI 2008), 868-873
Proceedings Article
AltCan2008Althaus, Ernst
Canzar, Stefan
Althaus, Canzar2008LASA: A tool for non-heuristic alignment of multiple sequences
In: Bioinformatics Research and Development (BIRD’08), 489-498
Proceedings Article
AltCanJOC08Althaus, Ernst
Canzar, Stefan
Althaus, Canzar2008A Lagrangian relaxation approach for the multiple sequence alignment problem
In: Journal of Combinatorial Optimization [16], 127-154
Journal Article
AltCanKar08Althaus, Ernst
Canzar, Stefan
Emmett, Mark
Karrenbauer, Andreas
Marshall, Alan
Meyer-Bäse, Anke
Zhang, Huimin
Althaus, Canzar, Emmett, Karrenbauer, Marshall, Meyer-Bäse, Zhang2008Computing H/D-exchange speeds of single residues from data of peptic fragments
In: 23rd Annual ACM Symposium on Applied Computing (SAC), 1273-1277
Proceedings Article
Althaus2006Althaus, Ernst
Calinescu, Gruia
Mandoiu, Ion
Prasad, Sushil
Tchervenski, Nickolay
Zelikovsly, Alexander
Althaus, Calinescu, Mandoiu, Prasad, Tchervenski, Zelikovsly2006Power efficient range assignment for symmetric connectivity in static ad-hoc wireless networks
In: Wireless Networks [12], 287-299
Journal Article
Althaus2006Althaus, Ernst
Caprara, Alberto
Lenhof, Hans-Peter
Reinert, Knut
Althaus, Caprara, Lenhof, Reinert2006Aligning multiple sequences by cutting planes
In: Mathematical Programming [2006], 387-425
Journal Article
[Replication or Save Conflict]
Althaus2007Althaus, Ernst
Canzar, Stefan
Althaus, Canzar2007A Lagrangian relaxation approach for the multiple sequence alignment problem
In: Combinatorial Optimization and Applications : First International Conference, COCOA 2007, 267-278
Proceedings Article
Althaus2007aAlthaus, Ernst
Baumann, Tobias
Schömer, Elmar
Werth, Kai
Althaus, Baumann, Schömer, Werth2007Trunk Packing Revisited
In: Experimental Algorithms, 6th International Workshop, 420-432
Proceedings Article
AMM2005Arya, Sunil
Malamatos, Theocharis
Mount, David M.
Arya, Malamatos, Mount2005Space-Time Tradeoffs for Approximate Spherical Range Counting
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 535-544
Proceedings Article
AMM2006aArya, Sunil
Malamatos, Theocharis
Mount, David M.
Arya, Malamatos, Mount2006On the Importance of Idempotence
In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, STOC'06, 564-573
Proceedings Article
AMM2006bArya, Sunil
Malamatos, Theocharis
Mount, David M.
Arya, Malamatos, Mount2006The Effect of Corners on the Complexity of Approximate Range Searching
In: Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06, 11-20
Proceedings Article
Angelopoulos2007SODA1Angelopoulos, SpyrosAngelopoulos2007Improved bounds for the online steiner tree problem in graphs of bounded edge-asymmetry
In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, 248-257
Proceedings Article
Angelopoulos2007SODA2Angelopoulos, Spyros
Dorrigiv, Reza
López-Ortiz, Alejandro
Angelopoulos, Dorrigiv, López-Ortiz2007On the separation and equivalence of paging strategies
In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, 229-237
Proceedings Article
Ang:08.steinerAngelopoulos, SpyrosAngelopoulos2008A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry
In: 16th Annual European Symposium on Algorithms (ESA 2008), 76-87
Proceedings Article
AntGECCO07Doerr, Benjamin
Neumann, Frank
Sudholt, Dirk
Witt, Carsten
Doerr, Neumann, Sudholt, Witt2007On the Runtime Analysis of the 1-ANT ACO algorithm
In: Genetic and Evolutionary Computation Conference 2007, 33-40
Proceedings Article
BachCaroli06Caroli, ManuelCaroli2006Exakte Arrangement-Berechnung gedrehter Quadratischer Kurven
Universität des Saarlandes
Thesis - Bachelor thesis
BachEbert05Ebert, FranziskaEbert2005Benchmark Data Sets for Conic Arrangements
Universität des Saarlandes
Thesis - Bachelor thesis
BachFouz06Fouz, MahmoudFouz2006Hereditary Discrepancy in Different Numbers of Colors
Universität des Saarlandes
Thesis - Bachelor thesis
BachSchmitt06Schmitt, DanielSchmitt2006Implementierung einer Überlagerungvon konvexen Arrangements der Kugeloberfläche
Universität des Saarlandes
Thesis - Bachelor thesis
BachSteurer06Steurer, DavidSteurer2006Tight Bounds on the Min-Max Boundary Decomposition Cost of Weighted Graphs
Universität des Saarlandes
Thesis - Bachelor thesis
BaGiePa2007Miklos, Balint
Giesen, Joachim
Pauly, Mark
Miklos, Giesen, Pauly2007Attachment IconMedial Axis Approximation from Inner Voronoi Balls: A Demo of the Mesecina Tool
In: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07), 123-124
Proceedings Article
bast05hzBast, HolgerBast2005Attachment IconPräzisionssuche im homöopathischen Netz
In: Homöopathie-Zeitschrift [I/05], 119-122
Journal Article
Bast2006bBast, HolgerBast2006Intelligente Suche mit garantiert schnellen Antwortzeiten
In: MPG Jahrbuch [?],
Electronic Journal Article
BastDMP06Bast, Holger
Dupret, Georges
Majumdar, Debapriyo
Piwowarski, Benjamin
Bast, Dupret, Majumdar, Piwowarski2006Discovering a Term Taxonomy from Term Similarities Using Principal Component Analysis
In: Semantics, web and mining : Joint International Workshops, EWMF 2005 and KDO 2005, 103-120
Proceedings Article
bastetal06spireBast, Holger
Mortensen, Christian Worm
Weber, Ingmar
Bast, Mortensen, Weber2006Attachment IconOutput-Sensitive Autocompletion Search
In: String Processing and Information Retrieval : 13th International Conference, SPIRE 2006, 150-162
Proceedings Article
bastetal07sigirBast, Holger
Chitea, Alexandru
Suchanek, Fabian
Weber, Ingmar
Bast, Chitea, Suchanek, Weber2007ESTER: Efficient Search in Text, Entities, and Relations
In: 30th International Conference on Research and Development in Information Retrieval (SIGIR'07), 671-678
Proceedings Article
BastFM06Bast, Holger
Funke, Stefan
Matijevic, Domagoj
Bast, Funke, Matijevic2006TRANSIT: Ultrafast Shortest-Path Queries with Linear-Time Preprocessing
In: 9th DIMACS Implementation Challenge --- Shortest Path,
Electronic Proceedings Article
BastFMSS07Bast, Holger
Funke, Stefan
Matijevic, Domagoj
Sanders, Peter
Schultes, Dominik
Bast, Funke, Matijevic, Sanders, Schultes2007In Transit to Constant Time Shortest-Path Queries in Road Networks
In: 9th Workshop on Algorithm Enginneering and Experiments (ALENEX'07), 46-59
Proceedings Article
bastmajumdar05sigirBast, Holger
Majumdar, Debapriyo
Bast, Majumdar2005Attachment IconWhy Spectral Retrieval Works
In: 28th Annual International Conference on Research and Development in Information Retrieval (SIGIR'05), 11-18
Proceedings Article
BastMSTW2006aBast, Holger
Majumdar, Debapriyo
Schenkel, Ralf
Theobald, Martin
Weikum, Gerhard
Bast, Majumdar, Schenkel, Theobald, Weikum2006Attachment IconIO-Top-k: Index-Access Optimized Top-k Query Processing
In: Proceedings of the 32nd International Conference on Very Large Data Bases, VLDB 2006, 475-486
Proceedings Article
BastMSTW2006trecBast, Holger
Majumdar, Debapriyo
Schenkel, Ralf
Theobald, Martin
Weikum, Gerhard
Bast, Majumdar, Schenkel, Theobald, Weikum2006IO-Top-k at TREC 2006: Terabyte Track
In: The Fifteenth Text Retrieval Conference Proceedings, TREC 2006, 1-5
Electronic Proceedings Article
BastMW07Bast, Holger
Majumdar, Debapriyo
Weber, Ingmar
Bast, Majumdar, Weber2007Efficient interactive query expansion with CompleteSearch
In: 16th Conference on Information and Knowledge Management (CIKM'07), 857-860
Proceedings Article
bastweber05weaBast, Holger
Weber, Ingmar
Bast, Weber2005Don't Compare Averages
In: 4th International Workshop on Efficient and Experimental Algorithms (WEA'05), 67-76
Proceedings Article
bastweber05wiriBast, Holger
Weber, Ingmar
Bast, Weber2005Insights from Viewing Ranked Retrieval as Rank Aggregation
In: Workshop on Challenges in Web Information Retrieval and Integration (WIRI'05), 243-248
Proceedings Article
bastweber06facetedBast, Holger
Weber, Ingmar
Bast, Weber2006When You're Lost For Words: Faceted Search With Autocompletion
In: SIGIR'06 Workshop on Faceted Search, 31-35
Proceedings Article
bastweber06sigirBast, Holger
Weber, Ingmar
Bast, Weber2006Attachment IconType Less, Find More: Fast Autocompletion Search with a Succinct Index
In: SIGIR 2006: Proceedings of the 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 364-371
Proceedings Article
bastweber07cidrBast, Holger
Weber, Ingmar
Bast, Weber2007Attachment IconThe CompleteSearch Engine: Interactive, Efficient, and Towards IR & DB integration
In: CIDR 2007 : 3rd Biennial Conference on Innovative Data Systems Research, 88-95
Electronic Proceedings Article
bastweber07gwemBast, Holger
Weber, Ingmar
Bast, Weber2007Managing Helpdesk Tasks with CompleteSearch: A Case Study
In: 4th Conference on Professional Knowledge Management (WM'07), 101-108
Proceedings Article
BaswanaEtal2005Baswana, Surender
Telikepalli, Kavitha
Mehlhorn, Kurt
Pettie, Seth
Baswana, Telikepalli, Mehlhorn, Pettie2005Attachment IconNew Constructions of (alpha, beta)-Spanners and Purely Additive Spanners
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 672-681
Proceedings Article
BaswanaSen2007Baswana, Surender
Sen, Sandeep
Baswana, Sen2007A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
In: Random Structures & Algorithms [30], 532-563
Journal Article
BausDipl05Baus, AndreasBaus2005Symbolic Constraints in Linear Integer Programming
Universität des Saarlandes
Thesis - Masters thesis
BCW-ECARC2007Berberich, Eric
Caroli, Manuel
Wolpert, Nicola
Berberich, Caroli, Wolpert2007Attachment IconExact Computation of Arrangements of Rotated Conics
In: Proceedings of 23rd European Workshop on Computational Geometry, 231-234
Proceedings Article
Behle2007Behle, MarkusBehle2007Attachment IconOn threshold BDDs and the optimal variable ordering problem
In: Combinatorial Optimization and Applications : First International Conference, COCOA 2007, 124-135
Proceedings Article
Behle2007ABehle, Markus
Jünger, Michael
Liers, Frauke
Behle, Jünger, Liers2007Attachment IconA Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem
In: Experimental Algorithms : 6th International Workshop, WEA 2007, 379-392
Proceedings Article
Beier2006Beier, René
Vöcking, Berthold
Beier, Vöcking2006Attachment IconTypical Properties of Winners and Losers in Discrete Optimization
In: SIAM Journal on Computing [35], 855-881
Journal Article
Beier2006bBeier, René
Vöcking, Berthold
Beier, Vöcking2006Attachment IconAn Experimental Study of Random Knapsack Problems
In: Algorithmica [45], 121-136
Journal Article
Beier2006cBeier, René
Czumaj, Artur
Krysta, Piotr
Vöcking, Berthold
Beier, Czumaj, Krysta, Vöcking2006Attachment IconComputing Equilibria for a Service Provider Game with (Im)perfect Information
In: ACM Transactions on Algorithms [2], 679-706
Journal Article
Beier2007Beier, René
Röglin, Heiko
Vöcking, Berthold
Beier, Röglin, Vöcking2007Attachment IconThe Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
In: Integer Programming and Combinatorial Optimization : 12th International IPCO Conference, 53-67
Proceedings Article
Berberich05Berberich, Eric
Eigenwillig, Arno
Hemmer, Michael
Hert, Susan
Kettner, Lutz
Mehlhorn, Kurt
Reichel, Joachim
Schmitt, Susanne
Schömer, Elmar
Wolpert, Nicola
Berberich, Eigenwillig, Hemmer, Hert, Kettner, Mehlhorn, Reichel, Schmitt, Schömer, Wolpert2005Attachment IconEXACUS: Efficient and exact algorithms for curves and surfaces
In: 13th Annual European Symposium on Algorithms (ESA 2005), 155-166
Proceedings Article
Berberich2008Berberich, EricBerberich2008Robust and Efficient Software for Problems in 2.5-Dimensional Non-Linear Geometry - Algorithms and Implementations
Universität des Saarlandes
Thesis - PhD thesis
BF08Bringmann, Karl
Friedrich, Tobias
Bringmann, Friedrich2008Approximating the volume of unions and intersections of high-dimensional geometric objects.
In: Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC 2008), 436-447
Proceedings Article
bfhmw-samtdaosafs-07Berberich, Eric
Fogel, Efi
Halperin, Dan
Mehlhorn, Kurt
Wein, Ron
Berberich, Fogel, Halperin, Mehlhorn, Wein2007Attachment IconSweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step
In: Algorithms - ESA 2007, 15th Annual European Symposium, 645-656
Proceedings Article
BFHW-SMTDAS2007Berberich, Eric
Fogel, Efi
Halperin, Dan
Wein, Ron
Berberich, Fogel, Halperin, Wein2007Attachment IconSweeping and Maintaining Two-Dimensional Arrangements on Surfaces
In: Proceedings of 23rd European Workshop on Computational Geometry, 223-226
Proceedings Article
BFSS07Bast, Holger
Funke, Stefan
Sanders, Peter
Schultes, Dominik
Bast, Funke, Sanders, Schultes2007Fast Routing in Road Networks using Transit Nodes
In: Science [316], 566
Journal Article
BGS2005Baswana, Surender
Goyal, Vishrut
Sen, Sandeep
Baswana, Goyal, Sen2005Attachment IconAll-pairs nearly 2-approximate shortest paths in $O(n^2 \mathrm polylog n)$ time
In: STACS 2005 : 22nd Annual Symposium on Theoretical Aspects of Computer Science, 666-679
Proceedings Article
bhksw-eceicpmqic-05Berberich, Eric
Hemmer, Michael
Kettner, Lutz
Schömer, Elmar
Wolpert, Nicola
Berberich, Hemmer, Kettner, Schömer, Wolpert2005An Exact, Complete and Efficient Implementation for Computing Planar Maps of Quadric Intersection Curves
In: 21st Annual Symposium on Computational Geometry (SCG'05), 99-106
Proceedings Article
bk-aosogo-08Berberich, Eric
Kerber, Michael
Berberich, Kerber2008Attachment IconArrangements on Surfaces of Genus One: Tori and Dupin Cyclides
In: 24th European Workshop on Computational Geometry - Collection of Abstracts, 209-212
Proceedings Article
bk-eatdc-08Berberich, Eric
Kerber, Michael
Berberich, Kerber2008Attachment IconExact Arrangements on Tori and Dupin Cyclides
In: Proceedings of the 2008 ACM Symposium on Solid and Physical Modeling, 59-66
Proceedings Article
bk-reorder-07Berberich, Eric
Kettner, Lutz
Berberich, Kettner2007Linear-Time Reordering in a Sweep-line Algorithm for Algebraic Curves Intersecting in a Common PointReport
bks-egtaas-08Berberich, Eric
Kerber, Michael
Sagraloff, Michael
Berberich, Kerber, Sagraloff2008Attachment IconExact Geometric-Topological Analysis of Algebraic Surfaces
In: Proceedings of the 24th ACM Symposium on Computational Geometry, 164-173
Proceedings Article
bks-gaoasbopa-08Berberich, Eric
Kerber, Michael
Sagraloff, Michael
Berberich, Kerber, Sagraloff2008Attachment IconGeometric Analysis of Algebraic Surfaces Based on Planar Arrangements
In: 24th European Workshop on Computational Geometry - Collection of Abstracts, 29-32
Proceedings Article
bks07Doerr, Benjamin
Klein, Christian
Storch, Tobias
Doerr, Klein, Storch2007Attachment IconFaster Evolutionary Algorithms by Superior Graph Representation
In: First IEEE Symposium on Foundations of Computational Intelligence (FOCI-2007), 245-250
Proceedings Article
BM-CEQ2007Berberich, Eric
Meyerovitch, Michal
Berberich, Meyerovitch2007Attachment IconComputing Envelopes of Quadrics
In: Proceedings of 23rd European Workshop on Computational Geometry, 235-238
Proceedings Article
BMST05Bast, Holger
Mehlhorn, Kurt
Schäfer, Guido
Tamaki, Hisao
Bast, Mehlhorn, Schäfer, Tamaki2006Attachment IconMatching Algorithms are Fast in Sparse Random Graphs
In: Theory of Computing Systems [39], 3-14
Journal Article
BodirskyGroeplJohannsenKang2007aBodirsky, Manuel
Gröpl, Clemens
Johannsen, Daniel
Kang, Mihyun
Bodirsky, Gröpl, Johannsen, Kang2007Attachment IconA Direct Decomposition of 3-connected Planar Graphs
In: Séminaire Lotharingien de Combinatoire [B54Ak], 15
Journal Article
BodirskyKutz2007Bodirsky, Manuel
Kutz, Martin
Bodirsky, Kutz2007Determining the consistency of partial tree descriptions
In: Artificial Intelligence [171], 185-196
Journal Article
BroFriNeuPPSN2008Brockhoff, Dimo
Friedrich, Tobias
Neumann, Frank
Brockhoff, Friedrich, Neumann2008Analyzing Hypervolume Indicator Based Algorithms
In: Parallel Problem Solving from Nature (PPSN X), 651-660
Proceedings Article
bs-agffgtaas-08Berberich, Eric
Sagraloff, Michael
Berberich, Sagraloff2008Attachment IconA Generic and Flexible Framework for the Geometrical and Topological Analysis of (Algebraic) Surfaces
In: Proceedings of the 2008 ACM Symposium on Solid and Physical Modeling, 171-182
Proceedings Article
CameronJohannsenPrellbergSchweitzer2008Cameron, Peter
Johannsen, Daniel
Prellberg, Thomas
Schweitzer, Pascal
Cameron, Johannsen, Prellberg, Schweitzer2008Attachment IconCounting Defective Parking Functions
In: Electronic Journal of Combinatorics [15], R92
Electronic Journal Article
Canzar2006Canzar, Stefan
Remy, Jan
Canzar, Remy2006Shape Distributions and Protein Similarity
In: GCB, 1-10
Proceedings Article
CaragiannisFishkin2007Caragiannis, Ioannis
Fishkin, Aleksei V.
Kaklamanis, Christos
Papaioannou, Evi
Caragiannis, Fishkin, Kaklamanis, Papaioannou2007Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs
In: 29th Symposium on Mathematical Foundations of Computer Science MFCS 2004, 119-136
Proceedings Article
Caragioannis2007Caragiannis, Ioannis
Fishkin, Aleksei V.
Kaklamanis, Christos
Papaioannou, Evi
Caragiannis, Fishkin, Kaklamanis, Papaioannou2007A tight bound for online colouring of disk graphs
In: Theoretical Computer Science [384], 152-160
Journal Article
Caroli07EvaluationCaroli, ManuelCaroli2007Evaluation of a Generic Method for Analyzing Controlled-Perturbation Algorithms
Universität des Saarlandes
Thesis - Masters thesis
CDoerrSP2006Cooper, Joshua
Doerr, Benjamin
Spencer, Joel
Tardos, Gabor
Cooper, Doerr, Spencer, Tardos2006Deterministic Random Walks on the Integers
In: ??? [?], 1-27
Miscellaneous
CDoerrST2007Cooper, Joshua
Doerr, Benjamin
Spencer, Joel
Tardos, Gábor
Cooper, Doerr, Spencer, Tardos2007Deterministic random walks on the integers
In: European Journal of Combinatorics [28], 2072-2090
Journal Article
CertifyingAlgsMehlhorn, Kurt
Eigenwillig, Arno
Kaligosi, Kanela
Kratsch, Dieter
McConnell, Ross
Meyer, Ulrich
Spinrad, Jeremy P.
Mehlhorn, Eigenwillig, Kaligosi, Kratsch, McConnell, Meyer, Spinrad2005Certifying Algorithms (draft)Unpublished/Draft
CGP2007Christodoulou, George
Gourves, Laurent
Pascual, Fanny
Christodoulou, Gourves, Pascual2007Attachment IconScheduling Selfish Tasks: About the Performance of Truthful Algorithms
In: Computing and Combinatorics : 13th Annual International Conference, COCOON 2007, 187-197
Proceedings Article
Chang2006Chang, Kevin L.
Kannan, Ravi
Chang, Kannan2006Attachment IconThe Space Complexity of Pass-Efficient Algorithms for Clustering
In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06, 1157-1166
Proceedings Article
Chang2007Chang, KevinChang2007Attachment IconMultiple pass streaming algorithms for learning mixtures of distributions in $R^d$
In: Algorithmic Learning Theory, 18th International Conference, Proceedings, 16
Proceedings Article
Chang2008aChang, Kevin
Johnson, Aaron
Chang, Johnson2008Attachment IconOnline and offline selling in limit order markets
In: 4th International Workshop on Internet and Network Economics (WINE 2008), 41-52
Proceedings Article
Christodoulou2008Christodoulou, GeorgeChristodoulou2008Price of Anarchy
In: Encyclopedia of Algorithms, 1-99
Part of a Book
ChristodoulouKS2008Christodoulou, George
Kovács, Annamária
Schapira, Michael
Christodoulou, Kovács, Schapira2008Bayesian Combinatorial Auctions
In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I, 820-832
Proceedings Article
ChristodoulouKV2008Christodoulou, George
Koutsoupias, Elias
Vidali, Angelina
Christodoulou, Koutsoupias, Vidali2008A Characterization of 2-Player Mechanisms for Scheduling
In: Algorithms - ESA 2008, 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings., 297-307
Proceedings Article
Chrobak2007Chrobak, Marek
Gasieniec, Leszek
Kowalski, Dariusz R.
Chrobak, Gasieniec, Kowalski2007The wake-up problem in multihop radio networks
In: SIAM Journal on Computing [36], 1453-1471
Journal Article
CK-STOCChlebus, Bogdan S.
Kowalski, Dariusz
Chlebus, Kowalski2005Cooperative asynchronous update of shared memory
In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC 2005), 733-739
Proceedings Article
CKK07Christodoulou, George
Koutsoupias, Elias
Kovács, Annamária
Christodoulou, Koutsoupias, Kovács2007Attachment IconMechanism design for fractional scheduling on unrelated machines
In: Automata, Languages and Programming : 34th International Colloquium, ICALP 2007, 40-52
Proceedings Article
CKMP-manusCzyzowicz, Jurek
Kowalski, Dariusz
Markou, Euripides
Pelc, Andrzej
Czyzowicz, Kowalski, Markou, Pelc2006Complexity of searching for a black holeUnpublished/Draft
CKMP-OPODISCzyzowicz, Jurek
Kowalski, Dariusz
Markou, Euripides
Pelc, Andrzej
Czyzowicz, Kowalski, Markou, Pelc2005Searching for a black hole in tree networks
In: Principles of distributed systems : 8th International Conference, OPODIS 2004, 67-80
Proceedings Article
CKV07Christodoulou, George
Koutsoupias, Elias
Vidali, Angelina
Christodoulou, Koutsoupias, Vidali2007A lower bound for scheduling mechanisms
In: ACM-SIAM Symposium on Discrete Algorithms (SODA), 1163-1170
Proceedings Article
COCOA07Mehlhorn, KurtMehlhorn2007Attachment IconMatchings in Graphs Variations of the Problem
In: Combinatorial Optimization and Applications : First International Conference, COCOA 2007, 1-2
Proceedings Article
conf/esa/Bar-YehudaFMR2007Bar-Yehuda, Reuven
Flysher, Guy
Mestre, Julián
Rawitz, Dror
Bar-Yehuda, Flysher, Mestre, Rawitz2007Approximation of Partial Capacitated Vertex Cover
In: 15th Annual European Symposium on Algorithms, 335-346
Proceedings Article
conf/esa/KhullerM2008Khuller, Samir
Mestre, Julián
Khuller, Mestre2008An Optimal Incremental Algorithm for Minimizing Lateness with Rejection
In: 16th Annual European Symposium on Algorithms (ESA), 601-610
Proceedings Article
conf/esa/KhullerMM2007Khuller, Samir
Malekian, Azarakhsh
Mestre, Julián
Khuller, Malekian, Mestre2007To Fill or Not to Fill: The Gas Station Problem
In: 15th Annual European Symposium on Algorithms, 534-545
Proceedings Article
conf/soda/Mestre2008Mestre, JuliánMestre2008Adaptive Local Ratio
In: 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 152-160
Proceedings Article
conf/stacs/Mestre2008Mestre, JuliánMestre2008Lagrangian Relaxation and Partial Cover (Extended Abstract)
In: 25th International Symposium on Theoretical Aspects of Computer Science (STACS), 539-550
Proceedings Article
conf/swat/AlthausCEKM2008Althaus, Ernst
Canzar, Stefan
Elbassioni, Khaled
Karrenbauer, Andreas
Mestre, Julián
Althaus, Canzar, Elbassioni, Karrenbauer, Mestre2008Approximating the Interval Constrained Coloring Problem
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), 210-221
Proceedings Article
ContRound2006Doerr, Benjamin
Klein, Christian
Doerr, Klein2006Controlled Randomized Rounding
In: Electronic Notes in Discrete Mathematics [25], 39-40
Electronic Journal Article
Csaba06Csaba, Bela
Lodha, S.
Csaba, Lodha2006A randomized on-line algorithm for the k-server problem on the line
In: Random Structures and Algorithms [29], 82-104
Journal Article
Csaba07Csaba, BelaCsaba2007On the Bollobas-Eidrigde conjecture for bipartite graphs
In: Combinatorics, Probability and Computing [16], 1-31
Journal Article
DBLP:conf/stacs/Meyer08Meyer, UlrichMeyer2008On Dynamic Breadth-First Search in External-Memory
In: Proc. 25th Annual Symposium on Theoretical Aspects (STACS), 551-560
Proceedings Article
DF2006Doerr, Benjamin
Friedrich, Tobias
Doerr, Friedrich2006Attachment IconDeterministic Random Walks on the Two-Dimensional Grid
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 474-483
Proceedings Article
DFKM08Dumitriu, Daniel
Funke, Stefan
Kutz, Martin
Milosavljevic, Nikola
Dumitriu, Funke, Kutz, Milosavljevic2008How much Geometry it takes to Reconstruct a 2-Manifold in $R^3$
In: 10th Workshop on Algorithm Engineering and Experiments (ALENEX-2008), 65-74
Proceedings Article
DFKM2008bDumitriu, Daniel
Funke, Stefan
Kutz, Martin
Milosavljevic, Nikola
Dumitriu, Funke, Kutz, Milosavljevic2008On the Locality of Extracting a 2-Manifold in $R^3$
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT-2008), 270-281
Proceedings Article
DFKO05Doerr, Benjamin
Friedrich, Tobias
Klein, Christian
Osbild, Ralf
Doerr, Friedrich, Klein, Osbild2005Attachment IconRounding of Sequences and Matrices, with Applications
In: Third Workshop on Approximation and Online Algorithms (WAOA 2005), 96-109
Proceedings Article
DFKO06Doerr, Benjamin
Friedrich, Tobias
Klein, Christian
Osbild, Ralf
Doerr, Friedrich, Klein, Osbild2006Attachment IconUnbiased Matrix Rounding
In: Algorithm theory - SWAT 2006 : 10th Scandinavian Workshop on Algorithm Theory, 102-112
Proceedings Article
DFKPDessmark, Anders
Fraigniaud, Pierre
Kowalski, Dariusz
Pelc, Andrzej
Dessmark, Fraigniaud, Kowalski, Pelc2006Deterministic rendezvous in graphsUnpublished/Draft
DFKP2006Dessmark, Anders
Fraigniaud, Pierre
Kowalski, Dariusz
Pelc, Andrzej
Dessmark, Fraigniaud, Kowalski, Pelc2006Attachment IconDeterministic Rendezvous in Graphs
In: Algorithmica [46], 69-96
Journal Article
DiedrichHarrenJansenThoeleThomas2008Diedrich, Florian
Harren, Rolf
Jansen, Klaus
Thöle, Ralf
Thomas, Henning
Diedrich, Harren, Jansen, Thöle, Thomas2008Attachment IconApproximation Algorithms for 3D Orthogonal Knapsack
In: Journal of Science and Technology [23], 749-762
Journal Article
DieKehNeu2008Diedrich, Florian
Kehden, Britta
Neumann, Frank
Diedrich, Kehden, Neumann2008Multi-objective Problems in Terms of Relational Algebra
In: Relations and Kleene Algebra in Computer Science 2008, 84-98
Proceedings Article
DieNeuCEC2008Diedrich, Florian
Neumann, Frank
Diedrich, Neumann2008Using Fast Matrix Multiplication in Bio-Inspired Computation for Complex Optimization Problems
In: IEEE Congress on Evolutionary Computation 2008, 3828-3833
Proceedings Article
DigHalf2003Doerr, BenjaminDoerr2006Non-independent Randomized Rounding, Linear Discrepancy and an Application to Digital Halftoning
In: Eurocomb '03 [3], 95-99
Journal Article
Dimitrios2007Michail, DimitriosMichail2007Reducing rank-maximal to maximum weight matching
In: Theoretical Computer Science [389], 125-132
Journal Article
DiplPohl06Pohl, SebastianPohl2006Exact Integer Linear Programming with Bounded Variables in a Branch- and Cut Algorithm
Universität des Saarlandes
Thesis - Masters thesis
DiplWeber06Weber, DennisWeber2006Solving large Sparse Linear Systems exactly
Universität des Saarlandes
Thesis - Masters thesis
Diss06DementievDementiev, RomanDementiev2006Algorithm Engineering for Large Data Sets
Universität des Saarlandes
Thesis - PhD thesis
Diss06HachHachenberger, PeterHachenberger2006Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms Optimized Implementation, Experiments and Applications
Universität des Saarlandes
Thesis - PhD thesis
DissReichel06Reichel, JoachimReichel2006Attachment IconCombinatorial Approaches for the Trunk Packing Problem
Universität des Saarlandes
Thesis - PhD thesis
DKMS05Dementiev, Roman
Kärkkäinen, Juha
Mehnert, Jens
Sanders, Peter
Dementiev, Kärkkäinen, Mehnert, Sanders2005Attachment IconBetter External Memory Suffix Array Construction
In: Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics
(ALENEX/ANALCO 2005), 86-97
Proceedings Article
Doerr2005Doerr, BenjaminDoerr2005Matrix Rounding with Low Error in Small Submatrices
In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), 1067-1068
Proceedings Article
Doerr2005EurocombProppCooper, Joshua
Doerr, Benjamin
Spencer, Joel
Tardos, Gabor
Cooper, Doerr, Spencer, Tardos2005Deterministic Random Walks on the Integers
In: 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 73-76
In: Discrete Mathematics & Theoretical Computer Science [AE], 73-76
Proceedings Article
Doerr2005gitterDoerr, Benjamin
Gnewuch, Michael
Srivastav, Anand
Doerr, Gnewuch, Srivastav2005Bounds and Constructions for the Star-Discrepancy via Delta-Covers
In: Journal of Complexity [21], 691-709
Journal Article
Doerr2005HabilDoerr, BenjaminDoerr2005Integral Approximation
Christian-Albrechts-Universität zu Kiel
Thesis - Habilitation thesis
Doerr2005minloadAhuja, Nitin
Baltz, Andreas
Doerr, Benjamin
Privetivy, Ales
Srivastav, Anand
Ahuja, Baltz, Doerr, Privetivy, Srivastav2005Attachment IconOn the Minimum Load Coloring Problem
In: Third Workshop on Approximation and Online Algorithms (WAOA 2005), 15-26
Proceedings Article
Doerr2006gametreesDoerr, Benjamin
Lorenz, Ulf
Doerr, Lorenz2006Attachment IconError Propagation in Game Trees
In: Mathematical Methods of Operations Research [64], 79-93
Journal Article
Doerr2007-CECaDoerr, Benjamin
Happ, Edda
Klein, Christian
Doerr, Happ, Klein2007A Tight Bound for the (1+1)-EA on the Single Source Shortest Path Problem
In: IEEE Congress on Evolutionary Computation 2007, 1890-1895
Proceedings Article
Doerr2007-CECbDoerr, Benjamin
Gnewuch, Michael
Hebbinghaus, Nils
Neumann, Frank
Doerr, Gnewuch, Hebbinghaus, Neumann2007A Rigorous View On Neutrality
In: IEEE Congress on Evolutionary Computation 2007, 2591-2597
Proceedings Article
Doerr2007-ENDMaCooper, Joshua
Doerr, Benjamin
Friedrich, Tobias
Spencer, Joel
Cooper, Doerr, Friedrich, Spencer2007Deterministic Random Walks on Regular Trees
In: Electronic Notes in Discrete Mathematics [29], 509-513
Journal Article
Doerr2007-ENDMbDoerr, Benjamin
Friedrich, Tobias
Klein, Christian
Osbild, Ralf
Doerr, Friedrich, Klein, Osbild2007Unbiased Matrix Rounding
In: Electronic Notes in Discrete Mathematics [28], 41-46
Journal Article
Doerr2007GeccoProcThierens, Beyer, Bongard, Branke, Clark, Cliff, Congdon, Deb, Doerr, Kovacs, Kumar, Miller, Moore, Neumann, Pelikan, Poli, Sastry, Stanley, Stützle, Watson, Wegener (ed.)Thierens, 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 ComputationProceedings
Doerr2007nitinAhuja, Nitin
Baltz, Andreas
Doerr, Benjamin
Privetivy, Ales
Srivastav, Anand
Ahuja, Baltz, Doerr, Privetivy, Srivastav2007On the Minimum Load Coloring Problem
In: Journal of Discrete Algorithms [5], 533-545
Journal Article
Doerr2007partialDoerr, BenjaminDoerr2007Partial Colorings of Unimodular Hypergraphs
In: Electronic Notes in Discrete Mathematics [29], 359-363
Journal Article
Doerr2008-SODADoerr, Benjamin
Friedrich, Tobias
Sauerwald, Thomas
Doerr, Friedrich, Sauerwald2008Quasirandom Rumor Spreading
In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, 773-781
Proceedings Article
Doerr2008-SODAbCooper, Joshua
Doerr, Benjamin
Friedrich, Tobias
Spencer, Joel
Cooper, Doerr, Friedrich, Spencer2008Deterministic Random Walks on Regular Trees
In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, 766-772
Proceedings Article
Doerr2008GeccoProcKeizer, Antoniol, Congdon, Deb, Doerr, Hansen, Holmes, Hornby, Howard, Kennedy, Kumar, Lobo, Miller, Moore, Neumann, Pelikan, Pollack, Sastry, Stanley, Stoica, Talbi, Wegener (ed.)Keizer, Antoniol, Congdon, Deb, Doerr, Hansen, Holmes, Hornby, Howard, Kennedy, Kumar, Lobo, Miller, Moore, Neumann, Pelikan, Pollack, Sastry, Stanley, Stoica, Talbi, Wegener (ed.)2008GECCO 2008: Proceedings of the 10th Annual Conference on Genetic and Evolutionary ComputationProceedings
DoerrANALCO06Cooper, Joshua
Doerr, Benjamin
Spencer, Joel
Tardos, Gábor
Cooper, Doerr, Spencer, Tardos2006Deterministic Random Walks
In: Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments and the Third Workshop on Analytic Algorithmics and Combinatorics (ALENEX'06 / ANALCO'06), 185-197
Proceedings Article
DoerrFouz2006Doerr, Benjamin
Fouz, Mahmoud
Doerr, Fouz2006Hereditary Discrepancies in Different Numbers of Colors II
In: ??? [?], 1-19
Miscellaneous
DoerrGKP08Doerr, Benjamin
Gnewuch, Michael
Kritzer, Peter
Pillichshammer, Peter
Doerr, Gnewuch, Kritzer, Pillichshammer2008 Component-by-component construction of low-discrepancy point sets of small size
In: Monte Carlo Methods Applications [14], 129-150
Journal Article
DoerrGnewuch2008Doerr, Benjamin
Gnewuch, Michael
Doerr, Gnewuch2008Construction of Low-Discrepancy Point Sets of Small Size by Bracketing Covers and Dependent Randomized Rounding
In: Monte Carlo and Quasi-Monte Carlo Methods 2006, 299-312
Proceedings Article
DoerrGnewuchKritzerPillichshammer2008Doerr, Benjamin
Gnewuch, Michael
Kritzer, Peter
Pillichshammer, Friedrich
Doerr, Gnewuch, Kritzer, Pillichshammer2008Component-by-component construction of low-discrepancy point sets of small size
In: Monte Carlo Methods and Applications [14], 129-149
Journal Article
DoerrHapp2008Doerr, Benjamin
Happ, Edda
Doerr, Happ2008Directed trees: A Powerful Representation for Sorting and Ordering Problems
In: Proceedings of CEC 2008, 3606-3613
Proceedings Article
DoerrJansenKlein2008Doerr, Benjamin
Jansen, Thomas
Klein, Christian
Doerr, Jansen, Klein2008Comparing local and global mutations on bit-strings.
In: Genetic and Evolutionary Computation Conference 2008, 929-936
Proceedings Article
DoerrJohannsen07aDoerr, Benjamin
Johannsen, Daniel
Doerr, Johannsen2007Attachment IconAdjacency List Matchings --- An Ideal Genotype for Cycle Covers
In: Genetic and Evolutionary Computation Conference (GECCO-2007), 1203-1210
Proceedings Article
DoerrJohannsen2007bDoerr, Benjamin
Johannsen, Daniel
Doerr, Johannsen2007Attachment IconRefined Runtime Analysis of a Basic Ant Colony Optimization Algorithm
In: IEEE Congress on Evolutionary Computation 2007, 501-507
Proceedings Article
DoerrJohannsenTang2008aDoerr, Benjamin
Johannsen, Daniel
Tang, Ching Hoo
Doerr, Johannsen, Tang2008Attachment IconHow Single Ant ACO Systems Optimize Pseudo-Boolean Functions
In: Parallel Problem Solving from Nature – PPSN X, 378-388
Proceedings Article
DoerrSTACS2005Doerr, BenjaminDoerr2005Roundings Respecting Hard Constraints
In: STACS 2005 : 22nd Annual Symposium on Theoretical Aspects of Computer Science (STACS'05), 617-628
Proceedings Article
DoerrStacs2006Doerr, BenjaminDoerr2006Attachment IconGenerating Randomized Roundings with Cardinality Constraints and Derandomizations
In: STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, 571-583
Proceedings Article
DoerrTCS2007Doerr, BenjaminDoerr2007Roundings respecting hard constraints
In: Theory of Computing Systems [40], 467-483
Journal Article
DoerrTusnadyDoerr, BenjaminDoerr2007Attachment IconMatrix approximation and Tusnády's problem
In: European Journal of Combinatorics [28], 990-995
Journal Article
Donato-etal-Web-07Donato, Debora
Laura, Luigi
Leonardi, Stefano
Millozzi, Stefano
Meyer, Ulrich
Sibeyn, Jop F.
Donato, Laura, Leonardi, Millozzi, Meyer, Sibeyn2006Attachment IconAlgorithms and Experiments for the Webgraph
In: Journal of Graph Algorithms and Applications [10], 219-236
Electronic Journal Article
Dumitriu2007Dumitriu, DanielDumitriu2007Attachment IconGraph-based Conservative Surface Reconstruction
Universität des Saarlandes
Thesis - Masters thesis
Dumitriu2008aDumitriu, Daniel
Funke, Stefan
Kutz, Martin
Milosavljevic, Nikola
Dumitriu, Funke, Kutz, Milosavljevic2008On the Locality of Extracting a 2-Manifold in $R^3$
In: Collection of abstracts of the 24th European Workshop on Computational Geometry, 205-208
Proceedings Article
EFKM2005Eisenbrand, Friedrich
Funke, Stefan
Karrenbauer, Andreas
Matijevic, Domagoj
Eisenbrand, Funke, Karrenbauer, Matijevic2005Attachment IconEnergy-Aware Stage Illumination
In: Proceedings of the 21st Annual Symposium on Computational Geometry : (SCG05), 336-346
Proceedings Article
EFKM2008Eisenbrand, Friedrich
Funke, Stefan
Karrenbauer, Andreas
Matijevic, Domagoj
Eisenbrand, Funke, Karrenbauer, Matijevic2008Energy-Aware Stage Illumination
In: International Journal of Computational Geometry and Applications [18], 107-129
Journal Article
eigenwillig-phd-08Eigenwillig, ArnoEigenwillig2008Real Root Isolation for Exact and Approximate Polynomials Using Descartes' Rule of Signs
Universität des Saarlandes
Thesis - PhD thesis
Eigenwillig2005Eigenwillig, Arno
Kettner, Lutz
Krandick, Werner
Mehlhorn, Kurt
Schmitt, Susanne
Wolpert, Nicola
Eigenwillig, Kettner, Krandick, Mehlhorn, Schmitt, Wolpert2005Attachment IconA Descartes algorithm for polynomials with bit-stream coefficients
In: Computer Algebra in Scientific Computing : 8th International Workshop, CASC 2005, 138-149
Proceedings Article
Eigenwillig2006aEigenwillig, Arno
Sharma, Vikram
Yap, Chee K.
Eigenwillig, Sharma, Yap2006Attachment IconAlmost Tight Recursion Tree Bounds for the Descartes Method
In: ISSAC '06: Proceedings of the 2006 international symposium on Symbolic and algebraic computation, 71-78
Electronic Proceedings Article
Eigenwillig2007aEigenwillig, ArnoEigenwillig2007Attachment IconOn Multiple Roots in Descartes' Rule and Their Distance to Roots of Higher Derivatives
In: Journal of Computational and Applied Mathematics [200], 226-230
Journal Article
Eigenwillig2007bEigenwillig, Arno
Kettner, Lutz
Wolpert, Nicola
Eigenwillig, Kettner, Wolpert2007Attachment IconSnap rounding of Bézier curves
In: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07), 158-167
Proceedings Article
EisenbrandIJCGA2007Eisenbrand, Friedrich
Funke, Stefan
Karrenbauer, Andreas
Reichel, Joachim
Schömer, Elmar
Eisenbrand, Funke, Karrenbauer, Reichel, Schömer2007Packing a truck - Now with a twist!
In: International Journal of Computational Geometry & Applications [17], 505-527
Journal Article
ek-eae2aoaac-08Eigenwillig, Arno
Kerber, Michael
Eigenwillig, Kerber2008Attachment IconExact and Efficient 2D-Arrangements of Arbitrary Algebraic Curves
In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA08), 122-131
Proceedings Article
ek-vaepaa-08Emeliyanenko, Pavel
Kerber, Michael
Emeliyanenko, Kerber2008Attachment IconVisualizing and Exploring Planar Algebraic Arrangements -- a Web Application
In: Proceedings of the 24th ACM Symposium on Computational Geometry, 224-225
Proceedings Article
eksw-eecaccc-06Eigenwillig, Arno
Kettner, Lutz
Schömer, Elmar
Wolpert, Nicola
Eigenwillig, Kettner, Schömer, Wolpert2006Attachment IconExact, Efficient and Complete Arrangement Computation for Cubic Curves
In: Computational Geometry [35], 36-73
Journal Article
EKSX2006Eisenbrand, Friedrich
Karrenbauer, Andreas
Skutella, Martin
Xu, Chihao
Eisenbrand, Karrenbauer, Skutella, Xu2006Multiline Addressing by Network Flow
In: Algorithms - ESA 2006 : 14th Annual European Symposium, 744-755
Proceedings Article
ekw-fast-2007Eigenwillig, Arno
Kerber, Michael
Wolpert, Nicola
Eigenwillig, Kerber, Wolpert2007Attachment IconFast and Exact Geometric Analysis of Real Algebraic Plane Curves
In: Proceedings of the 2007 International Symposium on Symbolic and Algebraic Computation, 151-158
Proceedings Article
EKX2007Eisenbrand, Friedrich
Karrenbauer, Andreas
Xu, Chihao
Eisenbrand, Karrenbauer, Xu2007Algorithms for longer OLED Lifetime
In: WEA 2007, 338-351
Proceedings Article
Elbassioni2005aElbassioni, Khaled M.
Mustafa, Nabil H.
Elbassioni, Mustafa2005Attachment IconConflict-Free Colorings of Rectangle Ranges for Wireless NetworksUnpublished/Draft
Elbassioni2005dKhachiyan, Leonid
Boros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
Khachiyan, Boros, Elbassioni, Gurvich2005A New Algorithm for the Hypergraph Transversal Problem
In: Computing and combinatorics : 11th Annual International Conference, COCOON 2005, 767-776
Proceedings Article
Elbassioni2005eKhachiyan, Leonid
Boros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
Khachiyan, Boros, Elbassioni, Gurvich2005Generating All Minimal Integral Solutions to Monotone $\wedge,\vee$-Systems of Linear, Transversal and Polymatroid Inequalities
In: Mathematical Foundations of Computer Science 2005 : 30th International Symposium, MFCS 2005, 556-567
Proceedings Article
Elbassioni2005fKhachiyan, Leonid
Boros, Endre
Borys, Konrad
Elbassioni, Khaled M.
Gurvich, Vladimir
Khachiyan, Boros, Borys, Elbassioni, Gurvich2005Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 156-165
Proceedings Article
Elbassioni2005gElbassioni, Khaled M.
Katriel, Irit
Kutz, Martin
Mahajan, Meena
Elbassioni, Katriel, Kutz, Mahajan2005Simultaneous Matchings
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 106-115
Proceedings Article
Elbassioni2005jaElbassioni, Khaled M.
Elmasry, Amr
Kamel, Ibrahim
Elbassioni, Elmasry, Kamel2005An Indexing Method for Answering Queries on Moving Objects
In: Distributed and Parallel Databases [17], 215-249
Journal Article
Elbassioni2005jbKhachiyan, Leonid
Boros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
Makino, Kazuhisa
Khachiyan, Boros, Elbassioni, Gurvich, Makino2005On the Complexity of Some Enumeration Problems for Matroids
In: SIAM Journal on Discrete Mathematics [19], 966-984
Journal Article
Elbassioni2006Elbassioni, Khaled M.Elbassioni2006On the Complexity of Monotone Boolean Duality TestingReport
Elbassioni2006aKhachiyan, Leonid
Boros, Endre
Borys, Konrad
Elbassioni, Khaled M.
Gurvich, Vladimir
Khachiyan, Boros, Borys, Elbassioni, Gurvich2006Generating All Vertices of a Polyhedron is Hard
In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06, 758-765
Proceedings Article
Elbassioni2006bElbassioni, Khaled M.
Mustafa, Nabil H.
Elbassioni, Mustafa2006Conflict-Free Colorings of Rectangle Ranges
In: STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, 254-263
Proceedings Article
Elbassioni2006cElbassioni, Khaled M.Elbassioni2006Finding All Minimal Infrequent Multi-dimensional Intervals
In: LATIN 2006: Theoretical Informatics, 7th Latin American Symposium, 423-434
Proceedings Article
Elbassioni2006dElbassioni, Khaled M.Elbassioni2006On the Complexity of the Multiplication Method for Monotone CNF/DNF Dualization
In: Algorithms - ESA 2006, 14th Annual European Symposium, 340-351
Proceedings Article
Elbassioni2006eElbassioni, Khaled M.
Lotker, Zvi
Seidel, Raimund
Elbassioni, Lotker, Seidel2006Upper bound on the number of vertices of polyhedra with 0, 1-constraint matrices
In: Information Processing Letters [100], 69 - 71
Journal Article
Elbassioni2006fKhachiyan, Leonid
Boros, Endre
Borys, Konrad
Elbassioni, Khaled M.
Gurvich, Vladimir
Makino, Kazuhisa
Khachiyan, Boros, Borys, Elbassioni, Gurvich, Makino2006Enumerating Spanning and Connected Subsets in Graphs and Matroids
In: Algorithms - ESA 2006, 14th Annual European Symposium, 444-455
Proceedings Article
Elbassioni2006gElbassioni, Khaled M.
Fishkin, Aleksei V.
Sitters, Rene
Elbassioni, Fishkin, Sitters2006On Approximating the TSP with Intersecting Neighborhoods
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 213-222
Proceedings Article
Elbassioni2007aAjwani, Deepak
Elbassioni, Khaled M.
Govindarajan, Sathish
Ray, Saurabh
Ajwani, Elbassioni, Govindarajan, Ray2007Conflict-Free Coloring for Rectangle Ranges Using $\tildeO(n^.382+\epsilon)$ Colors
In: 19th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 07), (to-appear)
Proceedings Article
Elbassioni2007bElbassioni, Khaled M.
Sitters, Rene
Zhang, Yan
Elbassioni, Sitters, Zhang2007Attachment IconA Quasi-PTAS for Envy-free Pricing on Line GraphsUnpublished/Draft
Elbassioni2007cBoros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
Makino, Kazuhisa
Boros, Elbassioni, Gurvich, Makino2007Generating Vertices of Polyhedra and Related Monotone Generation ProblemsUnpublished/Draft
Elbassioni2007dElbassioni, Khaled
Sitters, Rene
Zhang, Yan
Elbassioni, Sitters, Zhang2007A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs
In: Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings, 451-462
Proceedings Article
Elbassioni2007eBoros, Endre
Borys, Konrad
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa
Rudolf, Gabor
Boros, Borys, Elbassioni, Gurvich, Makino, Rudolf2007Generating Minimal k-Vertex Connected Spanning Subgraphs
In: Computing and Combinatorics, 13th Annual International Conference, COCOON 2007, Proceedings, 222-231
Proceedings Article
Elbassioni2007fAjwani, Deepak
Elbassioni, Khaled
Govindarajan, Sathish
Ray, Saurabh
Ajwani, Elbassioni, Govindarajan, Ray2007Conflict-free coloring for rectangle ranges using $n^.382$ colors
In: SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallel Algorithms and Architectures, 181-187
Proceedings Article
Elbassioni2007gKhachiyan, Leonid
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa
Khachiyan, Boros, Elbassioni, Gurvich, Makino2007Enumerating disjunctions and conjunctions of paths and cuts in reliability theory
In: Discrete Applied Mathematics [155], 137-149
Journal Article
Elbassioni2007hKhachiyan, Leonid
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Khachiyan, Boros, Elbassioni, Gurvich2007A global parallel algorithm for the hypergraph transversal problem
In: Information Processing Letters [101], 148-155
Journal Article
Elbassioni2007iKhachiyan, Leonid
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa
Khachiyan, Boros, Elbassioni, Gurvich, Makino2007Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data
In: Theoretical Computer Science [379], 361-376
Journal Article
Elbassioni2007jKhachiyan, Leonid
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Khachiyan, Boros, Elbassioni, Gurvich2007On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs
In: Theoretical Computer Science [382], 139-150
Journal Article
Elbassioni2008Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Tiwary, Hans Raj
Boros, Elbassioni, Gurvich, Tiwary2008Characterization of the vertices and extreme directions of the negative cycle polyhedron and hardness of generating vertices of 0/1-polyhedra
In: CoRR [abs/0801.3790], x-x
Journal Article
Elbassioni2008aTiwary, Hans Raj
Elbassioni, Khaled
Tiwary, Elbassioni2008On 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
Proceedings Article
Elbassioni2008bElbassioni, Khaled
Hagen, Matthias
Rauf, Imran
Elbassioni, Hagen, Rauf2008Some Fixed-Parameter Tractable Classes of Hypergraph Duality and Related Problems
In: Parameterized and Exact Computation, Third International Workshop, IWPEC 2008, 91-102
Proceedings Article
Elbassioni2008cBoros, Endre
Elbassioni, Khaled
Makino, Kazuhisa
Boros, Elbassioni, Makino2008On Berge Multiplication for Monotone Boolean Dualization
In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, 48-59
Proceedings Article
Elbassioni2008dBoros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa
Oudalov, Vladimir
Boros, Elbassioni, Gurvich, Makino, Oudalov2008A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2x2 subgames
In: Computer Science - Theory and Applications, Third International Computer Science Symposium in Russia, CSR 2008, 99-109
Proceedings Article
Elbassioni2008eElbassioni, Khaled
Tiwary, Hans Raj
Elbassioni, Tiwary2008On a Cone Covering Problem
In: Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 171-174
Proceedings Article
Elbassioni2008fKhachiyan, Leonid
Boros, Endre
Borys, Konrad
Elbassioni, Khaled
Gurvich, Vladimir
Rudolf, Gabor
Zhao, Jihui
Khachiyan, Boros, Borys, Elbassioni, Gurvich, Rudolf, Zhao2008On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction
In: Theory Comput. Syst. [43], 204-233
Journal Article
Elbassioni2008gKutz, Martin
Elbassioni, Khaled
Katriel, Irit
Mahajan, Meena
Kutz, Elbassioni, Katriel, Mahajan2008Simultaneous matchings: Hardness and approximation
In: J. Comput. Syst. Sci. [74], 884-897
Journal Article
Elbassioni2008hElbassioni, KhaledElbassioni2008A note on systems with max-min and max-product constraints
In: Fuzzy Sets and Systems [159], 2272-2277
Journal Article
Elbassioni2008iElbassioni, KhaledElbassioni2008On the complexity of monotone dualization and generating minimal hypergraph transversals
In: Discrete Applied Mathematics [156], 2109-2123
Journal Article
Elbassioni2008jKhachiyan, Leonid
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Khachiyan, Boros, Elbassioni, Gurvich2008Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions
In: Discrete Applied Mathematics [156], 2020-2034
Journal Article
Elbassioni2008kKhachiyan, Leonid
Boros, Endre
Borys, Konrad
Elbassioni, Khaled
Gurvich, Vladimir
Khachiyan, Boros, Borys, Elbassioni, Gurvich2008Generating All Vertices of a Polyhedron Is Hard
In: Discrete & Computational Geometry [39], 174-190
Journal Article
Elbassioni2008lElbassioni, Khaled
Tiwary, Hans Raj
Elbassioni, Tiwary2008On Computing the Vertex Centroid of a Polyhedron
In: CoRR [abs/0806.3456], x-x
Journal Article
Elbassioni2008mKhachiyan, Leonid
Boros, Endre
Borys, Konrad
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa
Khachiyan, Boros, Borys, Elbassioni, Gurvich, Makino2008Generating Cut Conjunctions in Graphs and Related Problems
In: Algorithmica [51], 239-263
Journal Article
Elbassioni2008nKhachiyan, Leonid
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Khachiyan, Boros, Elbassioni, Gurvich2008On Enumerating Minimal Dicuts and Strongly Connected Subgraphs
In: Algorithmica [50], 159-172
Journal Article
Elbassioni2008oElbassioni, Khaled
Elmasry, Amr
Kamel, Ibrahim
Elbassioni, Elmasry, Kamel2008Indexing Schemes for Multi-dimensional Moving Objects
In: Encyclopedia of GIS, 523-529
Part of a Book
Elbassioni2012dElbassioni, Khaled
Rauf, Imran
Ray, Saurabh
Elbassioni, Rauf, Ray??On Enumerating Minimal Transversals of Geometric HypergraphsUnpublished/Draft
ElbassioniKatriel2004Elbassioni, Khaled M.
Katriel, Irit
Elbassioni, Katriel2005Multiconsistency and Robustness with Global Constraints
In: Integration of AI and OR techniques in constraint programming for combinatorial optimization problems : Second International Conference, CPAIOR 2005, 168-182
Proceedings Article
ElbassioniKatriel2006Elbassioni, Khaled M.Elbassioni2006Multiconsistency and Robustness with Global Constraints
In: Constraints [11], 335-352
Journal Article
ElKahoui2005aEl Kahoui, M'hammedEl Kahoui2005Attachment IconBirational properties of the gap subresultant varieties
In: Journal of Symbolic Computation [39], 61-71
Journal Article
ElKahoui2005bEl Kahoui, M'hammedEl Kahoui2005Attachment Icon$D$-resultant and subresultants
In: Proceedings of the Amercian Mathematical Society [133], 2193-2199
Journal Article
ElKahoui2005cEl Kahoui, M'hammedEl Kahoui2005Attachment IconUFDs with commuting linearly independent locally nilpotent derivations
In: Journal of Algebra [289], 446-452
Journal Article
ElKahoui2005dBrown, Christopher
El Kahoui, M'hammed
Novotni, Dominik
Weber, Andreas
Brown, El Kahoui, Novotni, Weber2006Attachment IconAlgorithmic methods for investigating equilibria in epidemic modeling
In: Journal of Symbolic Computation [41], 1157-1173
Journal Article
ElKahoui2005eEl Kahoui, M'hammedEl Kahoui2008Attachment IconComputing with algebraic curves in generic positionMiscellaneous
ElKahoui2005fEl Kahoui, M'hammedEl Kahoui2008Attachment IconPolynomial parametrization of nonsingular algebraic curvesMiscellaneous
ElKahoui2005gEl Kahoui, M'hammed
Rakrak, Said
El Kahoui, Rakrak2007Attachment IconStructure of Groebner bases with respect to block orders
In: Mathematics of Computation [76], 2181-2187
Journal Article
Elmasry2008aElmasry, Amr
Hammad, Abdelrahman
Elmasry, Hammad2008Attachment IconInversion-Sensitive Sorting Algorithms in Practice
In: ACM Journal of Experimental Algorithmics [13], 1-18
Journal Article
Elmasry2008bElmasry, Amr
Jensen, Claus
Katajainen, Jyrki
Elmasry, Jensen, Katajainen2008Attachment IconMultipartite Priority Queues
In: ACM Transactions on Algorithms [5], 1-19
Journal Article
Elmasry2008cElmasry, Amr
Jensen, Claus
Katajainen, Jyrki
Elmasry, Jensen, Katajainen2008Attachment IconTwo New Methods for Constructing Double-Ended Priority Queues from Priority Queues
In: Computing [83], 193-204
Journal Article
Elmasry2008dElmasry, AmrElmasry2008Attachment IconViolation Heaps: A Better Substitute for Fibonacci HeapsReport
Emel2007Emeliyanenko, PavelEmeliyanenko2007Attachment IconVisualization of Points and Segments of Real Algebraic Plane Curves
Universität des Saarlandes
Thesis - Masters thesis
Epstein2006Epstein, Leah
Kesselman, Alexander
Epstein, Kesselman2006On the remote server problem or more about TCP acknowledgments
In: Theoretical Computer Science [369], 285
Journal Article
EulerECJ07Doerr, Benjamin
Hebbinghaus, Nils
Neumann, Frank
Doerr, Hebbinghaus, Neumann2007Speeding up Evolutionary Algorithms Through Asymmetric Mutation Operators
In: Evolutionary Computation [15], 401-410
Journal Article
FH08Friedrich, Tobias
Hebbinghaus, Nils
Friedrich, Hebbinghaus2008Average Update Times for Fully-Dynamic All-Pairs Shortest Paths.
In: Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC 2008), 693-704
Proceedings Article
FK2006Funke, Stefan
Klein, Christian
Funke, Klein2006Attachment 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
Funke, Kesselman, Meyer, Segal2006A 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
Funke, Kesselman, Kuhn, Lotker, Segal2007Attachment IconImproved approximation algorithms for connected sensor cover
In: Wireless Networks [13], 153-164
Journal Article
FKMS2005Funke, Stefan
Klein, Christian
Mehlhorn, Kurt
Schmitt, Susanne
Funke, Klein, Mehlhorn, Schmitt2005Attachment 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
Funke, Kesselman, Meyer, Segal2005A 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
Funke, Laue2007Attachment 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
Flash-WEA-2008Ajwani, Deepak
Malinger, Itay
Meyer, Ulrich
Toledo, Sivan
Ajwani, Malinger, Meyer, Toledo2008Characterizing the Performance of Flash Memory Storage Devices and Its Impact on Algorithm Design
In: Proc. 7th Intern. Workshop on Experimental Algorithms (WEA), 208-219
Proceedings Article
FLN2007Funke, Stefan
Laue, Sören
Naujoks, Rouven
Funke, Laue, Naujoks2007Minimum Energy Broadcast with Few Senders
In: Distributed Computing in Sensor Systems : Third IEEE International Conference, DCOSS 2007, 404-416
Proceedings Article
FLNL2008Funke, Stefan
Laue, Sören
Naujoks, Rouven
Lotker, Zvi
Funke, Laue, Naujoks, Lotker2008Power Assignment Problems in Wireless Communication: Covering Points by Disks, Reaching few Receivers Quickly, and Energy-Efficient Travelling Salesman Tours
In: Distributed Computing in Sensor Systems, 4th IEEE International Conference, DCOSS 2008, 282-295
Proceedings Article
FM2007Funke, Stefan
Milosavljevic, Nikola
Funke, Milosavljevic2007Network 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
Funke, Milosavljevic2007Guaranteed-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
Funke, Malamatos, Matijevic, Wolpert2006Attachment Icon(Approximate) Conic Nearest Neighbors and the induced Voronoi Diagram
In: 18th Canadian Conference on Computational Geometry, 23-26
Proceedings Article
FOSW08Friedrich, Tobias
Oliveto, Pietro
Sudholt, Dirk
Witt, Carsten
Friedrich, Oliveto, Sudholt, Witt2008Theoretical Analysis of Diversity Mechanisms for Global Exploration
In: Proceedings of the 10th annual conference on Genetic and evolutionary computation (GECCO 2008), 945-952
Proceedings Article
Fountoulakis2007Fountoulakis, Nikolaos
Reed, Bruce
Fountoulakis, Reed2007Faster Mixing and Small Bottlenecks
In: Probability Theory and Related Fields [137], 475-486
Journal Article
Fountoulakis2008Fountoulakis, Nikolaos
Reed, Bruce
Fountoulakis, Reed2008The evolution of the mixing rate of a simple random walk on the giant component of a random graph
In: Random Structures and Algorithms [33], 68-86
Journal Article
Fountoulakis2008aCooley, Oliver
Fountoulakis, Nikolaos
Kühn, Daniela
Osthus, Deryk
Cooley, Fountoulakis, Kühn, Osthus20083-Uniform hypergraphs of bounded degree have linear Ramsey numbers
In: Journal of Combinatorial Theory B [98], 484-505
Journal Article
Fountoulakis2008bFountoulakis, Nikolaos
Kühn, Daniela
Osthus, Deryk
Fountoulakis, Kühn, Osthus2008The order of the largest complete minor in a random graph
In: Random Structures and Algorithms [33], 127-141
Journal Article
Fountoulakis2009aFountoulakis, NikolaosFountoulakis2007Percolation on sparse random graphs with given degree sequence
In: Internet Mathematics [4], 329-356
Journal Article
Friedrich2005Friedrich, TobiasFriedrich2005Attachment IconDeterministic Random Walks on Infinite Grids
Friedrich-Schiller-Universität Jena
Thesis - Masters thesis
FriedrichPhD2007Friedrich, TobiasFriedrich2007Use and Avoidance of Randomness
Universität des Saarlandes
Thesis - PhD thesis
FriHorNeuPPSN2008Friedrich, Tobias
Horoba, Christian
Neumann, Frank
Friedrich, Horoba, Neumann2008Runtime Analyses for Using Fairness in Evolutionary Multi-Objective Optimization
In: Parallel Problem Solving from Nature (PPSN X), 671-680
Proceedings Article
FriNeuCEC2008Friedrich, Tobias
Neumann, Frank
Friedrich, Neumann2008When to Use Bit-wise Neutrality
In: IEEE Congress on Evolutionary Computation 2008, 997-1003
Proceedings Article
FroylandKMDW08Froyland, Gary
Koch, Thorsten
Megow, Nicole
Duane, Emily
Wren, Howard
Froyland, Koch, Megow, Duane, Wren2008Optimizing the Landside Operation of a Container Terminal
In: OR Spectrum [30], 53-75
Journal Article
FuGui2006Funke, Stefan
Guibas, Leonidas
Nguyen, An
Wang, Yusu
Funke, Guibas, Nguyen, Wang2006Distance-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
Aronov, Asano, Funke2007Optimal 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, StefanFunke2005Topological 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
Funke, Milosavljevic2005Infrastructure-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
Funke, Laue, Naujoks, Lotker2006Power Assignment Problems in Wireless Communication
In: ??? [?], 1-14
Miscellaneous
FunkeRauf07Funke, Stefan
Rauf, Imran
Funke, Rauf2007Information 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
Gidenstam, Papatriantafilou2007LFthreads: 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
Giesen, Schuberth, Simon, Zolliker, Zweifel2007Image-Dependent Gamut Mapping as Optimization Problem
In: IEEE Transactions on Image Processing [16], 2401-2410
Journal Article
Giesen2007bGiesen, JoachimGiesen2008Delaunay Triangulation Approximates Anchor Hull
In: Computational Geometry - Theory and Applications [36], 131-143
Journal Article
Giesen2007cGiesen, JoachimGiesen2008Conjoint Analysis for Measuring the Perceived Quality in Volume Rendering
In: IEEE Transactions on Visualization and Computer Graphics [13], 1664-1671
Journal Article
Giesen2007colGiesen, Joachim
Mitsche, Dieter
Schuberth, Eva
Giesen, Mitsche, Schuberth2007Attachment 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, JoachimGiesen2007The Combinatorial Structure of Polyhedral Choice Based Conjoint Analysis
In: Conjoint Measurement: Methods and Applications, 259-271
Part of a Book
Giesen2007eGiesen, JoachimGiesen2007Medial Axis Approximation from Inner Voronoi Balls: A Demo of the Mesecina Tool
In: 23d Annual ACM Symposium on Computational Geometry, 123-124
Proceedings Article
Giesen2008zGiesen, JoachimGiesen2008The Flow Complex: A Data Structure for Geometric Modeling
In: Computational Geometry - Theory and Applications [39], 178-190
Journal Article
GKMMP06Gotsman, Craig
Kaligosi, Kanela
Mehlhorn, Kurt
Michail, Dimitrios
Pyrga, Evangelia
Gotsman, Kaligosi, Mehlhorn, Michail, Pyrga2007Attachment IconCycle Bases of Graphs and Sampled Manifolds
In: Computer Aided Geometric Design [24], 464
Journal Article
GKSGeorgiou, Chryssis
Kowalski, Dariusz
Shvartsman, Alexander
Georgiou, Kowalski, Shvartsman2005Efficient gossip and robust distributed computation
In: Theoretical Computer Science [347], 130-166
Journal Article
GolumbicMR06Golumbic, Martin Charles
Mintz, Aviad
Rotics, Udi
Golumbic, Mintz, Rotics2006Factoring 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
Govindarajan2007Govindarajan, Sathish
Dietze, Michael C.
Agarwal, Pankaj K.
Clark, James S.
Govindarajan, Dietze, Agarwal, Clark2008Attachment IconA scalable algorithm for dispersing population
In: Journal of Intellingent Information Systems [29], 39-61
Journal Article
HachenbergerKettner2005NefHachenberger, Peter
Kettner, Lutz
Hachenberger, Kettner2005Boolean Operations on 3D Selective Nef Complexes: Optimized Implementation and Experiments
In: ACM Symposium on Solid and Physical Modeling (SPM 2005), 163-174
Proceedings Article
Happ2008Doerr, Benjamin
Happ, Edda
Klein, Christian
Doerr, Happ, Klein2008Crossover Can Provably be Useful in Evolutionary Computation
In: Genetic and Evolutionary Computation Conference 2008, 539-546
Proceedings Article
HappJohannsenKleinNeumann2008aHapp, Edda
Johannsen, Daniel
Klein, Christian
Neumann, Frank
Happ, Johannsen, Klein, Neumann2008Attachment IconRigorous Analyses of Fitness-Proportional Selection for Optimizing Linear Functions
In: Genetic and Evolutionary Computation Conference 2008, 953-960
Proceedings Article
Harren2006aHarren, RolfHarren2006Attachment IconApproximating the Orthogonal Knapsack Problem for Hypercubes
In: Automata, Languages and Programming, 238-249
Proceedings Article
Harren2006bHarren, RolfHarren2006Approximation mehrdimensionaler Packungsprobleme
Universität Dortmund
Thesis - other
Harren2007Diedrich, Florian
Harren, Rolf
Jansen, Klaus
Thöle, Ralf
Thomas, Henning
Diedrich, Harren, Jansen, Thöle, Thomas2007Attachment IconApproximation Algorithms for 3D Orthogonal Knapsack
In: Theory and Applications of Models of Computation, 34-45
Proceedings Article
Harren2007bHarren, RolfHarren2007Mehrdimensionale Packungsprobleme - Approximation geometrischer Verallgemeinerungen klassischer PackungsproblemeBook
HarrenvanStee2008Harren, Rolf
van Stee, Rob
Harren, van Stee2008Attachment IconPacking Rectangles into 2 OPT Bins using Rotations
In: 11th Scandinavian Workshop on Algorithm Theory, 306-318
Proceedings Article
Hebbinghaus2005Doerr, Benjamin
Hebbinghaus, Nils
Doerr, Hebbinghaus2005Discrepancy 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
Doerr, Hebbinghaus, Neumann2006Attachment 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
Bundy, Hebbinghaus, Stellmacher2006Attachment IconThe Local C(G,T) Theorem
In: Journal of Algebra [300], 741-789
Journal Article
Hebbinghaus2007Hebbinghaus, NilsHebbinghaus2007Attachment IconDiscrepancy of Sums of two Arithmetic ProgressionsReport
Hemmer2007Dupont, Laurent
Hemmer, Michael
Petitjean, Sylvain
Schömer, Elmar
Dupont, Hemmer, Petitjean, Schömer2007Attachment 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
Hemmer2008Hemmer, MichaelHemmer2008Attachment IconExact Computation of the Adjacency Graph of an Arrangement of Quadrics
Johannes Gutenberg-Universität Mainz
Thesis - PhD thesis
HKMN08Huang, Chien-Chung
Kavitha, Telikepalli
Michail, Dimitrios
Nasre, Meghana
Huang, Kavitha, Michail, Nasre2008Bounded Unpopularity Matchings
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), 127-137
Proceedings Article
HorNeuGECCO2008Horoba, Christian
Neumann, Frank
Horoba, Neumann2008Benefits and Drawbacks for the Use of epsilon-Dominance in Evolutionary Multi-Objective Optimization
In: Genetic and Evolutionary Computation Conference 2008, 641-680
Proceedings Article
HTM06aHariharan, Ramesh
Telikepalli, Kavitha
Mehlhorn, Kurt
Hariharan, Telikepalli, Mehlhorn2006Attachment 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
Friedrich, He, Hebbinghaus, Neumann, Witt2007On Improving Approximate Solutions by Evolutionary Algorithms
In: IEEE Congress on Evolutionary Computation 2007, 2614-2621
Proceedings Article
ImpBoun2006Doerr, Benjamin
Hebbinghaus, Nils
Werth, Sören
Doerr, Hebbinghaus, Werth2006Attachment IconImproved Bounds and Schemes for the Declustering Problem
In: Theoretical Computer Science [359], 123-132
Journal Article
INRIA-00340887:1Emiris, Ioannis Z.
Hemmer, Michael
Karavelas, Menelaos
Mourrain, Bernard
Tsigaridas, Elias P.
Zafeirakopoulos, Zafeirakis
Emiris, Hemmer, Karavelas, Mourrain, Tsigaridas, Zafeirakopoulos2008Attachment IconExperimental evaluation and cross-benchmarking of univariate real solversReport
inserpoints2006Teramoto, Sachio
Asano, Tetsuo
Katoh, Naoki
Doerr, Benjamin
Teramoto, Asano, Katoh, Doerr2006Inserting Points Uniformly at Every Instance
In: IEICE - Transactions on Information and Systems [E89-D], 2348-2356
Journal Article
IntLiar2006Doerr, Benjamin
Lengler, Johannes
Steurer, Daniel
Doerr, Lengler, Steurer2006Attachment 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
Irving, Telikepalli, Mehlhorn, Michail, Paluch2006Attachment IconRank-Maximal Matchings
In: ACM Transactions on Algorithms [2], 602-610
Journal Article
Johannsen2006aJohannsen, DanielJohannsen2006Attachment IconSampling Rooted 3-Connected Planar Graphs in Deterministic Polynomial Time
Humboldt-Universität zu Berlin
Thesis - Masters thesis
jounal/ploscb/ZotenkoMOP2008Zotenko, Elena
Mestre, Julián
O'Leary, Dianne
Przytyzka, Teresa
Zotenko, Mestre, O'Leary, Przytyzka2008Essential Complex Biological Modules Explain the Centrality-Lethality Rule
In: PLoS Computational Biology [x], x-x
Journal Article
Kaligosi2006aKaligosi, Kanela
Sanders, Peter
Kaligosi, Sanders2006How 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
Brodal, Kaligosi, Katriel, Kutz2006Faster Algorithms for Computing Longest Common Increasing Subsequences
In: Combinatorial Pattern Matching, 17th Annual Symposium, CPM 2006, 330-341
Proceedings Article
KamranDipl05Kamran Azam, MuhammadKamran Azam2005Branch-and-Cut Techniques for Generalized Asymmetric Traveling Salesman Problem
Universität des Saarlandes
Thesis - Masters thesis
KarrenbauerPhDKarrenbauer, AndreasKarrenbauer2007Attachment IconEngineering combinatorial optimization algorithms to improve the lifetime of OLED displays
Universität des Saarlandes
Thesis - PhD thesis
KatrielSWC2004Beldiceanu, Nicolas
Katriel, Irit
Thiel, Sven
Beldiceanu, Katriel, Thiel2005GCC-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
Katriel, Thiel2005Complete Bound Consistency for the Global Cardinality Constraint
In: Constraints [10], 191-217
Journal Article
Kav08Kavitha, TelikepalliKavitha2008On a Special Co-cycle Basis of Graphs
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), 343-354
Proceedings Article
Kavitha2007TCSKavitha, Telikepalli
Mehlhorn, Kurt
Kavitha, Mehlhorn2007Attachment IconAlgorithms to compute minimum cycle basis in directed graphs
In: Theory of Computing Systems [40], 485-505
Journal Article
Kerber2006Kerber, MichaelKerber2006Attachment IconAnalysis of Real Algebraic Plane Curves
Universität des Saarlandes
Thesis - Masters thesis
Kesselmann2004aKesselman, Alexander
Kogan, Kirill
Kesselman, Kogan2005Non-Preemptive Scheduling of Optical Switches
In: 2004 IEEE Global Telecommunications Conference workshops (GLOBECOM'04), 1840-1844
Proceedings Article
Kesselmann2005wonsKesselman, Alexander
Kowalski, Dariusz
Kesselman, Kowalski2005Fast 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, LutzKettner2005Reference 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
Brönnimann, Kettner, Pocchiola, Snoeyink2005Counting 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.)Mitchell, Rote, Kettner (ed.)200521st Annual Symposium on Computational Geometry (SCG'05)Proceedings
Kettner2005StxxlDementiev, Roman
Kettner, Lutz
Sanders, Peter
Dementiev, Kettner, Sanders2005STXXL: 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
Dementiev, Kettner, Sanders2005STXXL: Standard Template Library for XXL Data SetsReport
Kettner2006HandleKettner, LutzKettner2006Reference 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
Brönnimann, Kettner, Pocchiola, Snoeyink2006Attachment 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
Hert, Hoffmann, Kettner, Pion, Seel2007An adaptable and extensible geometry kernel
In: Computational Geometry: Theory and Applications [38], 16-36
Journal Article
Kettner2007ClassroomKettner, Lutz
Mehlhorn, Kurt
Pion, Sylvain
Schirra, Stefan
Yap, Chee
Kettner, Mehlhorn, Pion, Schirra, Yap2008Attachment IconClassroom Examples of Robustness Problems in Geometric Computations
In: Computational Geometry: Theory and Applications [40], 61-78
Journal Article
Kettner2007ECGBookMourrain, Bernard
Pion, Sylvain
Schmitt, Susanne
Técourt, Jean-Pierre
Tsigaridas, Elias
Wolpert, Nicola
Mourrain, Pion, Schmitt, Técourt, Tsigaridas, Wolpert2007Algebraic 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
Fogel, Halperin, Kettner, Teillaud, Wein, Wolpert2007Attachment IconArrangements
In: Effective Computational Geometry for Curves and Surfaces, 1-66
Part of a Book
Kettner2007Nef3Hachenberger, Peter
Kettner, Lutz
Mehlhorn, Kurt
Hachenberger, Kettner, Mehlhorn2007Attachment 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
Kesselman, Kowalski, Segal2005Attachment 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
Klein, Kutz2007Attachment IconComputing Geometric Minimum-Dilation Graphs Is NP-Hard
In: Graph Drawing : 14th International Symposium, GD 2006, 196-207
Proceedings Article
KlKu2006bKlein, Rolf
Kutz, Martin
Klein, Kutz2006Attachment 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
KM08Kavitha, Telikepalli
Nasre, Meghana
Kavitha, Nasre2008Optimal Popular MatchingsMiscellaneous
KM2005Kavitha, Telikepalli
Mehlhorn, Kurt
Kavitha, Mehlhorn2005Attachment 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
Kavitha, Mehlhorn, Michail2007Attachment 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
Kowalski, Musial, Shvartsman2005Explicit 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
Katriel, Michel, Van Hentenryck2005Maintaining Longest Paths Incrementally
In: Constraints [10], 159-183
Journal Article
KobelBachelor2008Kobel, AlexanderKobel2008Automated Generation of Kempe Linkages for Algebraic Curves in a Dynamic Geometry System
Universität des Saarlandes
Thesis - Bachelor thesis
Kov07Kovács, AnnamáriaKovács2007Fast Algorithms for Two Scheduling Problems
Universität des Saarlandes
Thesis - PhD thesis
Kovacs2005aKovács, AnnamáriaKovács2005Polynomial Time Preemptive Sum-Multicoloring on Paths
In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, 840-852
Proceedings Article
Kovacs2005bKovács, AnnamáriaKovács2005Fast monotone 3-approximation algorithm for scheduling related machines
In: Algorithms - ESA 2005: 13th Annual European Symposium, 616-627
Proceedings Article
Kovacs2006Kovács, AnnamáriaKovács2006Tighter Approximation Bounds for LPT Scheduling in Two Special Cases
In: Algorithms and Complexity : 6th Italian Conference, CIAC 2006, 187-198
Proceedings Article
Kowalik2005Kowalik, LukaszKowalik2006Improved 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
Chrobak, Dürr, Jawor, Kowalik, Kurowski2006A Note on Scheduling Equal-Length Jobs to Maximize Throughput
In: Journal of Scheduling [9], 71-73
Journal Article
KowalikAdjSparseGraphsKowalik, LukaszKowalik2007Adjacency Queries in Dynamic Sparse Graphs
In: Inf. Proc. Lett. [-], -
Journal Article
KowalikEdgeColoringCole, Richard
Kowalik, Lukasz
Cole, Kowalik2008New Linear-Time Algorithms for Edge-Coloring Planar Graphs
In: Algorithmica [50], 351-368
Journal Article
KowalikISAAC2006Kowalik, LukaszKowalik2006Approximation 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
Cole, Kowalik, Skrekovski2007A Generalization of Kotzig's Theorem and Its Application
In: SIAM Journal on Discrete Mathematics [21], 93-106
Journal Article
KP-TCSKowalski, Dariusz
Pelc, Andrzej
Kowalski, Pelc2005Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism
In: Theoretical Computer Science [333], 355-371
Journal Article
KroGhaMicNeuPPSN2008Kroeske, Jense
Ghandar, Adam
Michalewicz, Zbigniew
Neumann, Frank
Kroeske, Ghandar, Michalewicz, Neumann2008Learning Fuzzy Rules with Evolutionary Algorithms - An Analytic Approach
In: Parallel Problem Solving from Nature (PPSN X), 1051-1060
Proceedings Article
Kutz05Kutz, Martin
Pór, Attila
Kutz, Pór2005Attachment IconAngel, Devil, and King
In: Computing and Combinatorics : 11th Annual International Conference, COCOON 2005, 925-934
Proceedings Article
Kutz2006Kutz, MartinKutz2006Computing 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, MartinKutz2005Conway's Angel in three dimensions
In: Theoretical Computer Science [349], 443-451
Journal Article
KutzHGames:2004Kutz, MartinKutz2005Weak 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
Kutz, Schweitzer2007ScrewBox: 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
Lehnert, Schweitzer2007The Co-Word Problem for the Higman-Thompson Group is context-free
In: Bulletin of the London Mathematical Society [39], 235-241
Journal Article
LennerzDiss05Lennerz, ChristianLennerz2005Distance Computation for Extended Quadratic Complexes
Universität des Saarlandes
Thesis - PhD thesis
Limbach2008Limbach, SebastianLimbach2008Attachment IconContinued Work on the Computation of an Exact Arrangement of Quadrics
Universität des Saarlandes
Thesis - Masters thesis
lotkeretal06cocoonLotker, Zvi
Majumdar, Debapriyo
Narayanaswamy, N.S.
Weber, Ingmar
Lotker, Majumdar, Narayanaswamy, Weber2006Sequences Characterizing k-Trees
In: Computing and Combinatorics, 12th Annual International Conference, COCOON 2006, 216-225
Proceedings Article
LpDisc2006Doerr, BenjaminDoerr2007Attachment IconLp Linear discrepancy of totally unimodular matrices
In: Linear Algebra and Its Applications [420], 663-666
Journal Article
Mal05Elmasry, Amr
Elbassioni, Khaled M.
Elmasry, Elbassioni2005Output-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, TheocharisMalamatos2005Lower 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
Arya, Malamatos, Mount, Wong2007Optimal expected-case planar point location
In: SIAM Journal on Computing [37], 584-610
Journal Article
Malamatos2007bArya, Sunil
Malamatos, Theocharis
Mount, David M.
Arya, Malamatos, Mount2007A simple entropy-based algorithm for planar point location
In: ACM Transactions on Algorithms [3], 17
Journal Article
Malamatos2008Malamatos, TheocharisMalamatos2008Lower Bounds for expected-case planar point location
In: Computational Geometry Theory and Applications [39], 91-103
Journal Article
Manjunath2008Eigensatz, Michael
Giesen, Joachim
Manjunath, Madhusudan
Eigensatz, Giesen, Manjunath2008The Solution Path of the Slab Support Vector Machine
In: The 20th Canadian Conference on Computational Geometry, 211-214
Proceedings Article
Manjunath2008thManjunath, MadhusudanManjunath2008Two topics in Geometry: Minimizing absolute Gaussian Curvature over meshes and Solution Path of the Slab Support Vector Machine
Universität des Saarlandes
Thesis - Masters thesis
MastSteurer06Steurer, DavidSteurer2006An Asymptomic Approximation Scheme for Multigraph Edge Coloring
Universität des Saarlandes
Thesis - Masters thesis
MatijevicPhDMatijevic, DomagojMatijevic2007Attachment IconGeometric Optimization and Querying - Exact and Approximate
Universität des Saarlandes
Thesis - PhD thesis
Maue2006Maue, JensMaue2006Attachment IconA Goal-Directed Shortest Path Algorithm Using Precomputed Cluster Distances
Universität des Saarlandes
Thesis - Masters thesis
MaueSandersMatijevic2006Maue, Jens
Sanders, Peter
Matijevic, Domagoj
Maue, Sanders, Matijevic2006Goal 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
Bárány, Doerr2006Attachment IconBalanced partitions of vector sequences
In: Linear Algebra and Its Applications [414], 464-469
Journal Article
Mehlhorn-Sanders:ToolboxMehlhorn, Kurt
Sanders, Peter
Mehlhorn, Sanders2008Algorithms and Data Structures: The Basic ToolboxBook
mehlhorn05Lars, Bender, Demaine, Leiserson, Mehlhorn (ed.)Lars, Bender, Demaine, Leiserson, Mehlhorn (ed.)2005Cache-Oblivious and Cache-Aware AlgorithmsReport
mehlhorn05Mehlhorn, KurtMehlhorn2005Minimum Cycle Bases and Surface Reconstruction
In: Graph Drawing: 13th International Symposium, GD 2005, ,, 532-532
Proceedings Article
mehlhorn05Mehlhorn, Kurt
Waldmann, Uwe
Wilhelm, Reinhard
Mehlhorn, Waldmann, Wilhelm2005Harald 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
Kaligosi, Mehlhorn, Munro, Sanders2005Attachment 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
Funke, Mehlhorn, Näher2005Attachment 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
Kettner, Mehlhorn, Pion, Schirra, Yap2006Reply 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.
Kratsch, McConnell, Mehlhorn, Spinrad2006Attachment 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
Krandick, Mehlhorn2006Attachment IconNew bounds for the Descartes method
In: Journal of Symbolic Computation [41], 49-66
Journal Article
mehlhorn06xMehlhorn, KurtMehlhorn2006Reliable 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
Abraham, Cechlárová, Manlove, Mehlhorn2005Pareto 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
Aronov, Asano, Katoh, Mehlhorn, Tokuyama2006Polyline 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
Mehlhorn, Michail2007Attachment IconImplementing Minimum Cycle Basis Algorithms
In: Journal of Experimental Algorithmics [11], 1-14
Electronic Journal Article
Mehlhorn2008aGarg, Naveen
Kavitha, T.
Kumar, Amit
Mehlhorn, Kurt
Mestre, Julián
Garg, Kavitha, Kumar, Mehlhorn, Mestre2008Attachment IconAssigning Papers to RefereesUnpublished/Draft
Mehlhorn2008bMehlhorn, Kurt
Kavitha, T.
Hariharan, R.
Mehlhorn, Kavitha, Hariharan2008Attachment IconFaster Deterministic and Randomized Algorithms for Minimum Cycle Basis in Directed Graphs
In: SIAM Journal of Computing [38], 1430-1447
Journal Article
MehlhornMFCS07Mehlhorn, KurtMehlhorn2007Attachment 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
Meyer, Wetzel2006Introducing 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
Meyer_Swat08Meyer, UlrichMeyer2008On Trade-Offs in External-Memory Diameter Approximation
In: Proc. 11th Scandinavian Workshop on Algorithm Theory (SWAT), xxx-yyyy
Proceedings Article
MeyZeh06Meyer, Ulrich
Zeh, Norbert
Meyer, Zeh2006I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths
In: Algorithms - ESA 2006, 14th Annual European Symposium, 540-551
Proceedings Article
Michail2006Michail, DimitriosMichail2006Attachment IconMinimum Cycle Basis, Algorithms & Applications
Universität des Saarlandes
Thesis - PhD thesis
MM05Mehlhorn, Kurt
Michail, Dimitrios
Mehlhorn, Michail2005Attachment IconImplementing Minimum Cycle Basis Algorithms
In: Experimental and Efficient Algorithms, 4th InternationalWorkshop, WEA 2005, 32-43
Proceedings Article
MM05aMehlhorn, Kurt
Michail, Dimitrios
Mehlhorn, Michail2005Attachment IconNetwork Problems with Non-Polynomial Weights and ApplicationsUnpublished/Draft
MM06Mehlhorn, Kurt
Michail, Dimitrios
Mehlhorn, Michail2006Attachment IconImplementing Minimum Cycle Basis Algorithms
In: ACM Journal of Experimental Algorithmics [11], 1-14
Electronic Journal Article
MortensenPettie2005Mortensen, Christian Worm
Pettie, Seth
Mortensen, Pettie2005The 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
Mehlhorn, Osbild, Sagraloff2006Attachment 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
Friedrich, He, Hebbinghaus, Neumann, Witt2007Approximating 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
Mustafa, Ray2007Attachment 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.
Ray, Mustafa2007Attachment 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
Althaus, Naujoks2006Attachment 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
NaujoksPhDNaujoks, RouvenNaujoks2008NP-hard Networking Problems - Exact and Approximate Algorithms
Universität des Saarlandes
Thesis - PhD thesis
NeuEul07Neumann, FrankNeumann2008Expected Runtimes of Evolutionary Algorithms for the Eulerian Cycle Problem
In: Computers and Operations Research [35], 2750-2759
Journal Article
NeuReiPPSN2008Neumann, Frank
Reichel, Joachim
Neumann, Reichel2008Approximating Minimum Multicuts by Evolutionary Multi-Objective Algorithms
In: Parallel Problem Solving from Nature (PPSN X), 72-81
Proceedings Article
NeuReiSku2008Neumann, Frank
Reichel, Joachim
Skutella, Martin
Neumann, Reichel, Skutella2008Computing Minimum Cuts by Randomized Search Heuristics
In: Genetic and Evolutionary Computation Conference 2008, 779-786
Proceedings Article
NeuSudWit2008Neumann, Frank
Sudholt, Dirk
Witt, Carsten
Neumann, Sudholt, Witt2008Rigorous Analyses for the Combination of Ant Colony Optimization and Local Search
In: International Conference on Ant Colony Optimization and Swarm Intelligence 2008, 132-143
Proceedings Article
NeuWegMST2007Neumann, Frank
Wegener, Ingo
Neumann, Wegener2007Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem
In: Theoretical Computer Science [378], 32-40
Journal Article
NeuWitLion2008Neumann, Frank
Witt, Carsten
Neumann, Witt2008Ant Colony Optimization and the Minimum Spanning Tree Problem
In: International Conference on Learning and Intelligent Optimization 2007, 153-166
Proceedings Article
NeuWittMST2006Neumann, Frank
Witt, Carsten
Neumann, Witt2006Ant Colony Optimization and the Minimum Spanning Tree ProblemReport
NewoDipl05Newo Kenmogne, RegisNewo Kenmogne2005Understanding LSI Via The Truncated Term-Term Matrix
Universität des Saarlandes
Thesis - Masters thesis
NSWSLS2007Neumann, Frank
Sudholt, Dirk
Witt, Carsten
Neumann, Sudholt, Witt2007Attachment 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
Hemmer, Hert, Kettner, Pion, Schirra2007Number Types, CGAL - Computational Geometry Algorithms Library, release 3.3Manual
OTO_ISAAC_2007Ajwani, Deepak
Friedrich, Tobias
Ajwani, Friedrich2007Average-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, KatarzynaPaluch2006Attachment 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
Xu, Wahl, Eeisenbrand, Karrenbauer, Soh, Hitzelberger2005Verfahren zur Ansteuerung von MatrixanzeigenMiscellaneous
Pettie-sensitivity2005Pettie, SethPettie2005Sensitivity Analysis of Minimum Spanning Trees in Sub-Inverse-Ackermann Time
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 964-973
Proceedings Article
Pettie2005Pettie, SethPettie2005Towards 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
Pettie, Sanders2005Computing Approximate Matchings in External Memory, Streaming, Parallel, and Distributed Network ModelsUnpublished/Draft
PhilipMScThesis2008Philip, GeevarghesePhilip2008Attachment IconFixed-Parameter Algorithms for Graph Problems Using Graph Minor Theory
Homi Bhabha National Institute
Thesis - Masters thesis
Pyrga2007Pyrga, Evangelia
Schulz, Frank
Wagner, Dorothea
Zaroliagis, Christos
Pyrga, Schulz, Wagner, Zaroliagis2007Efficient models for timetable information in public transportation systems
In: ACM Journal of Experimental Algorithmics [12], 1-39
Journal Article
Pyrga2008Pyrga, Evangelia
Ray, Saurabh
Pyrga, Ray2008New existence Proofs for epsilon-nets
In: Proceedings of the twenty-fourth annual symposium on Computational geometry, 199-207
Proceedings Article
PyrgaDipl05Pyrga, EvangeliaPyrga2005Shortest Paths in Time-Dependent Networks and their Applications
Universität des Saarlandes
Thesis - Masters thesis
RandCol2006Doerr, BenjaminDoerr2006Attachment IconNon-independent randomized rounding and coloring
In: Discrete Applied Mathematics [154], 650-659
Journal Article
RaufDiss04Rauf, ImranRauf2005Attachment IconEarliest Arrival Flows with Multiple Sources
Universität des Saarlandes
Thesis - Masters thesis
Reichel2005Eisenbrand, Friedrich
Funke, Stefan
Karrenbauer, Andreas
Reichel, Joachim
Schömer, Elmar
Eisenbrand, Funke, Karrenbauer, Reichel, Schömer2005Packing a Trunk - now with a Twist!
In: Proceedings SPM 2005 ACM Symposium on Solid and Physical Modeling, 197-206
Proceedings Article
RoundSmSub2006Doerr, BenjaminDoerr2006Attachment IconMatrix Rounding With Respect to Small Submatrices
In: Random Structures & Algorithms [28], 107-112
Journal Article
Same2005Beldiceanu, Nicolas
Katriel, Irit
Thiel, Sven
Beldiceanu, Katriel, Thiel2007Filtering 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
Hutchinson, Sanders, Vitter2005Duality 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.
Fotakis, Pagh, Sanders, Spirakis2005Space Efficient Hash Tables With Worst Case Constant Access Time
In: Theory of Computing Systems [38], 229-248
Journal Article
SanSte2005Sanders, Peter
Steurer, David
Sanders, Steurer2005An 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, SusanneSchmitt2005Attachment 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, DominikSchultes2005Fast and Exact Shortest Path Queries Using Highway Hierachies
Universität des Saarlandes
Thesis - Masters thesis
selection07Friedrich, Tobias
Hebbinghaus, Nils
Neumann, Frank
Friedrich, Hebbinghaus, Neumann2007Rigorous Analyses of Simple Diversity Mechanisms
In: Genetic and Evolutionary Computation Conference 2007, 1219-1225
Proceedings Article
SemKielDoerr, Benjamin
Gnewuch, Michael
Doerr, Gnewuch2006Construction of low-discrepancy point sets of small size by bracketing covers and dependent randomized roundingReport
setcover07Friedrich, Tobias
Hebbinghaus, Nils
Neumann, Frank
Friedrich, Hebbinghaus, Neumann2007Plateaus Can Be Harder in Multi-Objective Optimization
In: IEEE Congress on Evolutionary Computation 2007, 2622-2629
Proceedings Article
Sharma2008Sharma, VikramSharma2008Complexity of real root isolation using continued fractions
In: Theoretical Computer Science [409], 292-310
Electronic Journal Article
Sitters2005Sitters, ReneSitters2005Complexity 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
Elbassioni, Fishkin, Mustafa, Sitters2005Approximation 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
Bodlaender, Feremans, Grigoriev, Penninkx, Sitters, Wolle2006On 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
Feremans, Grigoriev, Sitters2006The 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
Sitters, Stougie2006The general two-server problem
In: Journal of the ACM [53], 437-458
Journal Article
Sitters2006cGrigoriev, Alexander
van Loon, Joyce
Sitters, Rene
Uetz, Marc
Grigoriev, van Loon, Sitters, Uetz2006How 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
Bartal, Leonardi, Shallom, Sitters2006On 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.
Katriel, Bodlaender2005Online Topological Ordering
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 443-450
Proceedings Article
stacs07_randDoerr, BenjaminDoerr2007Attachment 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
Seidel, Wolpert2005On 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
Schömer, Wolpert2006An 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
Doerr, Gnewuch, Hebbinghaus2006Attachment 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
Bast, Majumdar, Schenkel, Theobald, Weikum2006Attachment IconIO-Top-k: Index-Access Optimized Top-k Query ProcessingReport
unbiasmatr2006Doerr, Benjamin
Klein, Christian
Doerr, Klein2006Attachment IconUnbiased Rounding of Rational Matrices
In: FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science: 26th International Conference, 200-211
Proceedings Article
vanStee2008Epstein, Leah
van Stee, Rob
Epstein, van Stee2008Attachment IconThe price of anarchy on uniformly related machines revisited
In: Algorithmic Game Theory, First International Symposium, SAGT 2008, 46-57
Proceedings Article
vanStee2008aEpstein, Leah
van Stee, Rob
Epstein, van Stee2008Attachment IconMaximizing the minimum load for selfish agents
In: LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, 264-275
Proceedings Article
vanStee2008bvan Stee, Robvan Stee2008Attachment IconPacket Switching in Single Buffer
In: Encyclopedia of Algorithms, 1-99
Part of a Book
vanStee2008dvan Stee, Robvan Stee2008Attachment IconPaging
In: Encyclopedia of Algorithms, 1-99
Part of a Book
vanStee2008eEpstein, Leah
Levin, Asaf
van Stee, Rob
Epstein, Levin, van Stee2008Attachment IconTwo-dimensional packing with conflicts
In: Acta Informatica [45], 155-175
Journal Article
vanStee2008fKrumke, Sven Oliver
Schwahn, Anne
van Stee, Rob
Westphal, Stephan
Krumke, Schwahn, van Stee, Westphal2008Attachment IconA monotone approximation algorithm for scheduling with precedence constraints
In: Operations Research Letters [36], 247-249
Journal Article
vanStee2008gEpstein, Leah
Levin, Asaf
van Stee, Rob
Epstein, Levin, van Stee2008Attachment IconOnline unit clustering: Variations on a theme
In: Theoretical Computer Science [407], 85-96
Journal Article
vanStee2008hPruhs, Kirk
van Stee, Rob
Uthaisombut, Patchrawat
Pruhs, van Stee, Uthaisombut2008Attachment IconSpeed Scaling of Tasks with Precedence Constraints
In: Theory of Computing Systems [43], 67-80
Journal Article
vanStee2008ivan Stee, Robvan Stee2008Attachment IconCombinatorial algorithms for packing and scheduling problems
Universität Karlsruhe
Thesis - Habilitation thesis
vanStee2008jEpstein, Leah
van Stee, Rob
Epstein, van Stee2008Attachment IconApproximation schemes for packing splittable items with cardinality constraints
In: Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, 232-245
Proceedings Article
vanStee2008kEpstein, Leah
van Stee, Rob
Epstein, van Stee2008Attachment IconOn the Online Unit Clustering Problem
In: Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, 193-206
Proceedings Article
WadsCentroid07Ajwani, Deepak
Ray, Saurabh
Seidel, Raimund
Tiwary, Hans Raj
Ajwani, Ray, Seidel, Tiwary2007On 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
Wahlstroem2008Wahlström, MagnusWahlström2008A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances
In: 3rd International Workshop on Parameterized and Exact Computation (IWPEC 2008), 202-213
Proceedings Article
weberetal05airwebBifet, Albert
Castillo, Carlos
Chirita, Paul-Elexandru
Weber, Ingmar
Bifet, Castillo, Chirita, Weber2005An 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, IngmarWeber2007Attachment 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
Weikum, Bast, Canright, Hales, Schindelhauer, Triantafillou2007Towards 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
Weikum, Bast, Canright, Hales, Schindelhauer, Triantafillou2005Towards 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, CarolineWeinand2005Fill-in Reduction while Solving large, sparse Linear Systems with Graph Theoretical Methods
Universität des Saarlandes
Thesis - Masters thesis
XKSC2008Xu, Chihao
Karrenbauer, Andreas
Soh, Kian Min
Codrea, Cosmin
Xu, Karrenbauer, Soh, Codrea2008Consecutive multiline addressing: A scheme for addressing PMOLEDs
In: Journal of the Society for Information Display [16], 211-219
Journal Article
XKSW2007Xu, Chihao
Karrenbauer, Andreas
Soh, Kian Min
Wahl, Jürgen
Xu, Karrenbauer, Soh, Wahl2007A 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)