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: Download

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

FilenameSize (KB)Can be sorted ascendingAccessTypeAuthor(s) [non member]TitleYear
____FringeAnalysis.pdf158627Public
Journal ArticleEisenbarth, Bernhard
Ziviani, Nivio
Gonnet, Gaston H.
Mehlhorn, Kurt
Wood, Derick
The Theory of Fringe Analysis and Its Application to 2-3 Trees and B-Trees
In: Information and Control [55], 125-174
1982
wg02.ps372Public
Proceedings ArticleFotakis, Dimitris
[Nikoletseas, Sotiris]
[Papadopoulou, Vicky]
[Spirakis, Paul G.]
Radiocolorings in Periodic Planar Graphs: PSPACE-Completeness and Efficient Approximations for the Optimal Range of Frequencies
In: Graph-Theoretic Concepts in Computer Science : 28th International Workshop, WG 2002, 223-234
2002
WeberPhD.pdf1420Internal
Thesis - Doctoral dissertationWeber, IngmarEfficient Index Structures for and Applications of the CompleteSearch Engine
Universität des Saarlandes
2007
WAE04.pdf265Public
Proceedings Article[Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Khachiyan, Leonid]
An Efficient Implementation of a Joint Generation Algorithm
In: Experimental and efficient algorithms : Third International Workshop, WEA 2004, 114-128
2004
volume-fptas.pdf261Institute
Proceedings ArticleChang, Kevin
[Johnson, Aaron]
Online and offline selling in limit order markets
In: 4th International Workshop on Internet and Network Economics (WINE 2008), 41-52
2008
VanLeeuwen.ps196Public
ReportIncremental Computation and Dynamic Algorithms 02.05.-06.05.941994
v13i1r40.pdf119Public
Electronic Journal ArticleDoerr, Benjamin
[Gnewuch, Michael]
Hebbinghaus, Nils
Discrepancy of Symmetric Products of Hypergraphs
In: The Electronic Journal of Combinatorics [13], 1-12
2006
unitj3.pdf203Internal
Journal Article[Epstein, Leah]
van Stee, Rob
On the online unit clustering problem
In: ACM Transactions on Algorithms [7], 1-18
2010
unitj3.dvi77Public
Proceedings Article[Epstein, Leah]
van Stee, Rob
On the Online Unit Clustering Problem
In: Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, 193-206
2008
unitcard_jour2.pdf217Public
Journal Article[Epstein, Leah]
[Levin, Asaf]
van Stee, Rob
Online unit clustering: Variations on a theme
In: Theoretical Computer Science [407], 85-96
2008
unbiasmatr2006.pdf97
221
Internal
Internet Download forbidden
Proceedings ArticleDoerr, Benjamin
Klein, Christian
Unbiased Rounding of Rational Matrices
In: FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science: 26th International Conference, 200-211
2006
twothirds.ps160Public
Journal ArticlePettie, Seth
Sanders, Peter
A simpler linear time 2/3 - eps approximation for maximum weight matching
In: Information Processing Letters [91], 271-276
2004
twoapproxJ2.pdf150Internal
Journal Article[Christodoulou, George]
[Kovacs, Annamaria]
van Stee, Rob
A truthful constant approximation for maximizing the minimum load on related machines
In: Theoretical Computer Science [489-490], 88-98
2013
trunk-esa03.ps.gz338Public
Proceedings ArticleEisenbrand, Friedrich
Funke, Stefan
Reichel, Joachim
[Schömer, Elmar]
Packing a Trunk
In: Algorithms - ESA 2003: 11th Annual European Symposium, 618-629
2003
TowardBetterComputationModelsForModernMachines.pdf1242Public
Thesis - Doctoral dissertationJurkiewicz, TomaszToward Better Computation Models for Modern Machines
Universität des Saarlandes
2013
TOCS897.ps852Public
Journal ArticleFatourou, Panagiota
[Spirakis, Paul G.]
Efficient Scheduling of Strict Multithreaded Computations
In: Theory of Computing Systems [33], 173-232
2000
threshold-conditions.pdf244Public
Journal Article[Brown, Christopher]
El Kahoui, M'hammed
[Novotni, Dominik]
[Weber, Andreas]
Algorithmic methods for investigating equilibria in epidemic modeling
In: Journal of Symbolic Computation [41], 1157-1173
2006
thesis_final.pdf3225
Thesis - Master's thesisEmeliyanenko, PavelVisualization of Points and Segments of Real Algebraic Plane Curves
Universität des Saarlandes
2007
thesis.ps.gz128Public
Thesis - Master's thesisRauf, ImranEarliest Arrival Flows with Multiple Sources
Universität des Saarlandes
2005
thesis.pdf1112
Thesis - Doctoral dissertationMichail, DimitriosMinimum Cycle Basis, Algorithms & Applications
Universität des Saarlandes
2006
thesis.pdf1750Public
Thesis - Master's thesisLimbach, SebastianContinued Work on the Computation of an Exact Arrangement of Quadrics
Universität des Saarlandes
2008
swat-lncs.pdf336Public
Proceedings Article[Kim, Eun Jung]
[Paul, Christophe]
Philip, Geevarghese
A Single-exponential FPT Algorithm for the K4-Minor Cover Problem
In: Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops, 119-130
2012
SurveyCycleBases.pdf2395Public
Journal Article[Kavitha, T.]
[Liebchen, Ch.]
Mehlhorn, K.
Michail, D.
[Rizzi, R.]
[Ueckerdt, T.]
[Zweig, K.]
Cycle Bases in Graphs: Characterization, Algorithms, Complexity, and Applications
In: Computer Science Review [3], 199-243
2009
Sum_sqrroot.pdf257Internal
Proceedings Article[Kayal, Neeraj]
Saha, Chandan
On the Sum of Square Roots of Polynomials and Related Problems
In: 26th IEEE Conference on Computational Complexity (CCC), 292-299
2011
Sum_sqrroot.pdf270Internal
Journal Article[Kayal, Neeraj]
Saha, Chandan
On the Sum of Square Roots of Polynomials and Related Problems
In: The ACM Transactions on Computation Theory [4], 9:1-9:15
2012
Sums2APs_final.pdf131Public
ReportHebbinghaus, NilsDiscrepancy of Sums of two Arithmetic Progressions2007
subresultant.pdf174Intranet
Journal ArticleEl Kahoui, M'hammedAn elementary approach to subresultants theory
In: Journal of Symbolic Computation [35], 281-292
2003
subres-rational.pdf169Intranet
Journal ArticleEl Kahoui, M'hammedBirational properties of the gap subresultant varieties
In: Journal of Symbolic Computation [39], 61-71
2005
subres-der.pdf143Intranet
Journal ArticleEl Kahoui, M'hammedSubresultants and locally nilpotent derivations
In: Linear Algebra and its Applications [380], 253-261
2004
struc-grob.pdf191Public
Journal ArticleEl Kahoui, M'hammed
[Rakrak, Said]
Structure of Groebner bases with respect to block orders
In: Mathematics of Computation [76], 2181-2187
2007
strip53.pdf489Public
Proceedings ArticleHarren, Rolf
[Jansen, Klaus]
[Prädel, Lars]
van Stee, Rob
A (5/3 + ε)-Approximation for Strip Packing
In: Algorithms and Data Structures : 12th International Symposium, WADS 2011, 475-487
2011
SteinerTrees.pdf5530Public
Journal ArticleMehlhorn, KurtA faster approximation algorithm for the Steiner problem in graphs
In: Information Processing Letters [27], 125-128
1988
stacs07_rand.pdf444Internal
Internet Download forbidden
Proceedings ArticleDoerr, BenjaminRandomly Rounding Rationals with Cardinality Constraints and Derandomizations
In: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, 441-452
2007
stacs05.ps262Public
Proceedings ArticleBaswana, Surender
[Goyal, Vishrut]
[Sen, Sandeep]
All-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
2005
stacs04.ps370Public
Proceedings ArticleSchäfer, Guido
Sivadasan, Naveen
Topology matters: Smoothed competitiveness of metrical task systems
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 489-500
2004
stacs02.pdf219Public
Proceedings ArticleElbassioni, Khaled M.On Dualization in Products of Forests.
In: STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, 142-153
2002
sporadic-bms-algo.pdf354Public
Journal ArticleBonifaci, Vincenzo
[Marchetti-Spaccamela, Alberto]
[Stiller, Sebastian]
A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
In: Algorithmica [62], 1034-1049
2012
splitemj9.pdf115Public
Journal Article[Epstein, Leah]
van Stee, Rob
Improved results for a memory allocation problem
In: Theory of Computing Systems [48], 79-92
2011
spelling-variants.pdf305Public
Proceedings ArticleCelikik, Marjan
Bast, Holger
Fast Error-Tolerant Search on Very Large Texts
In: The 24th Annual ACM Symposium on Applied Computing, 1724-1731
2009
sparseFact.pdf304Internal
Electronic Journal ArticleSaha, Chandan
[Saptharishi, Ramprasad]
[Saxena, Nitin]
A Case of Depth-3 Identity Testing, Sparse Factorization and Duality
In: Computational Complexity [22], 39-69
2013
soda_submission2.pdf226Public
Proceedings Article[Bhaskar, Umang]
[Fleischer, Lisa]
[Hoy, Darrell]
Huang, Chien-Chung
Equilibria of Atomic Flow Games are not Unique
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 748-757
2009
soda.pdf189Public
Proceedings ArticleAlthaus, Ernst
Naujoks, Rouven
Computing Steiner Minimal Trees in Hamming Metric
In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06, 172-181
2006
SODA10_109_bonifaciv.pdf759Public
Proceedings ArticleBonifaci, Vincenzo
Chan, Ho-Leung
[Marchetti-Spaccamela, Alberto]
Megow, Nicole
Algorithms and Complexity for Periodic Real-Time Scheduling
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1350-1359
2010
snippets.pdf254Internal
Unpublished/DraftCelikik, Marjan
Bast, Holger
Manolache, Gabriel
Efficient Index-Based Snippet Generation2011
SICOMP.pdf244Intranet
Journal Article[Moehring, Rolf H.]
Skutella, Martin
[Stork, Frederik]
Scheduling with AND/OR Precedence Constraints
In: SIAM Journal on Computing [33], 393-415
2004
set-depth-D.pdf472Internal
Electronic Journal Article[Agrawal, Manindra]
Saha, Chandan
[Saxena, Nitin]
Quasi-polynomial Hitting-set for Set-depth-Delta Formulas
In: arXiv [abs/1209.2333], 1-13
2012
SearchingSemiSortedTables.pdf11026Public
Journal ArticleAlt, Helmut
Mehlhorn, Kurt
Searching Semisorted Tables
In: SIAM Journal on Computing [14], 840-848
1985
seal-1.0.tgz577
Thesis - Master's thesisClanget, UlrichPlattformunabhängiges Toolkit für Grafische Benutzerschnittstellen (GUI)
Universität des Saarlandes
1999
sdarticle.pdf399
379
Intranet
Internet Download forbidden
Journal Article[Bundy, David]
Hebbinghaus, Nils
[Stellmacher, Bernd]
The Local C(G,T) Theorem
In: Journal of Algebra [300], 741-789
2006
RR-xxxx.pdf223Public
Report[Emiris, Ioannis Z.]
Hemmer, Michael
[Karavelas, Menelaos]
[Mourrain, Bernard]
[Tsigaridas, Elias P.]
[Zafeirakopoulos, Zafeirakis]
Experimental evaluation and cross-benchmarking of univariate real solvers2008
RoutingGeneralizedSwitchbox.pdf20670Public
Journal ArticleKaufmann, Michael
Mehlhorn, Kurt
Routing through a Generalized Switchbox
In: Journal of Algorithms [7], 510-531
1986
RoundSmSub2006.pdf160
100
Intranet
Internet Download forbidden
Journal ArticleDoerr, BenjaminMatrix Rounding With Respect to Small Submatrices
In: Random Structures & Algorithms [28], 107-112
2006
RingRoutingFull.pdf230Internal
Proceedings Article[Chen, Xujin]
Doerr, Benjamin
[Hu, Xiaodong]
[Ma, Weidong]
van Stee, Rob
Winzen, Carola
The Price of Anarchy for Selfish Ring Routing is Two
In: Internet and Network Economics : 8th International Workshop, WINE 2012, 420-433
2012
RenamingHorn.pdf6826Public
Journal ArticleMannila, Heikki
Mehlhorn, Kurt
A fast algorithm for renaming a set of clauses as a Horn set
In: Information Processing Letters [21], 269-272
1985
remarks_on_category_based_routing.pdf477Internal
Unpublished/DraftBringmann, Karl
Mehlhorn, Kurt
Neumann, Adrian
Remarks on Category-Based Routing in Social Networks2012
RefereeAssignment.pdf271Public
Unpublished/Draft[Garg, Naveen]
[Kavitha, T.]
[Kumar, Amit]
Mehlhorn, Kurt
Mestre, Julián
Assigning Papers to Referees2008
rectangles.ps155Public
Unpublished/DraftElbassioni, Khaled M.
Mustafa, Nabil H.
Conflict-Free Colorings of Rectangle Ranges for Wireless Networks2005
recompression_DLT.pdf436Internal
Proceedings ArticleJez, ArturRecompression: Word Equations and Beyond
In: 17th International Conference on Developments in Language Theory (DLT 2013), 12-26
2013
recfillingJ.pdf177Public
Proceedings Articlevan Stee, RobAn improved algorithm for online rectangle filling
In: Approximation and Online Algorithms : 8th International Workshop, WAOA 2010, 249-260
2011
recfillingJ2.pdf193Internal
Journal Articlevan Stee, RobAn improved algorithm for online rectangle filling
In: Theoretical Computer Science [423], 59-74
2012
RandomizedIncrementalAbstractVD.pdf1729Public
Journal ArticleKlein, Rolf
Mehlhorn, Kurt
Meiser, Stefan
Randomized incremental construction of abstract Voronoi diagrams
In: Computational Geometry: Theory and Applications [3], 157-184
1993
RandCol2006.pdf218
207
Intranet
Internet Download forbidden
Journal ArticleDoerr, BenjaminNon-independent randomized rounding and coloring
In: Discrete Applied Mathematics [154], 650-659
2006
RadioESA03long.ps.gz262Public
Proceedings ArticleFunke, Stefan
Matijevic, Domagoj
Sanders, Peter
Approximating Energy Efficient Paths in Wireless Multi-hop Networks
In: Algorithms - ESA 2003: 11th Annual European Symposium, 230-241
2003
pwone.pdf444Public
Proceedings ArticlePhilip, Geevarghese
[Raman, Venkatesh]
[Villanger, Yngve]
A Quartic Kernel for Pathwidth-One Vertex Deletion
In: Graph Theoretic Concepts in Computer Science - 36th International Workshop, WG 2010, Zar\'os, Crete, Greece, June 28-30, 2010 Revised Papers, 196-207
2010
published.pdf594Public
Electronic Proceedings ArticleMnich, Matthias
Philip, Geevarghese
[Saurabh, Saket]
[Suchy, Ondrej]
Beyond Max-Cut: lambda-Extendible Properties
Parameterized Above the Poljak-Turzík Bound
In: 32nd International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012), 412-423
2012
public.pdf165
209
MPG
Proceedings ArticleDoerr, Benjamin
Friedrich, Tobias
Klein, Christian
Osbild, Ralf
Rounding of Sequences and Matrices, with Applications
In: Third Workshop on Approximation and Online Algorithms (WAOA 2005), 96-109
2005
precede-j5.ps247Public
Journal Article[Pruhs, Kirk]
van Stee, Rob
[Uthaisombut, Patchrawat]
Speed Scaling of Tasks with Precedence Constraints
In: Theory of Computing Systems [43], 67-80
2008
ppl.ps221Intranet
Journal Article[Boros, Endre]
Elbassioni, Khaled M.
[Khachiyan, Leonid]
[Gurvich, Vladimir]
An Efficient Incremental Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension
In: Parallel Processing Letters [10], 14
2000
poa-sagt.dvi60Public
Proceedings Article[Epstein, Leah]
van Stee, Rob
The price of anarchy on uniformly related machines revisited
In: Algorithmic Game Theory, First International Symposium, SAGT 2008, 46-57
2008
poa-ic5.pdf177Internal
Journal Article[Epstein, Leah]
van Stee, Rob
The price of anarchy on uniformly related machines revisited
In: Information and Computation [212], 37-54
2012
PhD_Thesis_Johannsen.pdf1375
1375
Public
Thesis - Doctoral dissertationJohannsen, DanielRandom combinatorial structures and randomized search heuristics
Universität des Saarlandes
2010
patternClustering.pdf448Public
Proceedings Article[Bredereck, Robert]
[Nichterlein, Andr{\'e}]
[Niedermeier, Rolf]
Philip, Geevarghese
Pattern-Guided Data Anonymization and Clustering
In: Mathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011. Proceedings, 182-193
2011
PartialMatchRetrieval.pdf8301Public
Journal ArticleAlt, Helmut
Mehlhorn, Kurt
Munro, J. Ian
Partial match retrieval in implicit data structures
In: Information Processing Letters [19], 61-65
1984
paramet.pdf158Public
MiscellaneousEl Kahoui, M'hammedPolynomial parametrization of nonsingular algebraic curves2008
paper.ps245Public
Journal Article[Adler, Micah]
[Räcke, Harald]
Sivadasan, Naveen
[Sohler, Christian]
Vöcking, Berthold
Randomized Pursuit-Evasion in Graphs
In: Combinatorics, Probability and Computing [12], 225-244
2003
paper.pdf97
221
Internal
Internet Download forbidden
Proceedings ArticleDoerr, Benjamin
Klein, Christian
Unbiased Rounding of Rational Matrices
In: FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science: 26th International Conference, 200-211
2006
paper.pdf116Public
Proceedings ArticleElmasry, AmrPairing Heaps with O(log log n) decrease Cost
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 471-476
2009
paper.pdf138Public
ReportElmasry, AmrViolation Heaps: A Better Substitute for Fibonacci Heaps2008
Paper.pdf686Public
Proceedings ArticleHarren, RolfApproximating the Orthogonal Knapsack Problem for Hypercubes
In: Automata, Languages and Programming, 238-249
2006
paper.pdf750Public
Proceedings ArticleEmeliyanenko, PavelHigh-performance polynomial GCD computations on graphics processors
In: Proceedings of the 2011 International Conference on High Performance Computing & Simulation (HPCS 2011), 215-224
2011
paper.pdf1185Public
Proceedings ArticleFunke, Stefan
Klein, Christian
Hole Detection or: "How Much Geometry Hides in Connectivity?"
In: Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06, 377-385
2006
paper.pdf2631Public
Proceedings ArticleEmeliyanenko, Pavel
Berberich, Eric
Sagraloff, Michael
Visualizing Arcs of Implicit Algebraic Curves, Exactly and Fast
In: Advances in Visual Computing : 5th International Symposium, ISVC 2009, 608-619
2009
paper-2.pdf330Internal
Proceedings Article[Heydrich, Sandy]
van Stee, Rob
Dividing connected chores fairly
In: 6th International Symposium on Algorithmic Game Theory, 420-433
2013
paging.dvi10Public
Part of a Bookvan Stee, RobPacket Switching in Single Buffer
In: Encyclopedia of Algorithms, 1-99
2008
paging.dvi10Public
Part of a Bookvan Stee, RobPaging
In: Encyclopedia of Algorithms, 1-99
2008
pagesets-j3.pdf168Public
Journal Article[Epstein, Leah]
van Stee, Rob
[Tamir, Tami]
Paging with request sets
In: Theory of Computing Systems [44], 67-81
2009
p66-fleischer.pdf1012Intranet
Proceedings Article[Fleischer, Lisa]
Skutella, Martin
Minimum Cost Flows Over Time without Intermediate Storage
In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 66-75
2003
p51-houari.pdf145Public
Proceedings ArticleEl Kahoui, M'hammedAlgorithms for recognizing coordinates in two variables over UFD's
In: Proceedings of the 2004 International Symposium Symbolic and Algebraic Computation (ISSAC-04), 135-140
2004
p35-emeliyanenko-1.pdf456Public
Proceedings ArticleEmeliyanenko, PavelA complete modular resultant algorithm targeted for realization on graphics hardware
In: PASCO '10 : Proceedings of the 4th International Workshop on Parallel and Symbolic Computation, 35-43
2010
p213-ahuja.pdf932Priviledged Users
Journal ArticleAhuja, Ravindra K.
Mehlhorn, Kurt
Orlin, James B.
Tarjan, Robert E.
Faster algorithms for the shortest path problem
In: Journal of the ACM [37], 213-223
1990
p15-kesselman.pdf401Internal
Internet Download forbidden
Journal ArticleKesselman, Alexander
Kowalski, Dariusz
[Segal, Michael]
Energy 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
2005
oscm-kemeny.pdf445Public
Proceedings Article[Fernau, Henning]
[Fomin, Fedor V.]
[Lokshtanov, Daniel]
[Mnich, Matthias]
Philip, Geevarghese
[Saurabh, Saket]
Ranking and Drawing in Subexponential Time
In: Combinatorial Algorithms - 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers,
2011
oracle.ps269Public
Proceedings ArticleBaswana, Surender
[Sen, Sandeep]
Approximate distance oracle for unweighted graphs in Expected O(n²) time
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 271-280
2004
online-jobs.pdf103Public
Part of a Book[Krumke, Sven]
van Stee, Rob
[Westphal, Stefan]
Online job admissions
In: Fundamental Problems in Computing : Essays in Honor of Professor Daniel J. Rosenkrantz, 435-454
2009
online-bin-and-strip-packing.pdf610Internal
Journal Articlevan Stee, RobSIGACT News Online Algorithms Column 20: The Power of Harmony
In: SIGACT News [43], 127-136
2012
onevar_submission.pdf413Internal
Proceedings ArticleJez, ArturOne-Variable Word Equations in Linear Time
In: 40th International Colloquium on Automata, Languages, and Programming (ICALP 2013), 324-335
2013
onefix.ps212
Proceedings ArticleMutzel, Petra
Weiskircher, René
Two-Layer Planarization in Graph Drawing
In: Proceedings of the 9th International Symposium on Algorithms and Computation (ISAAC-98), 69-78
1998
oms.ps318Public
Electronic Journal Article[Boros, Endre]
Elbassioni, Khaled M.
[Khachiyan, Leonid]
[Gurvich, Vladimir]
Generating Dual-Bounded Hypergraphs
In: Optimization Methods and Software [17], 33
2002
[Replication or Save Conflict]
nowait-full.pdf534Internal
Proceedings Article[Epstein, Leah]
[Jez, Lukasz]
[Sgall, Jiri]
van Stee, Rob
Online Scheduling of Jobs with Fixed Start Times on Related Machines
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 15th International Workshop, APPROX 2012 and 16th International Workshop, RANDOM 2012, 134-145
2012
Neumann.pdf543Internal
Proceedings ArticleNeumann, Frank
[Sudholt, Dirk]
[Witt, Carsten]
Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions
In: Engineering Stochastic Local Search Algorithms 2007, 61-75
2007
networkpos.dvi73Priviledged Users
Proceedings ArticleChristodoulou, George
[Chung, Christine]
[Ligett, Katrina]
Pyrga, Evangelia
van Stee, Rob
On the price of stability for undirected network design
In: Approximation and Online Algorithms : 7th International Workshop, WAOA 2009, 86-97
2010
NaRa07.pdf110Internal
Internet Download forbidden
Proceedings ArticleMustafa, Nabil H.
[Ray, Saurabh]
An Optimal Generalization of the Centerpoint Theorem, and its Extensions
In: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07), 138-141
2007
NaRa07b.pdf141Internal
Internet Download forbidden
Proceedings Article[Ray, Saurabh]
Mustafa, Nabil H.
Weak $\epsilon$-nets have a basis of size $O(1/\epsilon\log 1/\epsilon)$ in any dimension
In: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07), 239-244
2007
MScThesis.pdf587Public
Thesis - Master's thesisPhilip, GeevargheseFixed-Parameter Algorithms for Graph Problems Using Graph Minor Theory
Homi Bhabha National Institute
2008
mprecede.dvi22Public
Journal Article[Krumke, Sven Oliver]
[Schwahn, Anne]
van Stee, Rob
[Westphal, Stephan]
A monotone approximation algorithm for scheduling with precedence constraints
In: Operations Research Letters [36], 247-249
2008
MPI-I-2004-1-006.ps137Public
ReportChandran, L. Sunil
Sivadasan, Naveen
On the Hadwiger's Conjecture for Graph Products2004
MPI-I-2004-1-005.ps262Public
ReportSchmitt, Susanne
Fousse, Laurent
A comparison of polynomial evaluation schemes2004
MPI-I-2004-1-004.pdf188Public
ReportSivadasan, Naveen
Sanders, Peter
Skutella, Martin
Online Scheduling with Bounded Migration2004
MPI-I-2004-1-003.ps238Public
ReportKatriel, IritOn Algorithms for Online Topological Ordering and Sorting2004
MPI-I-2004-1-002.ps212Public
ReportSanders, Peter
Pettie, Seth
A Simpler Linear Time 2/3 - epsilon Approximation for Maximum
Weight Matching
2004
MPI-I-2004-1-001.ps490Public
ReportBeldiceanu, Nicolas
Katriel, Irit
Thiel, Sven
Filtering algorithms for the Same and UsedBy constraints2004
monotone_PTAS_SODA_proceedings.pdf154Public
Proceedings Article[Epstein, Leah]
[Levin, Asaf]
van Stee, Rob
A unified approach to truthful scheduling on related machines
In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, 1243-1252
2013
mlcp_waoa05.pdf172Public
Proceedings Article[Ahuja, Nitin]
[Baltz, Andreas]
Doerr, Benjamin
[Privetivy, Ales]
[Srivastav, Anand]
On the Minimum Load Coloring Problem
In: Third Workshop on Approximation and Online Algorithms (WAOA 2005), 15-26
2005
mkerber_diplom.pdf2261
Thesis - Master's thesisKerber, MichaelAnalysis of Real Algebraic Plane Curves
Universität des Saarlandes
2006
mixedcritical-esa.pdf311Public
Proceedings Article[Baruah, Sanjoy]
Bonifaci, Vincenzo
[D'Angelo, Gianlorenzo]
[Marchetti-Spaccamela, Alberto]
[van der Ster, Suzanne]
[Stougie, Leen]
Mixed-criticality scheduling of sporadic task systems
In: Algorithms - ESA 2011 : 19th Annual European Symposium, 555-566
2011
MFCS2007.pdf108Internal
Proceedings ArticleMehlhorn, KurtMinimum Cycle Bases in Graphs Algorithms and Applications
In: Mathematical Foundations of Computer Science 2007 : 32nd International Symposium, MFCS 2007, 13-14
2007
MFCS04.pdf230Public
Proceedings Article[Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Khachiyan, Leonid]
[Makino, Kazuhisa]
Generating Paths and Cuts in Multi-pole (Di)graphs
In: Mathematical foundations of computer science 2004 : 29th International Symposium, MFCS 2004, 298-309
2004
mfcs04.pdf239
224
Intranet
Internet Download forbidden
Journal ArticleDoerr, Benjamin
Hebbinghaus, Nils
[Werth, Sören]
Improved Bounds and Schemes for the Declustering Problem
In: Theoretical Computer Science [359], 123-132
2006
mfcs03.ps.gz291
129
157
Intranet
Proceedings ArticleBanderier, Cyril
Beier, Rene
Mehlhorn, Kurt
Smoothed Analysis of Three Combinatorial Problems
In: Mathematical foundations of computer science 2003 : 28th International Symposium, MFCS 2003, 198-207
2003
mfcs02.ps315Public
Proceedings Article[Andreou, Maria]
Fotakis, Dimitris
[Nikoletseas, Sotiris]
[Papadopoulou, Vicky]
[Spirakis, Paul G.]
On Radiocoloring Hierarchically Specified Planar Graphs: PSPACE-Completeness and Approximations
In: Mathematical Foundations of Computer Science 2002 : 27th International Symposium, MFCS 2002, 81-92
2002
MFCS02.pdf186Public
Proceedings Article[Boros, Endre]
Elbassioni, Khaled M.
[Khachiyan, Leonid]
[Gurvich, Vladimir]
Matroid Intersections, Polymatroid Inequalities, and Related Problems
In: Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, 143-154
2002
Mehlhron175TALG.pdf339Intranet
Journal Article[Kavitha, Telikepalli]
Mehlhorn, Kurt
Michail, Dimitrios
[Paluch, Katarzyna E.]
Strongly stable matchings in time O(nm) and extension to the hospitals-residents problem
In: ACM Transactions on Algorithms [3], 15.1-15.18
2007
Mehlhorn_SFB_A_84_12.pdf11384Public
Report[Kaufmann, Michael]
[Mehlhorn, Kurt]
Local routing of two-terminal nets is easy1984
Mehlhorn_SFB_A_84_07.pdf13516Public
ReportBecker, Michael
Mehlhorn, Kurt
Algorithms for routing in planar graphs1984
Mehlhorn_SFB_A_84_02.pdf51488Public
Report[Hertel, Stefan]
[Mehlhorn, Kurt]
[Mäntylä, Martti]
[Nievergelt, Jurg]
Space sweep solves intersection of two convex polyhedra elegantly1984
Mehlhorn_SFB_A_83_04-1.pdf6251Public
ReportLengauer, Thomas
Mehlhorn, Kurt
The HILL System: A Design Environment for the Hierarchical Specification, Compaction, and Simulation of Integrated Circuit Layouts1983
Mehlhorn_SFB_A_03_89.pdf11094Public
Report[Klein, R.]
Mehlhorn, Kurt
[Meiser, Stefan]
On the construction of abstract Voronoi diagrams, II.1989
Mehlhorn_SFB_A_02_90-1.pdf9450Public
ReportMehlhorn, Kurt
Näher, Stefan
Uhrig, Christian
Hidden line elimination for isooriented rectangles1990
Mehlhorn_SFB_A_02_89.pdf40715Public
ReportMehlhorn, Kurt
Tsakalidis, Athanasios K.
Data structures1989
Mehlhorn_SFB_A_02_87.pdf9824Public
Report[Alt, Helmut]
Mehlhorn, Kurt
[Wagener, Hubert]
[Welzl, Emo]
Congruence, similarity and symmetries of geometric objects1987
Mehlhorn_SFB_A_01_89.pdf8777Public
ReportMehlhorn, Kurt
Meiser, Stefan
O'Dunlaing, Colm
On the construction of abstract Voronoi diagrams1989
Mehlhorn_SFB_124.pdf13674Public
ReportKaufmann, Michael
Mehlhorn, Kurt
Routing through a generalized switchbox1984
Mehlhorn_a_2006_e.pdf492Public
Journal Article[Krandick, Werner]
Mehlhorn, Kurt
New bounds for the Descartes method
In: Journal of Symbolic Computation [41], 49-66
2006
Mehlhorn_a_2006_d.pdf179Intranet
Journal ArticleBast, Holger
Mehlhorn, Kurt
Schäfer, Guido
[Tamaki, Hisao]
Matching Algorithms are Fast in Sparse Random Graphs
In: Theory of Computing Systems [39], 3-14
2006
Mehlhorn_a_2005_o.pdf189Public
Proceedings ArticleKaligosi, Kanela
Mehlhorn, Kurt
[Munro, J. Ian]
[Sanders, Peter]
Towards Optimal Multiple Selection
In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, 103-114
2005
Mehlhorn_a_2005_a.pdf104
238
Previledged Users
Internet Download forbidden
Proceedings ArticleEigenwillig, Arno
Kettner, Lutz
[Krandick, Werner]
Mehlhorn, Kurt
Schmitt, Susanne
Wolpert, Nicola
A Descartes algorithm for polynomials with bit-stream coefficients
In: Computer Algebra in Scientific Computing : 8th International Workshop, CASC 2005, 138-149
2005
Mehlhorn_a_2004_c_polyadj.ps252Public
Unpublished/DraftKonidaris, G.
Mehlhorn, Kurt
Shell, D.A.
An optimal algorithm for finding edge segment adjacencies in configurations of convex polygons2004
Mehlhorn_a_2003_j.pdf151
324
Intranet
Journal ArticleMehlhorn, Kurt
Sanders, Peter
Scanning Multiple Sequences via Cache Memory
In: Algorithmica [35], 75-93
2003
Mehlhorn_a_2003_e.pdf981
263
Public
Proceedings ArticleKratsch, Dieter
McConnell, Ross
Mehlhorn, Kurt
Spinrad, Jeremy P.
Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs
In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 158-167
2003
Mehlhorn_a_2001_j.pdf622
576
Public
Journal ArticleAlthaus, Ernst
Mehlhorn, Kurt
Traveling Salesman-Based Curve Reconstruction in Polynomial Time
In: SIAM Journal on Computing [31], 27-66
2001
Mehlhorn_a_2001_g.pdf120Intranet
Part of a BookMehlhorn, KurtFrom Algorithm to Program to Software Library
In: Informatics : 10 years back, 10 years ahead, 268-273
2001
Mehlhorn_a_2001_d_Descartes.ps159Public
Unpublished/DraftMehlhorn, KurtA Remark on the Sign Variation Method for Real Root Isolation2001
Mehlhorn_a_1999_j.pdf220
262
Public
Proceedings ArticleCrauser, Andreas
Mehlhorn, Kurt
LEDA-SM : Extending LEDA to Secondary Memory
In: Algorithm engineering (WAE-99) : 3rd International Workshop, WAE'99, 228-242
1999
Mehlhorn_a_1999_b.pdf387
186
Intranet
Journal Article[Cheriyan, Joseph]
Mehlhorn, Kurt
An analysis of the highest-level selection rule in the preflow-push max-flow algorithm
In: Information Processing Letters [69], 239-242
1999
Mehlhorn_a_1999_a.pdf59
152
Public
Journal Article[Arikati, Srinivasa Rao]
Mehlhorn, Kurt
A correctness certificate for the Stoer-Wagner min-cut algorithm
In: Information Processing Letters [70], 251-254
1999
Mehlhorn_a_1998_f.pdf514Public
Proceedings ArticleMehlhorn, Kurt
Näher, Stefan
From Algorithms to Working Programs: On the Use of Program Checking in LEDA
In: Mathematical foundations of computer science (MFCS-98) : 23rd international symposium, 84-93
1998
Mehlhorn_a_1996_b.pdf300Public
Journal Article[Alt, Helmut]
[Guibas, L.]
Mehlhorn, Kurt
[Karp, Richard M.]
[Wigderson, A.]
A Method for Obtaining Randomized Algorithms with Small Tail Probabilities
In: Algorithmica [16], 543-547
1996
Mehlhorn_a_1994_g.pdf16Public
Journal ArticleMehlhorn, Kurt
Näher, Stefan
Nievergelt, Jurg
Introduction
In: Journal of Symbolic Computation [17], 295-295
1994
Mehlhorn_a_1991_a.pdf1001Public
ReportAlt, Helmut
Guibas, L.
Mehlhorn, Kurt
Karp, Richard M.
Wigderson, A.
A Method for Obtaining Randomized Algorithms with Small Tail Probabilities1991
Mehlhorn_a_1988_m.pdf666Public
Proceedings ArticleGao, Shaodi
Jerrum, Mark
Kaufmann, Michael
Mehlhorn, Kurt
Rülling, Wolfgang
On Continuous Homotopic One Layer Routing
In: Computational geometry (SCG-88) : 4th symposium, 392-402
1988
Mehlhorn_a_1986_n.pdf1709Public
Journal ArticleMehlhorn, Kurt
Preparata, F. P.
Routing through a Rectangle
In: Journal of the ACM [33], 60-85
1986
Mehlhorn_a_1984_p.pdf949Public
Journal ArticleHertel, Stefan
Mäntylä, Martti
Mehlhorn, Kurt
Nievergelt, Jurg
Space Sweep Solves Intersection of Convex Polyhedra
In: Acta Informatica [21], 501-519
1984
Mehlhorn_a_1983_f.pdf1069Public
Journal ArticleHong, Jia-Wei
Mehlhorn, Kurt
Rosenberg, Arnold L.
Cost Trade-offs in Graph Embeddings, with Applications
In: Journal of the ACM [30], 709-728
1983
Mehlhorn_a_1980_d.pdf691Public
Journal ArticleAltenkamp, Doris
Mehlhorn, Kurt
Codes: Unequal Probabilities, Unequal Letter Cost
In: Journal of the ACM [27], 412-427
1980
Mehlhorn_a_1979_j.pdf198Public
Journal ArticleMehlhorn, KurtSome Remarks on Boolean Sums
In: Acta Informatica [12], 371-375
1979
Mehlhorn_a_1979_b.pdf2354Public
Journal ArticleMehlhorn, KurtDynamic Binary Search
In: SIAM Journal on Computing [8], 175-198
1979
Mehlhorn_a_1977_a.pdf363Public
Journal ArticleMehlhorn, KurtA best possible bound for the weighted path length of binary search trees
In: SIAM Journal on Computing [6], 235-239
1977
Mehlhorn_a_1976_j.pdf651Public
Journal ArticleMehlhorn, Kurt
Galil, Zvi
Monotone Switching Circuits and Boolean Matrix Product
In: Computing [16], 99-111
1976
Mehlhorn_a_1976_d.pdf293Public
Journal ArticleDeussen, Peter
Mehlhorn, Kurt
Van Wijngaarden Grammars and Space Complexity Class EXSPACE
In: Acta Informatica [8], 193-199
1977
Mehlhorn_a_1975_f.pdf329Public
Journal ArticleMehlhorn, KurtNearly Optimal Binary Search Trees
In: Acta Informatica [5], 287-295
1975
Mehlhorn_a_1975_b.pdf97Public
Journal ArticleAlt, Helmut
Mehlhorn, Kurt
A Language over a One Symbol Alphabet Requiring only O(log log n) Space
In: SIGACT News [7], 31-33
1975
Mehlhorn_a_1974_a.pdf683Public
Proceedings ArticleMehlhorn, KurtPolynomial and Abstract Subrecursive Classes
In: Conference Record of Sixth Annual ACM Symposium on Theory of computing (STOC-74), 96-109
In: Informatik Spektrum, 96-109
1974
Mehlhorn_a_1974_a.pdf683Public
Thesis - Doctoral dissertationMehlhorn, KurtPolynomial and abstract subrecursive classes
Cornell University
1974
Mehlhorn_2007_a_m.pdf462Public
Proceedings Article[Kavitha, Telikepalli]
Mehlhorn, Kurt
Michail, Dimitrios
New Approximation Algorithms for Minimum Cycle Bases of Graphs
In: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, 512-523
2007
Mehlhorn_2006_a_m.pdf231Public
Proceedings Article[Hariharan, Ramesh]
[Telikepalli, Kavitha]
Mehlhorn, Kurt
A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs
In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Part I, 250-261
2006
Mehlhorn_1976_f_m.pdf699Public
Journal ArticleMehlhorn, KurtBracket-languages are recognizable in logarithmic space
In: Information Processing Letters [5], 168-170
1976
Mehlhorn_1976_b_m.pdf319Public
Journal ArticleMehlhorn, KurtAn Improved Lower Bound on the Formula Complexity of Context-Free Recognition
In: Elektronische Informationsverarbeitung und Kybernetik [12], 523-524
1976
Mehlhorn_1974_d_m.pdf4763Public
Proceedings ArticleMehlhorn, KurtThe 'almost all' theory of subrecursive degrees is decidable
In: Automata, languages and programming : 2nd colloquium (ICALP-74), 317-325
1974
Mehlhorn_1973_a_m.pdf6094Public
Proceedings ArticleMehlhorn, KurtOn the Size of Sets of Computable Functions
In: 14th Annual Symposium on Switching & Automata Theory (SSAT-73), 190-196
1973
Mehlhorn_159.pdf271
3265
Public
Proceedings ArticleMehlhorn, Kurt
Ziegelmann, Mark
CNOP - A Package for Constrained Network Optimization
In: Algorithm engineering and experimentation (ALENEX-01) :Third International Workshop ALENEX 2001 ; revised papers, 17-31
2001
Mehlhorn.pdf580Priviledged Users
Proceedings ArticleMehlhorn, KurtPebbling Mountain Ranges and its Application of DCFL-Recognition
In: Automata, languages and programming (ICALP-80) : 7th annual international colloquium, 422-435
1980
MehlhornXXX.pdf166Intranet
Journal ArticleFunke, Stefan
Mehlhorn, Kurt
Näher, Stefan
Structural filtering: a paradigm for efficient and exact geometric programs
In: Computational Geometry [31], 179-194
2005
Mehlhorn98.pdf830Intranet
Journal Article[Dietz, Paul]
Mehlhorn, Kurt
[Raman, Rajeev]
Uhrig, Christian
Lower bounds for set intersection queries
In: Algorithmica [14], 154-168
1995
Mehlhorn95.pdf87Intranet
Journal ArticleAlt, Helmut
Geffert, Viliam
Mehlhorn, Kurt
A lower bound for the nondeterministic space complexity of context-free recognition
In: Information Processing Letters [42], 25-27
1992
Mehlhorn93.pdf1632Intranet
Journal ArticleBaumgarten, Hanna
Jung, Hermann
Mehlhorn, Kurt
Dynamic point location in general subdivisions
In: Journal of Algorithms [3], 342-380
1994
Mehlhorn92.pdf2036Intranet
Journal ArticleClarkson, Kenneth L.
Mehlhorn, Kurt
Seidel, Raimund
Four Results on Randomized Incremental Constructions
In: Computational Geometry: Theory and Applications [3], 185-212
1993
Mehlhorn91.pdf711Intranet
Journal ArticleMehlhorn, Kurt
Sharir, Micha
Welzl, Emo
Tail Estimates for the Efficiency of Randomized Incremental Algorithms for Line Segment Intersection
In: Computational Geometry: Theory and Applications [3], 235-246
1993
Mehlhorn90.pdf2928Intranet
Journal ArticleAlt, Helmut
Blum, Norbert
Mehlhorn, Kurt
Paul, Markus
Computing a maximum cardinality matching in a bipartite graph in time $O(n^1.5 \sqrtm/\log n)$
In: Information Processing Letters [37], 237-240
1991
Mehlhorn7.pdf4483Public
Journal ArticleMehlhorn, KurtPolynomial and abstract subrecursive classes
In: Journal of Computer and System Sciences [12], 147-178
1976
Mehlhorn74.pdf2606Intranet
Journal Article[Dietzfelbinger, Martin]
[Karlin, Anna]
Mehlhorn, Kurt
[Meyer Auf Der Heide, Friedhelm]
[Rohnert, Hans]
[Tarjan, Robert E.]
Dynamic Perfect Hashing: Upper and Lower Bounds
In: SIAM Journal on Computing [23], 738-761
1994
Mehlhorn72.pdf947Public
Journal ArticleMehlhorn, Kurt
Rülling, W.
Compaction on the torus
In: IEEE Transactions on CAD of Integrated Circuits and Systems [9], 389-397
1990
Mehlhorn65.pdf19978Priviledged Users
Journal ArticleMehlhorn, Kurt
Preparata, Franco P.
Area-Time Optimal Division for $T=\Omega((\log n)^1+\epsilon)$
In: Information and Computation [72], 270-282
1987
Mehlhorn62.pdf29880Public
Part of a BookLengauer, Thomas
Mehlhorn, Kurt
VLSI complexity, efficient VLSI algorithms and the HILL design system
In: Algorithmics for VLSI, 33-89
1986
Mehlhorn59.pdf8913Public
Journal ArticleMehlhorn, KurtÜber Verdrahtungsalgorithmen
In: Informatik Spektrum [9], 227-234
1986
Mehlhorn53.pdf635Intranet
Journal ArticleBecker, Michael
Mehlhorn, Kurt
Algorithms for Routing in Planar Graphs
In: Acta Informatica [23], 163-176
1986
Mehlhorn49.pdf697Intranet
Proceedings ArticleMehlhorn, Kurt
Tsakalidis, Athanasios K.
Dynamic Interpolation Search
In: Automata, languages and programming (ICALP-85) : 12th international colloquium, 424-434
1985
Mehlhorn48.pdf384Intranet
Proceedings ArticleMehlhorn, Kurt
Simon, Klaus
Intersecting two polyhedra one of which is convex
In: FCT '85: Fundamentals of Computation Theory, 534-542
1985
Mehlhorn43.pdf10760Public
Proceedings ArticleLengauer, Thomas
Mehlhorn, Kurt
The HILL system: A design environment for the hierarchical spezification, compaction, and simulation of integrated circuit layouts
In: Proceedings, Conference on Advanced Research in VLSI, 139-149
1984
Mehlhorn39.pdf36608Priviledged Users
Journal ArticleMehlhorn, Kurt
Preparata, Franco P.
Area-Time Optimal VLSI Integer Mutliplier with Minimum Computation Time
In: Information and Control [58], 137-156
1983
mehlhorn34.pdf2693Public
Journal ArticleBecker, Michael
Degenhardt, W.
Doenhardt, J.
Hertel, S.
Kaninke, G.
Kerber, W.
Mehlhorn, Kurt
Näher, Stefan
Rohnert, H.
Winter, T.
A Probabilistic Algorithm for Vertex Connectivity of Graphs
In: Information Processing Letters [15], 135-136
1982
Mehlhorn33.pdf4437
5919
Intranet
Proceedings ArticleMehlhorn, KurtOn the Program Size of Perfect and Universal Hash Functions
In: 23th Annual Symposium on Foundations of Computer Science (FOCS 1982), 170-175
1982
Mehlhorn30.pdf14991Intranet
Journal ArticleMehlhorn, KurtA Partial Analysis of Height-Balanced Trees Under Random Insertions and Deletions
In: SIAM Journal on Computing [11], 748-760
1982
Mehlhorn29.pdf20820Intranet
Journal ArticleLengauer, Thomas
Mehlhorn, Kurt
Four results on the complexity of VLSI computation
In: Advances in Computing Research [2], 1-22
1984
Mehlhorn28.pdf739Intranet
Proceedings ArticleHuddleston, S.
Mehlhorn, Kurt
Robust balancing in B-trees
In: Theoretical computer science : 5th GI-conference, 234-244
1981
Mehlhorn27.pdf1395
3623
Intranet
Journal ArticleMehlhorn, Kurt
Overmars, Mark H.
Optimal dynamization of decomposable searching problems
In: Information Processing Letters [12], 93-98
1981
Mehlhorn27Preprint.pdf1395
3623
Intranet
Journal ArticleMehlhorn, Kurt
Overmars, Mark H.
Optimal dynamization of decomposable searching problems
In: Information Processing Letters [12], 93-98
1981
Mehlhorn26.pdf950Intranet
Journal ArticleMehlhorn, KurtLower bounds on the efficiency of transforming static data structures into dynamic structures
In: Mathematical Systems Theory [15], 1-16
1981
Mehlhorn25.pdf36301Intranet
Journal ArticleMehlhorn, KurtArbitrary Weight Changes in Dynamic Trees
In: Revue française d'automatique, d'informatique et de recherche opérationnelle : RAIRO [15], 183-211
1981
Mehlhorn24.pdf18321Intranet
Journal ArticleMehlhorn, KurtAn Efficient Algorithm for Constructing Nearly Optimal Prefix Codes
In: IEEE Transactions on Information Theory [26], 513-517
1980
Mehlhorn23.pdf41719Intranet
Journal ArticleGüttler, Reiner
Mehlhorn, Kurt
Schneider, Wolfgang
Binary Search Trees: Average and Worst Case Behavior
In: Elektronische Informationsverarbeitung und Kybernetik [16], 41-61
1980
Mehlhorn22.pdf29591Intranet
Journal ArticleBlum, Norbert
Mehlhorn, Kurt
On the Average Number of Rebalancing Operations in Weight-Balanced Trees
In: Theoretical Computer Science [11], 303-320
1980
Mehlhorn20.pdf12358Intranet
Proceedings ArticleMehlhorn, KurtKonzepte der Komplexitätstheorie illustriert am Beispiel des Sortierens
In: GI - 9. Jahrestagung, 16-22
1979
Mehlhorn2007b.pdf407Public
Electronic Journal ArticleMehlhorn, Kurt
Michail, Dimitrios
Implementing Minimum Cycle Basis Algorithms
In: Journal of Experimental Algorithmics [11], 1-14
2007
Mehlhorn19.pdf12120Intranet
Proceedings ArticleMehlhorn, KurtSearching, Sorting and Information Theory
In: Mathematical foundations of computer science (MFCS-79) : 8th symposium, 131-145
1979
Mehlhorn199.pdf2810Intranet
Proceedings ArticleBerberich, Eric
[Fogel, Efi]
[Halperin, Dan]
Mehlhorn, Kurt
[Wein, Ron]
Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step
In: Algorithms - ESA 2007, 15th Annual European Symposium, 645-656
2007
Mehlhorn198.pdf904Intranet
Journal ArticleHachenberger, Peter
Kettner, Lutz
Mehlhorn, Kurt
Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, Optimized Implementation and Experiments
In: Computational Geometry: Theory and Applications [38], 64-99
2007
Mehlhorn195.pdf294Intranet
Journal Article[Abraham, David J.]
[Irving, Robert W.]
[Kavitha, Telikepalli]
Mehlhorn, Kurt
Popular Matchings
In: SIAM Journal on Computing [37], 1030-1045
2007
Mehlhorn192.pdf236Intranet
Proceedings ArticleMehlhorn, Kurt
Osbild, Ralf
Sagraloff, Michael
Reliable and Efficient Computational Geometry Via Controlled Perturbation
In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Part I, 299-310
2006
Mehlhorn191.pdf972Intranet
Journal Article[Gotsman, Craig]
Kaligosi, Kanela
Mehlhorn, Kurt
Michail, Dimitrios
Pyrga, Evangelia
Cycle Bases of Graphs and Sampled Manifolds
In: Computer Aided Geometric Design [24], 464
2007
Mehlhorn190.pdf245
294
Intranet
Internet Download forbidden
Proceedings ArticleBerberich, Eric
Eigenwillig, Arno
[Hemmer, Michael]
[Hert, Susan]
Kettner, Lutz
Mehlhorn, Kurt
Reichel, Joachim
Schmitt, Susanne
[Schömer, Elmar]
Wolpert, Nicola
EXACUS: Efficient and exact algorithms for curves and surfaces
In: 13th Annual European Symposium on Algorithms (ESA 2005), 155-166
2005
Mehlhorn18.pdf492Intranet
Proceedings ArticleMehlhorn, KurtSorting Presorted Files
In: Theoretical Computer Science, 4th GI-Conference, 199-212
1979
Mehlhorn186.pdf407Intranet
Electronic Journal ArticleMehlhorn, Kurt
Michail, Dimitrios
Implementing Minimum Cycle Basis Algorithms
In: ACM Journal of Experimental Algorithmics [11], 1-14
2006
Mehlhorn184.pdf187
214
Public
Proceedings ArticleKavitha, Telikepalli
Mehlhorn, Kurt
A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs
In: STACS 2005 : 22nd Annual Symposium on Theoretical Aspects of Computer Science, 654-665
2005
Mehlhorn183.pdf219
158
995
Intranet
Proceedings ArticleFunke, Stefan
Klein, Christian
Mehlhorn, Kurt
Schmitt, Susanne
Controlled Perturbation for Delaunay Triangulations
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 1047-1056
2005
Mehlhorn182.pdf235
872
Intranet
Proceedings ArticleAbraham, David
[Irving, Robert W.]
Mehlhorn, Kurt
Telikepalli, Kavitha
Popular Matchings
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 424-432
2005
Mehlhorn181.pdf222
400
Intranet
Proceedings ArticleAbraham, David
[Cechlárová, Katarina]
[Manlove, David F.]
Mehlhorn, Kurt
Pareto-optimality in house allocation problems
In: Algorithms and Computation: 15th International Symposium, ISAAC 2004, 3-15
2004
Mehlhorn17.pdf18754Intranet
Journal ArticleMehlhorn, KurtDynamic data structures
In: Mathematical Centre Tracts [108], 71-96
1979
Mehlhorn179.pdf174
918
Intranet
Proceedings ArticleBaswana, Surender
Telikepalli, Kavitha
Mehlhorn, Kurt
Pettie, Seth
New 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
2005
Mehlhorn178.pdf259
200
Public
Proceedings ArticleKavitha, Telikepalli
Mehlhorn, Kurt
Michail, Dimitrios
[Paluch, Katarzyna]
A Faster Algorithm for Minimum Cycle Basis of Graphs
In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, 846-857
2004
Mehlhorn177.pdf127
224
Intranet
Proceedings ArticleKettner, Lutz
Mehlhorn, Kurt
[Pion, Sylvain]
[Schirra, Stefan]
[Yap, Chee]
Classroom Examples of Robustness Problems in Geometric Computations
In: ESA 2004: 12th Annual European Symposium on Algorithms, 702-713
2004
Mehlhorn176.pdf217
177
Intranet
Proceedings Article[Aranov, Boris]
[Asano, Tetsuo]
[Katoh, Naoki]
Mehlhorn, Kurt
[Tokuyama, Takeshi]
Polyline Fitting of Planar Points Under Min-sum Criteria
In: Algorithms and Computation: 15th International Symposium, ISAAC 2004, 77-88
2004
Mehlhorn175STACS.pdf72
194
Intranet
Proceedings ArticleKavitha, Telikepalli
Mehlhorn, Kurt
Michail, Dimitrios
[Paluch, Katarzyna]
Strongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents Problem
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 222-233
2004
Mehlhorn174STACS.pdf139
176
Intranet
Proceedings ArticleBast, Holger
Mehlhorn, Kurt
Schäfer, Guido
[Tamaki, Hisao]
Matching Algorithms Are Fast in Sparse Random Graphs
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 81-92
2004
Mehlhorn172.pdf177
184
Intranet
Proceedings ArticleAlthaus, Ernst
Eisenbrand, Friedrich
Funke, Stefan
Mehlhorn, Kurt
Point Containment in the Integer Hull of a Polyhedron
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 929-933
2004
Mehlhorn172.pdf184Intranet
Journal Article[Irving, Robert W.]
[Telikepalli, Kavitha]
Mehlhorn, Kurt
Michail, Dimitrios
[Paluch, Katarzyna]
Rank-Maximal Matchings
In: ACM Transactions on Algorithms [2], 602-610
2006
Mehlhorn172SODA.pdf73
258
Intranet
Proceedings ArticleMehlhorn, Kurt
Michail, Dimitrios
Telikepalli, Kavitha
[Irving, Robert W.]
[Paluch, Katarzyna]
Rank-Maximal Matchings
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 68-75
2004
Mehlhorn171.pdf291
129
157
Intranet
Proceedings ArticleBanderier, Cyril
Beier, Rene
Mehlhorn, Kurt
Smoothed Analysis of Three Combinatorial Problems
In: Mathematical foundations of computer science 2003 : 28th International Symposium, MFCS 2003, 198-207
2003
Mehlhorn170.pdf147
219
Intranet
Proceedings ArticleGranados, Miguel
Hachenberger, Peter
Hert, Susan
Kettner, Lutz
Mehlhorn, Kurt
Seel, Michael
Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation
In: Algorithms - ESA 2003: 11th Annual European Symposium, 654-666
2003
Mehlhorn169.pdf133
122
Intranet
Part of a BookMehlhorn, KurtThe reliable algorithmic software challenge RASC : dedicated to Thomas Ottmann on the occassion of his 60th birthday
In: Computer Science in Perspective : essays dedicated to Thomas Ottmann, 255-263
2003
Mehlhorn169.pdf298Intranet
Proceedings ArticleMehlhorn, KurtThe Reliable Algorithmic Software Challenge RASC
In: Experimental and efficient algorithms : Second International Workshop, WEA 2003, 222-222
2003
Mehlhorn168.pdf30
212
Intranet
Proceedings ArticleDhiflaoui, Marcel
Funke, Stefan
Kwappik, Carsten
Mehlhorn, Kurt
Seel, Michael
Schömer, Elmar
Schulte, Ralph
Weber, Dennis
Certifying and Repairing Solutions to Large LPs - How Good are LP-Solvers?
In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 255-256
2003
Mehlhorn167.pdf276
198
Intranet
Proceedings ArticleAlthaus, Ernst
[Bockmayr, Alexander]
[Elf, Matthias]
[Kasper, Thomas]
[Jünger, Michael]
Mehlhorn, Kurt
SCIL - Symbolic Constraints in Integer Linear Programming.
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 75-87
2002
Mehlhorn166.pdf147
222
Intranet
Proceedings ArticleMehlhorn, Kurt
Meyer, Ulrich
External-Memory Breadth-First Search with Sublinear I/O
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 723-735
2002
Mehlhorn165.pdf541
412
Intranet
Proceedings ArticleBerberich, Eric
Eigenwillig, Arno
Hemmer, Michael
Hert, Susan
Mehlhorn, Kurt
Schömer, Elmar
A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 174-186
2002
Mehlhorn164Journal.pdf253Intranet
Journal Article[Kratsch, Dieter]
[McConnell, Ross]
Mehlhorn, Kurt
[Spinrad, Jeremy P.]
Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs
In: Siam Journal on Computing, 326-353
In: SIAM Journal on Computing [36], 326-353
2006
Mehlhorn162.pdf166
75
Intranet
Journal Article[Kwek, St.]
Mehlhorn, Kurt
Optimal Search for Rationals
In: Information Processing Letters [86], 23-26
2003
Mehlhorn161.pdf322
178
Intranet
Journal ArticleBast, Holger
Mehlhorn, Kurt
Schäfer, Guido
Tamaki, Hisao
A Heuristic for Dijkstra's Algorithm With Many Targets and its Use in Weighted Matching Algorithms
In: Algorithmica [36], 75-88
2003
Mehlhorn158.pdf479
1178
Intranet
Journal Article[Kececioglu, John]
Lenhof, Hans-Peter
Mehlhorn, Kurt
Mutzel, Petra
Reinert, Knut
[Vingron, Martin]
A polyhedral approach to sequence alignment problems
In: Discrete Applied Mathematics [104], 143-186
2000
Mehlhorn157.pdf100
1669
Intranet
Journal ArticleMehlhorn, Kurt
[Seel, Michael]
Infimaximal frames: A technique for making lines look like segments
In: International Journal of Computational Geometry & Applications [13], 241-255
2003
Mehlhorn156.pdf147
49
Intranet
Journal ArticleMehlhorn, Kurt
Priebe, Volker
Schäfer, Guido
Sivadasan, Naveen
All-Pairs Shortest-Paths Computation in the Presence of Negative Cycles
In: Information Processing Letters [81], 341-343
2002
Mehlhorn155.pdf95
171
Intranet
Proceedings Article[Burnikel, Christoph]
Funke, Stefan
Mehlhorn, Kurt
[Schirra, Stefan]
Schmitt, Susanne
A Separation Bound for Real Algebraic Expressions
In: Proceedings of the 9th Annual European Symposium on Algorithms (ESA-01), 254-265
2001
Mehlhorn154.pdf302Intranet
Electronic Journal ArticleMehlhorn, Kurt
Schäfer, Guido
Implementation of $O(nm \log n)$ Weighted Matchings in General Graphs: The Power of Data Structures
In: Proceedings of the n?th Conference on,
In: Journal of Experimental Algorithmics [7],
2002
Mehlhorn153.pdf107
120
Intranet
Proceedings ArticleMehlhorn, Kurt
Ziegelmann, Mark
Resource Constrained Shortest Paths
In: Algorithms - ESA 2000, Proceedings of the 8th Annual European Symposium (ESA-00), 326-337
2000
Mehlhorn152.pdf30
83
Intranet
Proceedings ArticleMehlhorn, KurtConstraint Programming and Graph Algorithms
In: Automata, Languages and Programming, Proceedings of the 27th International Colloquium (ICALP-00), 571-575
2000
Mehlhorn151.pdf242
224
Public
Proceedings ArticleKoller, Alexander
Mehlhorn, Kurt
Niehren, Joachim
A Polynomial-Time Fragment of Dominance Constraints
In: Proceedings of the 38th Annual Meeting of the Association of Computational Linguistics (ACL-00), 368-375
2000
Mehlhorn150.pdf252
349
252
Intranet
Journal ArticleAlthaus, Ernst
[Duchier, Denys]
[Koller, Alexander]
Mehlhorn, Kurt
[Niehren, Joachim]
Thiel, Sven
An Efficient Algorithm for the Configuration Problem of Dominance Graphs
In: Journal of Algorithms [48], 194-219
2003
Mehlhorn14.pdf19269Intranet
Journal ArticleMehlhorn, KurtParsing Macro Grammars Top Down
In: Information and Control [40], 123-143
1979
mehlhorn149.pdf13804Public
Proceedings ArticleFunke, Stefan
Mehlhorn, Kurt
LOOK - a Lazy Object-Oriented Kernel for Geometric Computation
In: Proceedings of the 16th Annual Symposium on Computational Geometry (SCG-00), 156-165
2000
Mehlhorn148.pdf226Intranet
Proceedings ArticleMehlhorn, Kurt
Thiel, Sven
Faster Algorithms for Bound-Consistency of the Sortedness and the Alldifferent Constraint
In: Principles and practice of constraint programming - CP 2000 (CP-00) : 6th international conference, CP 2000, 306-319
2000
Mehlhorn145.pdf13555Public
Part of a BookMehlhorn, Kurt
Schirra, Stefan
Exact computation with leda_real - Theory and geometric applications
In: Symbolic Algebraic Methods and Verification Methods, 163-172
2001
Mehlhorn144.pdf498
497
Intranet
Electronic Proceedings ArticleAlthaus, Ernst
Mehlhorn, Kurt
Näher, Stefan
Schirra, Stefan
Experiments on curve reconstruction
In: Proceedings of 2nd Workshop on Algorithm Engineering and Experiments (ALENEX-00), 103-114
2000
Mehlhorn142.pdf194Intranet
Proceedings ArticleFunke, Stefan
Mehlhorn, Kurt
[Näher, Stefan]
Structural Filtering: a Paradigm for Efficient and Exact Geometric Programs
In: Abstracts for the 11th Canadian Conference on Computational Geometry (CCCG-99), 39-42
1999
Mehlhorn13.pdf4035Intranet
Journal ArticleAlt, Helmut
Mehlhorn, Kurt
Complexity arguments in algebraic language theory
In: Revue française d'automatique, d'informatique et de recherche opérationnelle : RAIRO / Association Française pour la Cybernétique Economique et Technique [13], 217-225
1979
Mehlhorn139.pdf340
245
Intranet
Journal Article[Dey, Tamal K.]
Mehlhorn, Kurt
Ramos, Edgar A.
Curve reconstruction: Connecting dots with good reason
In: Computational Geometry [15], 229-244
2000
Mehlhorn136.pdf673Intranet
Proceedings ArticleCrauser, Andreas
Mehlhorn, Kurt
Meyer, Ulrich
Sanders, Peter
A Parallelization of Dijkstra's Shortest Path Algorithm
In: Proceedings of the 23rd International Symposium on the Mathematical Foundations of Computer Science (MFCS-98), 722-731
1998
Mehlhorn135.pdf317
1063
Intranet
Proceedings ArticleBurnikel, Christoph
Fleischer, Rudolf
Mehlhorn, Kurt
Schirra, Stefan
Efficient exact geometric computation made easy
In: Proceedings of the 15th Annual Symposium on Computational Geometry (SCG-99), 341-350
1999
Mehlhorn133.pdf1545Intranet
Proceedings ArticleCrauser, Andreas
Ferragina, Paolo
Mehlhorn, Kurt
Meyer, Ulrich
Ramos, Edgar A.
Randomized External-Memory Algorithms for some Geometric Problems
In: Proceedings of the 14th International Annual ACM Symposium on Computational Geometry (SCG-98), 259-268
1998
Mehlhorn132.pdf474Intranet
Journal ArticleAlthaus, Ernst
Mehlhorn, Kurt
Maximum Network Flow with Floating Point Arithmetic
In: Information Processing Letters [66], 109-113
1998
mehlhorn128.pdf9476Public
Journal Article[Cooper, Colin]
Frieze, Alan M.
Mehlhorn, Kurt
Priebe, Volker
Average-Case Complexity of Shortest-Paths Problems in the Vertex-Potential Model
In: Random Structures & Algorithms [16], 33-46
2000
Mehlhorn127.pdf258
81
Intranet
Journal ArticleBurnikel, Christoph
Fleischer, Rudolf
Mehlhorn, Kurt
Schirra, Stefan
A strong and easily computable separation bound for arithmetic expressions involving radicals
In: Algorithmica [27], 87-99
2000
Mehlhorn126.pdf979Intranet
Proceedings ArticleMehlhorn, Kurt
[Shermer, Thomas C.]
[Yap, Chee]
A complete roundness classification procedure
In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 129-138
1997
Mehlhorn125.pdf1142Intranet
Proceedings ArticleReinert, Knut
Lenhof, Hans-Peter
Mehlhorn, Kurt
Mutzel, Petra
Kececioglu, John
A Branch-And-Cut algorithm for multiple sequence alignment
In: Proceedings of the 1st Annual International Conference on Computational Molecular Biology (RECOMB-97), 241-250
1997
Mehlhorn122.pdf1832Intranet
Journal Article[Cheriyan, Joseph]
Mehlhorn, Kurt
Algorithms for Dense Graphs and Networks on the Random Access Computer
In: Algorithmica [15], 521-549
1996
mehlhorn120.pdf8499Public
Part of a BookMehlhorn, KurtAmortisierte Analyse
In: Prinzipien des Algorithmenentwurfs, 91-102
1998
Mehlhorn11.pdf2162Intranet
Journal ArticleMehlhorn, KurtEffiziente Algorithmen: Ein Beispiel
In: Informatik Spektrum [1], 81-89
1978
Mehlhorn118.pdf164Intranet
Journal ArticleMehlhorn, Kurt
[Näher, Stefan]
Seel, Michael
[Seidel, Raimund]
Schilz, Thomas
Schirra, Stefan
Uhrig, Christian
Checking geometric programs or verification of geometric structures
In: Computational Geometry: Theory and Applications [12], 85-104
1999
Mehlhorn117.pdf152Intranet
Proceedings ArticleBurnikel, Christoph
Könemann, Jochen
Mehlhorn, Kurt
[Näher, Stefan]
Schirra, Stefan
Uhrig, Christian
Exact Geometric Computation in LEDA
In: 11th ACM Symposium on Computational Geometry (SCG95), C18-C19
1995
Mehlhorn116.pdf2130Intranet
Journal ArticleMehlhorn, Kurt
[Näher, Stefan]
LEDA: A Platform for Combinatorial and Geometric Computing
In: Communications of the ACM [38], 96-102
1995
Mehlhorn113.pdf638Intranet
Proceedings ArticleBurnikel, Christoph
Mehlhorn, Kurt
Schirra, Stefan
How to Compute the Voronoi Diagram of Line Segments:
Theoretical and Experimental Results
In: Algorithms (ESA-94) : 2nd annual European symposium, 227-239
1994
Mehlhorn112.pdf16871Public
Proceedings ArticleMehlhorn, Kurt
Näher, Stefan
The Implementation of Geometric Algorithms
In: Technology and foundations : Information Processing '94 ; proceedings of the IFIP 13th World Computer Congress, 223-231
1994
Mehlhorn111.pdf541Intranet
Journal ArticleMehlhorn, Kurt
Mutzel, Petra
On the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm
In: Algorithmica [16], 233-242
1996
Mehlhorn108.pdf525Intranet
Journal ArticleBilardi, Gianfranco
Chaudhuri, Shiva
Dubhashi, Devdatt
Mehlhorn, Kurt
A lower bound for area-universal graphs
In: Information Processing Letters [51], 101-105
1994
Mehlhorn107.pdf646Intranet
Proceedings ArticleDobrindt, Katrin
Mehlhorn, Kurt
Yvinec, Mariette
A Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron
In: Algorithms and data structures (WADS-93) : 3rd workshop, 314-324
1993
Mehlhorn106.pdf437Intranet
Proceedings ArticleDubhashi, Devdatt P.
Ranjan, Desh
Mehlhorn, Kurt
Thiel, Christian
Searching, Sorting and Randomised Algorithms for Central Elements and Ideal Counting in Posets
In: Foundations of software technology and theoretical computer science (FSTTCS-93) : 13th conference, 436-443
1993
Mehlhorn103.pdf855Intranet
Proceedings ArticleHagerup, Torben
Mehlhorn, Kurt
Munro, I.
Maintaining Discrete Probability Distributions Optimally
In: Automata, languages and programming (ICALP-93) : 20th international colloquium, 253-264
1993
Mehlhorn102.pdf22220Public
Proceedings ArticleMehlhorn, Kurt
Näher, Stefan
Algorithm Design and Software Libraries: Recent Developments in the LEDA Project
In: Proceedings of the IFIP 12th World Computer Congress. Volume 1: Algorithms, Software, Architecture, 493-508
1992
Mehlhorn101.pdf251Intranet
Proceedings ArticleKucera, Ludek
Mehlhorn, Kurt
Preis, B.
Schwarzenecker, E.
Exact Algorithms for a Geometric Packing Problem (Extended Abstract)
In: Theoretical aspects of computer science (STACS-93) : 10th annual symposium, 317-322
1993
Mehlhorn100.pdf6035Intranet
Journal ArticleMehlhorn, Kurt
[Meiser, Stefan]
[Rasch, Ronald]
Furthest site abstract Voronoi diagrams
In: International Journal of Computational Geometry & Applications [11], 583-616
2001
MCscheduling-mfcs-final.pdf319Public
Proceedings Article[Baruah, Sanjoy]
Bonifaci, Vincenzo
[D'Angelo, Gianlorenzo]
[Li, Haohan]
[Marchetti-Spaccamela, Alberto]
Megow, Nicole
[Stougie, Leen]
Scheduling Real-Time Mixed-Criticality Jobs
In: Mathematical Foundations of Computer Science 2010 : 35th International Symposium, MFCS 2010, 90-101
2010
mcblog.pdf141Public
Electronic Journal ArticleMehlhorn, K.
Michail, D.
Minimum Cycle Bases: Faster and Simpler
In: ACM Transactions on Algorithms [6], 8:1-8:13
2009
mcbg.pdf103Intranet
Journal Article[Bárány, Imre]
Doerr, Benjamin
Balanced partitions of vector sequences
In: Linear Algebra and Its Applications [414], 464-469
2006
maxnorm.pdf160
100
Intranet
Internet Download forbidden
Journal ArticleDoerr, BenjaminMatrix Rounding With Respect to Small Submatrices
In: Random Structures & Algorithms [28], 107-112
2006
MaxFlowICALP90.pdf1036Public
ReportCheriyan, Joseph
Hagerup, Torben
Mehlhorn, Kurt
Can a maximum flow be computed in $o(nm)$ time?1990
max-flow2.pdf178Internal
Proceedings ArticleDuan, RanBreaking the $O(n^2.5)$ Deterministic Time Barrier for Undirected Unit-Capacity Maximum Flow
In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), 1171-1179
2013
Maue2006.ps1040
2745
Public
Thesis - Master's thesisMaue, JensA Goal-Directed Shortest Path Algorithm Using Precomputed Cluster Distances
Universität des Saarlandes
2006
Maue2006.pdf1040
2745
Public
Thesis - Master's thesisMaue, JensA Goal-Directed Shortest Path Algorithm Using Precomputed Cluster Distances
Universität des Saarlandes
2006
Matijevic.pdf1325Public
Thesis - Doctoral dissertationMatijevic, DomagojGeometric Optimization and Querying - Exact and Approximate
Universität des Saarlandes
2007
main.ps8840Public
Proceedings ArticleBerberich, Eric
[Meyerovitch, Michal]
Computing Envelopes of Quadrics
In: Proceedings of 23rd European Workshop on Computational Geometry, 235-238
2007
main.pdf167Public
Proceedings ArticleBerberich, Eric
Caroli, Manuel
[Wolpert, Nicola]
Exact Computation of Arrangements of Rotated Conics
In: Proceedings of 23rd European Workshop on Computational Geometry, 231-234
2007
lsiexplained.pdf176Public
Proceedings ArticleBast, Holger
Majumdar, Debapriyo
Why Spectral Retrieval Works
In: 28th Annual International Conference on Research and Development in Information Retrieval (SIGIR'05), 11-18
2005
LpDisc2006.pdf104Intranet
Internet Download forbidden
Journal ArticleDoerr, BenjaminLp Linear discrepancy of totally unimodular matrices
In: Linear Algebra and Its Applications [420], 663-666
2007
LocalRoutingTwoTerminalNets.pdf45289Public
Journal ArticleKaufmann, Michael
Mehlhorn, Kurt
On local routing of two-terminal nets
In: Journal of Combinatorial Theory / Series B [55], 33-72
1992
Light.pdf293Public
Proceedings ArticleEisenbrand, Friedrich
Funke, Stefan
Karrenbauer, Andreas
Matijevic, Domagoj
Energy-Aware Stage Illumination
In: Proceedings of the 21st Annual Symposium on Computational Geometry : (SCG05), 336-346
2005
LATIN04.pdf183Public
Proceedings Article[Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Khachiyan, Leonid]
Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections
In: LATIN 2004: Theoretical Informatics, 6th Latin American Symposium, 488-498
2004
KVersusPlusOne.pdf11262Public
Journal ArticleMehlhorn, Kurt
[Paul, Wolfgang J.]
Uhrig, C
$k$ versus $k+1$ Index Registers and Modifiable versus Non-modifiable Programs
In: Information and Computation [101], 123-129
1992
KPSY-TOCS2000.pdf.gz343Public
Journal ArticleKontogiannis, Spyros
[Pantziou, Grammati E.]
[Spirakis, Paul G.]
[Yung, Moti]
Robust Parallel Computations through Randomization
In: Theory of Computing Systems [33], 427-464
2000
koerber.ps2452
MiscellaneousKlau, Gunnar W.Visuelle Zeitenwende: Bilder - Technik - Reflexionen. Quasi-orthogonales Zeichnen1998
KlKu2006b.pdf207Internal
Internet Download forbidden
Proceedings Article[Klein, Rolf]
Kutz, Martin
The 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
2006
KlKu2006a.pdf401Internal
Internet Download forbidden
Proceedings Article[Klein, Rolf]
Kutz, Martin
Computing Geometric Minimum-Dilation Graphs Is NP-Hard
In: Graph Drawing : 14th International Symposium, GD 2006, 196-207
2007
Kettner2006PseudoTEnum.pdf379Intranet
Internet Download forbidden
Journal Article[Brönnimann, Hervé]
Kettner, Lutz
[Pocchiola, Michel]
[Snoeyink, Jack]
Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm
In: SIAM Journal on Computing [36], 721-739
2006
Kettner2006PseudoTEnum.pdf399
379
Intranet
Internet Download forbidden
Journal Article[Bundy, David]
Hebbinghaus, Nils
[Stellmacher, Bernd]
The Local C(G,T) Theorem
In: Journal of Algebra [300], 741-789
2006
Kavitha2007TCS.pdf344Intranet
Journal ArticleKavitha, Telikepalli
Mehlhorn, Kurt
Algorithms to compute minimum cycle basis in directed graphs
In: Theory of Computing Systems [40], 485-505
2007
karrenbauer.pdf1589Internal
Thesis - Doctoral dissertationKarrenbauer, AndreasEngineering combinatorial optimization algorithms to improve the lifetime of OLED displays
Universität des Saarlandes
2007
k-otcorra-09-authprep.pdf126Public
Proceedings ArticleKerber, MichaelOn the Complexity of Reliable Root Approximation
In: Computer Algebra in Scientific Computing : 11th International Workshop, CASC 2009, 155-167
2009
journal-r0.pdf226Public
Journal Article[Baruah, Sanjoy]
Bonifaci, Vincenzo
[Marchetti-Spaccamela, Alberto]
[Stiller, Sebastian]
Improved Multiprocessor Global Schedulability Analysis
In: Real-Time Systems [46], 3-24
2010
JordanSorting.pdf19118Public
Journal ArticleHoffmann, Kurt
Mehlhorn, Kurt
Rosenstiehl, Pierre
Tarjan, Robert E.
Sorting Jordan Sequences in Linear Time Using Level-Linked Search Trees
In: Information and Control [68], 170-184
1986
Johannsen_2006_MasterThesis_SamplingRooted3-ConnectedPlanarGraphsInDeterministicPolynomialTime.pdf748Public
Thesis - Master's thesisJohannsen, DanielSampling Rooted 3-Connected Planar Graphs in Deterministic Polynomial Time
Humboldt-Universität zu Berlin
2006
JohannsenRazgonWahlstroem_2008_SolvingSATForCNFFormulasWithAOnesidedRestrictionOnVariableOccurrences.pdf168Public
Proceedings ArticleJohannsen, Daniel
[Razgon, Igor]
Wahlström, Magnus
Solving SAT for CNF formulas with a one-sided variable occurrence restriction
In: Theory and Applications of Satisfiability Testing, SAT 2009 : 12th International Conference, SAT 2009, 80-85
2009
JohannsenPanagiotou2010.pdf265Public
Proceedings ArticleJohannsen, Daniel
Panagiotou, Konstantinos
Vertices of Degree k in Random Maps
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1436-1447
2010
JohannsenLenglerKurur10.pdf353Public
Proceedings ArticleJohannsen, Daniel
Lengler, Johannes
Can Quantum Search Accelerate Evolutionary Algorithms?
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1433-1440
2010
JALG-final.pdf274Intranet
Journal Article[Goemans, Michel X.]
Skutella, Martin
Cooperative facility location games
In: Journal of Algorithms [50], 194-214
2004
jacobian.pdf392Internal
Proceedings Article[Agrawal, Manindra]
Saha, Chandan
[Saptharishi, Ramprasad]
[Saxena, Nitin]
Jacobian hits circuits: hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits
In: STOC'12 : Proceedings of the 2012 ACM Symposium on Theory of Computing, 599-614
2012
iwcia01.ps9918Public
Proceedings ArticleRay, Rahul
[Smid, MIchiel]
[Lange, Katharina]
[Wendt, Ulrich]
Computing Large Planar Regions in Terrains
In: IWCIA 2001, 8th International Workshop on Combinatorial Image Analysis (IWCIA-01), 139-152
2002
isaac.pdf191Public
Proceedings ArticlePaluch, KatarzynaA New Approximation Algorithm for Multidimensional Rectangle Tiling
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 712-721
2006
ISAAC2003.pdf161Public
Proceedings Article[Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Khachiyan, Leonid]
Algorithms for Enumerating Circuits in Matroids.
In: Algorithms and Computation, 14th International Symposium, ISAAC 2003, 485-494
2003
IPL03-FeketeSkutellaWoeginger.pdf148Intranet
Journal Article[Fekete, Sandor P.]
Skutella, Martin
[Woeginger, Gerhard J.]
The complexity of economic equilibria for house allocation markets
In: Information Processing Letters [88], 219-223
2003
IPCO04.pdf201Public
Proceedings Article[Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Khachiyan, Leonid]
Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems
In: Integer programming and combinatorial optimization : 10th International IPCO Conference, 152-162
2004
iotopk_tr.pdf335MPG
ReportBast, Holger
Majumdar, Debapriyo
Schenkel, Ralf
Theobald, Martin
Weikum, Gerhard
IO-Top-k: Index-Access Optimized Top-k Query Processing2006
IntLiar2006.pdf362Internal
Internet Download forbidden
Proceedings ArticleDoerr, Benjamin
[Lengler, Johannes]
[Steurer, Daniel]
The Interval Liar Game
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 318-327
2006
ineq-poly.pdf315Intranet
Journal Article[Boros, Endre]
Elbassioni, Khaled M.
[Khachiyan, Leonid]
[Gurvich, Vladimir]
An Inequality for Polymatroid Functions and its Applications
In: Discrete Applied mathematics [131], 27
2003
indsubgraphs_sub.pdf213Intranet
Unpublished/DraftGao, Pu (Jane)
[Wormald, Nicholas]
[Su, Yi]
Induced subgraphs in sparse random graphs with given degree sequence2010
IndependentSets.pdf15401Public
Journal ArticleJung, Hermann
Mehlhorn, Kurt
Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees
In: Information Processing Letters [27], 227-236
1988
ImpBoun2006.pdf239
224
Intranet
Internet Download forbidden
Journal ArticleDoerr, Benjamin
Hebbinghaus, Nils
[Werth, Sören]
Improved Bounds and Schemes for the Declustering Problem
In: Theoretical Computer Science [359], 123-132
2006
ifvs_jv.pdf219Public
Journal Article[Misra, Neeldhara]
Philip, Geevarghese
[Raman, Venkatesh]
[Saurabh, Saket]
On Parameterized Independent Feedback Vertex Set
In: Theoretical Computer Science [461], 65-75
2012
ifvs.pdf308Public
Proceedings Article[Misra, Neeldhara]
Philip, Geevarghese
[Raman, Venkatesh]
[Saurabh, Saket]
On Parameterized Independent Feedback Vertex Set
In: Computing and Combinatorics - 17th Annual International Conference, COCOON 2011, Dallas, TX, USA, August 14-16, 2011. Proceedings, 98-109
2011
ICDT03.pdf308Public
Proceedings ArticleElbassioni, Khaled M.
[Elmasry, Amr]
[Kamel, Ibrahim]
An Efficient Indexing Scheme for Multi-dimensional Moving Objects
In: Database Theory - ICDT 2003, 9th International Conference, 425-439
2003
ICDE04.pdf293Public
Proceedings Article[Mokbel, Mohamed F.]
[Aref, Walid G.]
Elbassioni, Khaled M.
[Kamel, Ibrahim]
Scalable Multimedia Disk Scheduling
In: 20th International Conference on Data Engineering, ICDE 2004, 498-509
2004
ICALP76.PDF27854Public
Proceedings ArticleAlt, Helmut
Mehlhorn, Kurt
Lower Bounds for the Space Complexity of Context-Free Recognition
In: Third International Colloquium on Automata, Languages and Programming, 338-354
1976
icalp04.ps230Public
Proceedings ArticleSanders, Peter
Sivadasan, Naveen
Skutella, Martin
Online scheduling with bounded migration
In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, 1111-1122
2004
ICALP03.pdf198Public
Proceedings Article[Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Khachiyan, Leonid]
[Makino, Kazuhisa]
An Intersection Inequality for Discrete Distributions and Related Generation Problems
In: Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, 543-555
2003
icalp03.pdf229Public
Proceedings ArticleFotakis, DimitrisOn the Competitive Ratio for Online Facility Location
In: Automata, languages and programming : 30th International Colloquium, ICALP 2003, 637-652
2003
icalp02.ps204Public
Proceedings ArticleFotakis, Dimitris
Kontogiannis, Spyros
[Koutsoupias, Elias]
[Mavronicolas, Marios]
[Spirakis, Paul G.]
The Structure and Complexity of Nash Equilibria for a Selfish Routing Game
In: Automata, Languages and Programming : 29th International Colloquium, ICALP 2002, 123-134
2002
icalp01.pdf184Public
Proceedings Article[Boros, Endre]
Elbassioni, Khaled M.
[Khachiyan, Leonid]
[Gurvich, Vladimir]
[Makino, Kazuhisa]
On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities
In: Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, 92-103
2001
ICALP-final.pdf207Intranet
Proceedings Article[Hall, Alex]
[Hippler, Steffen]
Skutella, Martin
Multicommodity Flows Over Time: Efficient Algorithms and Complexity
In: Automata, languages and programming : 30th International Colloquium, ICALP 2003, 397-409
2003
htp.ps761Public
Unpublished/DraftElbassioni, Khaled M.
[Sitters, Rene]
[Zhang, Yan]
A Quasi-PTAS for Envy-free Pricing on Line Graphs2007
HSW-MathProg-final.pdf125Intranet
Journal Article[Hoogeveen, Han]
Skutella, Martin
[Woeginger, Gerhard J.]
Preemptive scheduling with rejection
In: Mathematical Programming [94], 361-374
2003
Hopf02-12-99.pdf250Intranet
Journal ArticleEl Kahoui, M'hammedDeciding Hopf bifurcations by quantifier elimination in a software-component architecture
In: Journal of Symbolic Computation [30], 161-179
2000
HomotopicRoutingGridGraphs.pdf32312Public
Journal ArticleKaufmann, Michael
Mehlhorn, Kurt
A linear-time algorithm for the homotopic routing problem in grid graphs
In: SIAM Journal on Computing [23], 227-246
1994
hls-qarr-09.pdf187Public
Proceedings ArticleHemmer, Michael
Limbach, Sebastian
[Schömer, Elmar]
Continued Work on the Computation of an Exact Arrangement of Quadrics
In: EuroCG'09 : 25th European Workshop on Computational Geometry, 313-316
2009
HiddenLineRectangles.pdf12590Public
Journal ArticleMehlhorn, Kurt
Näher, Stefan
Uhrig, Christian
Hidden line elimination for isooriented rectangles
In: Information Processing Letters [35], 137-143
1990
Hebbinghaus2006.pdf430Internal
Internet Download forbidden
Proceedings ArticleDoerr, Benjamin
Hebbinghaus, Nils
Neumann, Frank
Speeding Up Evolutionary Algorithms Through Restricted Mutation Operators
In: Parallel Problem Solving from Nature - PPSN IX, 9th International Conference, 978-987
2006
Harren,vanStee-SWAT2008.pdf301Public
Proceedings ArticleHarren, Rolf
van Stee, Rob
Packing Rectangles into 2 OPT Bins using Rotations
In: 11th Scandinavian Workshop on Algorithm Theory, 306-318
2008
Harren-TCS2009.pdf522Public
Journal ArticleHarren, RolfApproximation Algorithms for Orthogonal Packing Problems for Hypercubes
In: Theoretical Computer Science [410], 4504-4532
2009
HappJohannsenKleinNeumann_2008_RigorousAnalysesOfFitness-ProportionalSelectionForOptimizingLinearFunctions.pdf229Public
Proceedings ArticleHapp, Edda
Johannsen, Daniel
Klein, Christian
Neumann, Frank
Rigorous Analyses of Fitness-Proportional Selection for Optimizing Linear Functions
In: Genetic and Evolutionary Computation Conference 2008, 953-960
2008
habil-embed.ps2189Public
Thesis - Habilitation thesisvan Stee, RobCombinatorial algorithms for packing and scheduling problems
Universität Karlsruhe
2008
grammar_CPM.pdf334Internal
Proceedings ArticleJez, ArturApproximation of Grammar-Based Compression via Recompression
In: 24th Annual Symposium on Combinatorial Pattern Matching (CPM 2013), 165-176
2013
gpu_res_2012.pdf1157Public
Electronic Journal ArticleEmeliyanenko, PavelComputing resultants on Graphics Processing Units: Towards GPU-accelerated computer algebra
In: Journal of Parallel and Distributed Computing [In press], 1-14
2012
gphilip_thesis.pdf1448Public
Thesis - Doctoral dissertationPhilip, GeevargheseThe Kernelization Complexity of some Domination and Covering Problems
Homi Bhabha National Institute
2011
gpgpu_mul.pdf364Public
Proceedings ArticleEmeliyanenko, PavelEfficient Multiplication of Polynomials on Graphics Hardware
In: Advanced Parallel Processing Technologies : 8th International Symposium, APPT 2009, 134-149
2009
Govindarajan.pdf921Internal
Journal ArticleGovindarajan, Sathish
[Dietze, Michael C.]
[Agarwal, Pankaj K.]
[Clark, James S.]
A scalable algorithm for dispersing population
In: Journal of Intellingent Information Systems [29], 39-61
2008
girthcds.pdf539Public
Proceedings Article[Misra, Neeldhara]
Philip, Geevarghese
[Raman, Venkatesh]
[Saurabh, Saket]
The effect of girth on the kernelization complexity of Connected Dominating Set
In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, 96-107
2010
Giesen.pdf377Internal
Proceedings ArticleGiesen, Joachim
[Mitsche, Dieter]
[Schuberth, Eva]
Collaborative Ranking: an aggregation algorithm for individuals' preference estimation
In: Algorithmic Aspects in Information and Management : Third International Conference, AAIM 2007, 58-67
2007
gathering-tcs.pdf300Public
Journal ArticleBonifaci, Vincenzo
[Korteweg, Peter]
[Marchetti-Spaccamela, Alberto]
[Stougie, Leen]
The Distributed Wireless Gathering Problem
In: Theoretical Computer Science [412], 633-641
2011
gathering-talg.pdf278Public
Journal ArticleBonifaci, Vincenzo
[Korteweg, Peter]
[Marchetti-Spaccamela, Alberto]
[Stougie, Leen]
Minimizing Flow Time in the Wireless Gathering Problem
In: ACM Transactions on Algorithms [7], 33:1-33:20
2011
GaloisMultiplier.pdf982Public
Journal ArticleFürer, Martin
Mehlhorn, Kurt
AT$^2$-Optimal Galois Field Multiplier for VLSI
In: IEEE Transactions on Computers [38], 1333-1336
1989
funkekesselman2007.pdf536Internal
Journal ArticleFunke, Stefan
Kesselman, Alexander
[Kuhn, Fabian]
[Lotker, Zvi]
[Segal, Michael]
Improved approximation algorithms for connected sensor cover
In: Wireless Networks [13], 153-164
2007
fulltext.pdf317Internal
Proceedings ArticleEmeliyanenko, PavelModular Resultant Algorithm for Graphics Processors
In: Algorithms and Architectures for Parallel Processing : 10th International Conference, ICA3PP 2010. - Pt. 1, 427-440
2010
fulltext.pdf718
718
Public
Journal ArticleElmasry, Amr
[Jensen, Claus]
[Katajainen, Jyrki]
Two New Methods for Constructing Double-Ended Priority Queues from Priority Queues
In: Computing [83], 193-204
2008
frame.pdf208Intranet
Journal ArticleDoerr, Benjamin
[Lorenz, Ulf]
Error Propagation in Game Trees
In: Mathematical Methods of Operations Research [64], 79-93
2006
fotakis.pdf202Public
Proceedings ArticleFotakis, DimitrisIncremental Algorithms for Facility Location and k-Median
In: Algorithms – ESA 2004: 12th Annual European Symposium, 347-358
2004
forbidden_minors_stacs.pdf3041Public
Proceedings Article[Fomin, Fedor V.]
[Lokshtanov, Daniel]
[Misra, Neeldhara]
Philip, Geevarghese
[Saurabh, Saket]
Hitting forbidden minors: Approximation and Kernelization
In: 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany, 189-200
2011
foci2007.pdf135Public
Proceedings ArticleDoerr, Benjamin
Klein, Christian
[Storch, Tobias]
Faster Evolutionary Algorithms by Superior Graph Representation
In: First IEEE Symposium on Foundations of Computational Intelligence (FOCI-2007), 245-250
2007
FL2007.pdf426
454
Internal
Internet Download forbidden
Proceedings ArticleFunke, Stefan
Laue, Sören
Bounded-Hop Energy-Efficient Broadcast in Low-Dimensional Metrics Via Coresets
In: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, 272-283
2007
final.pdf165
209
MPG
Proceedings ArticleDoerr, Benjamin
Friedrich, Tobias
Klein, Christian
Osbild, Ralf
Rounding of Sequences and Matrices, with Applications
In: Third Workshop on Approximation and Online Algorithms (WAOA 2005), 96-109
2005
final.pdf169Public
Proceedings ArticleHemmer, Michael
[Hülse, Dominik]
Generic implementation of a modular GCD over Algebraic Extension Fields
In: EuroCG'09 : 25th European Workshop on Computational Geometry, 321-324
2009
final.pdf223MPG
Proceedings Article[Dupont, Laurent]
Hemmer, Michael
[Petitjean, Sylvain]
[Schömer, Elmar]
Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics
In: 15th Annual European Symposium on Algorithms, 633-644
2007
finalCGTA.pdf323Internal
Journal ArticleBringmann, KarlAn improved algorithm for Klee's measure problem on fat boxes
In: Computational Geometry: Theory and Applications [45], 225-233
2012
fillin.pdf563Public
Proceedings Article[Fomin, Fedor V.]
Philip, Geevarghese
[Villanger, Yngve]
Minimum Fill-in of Sparse Graphs: Kernelization and Approximation
In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, 164-175
2011
fetch.pdf133MPG
Journal Article[Sanders, Peter]
[Singler, Johannes]
van Stee, Rob
Real-time prefetching and caching
In: Journal of Scheduling [16], 47-58
2013
faults.ps343Public
Journal ArticleFotakis, Dimitris
[Spirakis, Paul G.]
Minimum Congestion Redundant Assignments to Tolerate Random Faults
In: Algorithmica [32], 396-422
2002
FastTriangulation.pdf11113Public
Journal ArticleHertel, Stefan
Mehlhorn, Kurt
Fast Triangulation of the Plane with Respect to Simple Polygons
In: Information and Control [64], 52-76
1985
ext.ps213Public
Proceedings ArticleSchmitt, SusanneThe diamond operator - Implementation of exact real algebraic numbers
In: Computer Algebra in Scientific Computing, 8th International Workshop, CASC 2005, 355-366
2005
exact-esa-cr.pdf339Public
Proceedings ArticleBonifaci, Vincenzo
[Marchetti-Spaccamela, Alberto]
Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. II, 230-241
2010
exact-algorithmica-r2.pdf365Public
Journal ArticleBonifaci, Vincenzo
[Marchetti-Spaccamela, Alberto]
Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems
In: Algorithmica [63], 763-780
2012
ESY-DescTree-ISSAC06-authprep.pdf183Public
Electronic Proceedings ArticleEigenwillig, Arno
[Sharma, Vikram]
[Yap, Chee K.]
Almost Tight Recursion Tree Bounds for the Descartes Method
In: ISSAC '06: Proceedings of the 2006 international symposium on Symbolic and algebraic computation, 71-78
2006
esa09.pdf238Public
Proceedings ArticleElbassioni, Khaled
[Makino, Kazuhisa]
Rauf, Imran
Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs
In: Algorithms - ESA 2009 : 17th Annual European Symposium, 143-154
2009
ESA04.pdf204Public
Proceedings Article[Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
Algorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems
In: Algorithms – ESA 2004: 12th Annual European Symposium, 122-133
2004
ESA03.pdf234Public
Proceedings Article[Boros, Endre]
Elbassioni, Khaled M.
[Khachiyan, Leonid]
[Gurvich, Vladimir]
An Efficient Implementation of a Quasi-polynomial Algorithm for Generating Hypergraph Transversals
In: Algorithms - ESA 2003, 11th Annual European Symposium, 556-567
2003
ESA02.pdf224Public
Proceedings ArticleElbassioni, Khaled M.An Algorithm for Dualization in Products of Lattices and Its Applications
In: Algorithms - ESA 2002, 10th Annual European Symposium, 424-435
2002
emst.pdf185Public
Proceedings ArticleDementiev, Roman
Sanders, Peter
Schultes, Dominik
[Sibeyn, Jop F.]
Engineering an External Memory Minimum Spanning Tree Algorithm
In: 3rd IFIP International Conference on Theoretical Computer Science (TSC2004), 195-208
2004
elkahoui.pdf321Intranet
Journal ArticleEl Kahoui, M'hammedAn Improved Upper Complexity Bound for the Topology Computation of a Real Algebraic Plane Curve
In: Journal of Complexity [12], 527-544
1996
elkahoui2001.pdf272Intranet
Journal ArticleEl Kahoui, M'hammedImproved algorithms for linear complementarity problems arising from collision response
In: Mathematics and Computers in Simulation [56], 69-93
2001
ElektronischeVersion.pdf1786Public
Thesis - Doctoral dissertationHemmer, MichaelExact Computation of the Adjacency Graph of an Arrangement of Quadrics
Johannes Gutenberg-Universität Mainz
2008
ekw-fast-2007-authprep.pdf296Public
Proceedings ArticleEigenwillig, Arno
Kerber, Michael
[Wolpert, Nicola]
Fast and Exact Geometric Analysis of Real Algebraic Plane Curves
In: Proceedings of the 2007 International Symposium on Symbolic and Algebraic Computation, 151-158
2007
EKW-BSnap-SCG07-authprep.pdf241
21
Public
Proceedings ArticleEigenwillig, Arno
Kettner, Lutz
[Wolpert, Nicola]
Snap rounding of Bézier curves
In: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07), 158-167
2007
EKW-BSnap-SCG07-addendum.pdf241
21
Public
Proceedings ArticleEigenwillig, Arno
Kettner, Lutz
[Wolpert, Nicola]
Snap rounding of Bézier curves
In: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07), 158-167
2007
EKSW-Cubics-CGTA-authprep.pdf493Public
Journal ArticleEigenwillig, Arno
Kettner, Lutz
[Schömer, Elmar]
Wolpert, Nicola
Exact, Efficient and Complete Arrangement Computation for Cubic Curves
In: Computational Geometry [35], 36-73
2006
ek-vaepaa-08.pdf77Public
Proceedings ArticleEmeliyanenko, Pavel
Kerber, Michael
Visualizing and Exploring Planar Algebraic Arrangements -- a Web Application
In: Proceedings of the 24th ACM Symposium on Computational Geometry, 224-225
2008
ek-arrangements-2008-authprep.pdf259Public
Proceedings ArticleEigenwillig, Arno
Kerber, Michael
Exact and Efficient 2D-Arrangements of Arbitrary Algebraic Curves
In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA08), 122-131
2008
Eigenwillig2007a.pdf106
179
Internal
Internet Download forbidden
Journal ArticleEigenwillig, ArnoOn Multiple Roots in Descartes' Rule and Their Distance to Roots of Higher Derivatives
In: Journal of Computational and Applied Mathematics [200], 226-230
2007
ECG-TR-363109-02.ps.gz337Public
ReportKlein, ChristianA Fast Root Checking Algorithm2004
ECG-TR-361200-01.pdf893Public
ReportBerberich, Eric
Eigenwillig, Arno
[Emiris, Ioannis]
[Fogel, Efraim]
[Hemmer, Michael]
[Halperin, Dan]
[Kakargias, Athanasios]
Kettner, Lutz
Mehlhorn, Kurt
[Pion, Sylvain]
[Schömer, Elmar]
[Teillaud, Monique]
[Wein, Ron]
Wolpert, Nicola
An Empirical Comparison of Software for Constructing Arrangements of Curved Arcs2004
E024423682.pdf497Intranet
Journal ArticleBast, HolgerPräzisionssuche im homöopathischen Netz
In: Homöopathie-Zeitschrift [I/05], 119-122
2005
DynamicFractionalCascading.pdf16216Public
Journal ArticleMehlhorn, Kurt
Näher, Stefan
Dynamic Fractional Cascading
In: Algorithmica [5], 215-241
1990
dumitriu2007_mscthesis.pdf1333Public
Thesis - Master's thesisDumitriu, DanielGraph-based Conservative Surface Reconstruction
Universität des Saarlandes
2007
dual3145.pdf192Intranet
Journal Article[Bouziane, Driss]
El Kahoui, M'hammed
Computation of the dual of a plane projective curve
In: Journal of Symbolic Computation [34], 105-117
2002
ds_kernel_LNCS.pdf184Public
Proceedings ArticlePhilip, Geevarghese
[Raman, Venkatesh]
[Sikdar, Somnath]
Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels
In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, 694-705
2009
Donato-etal-Web-07.pdf269Internal
Internet Download forbidden
Electronic Journal Article[Donato, Debora]
[Laura, Luigi]
[Leonardi, Stefano]
[Millozzi, Stefano]
Meyer, Ulrich
[Sibeyn, Jop F.]
Algorithms and Experiments for the Webgraph
In: Journal of Graph Algorithms and Applications [10], 219-236
2006
domset-clawfree.pdf428Public
Journal Article[Cygan, Marek]
Philip, Geevarghese
[Pilipczuk, Marcin]
[Pilipczuk, Micha\l{}]
[Wojtaszczyk, Jakub Onufry]
Dominating set is fixed parameter tractable in claw-free graphs
In: Theoretical Computer Science [412], 6982-7000
2011
dominance_journal.pdf252
349
252
Intranet
Journal ArticleAlthaus, Ernst
[Duchier, Denys]
[Koller, Alexander]
Mehlhorn, Kurt
[Niehren, Joachim]
Thiel, Sven
An Efficient Algorithm for the Configuration Problem of Dominance Graphs
In: Journal of Algorithms [48], 194-219
2003
DomChrom.pdf478Public
Proceedings Article[Arumugam, S.]
[Chandrasekar, K. Raja]
[Misra, Neeldhara]
Philip, Geevarghese
[Saurabh, Saket]
Algorithmic Aspects of Dominator Colorings in Graphs
In: Combinatorial Algorithms - 22nd International Workshop, IWOCA 2011, Victoria, BC, Canada, July 20-22, 2011, Revised Selected Papers, 19-30
2011
DoerrTusnady.pdf183Intranet
Internet Download forbidden
Journal ArticleDoerr, BenjaminMatrix approximation and Tusnády's problem
In: European Journal of Combinatorics [28], 990-995
2007
DoerrStacs2006.pdf448Internal
Internet Download forbidden
Proceedings ArticleDoerr, BenjaminGenerating Randomized Roundings with Cardinality Constraints and Derandomizations
In: STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, 571-583
2006
DoerrJohannsen_2007_RefinedRuntimeAnalysisOfABasicAntColonyOptimizationAlgorithm.pdf238Public
Proceedings ArticleDoerr, Benjamin
Johannsen, Daniel
Refined Runtime Analysis of a Basic Ant Colony Optimization Algorithm
In: IEEE Congress on Evolutionary Computation 2007, 501-507
2007
DoerrJohannsen_2007_AdjacencyListMatchings-AnIdealGenotypeForCycleCovers.pdf223Public
Proceedings ArticleDoerr, Benjamin
Johannsen, Daniel
Adjacency List Matchings --- An Ideal Genotype for Cycle Covers
In: Genetic and Evolutionary Computation Conference (GECCO-2007), 1203-1210
2007
DoerrJohannsenTang_HowSingleAntACOSystemsOptimizePseudo-BooleanFunctions.pdf359
857
Public
Proceedings ArticleDoerr, Benjamin
Johannsen, Daniel
[Tang, Ching Hoo]
How Single Ant ACO Systems Optimize Pseudo-Boolean Functions
In: Parallel Problem Solving from Nature – PPSN X, 378-388
2008
DoerrJohannsenTang_Appendix_HowSingleAntACOSystemsOptimizePseudo-BooleanFunctions.pdf359
857
Public
Proceedings ArticleDoerr, Benjamin
Johannsen, Daniel
[Tang, Ching Hoo]
How Single Ant ACO Systems Optimize Pseudo-Boolean Functions
In: Parallel Problem Solving from Nature – PPSN X, 378-388
2008
DoerrJohannsenSchmidt11.pdf366Public
Proceedings ArticleDoerr, Benjamin
Johannsen, Daniel
[Schmidt, Martin]
Runtime analysis of the (1+1) evolutionary algorithm on strings over finite alphabets
In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, 119-126
2011
DoerrJohannsen10.pdf338Public
Proceedings ArticleDoerr, Benjamin
[Johannsen, Daniel]
Edge-based representation beats vertex-based representation in shortest path problems
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 759-766
2010
DKMS05.pdf231Public
Proceedings ArticleDementiev, Roman
[Kärkkäinen, Juha]
Mehnert, Jens
Sanders, Peter
Better 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
2005
diss.pdf14549Public
Thesis - Doctoral dissertationReichel, JoachimCombinatorial Approaches for the Trunk Packing Problem
Universität des Saarlandes
2006
DirectedCycleBasisJournal.pdf244Public
Journal ArticleMehlhorn, Kurt
[Kavitha, T.]
[Hariharan, R.]
Faster Deterministic and Randomized Algorithms for Minimum Cycle Basis in Directed Graphs
In: SIAM Journal of Computing [38], 1430-1447
2008
Diplom.ps.gz288
Thesis - Master's thesisWeiskircher, Rene2-Schicht-Planarisierung bipartiter Graphen
Universität des Saarlandes
1997
diplom.ps.gz431
Thesis - Master's thesisThiel, SvenPersistente Suchbäume
Universität des Saarlandes
1999
diplom.ps.gz474
Thesis - Master's thesisKlau, Gunnar W.Quasi-orthogonales Zeichnen planarer Graphen mit wenigen Knicken
Universität des Saarlandes
1997
diplom.ps.gz1041
Thesis - Master's thesisReichel, JoachimOptimale Hüllkörper für Objekte mit gekrümmten Oberflächen
Universität des Saarlandes
2001
diplom.ps1473
Thesis - Master's thesisAlthaus, ErnstBerechnung optimaler Steinerbäume in der Ebene
Universität des Saarlandes
1998
diplom.ps14779Public
Thesis - Master's thesisKlein, ChristianControlled Perturbation for Voronoi Diagrams
Universität des Saarlandes
2004
Diedrich,Harren,Jansen,Thoele,Thomas-JCST2008.pdf310Public
Journal Article[Diedrich, Florian]
Harren, Rolf
[Jansen, Klaus]
[Thöle, Ralf]
[Thomas, Henning]
Approximation Algorithms for 3D Orthogonal Knapsack
In: Journal of Science and Technology [23], 749-762
2008
DFKP2006.pdf271Internal
Internet Download forbidden
Journal Article[Dessmark, Anders]
[Fraigniaud, Pierre]
Kowalski, Dariusz
[Pelc, Andrzej]
Deterministic Rendezvous in Graphs
In: Algorithmica [46], 69-96
2006
DeterministicSimulationParallel.pdf46536Public
Proceedings ArticleAlt, Helmut
Hagerup,Torben
Mehlhorn, Kurt
Preparata, Franco P.
Deterministic Simulation of Idealized Parallel Computers on more Realistic Ones
In: Parallel Algorithms and Architectures : International Workshop, 11-15
1987
Descartes-Test-Multiple-JCAM-authprep.pdf106
179
Internal
Internet Download forbidden
Journal ArticleEigenwillig, ArnoOn Multiple Roots in Descartes' Rule and Their Distance to Roots of Higher Derivatives
In: Journal of Computational and Applied Mathematics [200], 226-230
2007
der-ker.pdf134Intranet
Journal ArticleEl Kahoui, M'hammedContants of derivations in polynomial rings over unique factorization domains
In: Proceedings of the Amercian Mathematical Society [132], 2537-2541
2004
DegeneracyGeometry.pdf813Public
Proceedings ArticleBurnikel, Christoph
Mehlhorn, Kurt
Schirra, Stefan
On degeneracy in geometric computations
In: Discrete algorithms (SODA-94) : 5th annual ACM-SIAM symposium, 16-23
1994
DA.pdf1171Public
Thesis - Master's thesisFriedrich, TobiasDeterministic Random Walks on Infinite Grids
Friedrich-Schiller-Universität Jena
2005
dam.pdf218
207
Intranet
Internet Download forbidden
Journal ArticleDoerr, BenjaminNon-independent randomized rounding and coloring
In: Discrete Applied Mathematics [154], 650-659
2006
d-result.pdf152Public
Journal ArticleEl Kahoui, M'hammed$D$-resultant and subresultants
In: Proceedings of the Amercian Mathematical Society [133], 2193-2199
2005
d-cuckoo.ps201Public
Proceedings ArticleFotakis, Dimitris
[Pagh, Rasmus]
Sanders, Peter
[Spirakis, Paul G.]
Space Efficient Hash Tables with Worst Case Constant Access Time
In: Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2003), 271-282
2003
cpm03.pdf223Public
Proceedings ArticleBurkhardt, Stefan
Kärkkäinen, Juha
Fast Lightweight Suffix Array Construction and Checking
In: Combinatorial Pattern Matching: 14th Annual Symposium, CPM 2003, 55-69
2003
CP-paper-FINAL.pdf219
158
995
Intranet
Proceedings ArticleFunke, Stefan
Klein, Christian
Mehlhorn, Kurt
Schmitt, Susanne
Controlled Perturbation for Delaunay Triangulations
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 1047-1056
2005
cover16.dvi108Public
Proceedings Article[Epstein, Leah]
van Stee, Rob
Maximizing the minimum load for selfish agents
In: LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, 264-275
2008
connected_area_part.ps.gz19
Proceedings ArticleHert, SusanConnected Area Partitioning
In: Proceedings of the 17th European Workshop on Computational Geometry (CG-01), 35-38
2001
CongruenceSimilarity.pdf25774Public
Journal ArticleAlt, Helmut
Mehlhorn, Kurt
Wagener, Hubert
Welzl, Emo
Congruence, Similarity, and Symmetries of Geometric Objects
In: Discrete and Computational Geometry [3], 237-256
1988
commute.pdf157Public
Journal ArticleEl Kahoui, M'hammedUFDs with commuting linearly independent locally nilpotent derivations
In: Journal of Algebra [289], 446-452
2005
COMEGO.pdf1258Intranet
Journal ArticleKettner, Lutz
Mehlhorn, Kurt
[Pion, Sylvain]
[Schirra, Stefan]
[Yap, Chee]
Classroom Examples of Robustness Problems in Geometric Computations
In: Computational Geometry: Theory and Applications [40], 61-78
2008
cocoon09.pdf218Public
Proceedings ArticleElbassioni, Khaled
[Makino, Kazuhisa]
Rauf, Imran
On the Readability of Monotone Boolean Formulae
In: Computing and Combinatorics :15th Annual International Conference, COCOON 2009, 496-505
2009
cocoon088a.pdf162Public
Proceedings Article[Fernau, Henning]
[Fomin, Fedor V.]
Philip, Geevarghese
[Saurabh, Saket]
The Curse of Connectivity: $t$-Total Vertex (Edge) Cover
In: Computing and Combinatorics, 16th Annual International Conference, COCOON 2010, Nha Trang, Vietnam, July 19-21, 2010. Proceedings, 34-43
2010
COCOA07.pdf221Internal
Proceedings ArticleMehlhorn, KurtMatchings in Graphs Variations of the Problem
In: Combinatorial Optimization and Applications : First International Conference, COCOA 2007, 1-2
2007
cm-ipec.pdf330Public
Proceedings Article[Ambalath, Abhimanyu M.]
[Balasundaram, Radheshyam]
[H., Chintan Rao]
[Koppula, Venkata]
[Misra, Neeldhara]
Philip, Geevarghese
[Ramanujan, M. S.]
On the Kernelization Complexity of Colorful Motifs
In: Parameterized and Exact Computation - 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings, 14-25
2010
christodoulou.pdf429Internal
Proceedings ArticleChristodoulou, George
[Koutsoupias, Elias]
Kovács, Annamária
Mechanism design for fractional scheduling on unrelated machines
In: Automata, Languages and Programming : 34th International Colloquium, ICALP 2007, 40-52
2007
christodoulouA.pdf402Internal
Proceedings ArticleChristodoulou, George
[Gourves, Laurent]
[Pascual, Fanny]
Scheduling Selfish Tasks: About the Performance of Truthful Algorithms
In: Computing and Combinatorics : 13th Annual International Conference, COCOON 2007, 187-197
2007
ChannelRoutingKnockKneeMode.pdf8607Public
Journal ArticleMehlhorn, Kurt
Preparata, Franco P.
Sarrafzadeh, Maji
Channel Routing in Knock-Knee Mode: Simplified Algorithms and Proofs
In: Algorithmica [1], 213-221
1986
cfvs_walcom.pdf173Public
Proceedings Article[Misra, Neeldhara]
Philip, Geevarghese
[Raman, Venkatesh]
[Saurabh, Saket]
[Sikdar, Somnath]
FPT Algorithms for Connected Feedback Vertex Set
In: WALCOM: Algorithms and Computation, 4th International Workshop, WALCOM 2010, Dhaka, Bangladesh, February 10-12, 2010. Proceedings, 269-280
2010
cfvs_jv.pdf199Public
Journal Article[Misra, Neeldhara]
Philip, Geevarghese
[Raman, Venkatesh]
[Saurabh, Saket]
[Sikdar, Somnath]
FPT Algorithms for Connected Feedback Vertex Set
In: Journal of Combinatorial Optimization [24], 131-146
2012
CertifyingEdgeConnectivity.pdf169Internal
Unpublished/DraftMehlhorn, Kurt
Neumann, Adrian
Schmidt, Jens M.
Certifying 3-Edge-Connectivity2012
census-soda.ps424Public
Proceedings ArticleChang, Kevin L.
[Kannan, Ravi]
The Space Complexity of Pass-Efficient Algorithms for Clustering
In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06, 1157-1166
2006
cds_cccg_electronic.pdf204Public
Proceedings Article[Guibas, Leonidas]
Milosavljevic, Nikola
[Motskin, Arik]
Connected Dominating Sets on Dynamic Geometric Graphs
In: Proceedings of the 22nd Canadian Conference on Computational Geometry (CCCG2010), 27-30
2010
CCCG06paper.pdf126Public
Proceedings ArticleFunke, Stefan
[Malamatos, Theocharis]
[Matijevic, Domagoj]
Wolpert, Nicola
(Approximate) Conic Nearest Neighbors and the induced Voronoi Diagram
In: 18th Canadian Conference on Computational Geometry, 23-26
2006
cards-j_revised2.dvi127Public
Journal Article[Epstein, Leah]
[Levin, Asaf]
van Stee, Rob
Approximation Schemes for Packing Splittable Items with Cardinality Constraints
In: Algorithmica [62], 102-129
2012
cards-j.ps60Public
Proceedings Article[Epstein, Leah]
van Stee, Rob
Approximation schemes for packing splittable items with cardinality constraints
In: Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, 232-245
2008
CameronJohannsenPrellbergSchweitzer_2008_CountingDefectiveParkingFunctions.pdf251Public
Electronic Journal Article[Cameron, Peter]
Johannsen, Daniel
[Prellberg, Thomas]
Schweitzer, Pascal
Counting Defective Parking Functions
In: Electronic Journal of Combinatorics [15], R92
2008
buffer.pdf133Internal
Journal Article[Chan, Ho-Leung]
Megow, Nicole
[Sitters, René]
van Stee, Rob
A note on sorting buffers offline
In: Theoretical Computer Science [423], 11-18
2012
bs-framework-authprep.pdf222Public
Proceedings ArticleBerberich, Eric
Sagraloff, Michael
A 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
2008
BrownRizkallah2011.pdf155Public
Unpublished/DraftRizkallah, ChristineGlivenko and Kuroda for Simple Type Theory2011
BroadcastDD.ps426
454
Internal
Internet Download forbidden
Proceedings ArticleFunke, Stefan
Laue, Sören
Bounded-Hop Energy-Efficient Broadcast in Low-Dimensional Metrics Via Coresets
In: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, 272-283
2007
bounds.pdf229Intranet
Journal ArticleEl Kahoui, M'hammedOn plane polynomial vector fields and the Poincar\'e problem
In: Electronic Journal of Differential Equations [2002], 1-23
2002
Bonifaci2010b.pdf271
271
Public
Journal ArticleBonifaci, Vincenzo
[Harks, Tobias]
[Schäfer, Guido]
Stackelberg Routing in Arbitrary Networks
In: Mathematics of Operations Research [35], 330 - 346
2010
BodirskyGroeplJohannsenKang_2007_ADirectDecompositionOfThree-ConnectedPlanarGraphs.pdf283Public
Internet Download forbidden
Journal Article[Bodirsky, Manuel]
[Gröpl, Clemens]
Johannsen, Daniel
[Kang, Mihyun]
A Direct Decomposition of 3-connected Planar Graphs
In: Séminaire Lotharingien de Combinatoire [B54Ak], 15
2007
Blum.pdf386Priviledged Users
Proceedings ArticleBlum, Norbert
Mehlhorn, Kurt
Mittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten Bäumen
In: Theoretical Computer Science, 4th GI-Conference, 67-78
1979
bk_eaotadc_auth_prep.pdf551Public
Proceedings ArticleBerberich, Eric
Kerber, Michael
Exact Arrangements on Tori and Dupin Cyclides
In: Proceedings of the 2008 ACM Symposium on Solid and Physical Modeling, 59-66
2008
bks_egtaoas.pdf314Public
Proceedings ArticleBerberich, Eric
Kerber, Michael
Sagraloff, Michael
Exact Geometric-Topological Analysis of Algebraic Surfaces
In: Proceedings of the 24th ACM Symposium on Computational Geometry, 164-173
2008
bks-exact-eurocg08.pdf193Public
Proceedings ArticleBerberich, Eric
Kerber, Michael
Sagraloff, Michael
Geometric Analysis of Algebraic Surfaces Based on Planar Arrangements
In: 24th European Workshop on Computational Geometry - Collection of Abstracts, 29-32
2008
bk-arrangements-eurocg08.pdf544Public
Proceedings ArticleBerberich, Eric
Kerber, Michael
Arrangements on Surfaces of Genus One: Tori and Dupin Cyclides
In: 24th European Workshop on Computational Geometry - Collection of Abstracts, 209-212
2008
BF-Orderable.pdf15745Public
Journal ArticleMehlhorn, Kurt
Schmidt, Bernd H.
On BF-orderable graphs
In: Discrete Applied Mathematics [15], 315-327
1986
beier.pdf498Internal
Proceedings ArticleBeier, René
[Röglin, Heiko]
[Vöcking, Berthold]
The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
In: Integer Programming and Combinatorial Optimization : 12th International IPCO Conference, 53-67
2007
Beier2006.pdf264Intranet
Internet Download forbidden
Journal ArticleBeier, René
[Vöcking, Berthold]
Typical Properties of Winners and Losers in Discrete Optimization
In: SIAM Journal on Computing [35], 855-881
2006
Beier2006c.pdf198Intranet
Internet Download forbidden
Journal ArticleBeier, René
[Czumaj, Artur]
[Krysta, Piotr]
[Vöcking, Berthold]
Computing Equilibria for a Service Provider Game with (Im)perfect Information
In: ACM Transactions on Algorithms [2], 679-706
2006
Beier2006b.pdf306Intranet
Internet Download forbidden
Journal ArticleBeier, René
[Vöcking, Berthold]
An Experimental Study of Random Knapsack Problems
In: Algorithmica [45], 121-136
2006
Behle.pdf470Intranet
Proceedings ArticleBehle, MarkusOn threshold BDDs and the optimal variable ordering problem
In: Combinatorial Optimization and Applications : First International Conference, COCOA 2007, 124-135
2007
BehleA.pdf365Internal
Proceedings ArticleBehle, Markus
[Jünger, Michael]
[Liers, Frauke]
A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem
In: Experimental Algorithms : 6th International Workshop, WEA 2007, 379-392
2007
bcover_jour5_rev_sec.pdf116
168
Public
Journal Article[Epstein, Leah]
[Levin, Asaf]
van Stee, Rob
Max-min online allocations with a reordering buffer
In: SIAM Journal on Discrete Mathematics [25], 1230-1250
2011
bcover_jour2.dvi116
168
Public
Journal Article[Epstein, Leah]
[Levin, Asaf]
van Stee, Rob
Max-min online allocations with a reordering buffer
In: SIAM Journal on Discrete Mathematics [25], 1230-1250
2011
bcover-c.pdf105Internal
Proceedings Article[Epstein, Leah]
[Levin, Asaf]
van Stee, Rob
Max-min online allocations with a reordering buffer
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010, 336-347
2010
bastweber07cidr.pdf554Public
Electronic Proceedings ArticleBast, Holger
Weber, Ingmar
The CompleteSearch Engine: Interactive, Efficient, and Towards IR & DB integration
In: CIDR 2007 : 3rd Biennial Conference on Innovative Data Systems Research, 88-95
2007
bastweber06sigir.pdf220Internal
Internet Download forbidden
Proceedings ArticleBast, Holger
Weber, Ingmar
Type 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
2006
BastMSTW2006a.pdf655Internal
Internet Download forbidden
Proceedings ArticleBast, Holger
Majumdar, Debapriyo
Schenkel, Ralf
Theobald, Martin
Weikum, Gerhard
IO-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
2006
bastetal06spire.pdf591Internal
Internet Download forbidden
Proceedings ArticleBast, Holger
[Mortensen, Christian Worm]
Weber, Ingmar
Output-Sensitive Autocompletion Search
In: String Processing and Information Retrieval : 13th International Conference, SPIRE 2006, 150-162
2006
balas-MP2.ps253Intranet
Journal Article[Boros, Endre]
Elbassioni, Khaled M.
[Khachiyan, Leonid]
[Gurvich, Vladimir]
Extending the Balas-Yu Bounds on the Number of Maximal Independent Sets in Graphs to Hypergraphs and Lattices
In: Mathematical Programming, Ser. B [98], 14
2003
BaGiePa2007.pdf514Internal
Internet Download forbidden
Proceedings Article[Miklos, Balint]
Giesen, Joachim
[Pauly, Mark]
Medial 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
2007
ATTUSH4Y.pdf718
718
Public
Journal ArticleElmasry, Amr
[Jensen, Claus]
[Katajainen, Jyrki]
Two New Methods for Constructing Double-Ended Priority Queues from Priority Queues
In: Computing [83], 193-204
2008
ATTLBEBZ.pdf1375
1375
Public
Thesis - Doctoral dissertationJohannsen, DanielRandom combinatorial structures and randomized search heuristics
Universität des Saarlandes
2010
ATTJA6PS73
135
Intranet
Internet Download forbidden
Journal ArticleDoerr, Benjamin
Friedrich, Tobias
Quasirandomness in Graphs
In: Electronic Notes in Discrete Mathematics [25], 61-64
2006
ATTCYBW3.pdf271
271
Public
Journal ArticleBonifaci, Vincenzo
[Harks, Tobias]
[Schäfer, Guido]
Stackelberg Routing in Arbitrary Networks
In: Mathematics of Operations Research [35], 330 - 346
2010
ATT5YF4V4437
5919
Intranet
Proceedings ArticleMehlhorn, KurtOn the Program Size of Perfect and Universal Hash Functions
In: 23th Annual Symposium on Foundations of Computer Science (FOCS 1982), 170-175
1982
aswan.pdf457Public
Proceedings ArticleFunke, Stefan
Matijevic, Domagoj
Sanders, Peter
Constant Time Queries for Energy Efficient Paths in Multi-Hop Wireless Networks
In: First International Workshop on Algorithms for Wireless and Mobile Networks, 97-111
2004
arr_surf_EWCG07.ps367Public
Proceedings ArticleBerberich, Eric
[Fogel, Efi]
[Halperin, Dan]
[Wein, Ron]
Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces
In: Proceedings of 23rd European Workshop on Computational Geometry, 223-226
2007
arno_thesis_2003.pdf1013Public
Thesis - Master's thesisEigenwillig, ArnoExact Arrangement Computation for Cubic Curves
Universität des Saarlandes
2003
area_perf_jour_revised.dvi116Public
Journal Article[Epstein, Leah]
[Levin, Asaf]
van Stee, Rob
Two-dimensional packing with conflicts
In: Acta Informatica [45], 155-175
2008
Approximation Algorithms for 3D Orthogonal Knapsack (TAMC07).pdf217Public
Proceedings Article[Diedrich, Florian]
Harren, Rolf
[Jansen, Klaus]
[Thöle, Ralf]
[Thomas, Henning]
Approximation Algorithms for 3D Orthogonal Knapsack
In: Theory and Applications of Models of Computation, 34-45
2007
anon.pdf600Public
Proceedings Article[Bredereck, Robert]
[Nichterlein, Andr{\'e}]
[Niedermeier, Rolf]
Philip, Geevarghese
The Effect of Homogeneity on the Complexity of $k$-Anonymity
In: Fundamentals of Computation Theory - 18th International Symposium, FCT 2011, Oslo, Norway, August 22-25, 2011. Proceedings, 53-64
2011
AmortizedAnalysisAVL.pdf14846Public
Journal ArticleMehlhorn, Kurt
Tsakalidis, Athanasios K.
An Amortized Analysis of Insertions into AVL-Trees
In: SIAM Journal on Computing [15], 22-33
1986
alt07.ps439Intranet
Proceedings ArticleChang, KevinMultiple pass streaming algorithms for learning mixtures of distributions in $R^d$
In: Algorithmic Learning Theory, 18th International Conference, Proceedings, 16
2007
alg_curves.pdf265Public
MiscellaneousEl Kahoui, M'hammedComputing with algebraic curves in generic position2008
ALGO-S-10-00273.fdf424Internal
Journal Article[Chen, Xujin]
[Epstein, Leah]
[Kleiman, Elena]
van Stee, Rob
Maximizing the minimum load: The cost of selfishness
In: Theoretical Computer Science [482], 9-19
2013
AISTATS09.pdf175Public
Electronic Proceedings Article[Shervashidze, Nino]
Vishwanathan, S .V. N.
[Petri, Tobias H.]
Mehlhorn, Kurt
[Borgwardt, Karsten M.]
Efficient Graphlet Kernels for Large Graph Comparison
In: Proceedings of the Twelfth International Conference on Artificial Intelligence and Statistics (AISTATS), 488-495
2009
AG1_004.pdf250Internal
Internet Download forbidden
Proceedings ArticleAjwani, Deepak
[Dementiev, Roman]
Meyer, Ulrich
A computational study of external memory BFS algorithms
In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06, 601-610
2006
AG1_003.pdf104
238
Previledged Users
Internet Download forbidden
Proceedings ArticleEigenwillig, Arno
Kettner, Lutz
[Krandick, Werner]
Mehlhorn, Kurt
Schmitt, Susanne
Wolpert, Nicola
A Descartes algorithm for polynomials with bit-stream coefficients
In: Computer Algebra in Scientific Computing : 8th International Workshop, CASC 2005, 138-149
2005
AG1_002.pdf245
294
Intranet
Internet Download forbidden
Proceedings ArticleBerberich, Eric
Eigenwillig, Arno
[Hemmer, Michael]
[Hert, Susan]
Kettner, Lutz
Mehlhorn, Kurt
Reichel, Joachim
Schmitt, Susanne
[Schömer, Elmar]
Wolpert, Nicola
EXACUS: Efficient and exact algorithms for curves and surfaces
In: 13th Annual European Symposium on Algorithms (ESA 2005), 155-166
2005
AG1_001.ps207Previledged Users
Internet Download forbidden
Proceedings ArticleKutz, Martin
[Pór, Attila]
Angel, Devil, and King
In: Computing and Combinatorics : 11th Annual International Conference, COCOON 2005, 925-934
2005
acstr12110303.pdf172Public
ReportFunke, Stefan
Klein, Christian
Mehlhorn, Kurt
Schmitt, Susanne
Controlled Perturbation for Delaunay Triangulations2006
ACS-TR-363608-02.pdf120Public
ReportEmeliyanenko, Pavel
Kerber, Michael
Visualizing and Exploring Planar Algebraic Arrangements - a Web Application2008
ACS-TR-363602-01.pdf162Public
ReportEmeliyanenko, Pavel
Kerber, Michael
An implementation of the 2D Algebraic Kernel2008
ACS-TR-243404-03.pdf109Public
ReportKerber, MichaelOn filter methods in CGAL's 2D curved kernel2008
ACS-TR-121108-01.pdf212Public
ReportEigenwillig, Arno
Kettner, Lutz
[Wolpert, Nicola]
Snap Rounding of Bézier Curves2007
ACM-final.pdf176Public
Journal ArticleElmasry, Amr
[Jensen, Claus]
[Katajainen, Jyrki]
Multipartite Priority Queues
In: ACM Transactions on Algorithms [5], 1-19
2008
ACM-final.pdf656Public
Journal ArticleElmasry, Amr
[Hammad, Abdelrahman]
Inversion-Sensitive Sorting Algorithms in Practice
In: ACM Journal of Experimental Algorithmics [13], 1-18
2008
61517561.pdf264Internal
Internet Download forbidden
Part of a Book[Fogel, Efi]
[Halperin, Dan]
Kettner, Lutz
[Teillaud, Monique]
[Wein, Ron]
Wolpert, Nicola
Arrangements
In: Effective Computational Geometry for Curves and Surfaces, 1-66
2007
38876.ps545Intranet
Journal Article[Boros, Endre]
Elbassioni, Khaled M.
[Khachiyan, Leonid]
[Gurvich, Vladimir]
[Makino, Kazuhisa]
Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities
In: SIAM Journal on Computing [31], 20
2002
25.pdf532Public
Proceedings ArticleJez, ArturRecompression: a simple and powerful technique for word equations
In: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), 233-244
2013
21approx-waoa-report.pdf2426Internal
Journal Articlevan Stee, RobSIGACT News Online Algorithms Column 21: APPROX and ALGO
In: SIGACT News [43], 123-129
2012
2012SOCG.pdf214Internal
Proceedings Article[Alvarez, Victor]
Bringmann, Karl
[Curticapean, Radu]
Ray, Saurabh
Counting Crossing Free Structures
In: Proceedings of the Twenty-Eight Annual Symposium on Computational Geometry (SCG'12), 61-68
2012
2012ICALP.pdf306Internal
Proceedings ArticleBringmann, Karl
[Panagiotou, Konstantinos]
Efficient Sampling Methods for Discrete Distributions
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 133-144
2012
2012GECCO.pdf249Internal
Proceedings ArticleBringmann, Karl
Friedrich, Tobias
Convergence of Hypervolume-Based Archiving Algorithms II: Competitiveness
In: GECCO'12 : Proceedings of the Fourteenth International Conference on
Genetic and Evolutionary Computation, 457-464
2012
2011ewea.pdf370Public
Proceedings ArticleWagner, Markus
[Veeramachaneni, Kalyan]
[Neumann, Frank]
[O'Reilly, Una-May]
Optimizing the Layout of 1000 Wind Turbines
In: European Wind Energy Association Annual Event, 1-10
2011
2006SWATofficial_rounding.pdf420MPG
Proceedings ArticleDoerr, Benjamin
Friedrich, Tobias
Klein, Christian
Osbild, Ralf
Unbiased Matrix Rounding
In: Algorithm theory - SWAT 2006 : 10th Scandinavian Workshop on Algorithm Theory, 102-112
2006
2006SWATofficial_oto.pdf481MPG
Proceedings ArticleAjwani, Deepak
Friedrich, Tobias
Meyer, Ulrich
An $O(n^2.75)$ algorithm for online topological ordering
In: Algorithm theory - SWAT 2006 : 10th Scandinavian Workshop on Algorithm Theory, 53-64
2006
2006ISAAC.pdf123Public
Proceedings ArticleDoerr, Benjamin
Friedrich, Tobias
Deterministic Random Walks on the Two-Dimensional Grid
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 474-483
2006
2006CTW_Propp.pdf73
135
Intranet
Internet Download forbidden
Journal ArticleDoerr, Benjamin
Friedrich, Tobias
Quasirandomness in Graphs
In: Electronic Notes in Discrete Mathematics [25], 61-64
2006
2000.phdthesis.ps.gz377
Thesis - Doctoral dissertationBast, HannahProvably Optimal Scheduling of Similar Tasks
Universität des Saarlandes
2000
1.pdf647Internal
Proceedings ArticleJez, Artur
[Lohrey, Markus]
Approximation of smallest linear tree grammar
In: 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 445-457
2014
187.pdf151Public
Proceedings ArticleMehlhorn, Kurt
Michail, Dimitrios
Implementing Minimum Cycle Basis Algorithms
In: Experimental and Efficient Algorithms, 4th InternationalWorkshop, WEA 2005, 32-43
2005
185.pdf187
214
Public
Proceedings ArticleKavitha, Telikepalli
Mehlhorn, Kurt
A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs
In: STACS 2005 : 22nd Annual Symposium on Theoretical Aspects of Computer Science, 654-665
2005
184.pdf219
158
995
Intranet
Proceedings ArticleFunke, Stefan
Klein, Christian
Mehlhorn, Kurt
Schmitt, Susanne
Controlled Perturbation for Delaunay Triangulations
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 1047-1056
2005
183.pdf235
872
Intranet
Proceedings ArticleAbraham, David
[Irving, Robert W.]
Mehlhorn, Kurt
Telikepalli, Kavitha
Popular Matchings
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 424-432
2005
182.pdf222
400
Intranet
Proceedings ArticleAbraham, David
[Cechlárová, Katarina]
[Manlove, David F.]
Mehlhorn, Kurt
Pareto-optimality in house allocation problems
In: Algorithms and Computation: 15th International Symposium, ISAAC 2004, 3-15
2004
181.pdf134Working Group
Unpublished/DraftMehlhorn, Kurt
Michail, Dimitrios
Network Problems with Non-Polynomial Weights and Applications2005
180.pdf174
918
Intranet
Proceedings ArticleBaswana, Surender
Telikepalli, Kavitha
Mehlhorn, Kurt
Pettie, Seth
New 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
2005
179.pdf259
200
Public
Proceedings ArticleKavitha, Telikepalli
Mehlhorn, Kurt
Michail, Dimitrios
[Paluch, Katarzyna]
A Faster Algorithm for Minimum Cycle Basis of Graphs
In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, 846-857
2004
178.pdf127
224
Intranet
Proceedings ArticleKettner, Lutz
Mehlhorn, Kurt
[Pion, Sylvain]
[Schirra, Stefan]
[Yap, Chee]
Classroom Examples of Robustness Problems in Geometric Computations
In: ESA 2004: 12th Annual European Symposium on Algorithms, 702-713
2004
176.pdf217
177
Intranet
Proceedings Article[Aranov, Boris]
[Asano, Tetsuo]
[Katoh, Naoki]
Mehlhorn, Kurt
[Tokuyama, Takeshi]
Polyline Fitting of Planar Points Under Min-sum Criteria
In: Algorithms and Computation: 15th International Symposium, ISAAC 2004, 77-88
2004
175.pdf72
194
Intranet
Proceedings ArticleKavitha, Telikepalli
Mehlhorn, Kurt
Michail, Dimitrios
[Paluch, Katarzyna]
Strongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents Problem
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 222-233
2004
174.pdf139
176
Intranet
Proceedings ArticleBast, Holger
Mehlhorn, Kurt
Schäfer, Guido
[Tamaki, Hisao]
Matching Algorithms Are Fast in Sparse Random Graphs
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 81-92
2004
173.pdf177
184
Intranet
Proceedings ArticleAlthaus, Ernst
Eisenbrand, Friedrich
Funke, Stefan
Mehlhorn, Kurt
Point Containment in the Integer Hull of a Polyhedron
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 929-933
2004
172.pdf73
258
Intranet
Proceedings ArticleMehlhorn, Kurt
Michail, Dimitrios
Telikepalli, Kavitha
[Irving, Robert W.]
[Paluch, Katarzyna]
Rank-Maximal Matchings
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 68-75
2004
171.pdf291
129
157
Intranet
Proceedings ArticleBanderier, Cyril
Beier, Rene
Mehlhorn, Kurt
Smoothed Analysis of Three Combinatorial Problems
In: Mathematical foundations of computer science 2003 : 28th International Symposium, MFCS 2003, 198-207
2003
170.pdf147
219
Intranet
Proceedings ArticleGranados, Miguel
Hachenberger, Peter
Hert, Susan
Kettner, Lutz
Mehlhorn, Kurt
Seel, Michael
Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation
In: Algorithms - ESA 2003: 11th Annual European Symposium, 654-666
2003
169.pdf133
122
Intranet
Part of a BookMehlhorn, KurtThe reliable algorithmic software challenge RASC : dedicated to Thomas Ottmann on the occassion of his 60th birthday
In: Computer Science in Perspective : essays dedicated to Thomas Ottmann, 255-263
2003
168.pdf30
212
Intranet
Proceedings ArticleDhiflaoui, Marcel
Funke, Stefan
Kwappik, Carsten
Mehlhorn, Kurt
Seel, Michael
Schömer, Elmar
Schulte, Ralph
Weber, Dennis
Certifying and Repairing Solutions to Large LPs - How Good are LP-Solvers?
In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 255-256
2003
167.pdf276
198
Intranet
Proceedings ArticleAlthaus, Ernst
[Bockmayr, Alexander]
[Elf, Matthias]
[Kasper, Thomas]
[Jünger, Michael]
Mehlhorn, Kurt
SCIL - Symbolic Constraints in Integer Linear Programming.
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 75-87
2002
166.pdf147
222
Intranet
Proceedings ArticleMehlhorn, Kurt
Meyer, Ulrich
External-Memory Breadth-First Search with Sublinear I/O
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 723-735
2002
165.pdf541
412
Intranet
Proceedings ArticleBerberich, Eric
Eigenwillig, Arno
Hemmer, Michael
Hert, Susan
Mehlhorn, Kurt
Schömer, Elmar
A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 174-186
2002
164.pdf981
263
Public
Proceedings ArticleKratsch, Dieter
McConnell, Ross
Mehlhorn, Kurt
Spinrad, Jeremy P.
Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs
In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 158-167
2003
162.pdf166
75
Intranet
Journal Article[Kwek, St.]
Mehlhorn, Kurt
Optimal Search for Rationals
In: Information Processing Letters [86], 23-26
2003
161.pdf322
178
Intranet
Journal ArticleBast, Holger
Mehlhorn, Kurt
Schäfer, Guido
Tamaki, Hisao
A Heuristic for Dijkstra's Algorithm With Many Targets and its Use in Weighted Matching Algorithms
In: Algorithmica [36], 75-88
2003
159mehlhorn159.pdf271
3265
Public
Proceedings ArticleMehlhorn, Kurt
Ziegelmann, Mark
CNOP - A Package for Constrained Network Optimization
In: Algorithm engineering and experimentation (ALENEX-01) :Third International Workshop ALENEX 2001 ; revised papers, 17-31
2001
158.pdf479
1178
Intranet
Journal Article[Kececioglu, John]
Lenhof, Hans-Peter
Mehlhorn, Kurt
Mutzel, Petra
Reinert, Knut
[Vingron, Martin]
A polyhedral approach to sequence alignment problems
In: Discrete Applied Mathematics [104], 143-186
2000
157.pdf100
1669
Intranet
Journal ArticleMehlhorn, Kurt
[Seel, Michael]
Infimaximal frames: A technique for making lines look like segments
In: International Journal of Computational Geometry & Applications [13], 241-255
2003
156.pdf147
49
Intranet
Journal ArticleMehlhorn, Kurt
Priebe, Volker
Schäfer, Guido
Sivadasan, Naveen
All-Pairs Shortest-Paths Computation in the Presence of Negative Cycles
In: Information Processing Letters [81], 341-343
2002
155.pdf95
171
Intranet
Proceedings Article[Burnikel, Christoph]
Funke, Stefan
Mehlhorn, Kurt
[Schirra, Stefan]
Schmitt, Susanne
A Separation Bound for Real Algebraic Expressions
In: Proceedings of the 9th Annual European Symposium on Algorithms (ESA-01), 254-265
2001
154.pdf278Public
Proceedings ArticleMehlhorn, Kurt
Schäfer, Guido
Implementation of $O(nm \log n)$ weighted matchings: The power of data structures
In: 4th International Workshop on Algorithm Engineering, 23-38
2000
153.pdf107
120
Intranet
Proceedings ArticleMehlhorn, Kurt
Ziegelmann, Mark
Resource Constrained Shortest Paths
In: Algorithms - ESA 2000, Proceedings of the 8th Annual European Symposium (ESA-00), 326-337
2000
152.pdf30
83
Intranet
Proceedings ArticleMehlhorn, KurtConstraint Programming and Graph Algorithms
In: Automata, Languages and Programming, Proceedings of the 27th International Colloquium (ICALP-00), 571-575
2000
151.pdf242
224
Public
Proceedings ArticleKoller, Alexander
Mehlhorn, Kurt
Niehren, Joachim
A Polynomial-Time Fragment of Dominance Constraints
In: Proceedings of the 38th Annual Meeting of the Association of Computational Linguistics (ACL-00), 368-375
2000
150.pdf252
349
252
Intranet
Journal ArticleAlthaus, Ernst
[Duchier, Denys]
[Koller, Alexander]
Mehlhorn, Kurt
[Niehren, Joachim]
Thiel, Sven
An Efficient Algorithm for the Configuration Problem of Dominance Graphs
In: Journal of Algorithms [48], 194-219
2003
147.pdf151
324
Intranet
Journal ArticleMehlhorn, Kurt
Sanders, Peter
Scanning Multiple Sequences via Cache Memory
In: Algorithmica [35], 75-93
2003
146.pdf154Public
Proceedings ArticleMehlhorn, Kurt
Schirra, Stefan
Geometric Computing with CGAL and LEDA
In: Curve and surface design, Saint-Malo 1999, 277-286
2000
144.pdf498
497
Intranet
Electronic Proceedings ArticleAlthaus, Ernst
Mehlhorn, Kurt
Näher, Stefan
Schirra, Stefan
Experiments on curve reconstruction
In: Proceedings of 2nd Workshop on Algorithm Engineering and Experiments (ALENEX-00), 103-114
2000
143.pdf622
576
Public
Journal ArticleAlthaus, Ernst
Mehlhorn, Kurt
Traveling Salesman-Based Curve Reconstruction in Polynomial Time
In: SIAM Journal on Computing [31], 27-66
2001
141.pdf59
152
Public
Journal Article[Arikati, Srinivasa Rao]
Mehlhorn, Kurt
A correctness certificate for the Stoer-Wagner min-cut algorithm
In: Information Processing Letters [70], 251-254
1999
140.pdf387
186
Intranet
Journal Article[Cheriyan, Joseph]
Mehlhorn, Kurt
An analysis of the highest-level selection rule in the preflow-push max-flow algorithm
In: Information Processing Letters [69], 239-242
1999
139.pdf340
245
Intranet
Journal Article[Dey, Tamal K.]
Mehlhorn, Kurt
Ramos, Edgar A.
Curve reconstruction: Connecting dots with good reason
In: Computational Geometry [15], 229-244
2000
138.pdf220
262
Public
Proceedings ArticleCrauser, Andreas
Mehlhorn, Kurt
LEDA-SM : Extending LEDA to Secondary Memory
In: Algorithm engineering (WAE-99) : 3rd International Workshop, WAE'99, 228-242
1999
135.pdf317
1063
Intranet
Proceedings ArticleBurnikel, Christoph
Fleischer, Rudolf
Mehlhorn, Kurt
Schirra, Stefan
Efficient exact geometric computation made easy
In: Proceedings of the 15th Annual Symposium on Computational Geometry (SCG-99), 341-350
1999
127.pdf258
81
Intranet
Journal ArticleBurnikel, Christoph
Fleischer, Rudolf
Mehlhorn, Kurt
Schirra, Stefan
A strong and easily computable separation bound for arithmetic expressions involving radicals
In: Algorithmica [27], 87-99
2000
0901.1140v2.pdf217Public
Proceedings ArticleElbassioni, Khaled
Raman, Rajiv
Ray, Saurabh
[Sitters, Rene]
On Profit-Maximizing Pricing for the Highway and Tollbooth Problems
In: Algorithmic Game Theory : Second International Symposium, SAGT 2009, 275-286
In: ArXiv.org [5814], 275-286
2009

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