MPI-INF Logo
Publications

Server    domino.mpi-inf.mpg.de

MPI-INF D1 Publications

Entries sorted by: 1. Author,Editor - 2. by Group - 4. with BibTeX cite keys

Login to this database


 

Previous Page | Next Page | Expand All | Collapse All | Search (Full Text)
Show entries starting with: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

YearTitleBibTeX cite key
2002Attachment IconRadiocolorings 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
FNPS02
Hide details for Fotakis, Pagh, Sanders, SpirakisFotakis, Pagh, Sanders, Spirakis
2005Space Efficient Hash Tables With Worst Case Constant Access Time
In: Theory of Computing Systems [38], 229-248
Sanders2005b
2003Attachment IconSpace Efficient Hash Tables with Worst Case Constant Access Time
In: Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2003), 271-282
FPSS03
Hide details for Fotakis, SpirakisFotakis, Spirakis
2002Attachment IconMinimum Congestion Redundant Assignments to Tolerate Random Faults
In: Algorithmica [32], 396-422
FS2002a
Hide details for FountoulakisFountoulakis
2007Percolation on sparse random graphs with given degree sequence
In: Internet Mathematics [4], 329-356
Fountoulakis2009a
Hide details for Fountoulakis, Friedrich, HermelinFountoulakis, Friedrich, Hermelin
2011Average Case Parameterized ComplexityavgFPTsubmitted
Hide details for Fountoulakis, HuberFountoulakis, Huber
2009Quasirandom rumor spreading on the complete graph is as fast as randomized rumor spreading
In: SIAM Journal on Discrete Mathematics [23], 1964-1991
HF2009
Hide details for Fountoulakis, Huber, PanagiotouFountoulakis, Huber, Panagiotou
2010Reliable broadcasting in random networks and the effect of density
In: 2010 Proceedings IEEE INFOCOM, 2552-2560
FHPInfocom10
2009Brief Announcement: The Speed of Broadcasting in Random Networks - Density Does Not Matter
In: Distributed Computing : 23rd International Symposium, DISC 2009, 529-530
FHP2009
2009The Speed of Broadcasting in Random Networks: Density Does Not Matter
In: 23rd International Symposium on Distributed Computing (DISC '09), 529-530
FountoulakisHuberPanagiotouBrief2010
Hide details for Fountoulakis, Kang, McDiarmidFountoulakis, Kang, McDiarmid
2010The t-stability number of a random graph
In: The Electronic Journal of Combinatorics [17], R59,1-R59,29
FKMcEJC2010
Hide details for Fountoulakis, Khosla, PanagiotouFountoulakis, Khosla, Panagiotou
2011The Multiple-orientability Thresholds for Random Hypergraphs
In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), 1222-1236
FountoulakisKhoslaPanagiotou2010
Hide details for Fountoulakis, Kühn, OsthusFountoulakis, Kühn, Osthus
2009Minors in random regular graphs
In: Random Structures and Algorithms [35], 444-463
Fountoulakis2009b
2008The order of the largest complete minor in a random graph
In: Random Structures and Algorithms [33], 127-141
Fountoulakis2008b
Hide details for Fountoulakis, PanagiotouFountoulakis, Panagiotou
2013On the Insertion Time of Cuckoo Hashing
In: SIAM Journal on Computing [?], ?-?
FPSSICOMP2013
2012Tight Load Thresholds for Cuckoo Hashing
In: Random Structures and Algorithms [41], 306-333
FP12RSA
20113-Connected Cores In Random Planar Graphs
In: Combinatorics, Probability & Computing [20], 381-412
Fountoulakis2011
2010Orientability of random hypergraphs and the power of multiple choices
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010. - Pt. 1, 348-359
FPIcalp2010
2010Rumor spreading on random regular graphs and expanders
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 13th Internationa lWorkshop, APPROX 2010 and 14th International Workshop, RANDOM 2010, 560-573
FPRandom10
Hide details for Fountoulakis, Panagiotou, SauerwaldFountoulakis, Panagiotou, Sauerwald
2012Ultra-fast rumor spreading in social networks
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 1642-1660
FountoulakisPS12
Hide details for Fountoulakis, ReedFountoulakis, Reed
2008The evolution of the mixing rate of a simple random walk on the giant component of a random graph
In: Random Structures and Algorithms [33], 68-86
Fountoulakis2008
2007Faster Mixing and Small Bottlenecks
In: Probability Theory and Related Fields [137], 475-486
Fountoulakis2007
Hide details for FouzFouz
2012Randomized Rumor Spreading in Social Networks & Complete Graphs
Universität des Saarlandes
FouzDiss2012
2006Hereditary Discrepancy in Different Numbers of Colors
Universität des Saarlandes
BachFouz06
Hide details for Fraigniaud, Gasieniec, Kowalski, PelcFraigniaud, Gasieniec, Kowalski, Pelc
2004Collective Tree Exploration
In: LATIN 2004: Theoretical informatics, 6th Latin American Symposium, 141-151
Kowalski-LATIN-2004
Hide details for Frederickson, Solis-ObaFrederickson, Solis-Oba
1998Algorithms for Measuring Perturbability in Matroid Optimization
In: Combinatorica [18], 503-518
FredericksonSolis-Oba98
Hide details for Fredman, KhachiyanFredman, Khachiyan
1996On the Complexity of Dualization of Monotone Disjunctive Normal Forms
In: J. Algorithms [21], 618-628
FredmanKhachiyan96
Hide details for FriedrichFriedrich
2007Use and Avoidance of Randomness
Universität des Saarlandes
FriedrichPhD2007
2005Attachment IconDeterministic Random Walks on Infinite Grids
Friedrich-Schiller-Universität Jena
Friedrich2005
Hide details for Friedrichs, Kulau, WolfFriedrichs, Kulau, Wolf
2014Energy-efficient voltage scheduling of peripheral components on wireless sensor nodes
In: Communications Workshops (ICC), 2014 IEEE International Conference on, 860-865
fkw-eevsopcowsn-14
Hide details for Friedrich, Bringmann, Voss, IgelFriedrich, Bringmann, Voss, Igel
2011The Logarithmic Hypervolume Indicator
In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, 81-92
FBVI2011
Hide details for Friedrich, Gairing, SauerwaldFriedrich, Gairing, Sauerwald
2012Quasirandom Load Balancing
In: SIAM Journal on Computing [41], 747-771
FriedrichGS2012
2010Quasirandom Load Balancing
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1620-1629
Friedrich2009
Hide details for Friedrich, HebbinghausFriedrich, Hebbinghaus
2011Average update times for fully-dynamic all-pairs shortest paths
In: Discrete Applied Mathematics [159], 1751-1758
FriedrichDAM2011
2008Average Update Times for Fully-Dynamic All-Pairs Shortest Paths.
In: Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC 2008), 693-704
FH08
Hide details for Friedrich, Hebbinghaus, NeumannFriedrich, Hebbinghaus, Neumann
2009Comparison of Simple Diversity Mechanisms on Plateau Functions
In: Theoretical Computer Science [410], 2455-2462
FriHebNeuTCS2009
2007Plateaus Can Be Harder in Multi-Objective Optimization
In: IEEE Congress on Evolutionary Computation 2007, 2622-2629
setcover07
2007Rigorous Analyses of Simple Diversity Mechanisms
In: Genetic and Evolutionary Computation Conference 2007, 1219-1225
selection07
Hide details for Friedrich, Hebbinhaus, NeumannFriedrich, Hebbinhaus, Neumann
2010Plateaus Can Be Harder in Multi-Objective Optimization
In: Theoretical Computer Science [411], 854-864
FHN10
Hide details for Friedrich, He, Hebbinghaus, Neumann, WittFriedrich, He, Hebbinghaus, Neumann, Witt
2010Approximating Covering Problems by Randomized Search Heuristics using Multi-Objective Models
In: Evolutionary Computation [18], 617 - 633
FHHNW10
2009Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem
In: Evolutionary Computation, [17], 3-19
FrietalECJ2009
2007Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models
In: Genetic and Evolutionary Computation Conference 2007, 797-804
MultVC07
2007On Improving Approximate Solutions by Evolutionary Algorithms
In: IEEE Congress on Evolutionary Computation 2007, 2614-2621
HybridVC07
Hide details for Friedrich, Horoba, NeumannFriedrich, Horoba, Neumann
2011Illustration of fairness in evolutionary multi-objective optimization
In: Theoretical Computer Science [412], 1546-1556
FriedrichTCS2011
2009Multiplicative Approximations and the Hypervolume Indicator
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 571-578
FriHorNeuGECCO2009
2008Runtime Analyses for Using Fairness in Evolutionary Multi-Objective Optimization
In: Parallel Problem Solving from Nature (PPSN X), 671-680
FriHorNeuPPSN2008
Hide details for Friedrich, Kroeger, NeumannFriedrich, Kroeger, Neumann
2012Weighted preferences in evolutionary multi-objective optimization
In: International Journal of Machine Learning and Cybernetics [Online First], 1-10
FriedrichKN2011
Hide details for Friedrich, NeumannFriedrich, Neumann
2010When to Use Bit-Wise Neutrality
In: Natural Computing [9], 283 - 294
FriNeuNat2009
2008When to Use Bit-wise Neutrality
In: IEEE Congress on Evolutionary Computation 2008, 997-1003
FriNeuCEC2008
Hide details for Friedrich, Oliveto, Sudholt, WittFriedrich, Oliveto, Sudholt, Witt
2009Analysis of Diversity-Preserving Mechanisms for Global Exploration
In: Evolutionary Computation [17], 455-476
FriedrichOSW2009
2008Theoretical Analysis of Diversity Mechanisms for Global Exploration
In: Proceedings of the 10th annual conference on Genetic and evolutionary computation (GECCO 2008), 945-952
FOSW08
Hide details for Friedrich, SauerwaldFriedrich, Sauerwald
2010The Cover Time of Deterministic Random Walks
In: Computing and Combinatorics : 16th Annual International Conference, COCOON 2010, 130-139
FriedrichSauerwald2010
2010The Cover Time of Deterministic Random Walks
In: The Electronic Journal of Combinatorics [17], R167,1-R167,30
FriedrichSauerwald2010EJC
2009Near-Perfect Load Balancing by Randomized Rounding
In: STOC09 : Proceedings of the 2009 ACM International Symposium on Theory of Computing, 121-130
FS09
Hide details for Friedrich, Sauerwald, StaufferFriedrich, Sauerwald, Stauffer
2011Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions
In: 22nd International Symposium on Algorithms and Computation (ISAAC-11), 190-199
FriedrichSS11
Hide details for Friedrich, Sauerwald, VilenchikFriedrich, Sauerwald, Vilenchik
2011Smoothed analysis of balancing networks
In: Random Structures & Algorithms [39], 115-138
FriedrichRSA2011
2010Smoothed Analysis of Balancing Networks
In: Random Structures and Algorithms [Early View], 1-24
TF_RSA2
2009Smoothed Analysis of Balancing Networks
In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, 472-483
FriedrichSauerwaldVilenchik09
Hide details for FriesFries
2001Implementation of a Dynamic Convex Hall Algorithm in Arbitrary Dimension
Universität des Saarlandes
FriesDipl01
2000Implementation of a Dynamic Convex Hull Algorithm in Arbitrary Dimension
Universität des Saarlandes
Fries2000
Hide details for Fries, Mehlhorn, NäherFries, Mehlhorn, Näher
1985Dynamization of geometric data structuresmehlhorn85z
1985Dynamization of geometric data structures
In: Computational geometry (SCG-85) : 1st symposium, 168-176
mehlhorn85e
Hide details for Fries, Mehlhorn, Näher, TsakalidisFries, Mehlhorn, Näher, Tsakalidis
1987A $\log \log n$ data structure for three-sided range queries
In: Information Processing Letters [25], 269-273
IPL::FriesMNT1987
Hide details for Frigioni, Miller, Nanni, Pasqualone, Schäfer, ZaroliagisFrigioni, Miller, Nanni, Pasqualone, Schäfer, Zaroliagis
1998An experimental study of dynamic algorithms for directed graphs
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 368-380
Frigioni-et-al-98
Hide details for Froyland, Koch, Megow, Duane, WrenFroyland, Koch, Megow, Duane, Wren
2008Optimizing the Landside Operation of a Container Terminal
In: OR Spectrum [30], 53-75
FroylandKMDW08
Hide details for Fuhrmann, SchömerFuhrmann, Schömer
2001A General Method for Computing the Reachable Space of Mechanisms
In: Proceedings of the 2001 ASME Design Engineering Technical Conferences and Computers and Information in Engineering Conference. - Vol. 2, 27th Design Automation Conference (DETC'01), DAC-21057
fs-rsm-01
Hide details for FunkeFunke
2005Topological Hole Detection in Wireless Sensor Networks and its Applications
In: 3rd ACM/SIGMOBILE International Workshop on foundations of Mobile Computing (DIAL-M-POMC), 44-53
FunkeHD2005
2001Combinatorial Curve Reconstruction and the Efficient Exact Implementation of Geometric Algorithms
Universität des Saarlandes
FunkeDiss2001
1997Exact Arithmetic using Cascaded Computation
Universität des Saarlandes
Funke97
Hide details for Funke, Guibas, Nguyen, WangFunke, Guibas, Nguyen, Wang
2006Distance-Sensitive Information Brokerage in Sensor Networks
In: Distributed Computing in Sensor Systems, Second IEEE International Conference, DCOSS 2006, 234-251
FuGui2006
Hide details for Funke, Kesselman, Kuhn, Lotker, SegalFunke, Kesselman, Kuhn, Lotker, Segal
2007Attachment IconImproved approximation algorithms for connected sensor cover
In: Wireless Networks [13], 153-164
FKKLS07
Hide details for Funke, Kesselman, Lotker, SegalFunke, Kesselman, Lotker, Segal
2004Improved Approximation Algorithms for Connected Sensor Cover
In: Ad-hoc, mobil and wireless networks : Third International Conference, ADHOC-NOW 2004, 56-69
FKLS2004
Hide details for Funke, Kesselman, Meyer, SegalFunke, Kesselman, Meyer, Segal
2006A Simple Improved Distributed Algorithm for Minimum CDS in Unit Disk Graphs
In: ACM Transactions on Sensor Networks [2], 444-453
FKesselmanMeyerS2006
2005A Simple Improved Distributed Algorithm for Minimum CDS in Unit Disk Graphs
In: 1st IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob 2005), 220-223
FKMS2005b
Hide details for Funke, KleinFunke, Klein
2006Attachment IconHole Detection or: "How Much Geometry Hides in Connectivity?"
In: Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06, 377-385
FK2006
Hide details for Funke, Klein, Mehlhorn, SchmittFunke, Klein, Mehlhorn, Schmitt
2006Attachment IconControlled Perturbation for Delaunay Triangulationsacstr123109-01
2005Attachment IconControlled Perturbation for Delaunay Triangulations
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 1047-1056
FKMS2005
Hide details for Funke, LaueFunke, Laue
2007Attachment IconBounded-Hop Energy-Efficient Broadcast in Low-Dimensional Metrics Via Coresets
In: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, 272-283
FL2007
Hide details for Funke, Laue, Lotker, NaujoksFunke, Laue, Lotker, Naujoks
2011Power assignment problems in wireless communication: Covering points by disks, reaching few receivers quickly, and energy-efficient travelling salesman tours
In: Ad Hoc Networks [9], 1028-1035
Naujoks2011
Hide details for Funke, Laue, NaujoksFunke, Laue, Naujoks
2007Minimum Energy Broadcast with Few Senders
In: Distributed Computing in Sensor Systems : Third IEEE International Conference, DCOSS 2007, 404-416
FLN2007
Hide details for Funke, Laue, Naujoks, LotkerFunke, Laue, Naujoks, Lotker
2008Power Assignment Problems in Wireless Communication: Covering Points by Disks, Reaching few Receivers Quickly, and Energy-Efficient Travelling Salesman Tours
In: Distributed Computing in Sensor Systems, 4th IEEE International Conference, DCOSS 2008, 282-295
FLNL2008
2006Power Assignment Problems in Wireless Communication
In: ??? [?], 1-14
FunkeLaueLotkerNaujoks2006
Hide details for Funke, Malamatos, Matijevic, WolpertFunke, Malamatos, Matijevic, Wolpert
2006Attachment Icon(Approximate) Conic Nearest Neighbors and the induced Voronoi Diagram
In: 18th Canadian Conference on Computational Geometry, 23-26
FMMW2006
Hide details for Funke, Malamatos, RayFunke, Malamatos, Ray
2004Finding Planar Regions in a Terrain
In: 20th European Workshop on Computational Geometry (EWCG), 1-4
FMR2004b
2004Finding Planar Regions in a Terrain: In Practice and with a Guarantee
In: Proceedings of the Twentieth Annual Symposium on Computational Geometry : (SCG'04), 96-105
FMR2004
Hide details for Funke, Matijevic, SandersFunke, Matijevic, Sanders
2004Attachment IconConstant Time Queries for Energy Efficient Paths in Multi-Hop Wireless Networks
In: First International Workshop on Algorithms for Wireless and Mobile Networks, 97-111
FMS2004
2003Attachment IconApproximating Energy Efficient Paths in Wireless Multi-hop Networks
In: Algorithms - ESA 2003: 11th Annual European Symposium, 230-241
FMS2003
Hide details for Funke, MehlhornFunke, Mehlhorn
2002LOOK - A Lazy Object-Oriented Kernel for Geometric Computation
In: Computational Geometry - Theory and Applications [22], 99-118
fm-look-2002
2000Attachment IconLOOK - a Lazy Object-Oriented Kernel for Geometric Computation
In: Proceedings of the 16th Annual Symposium on Computational Geometry (SCG-00), 156-165
fm-lalokfgc-00
Hide details for Funke, Mehlhorn, NäherFunke, Mehlhorn, Näher
2005Attachment IconStructural filtering: a paradigm for efficient and exact geometric programs
In: Computational Geometry [31], 179-194
mehlhorn05z
1999Attachment IconStructural Filtering: a Paradigm for Efficient and Exact Geometric Programs
In: Abstracts for the 11th Canadian Conference on Computational Geometry (CCCG-99), 39-42
FMN1999
Hide details for Funke, Mehlhorn, Schmitt, Burnikel, Fleischer, SchirraFunke, Mehlhorn, Schmitt, Burnikel, Fleischer, Schirra
2004The LEDA class real number -- extended versionBFFMSS04
Hide details for Funke, MilosavljevicFunke, Milosavljevic
2007Guaranteed-delivery Geographic Routing under Uncertain Node Locations
In: IEEE INFOCOM 2007 : 26th IEEE International Conference on Computer Communications, 1244-1252
FM2007b
2007Network Sketching or: "How much Geometry hides in Connectivity? - Part II"
In: Proceedings of the eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-07), 958-967
FM2007
2005Infrastructure-Establishment from Scratch in Wireless Sensor Networks
In: Distributed computing in sensor systems : First IEEE International Conference, DCOSS 2005, 354-367
FunkeIE2005
Hide details for Funke, RamosFunke, Ramos
2002Smooth-Surface Reconstruction in Near-Linear Time
In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-02), 781-790
fr-ssrinlt-02
2001Reconstructing a Collection of Curves with Corners and Endpoints
In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), 344-353
fr-rcwcae-01
Hide details for Funke, RaufFunke, Rauf
2007Information Brokerage Via Location-Free Double Rulings
In: Ad-Hoc, Mobile, and Wireless Networks : 6th International Conference, ADHOC-NOW 2007, Morelia, Mexico, September 24-26, 2007, Proceedings, 87-100
FunkeRauf07
Hide details for Fürer, MehlhornFürer, Mehlhorn
1989Attachment IconAT$^2$-Optimal Galois Field Multiplier for VLSI
In: IEEE Transactions on Computers [38], 1333-1336
journals/tc/FurerM89
1986AT$^2$-Optimal Galois Field Multiplier for VLSI
In: VLSI Algorithms and Architectures, Aegean Workshop on Computing, 217-225
mehlhorn86d
1986VLSI Algorithms and Architectures, Aegean Workshop on Computing - >> Dublette
In: VLSI Algorithms and Architectures, Aegean Workshop on Computing, 328
mehlhorn86d
1986VLSI Algorithms and Architectures, Aegean Workshop on Computing - >> Dublette
In: VLSI Algorithms and Architectures, Aegean Workshop on Computing, 328
mehlhorn86d
Hide details for Gagie, Gawrychowski, Kärkkäinen, Nekrich, PuglisiGagie, Gawrychowski, Kärkkäinen, Nekrich, Puglisi
2014LZ77-Based Self-indexing with Faster Pattern Matching
In: LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31 - April 4, 2014. Proceedings, 731-742
Gawrychowski2014a
Hide details for Gagie, Gawrychowski, NekrichGagie, Gawrychowski, Nekrich
2013Heaviest Induced Ancestors and Longest Common Substrings
In: 25th Canadian Conference on Computational Geometry (CCCG 13), 145-150
Gawrychowski2013ancestors
Hide details for Gandhi, MestreGandhi, Mestre
2009Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
In: Algorithmica [54], 54-71
journal/algo/GandhiM2007
Hide details for GaoGao
2011Distribution of spanning regular subgraphs in random graphsGao2012dFactor
Hide details for Gao, Jerrum, Kaufmann, Mehlhorn, RüllingGao, Jerrum, Kaufmann, Mehlhorn, Rülling
1988Attachment IconOn Continuous Homotopic One Layer Routing
In: Computational geometry (SCG-88) : 4th symposium, 392-402
conf/compgeom/GaoJKMR89
Hide details for Gao, Kaufmann, Mehlhorn, Rülling, Storb, JerrumGao, Kaufmann, Mehlhorn, Rülling, Storb, Jerrum
1988On Continuous Homotopic One Layer Routing (Extended Abstract)
In: Computational geometry and its applications (CG-88) : international workshop, 55-70
lncs333*55
Hide details for Gao, Wormald, SuGao, Wormald, Su
2010Attachment IconInduced subgraphs in sparse random graphs with given degree sequenceGao2010DegSub
Hide details for GargGarg
1996A 3-approximation for the minimum tree spanning with k-vertices
In: Foundations of computer science (FOCS-96) : 37th annual symposium, 302-309
GSV
Hide details for Garg, Kavitha, Kumar, Mehlhorn, MestreGarg, Kavitha, Kumar, Mehlhorn, Mestre
2010Assigning Papers to Referees
In: Algorithmica [58], 119-136
MehlhonMestre2009
2008Attachment IconAssigning Papers to RefereesMehlhorn2008a
Hide details for Garg, Konjevod, RaviGarg, Konjevod, Ravi
2000Approximation algorithm for the group Steiner tree problem
In: Journal of Algorithms [37], 66-84
GargKonjevodRavi2000
Hide details for Garg, Papatriantafilou, TsigasGarg, Papatriantafilou, Tsigas
1996Distributed List Coloring: How to Dynamically Allocate Frequencies to Mobile Base Stations
In: 8th Annual IEEE Symposium on Parallel and Distributed Processing (SPDP '96), 18-25
Garg-et-al96
Hide details for Garg, VaziraniGarg, Vazirani
1996Approximate max-flow min-(multi)cut theorems and their applications
In: SIAM Journal on Computing [25], 235-251
Garg-Vazirani96
1995A polyhedron with all s-t cuts as vertices, and adjacency of cuts
In: Mathematical Programming (A) [70], 17-25
Garg-Vazirani-95
Hide details for Gärtner, HotzGärtner, Hotz
2009Computability of Analytic Functions with Analytic Machines
In: Mathematical Theory and Computational Practice : 5th Conference on Computability in Europe, CiE 2009, 250-259
GaertnerHotzr2009
Hide details for Gasieniec, IndykGasieniec, Indyk
1997Efficient Parallel Computing with Memory Faults
In: Proceedings of the 11th Symposium on Fundamentals of Computation Theory (FCT-97), 188-197
GasieniecIndyk97
Hide details for Gasieniec, Indyk, KrystaGasieniec, Indyk, Krysta
1997External inverse pattern matching
In: Proceedings of the 8th Symposium on Combinatorial Pattern Matching (CPM-97), 90-101
Gasieniec-Indyk-Krysta97
Hide details for Gasieniec, Jansson, Lingas, ÖstlinGasieniec, Jansson, Lingas, Östlin
1997On the complexity of computing evolutionary trees
In: Proceedings of the 3rd International Conference on Computing and Combinatorics (COCOON-97), 134-145
GasienicJanssonLingasOestlin1997
Hide details for Gasieniec, Karpinski, Plandowski, RytterGasieniec, Karpinski, Plandowski, Rytter
1996Efficient Algorithms for Lempel-Ziv Encoding
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 392-403
Gasieniec1-96
1996Randomized Efficient Algorithms for Compressed Strings: the Finger-Print Approach
In: Combinatorial Pattern Matching: 7th Annual Symposium (CPM'96), 39-49
Gasieniec5-96
Hide details for Gasieniec, Kranakis, Krizanc, PelcGasieniec, Kranakis, Krizanc, Pelc
1996Minimizing Congestion of Layouts for ATM Networks with Faulty Links
In: Mathematical Foundations of Computer Science 1996: 21st International Symposium (MFCS'96), 392-403
Gasieniec3-96
Hide details for Gasieniec, PelcGasieniec, Pelc
1997Broadcasting with a bounded fraction of faulty nodes
In: Journal of Parallel and Distributed Computing [42], 11-20
GasieniecPelc97
1996Adaptive Broadcasting with Faulty Nodes
In: Parallel Computing [22], 903-912
Gasieniec6-96
Hide details for GastGast
1997Das Maximum-Weight-Trace-Problem bei multiplem Sequenz-Alignment
Universität des Saarlandes
Gast97
Hide details for GawrychowskiGawrychowski
2014Simple and efficient LZW-compressed multiple pattern matching
In: Journal of Discrete Algorithms [25], 34-41
Gawrychowski2014e
2013Alphabetic Minimax Trees in Linear Time
In: 8th International Computer Science Symposium in Russia (CSR 2013), 36-48
Gawrychowski2013alphabetic
2012Faster Algorithm for Computing the Edit Distance between SLP-Compressed Strings
In: String Processing and Information Retrieval : 19th International Symposium, SPIRE 2012, 229-236
Gawrychowski2012c
2012Simple and efficient LZW-compressed multiple pattern matching
In: Combinatorial Pattern Matching : 23rd Annual Symposium, CPM 2012, 232-242
Gawrychowski2012b
2012Tying up the loose ends in fully LZW-compressed pattern matching
In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 624-635
Gawrychowski2012a
Hide details for Gawrychowski, Jez, JezGawrychowski, Jez, Jez
2014Validating the Knuth-Morris-Pratt Failure Function, Fast and Online
In: Theory of Computing Systems [54], 337-372
GawrychowskiJez2014
Hide details for Gawrychowski, Kucherov, Nekrich, StarikovskayaGawrychowski, Kucherov, Nekrich, Starikovskaya
2013Minimal Discriminating Words Problem Revisited
In: String Processing and Information Retrieval - 20th International Symposium (SPIRE 2013),
Gawrychowski2013discriminating
Hide details for Gawrychowski, Manea, Mercas, Nowotka, TiseanuGawrychowski, Manea, Mercas, Nowotka, Tiseanu
2013Finding Pseudo-repetitions
In: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), 257-268
Gawrychowski2013
Hide details for Gawrychowski, Manea, NowotkaGawrychowski, Manea, Nowotka
2014Testing Generalised Freeness of Words
In: 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 337-349
Gawrychowski2014
2013Discovering Hidden Repetitions in Words
In: 9th Conference on Computability in Europe (CiE 2013), 210-219
Gawrychowski2013discovering
Hide details for Gawrychowski, Mozes, WeimannGawrychowski, Mozes, Weimann
2014Improved Submatrix Maximum Queries in Monge Matrices
In: Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I, 525-537
Gawrychowski2014b
Hide details for Gawrychowski, StraszakGawrychowski, Straszak
2013Beating O(nm) in Approximate LZW-Compressed Pattern Matching
In: Algorithms and Computation - 24th International Symposium (ISAAC 2013), 78-88
Gawrychowski2013beating
Hide details for Gawrychowski, UznanskiGawrychowski, Uznanski
2014Order-Preserving Pattern Matching with k Mismatches
In: Combinatorial Pattern Matching - 25th Annual Symposium, CPM 2014, Moscow, Russia, June 16-18, 2014. Proceedings, 130-139
Gawrychowski2014c
Hide details for Geismann, Hemmer, SchömerGeismann, Hemmer, Schömer
2001Computing a 3-dimensional Cell in an Arrangement of Quadrics: Exactly and Actually!
In: Proceedings of the 17th Annual Symposium on Computational Geometry (SCG-01), 264-273
ghs-qsi-01
2001The Convex Hull of Ellipsoids (Video)
In: Proceedings of the 17th Annual Symposium on Computational Geometry (SCG-01), 321-322
ghs-che-01
Hide details for Georgiou, Kowalski, ShvartsmanGeorgiou, Kowalski, Shvartsman
2005Efficient gossip and robust distributed computation
In: Theoretical Computer Science [347], 130-166
GKS
2003Efficient Gossip and Robust Distributed Computation
In: Distributed Computing, 17th International Conference (DISC 2003), 224-238
GKS-DISC2003
Hide details for GergovGergov
2000Algorithms for Interval Coloring, Geometric Packing and Memory Optimization
Universität des Saarlandes
GergovDiss00
1996Approximation Algorithms for Dynamic Storage Allocation
In: Algorithms - ESA '96: 4th Annual European Symposium, 52-61
Gergov-et-al96
Hide details for Gergov, MeinelGergov, Meinel
1996Mod-2-OBDDs - a Date Structure that generalizes EXOR-Sum-of-Products and Ordered Binary Decision Diagrams
In: Formal Methods in System Design [8], 273-282
Gergov-Meinel96
Hide details for Giakkoupis, SauerwaldGiakkoupis, Sauerwald
2012Rumor spreading and vertex expansion
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 1623-1641
GiakkoupisS12
Hide details for Giakkoupis, Sauerwald, Sun, WoelfelGiakkoupis, Sauerwald, Sun, Woelfel
2012Low Randomness Rumor Spreading via Hashing
In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 314-325
Sun2012a
Hide details for Giannopoulos, Klein, Kutz, MarxGiannopoulos, Klein, Kutz, Marx
2010Computing geometric minimum-dilation graphs is NP-hard
In: International Journal of Computational Geometry & Applications [20], 147-173
Giannopoulos2010
Hide details for Giannopoulos, Knauer, Wahlström, WernerGiannopoulos, Knauer, Wahlström, Werner
2012Hardness of discrepancy computation and ε-net verification in high dimension
In: Journal of Complexity [28], 162-176
GKWahlstroemW2012
Hide details for Gidenstam, PapatriantafilouGidenstam, Papatriantafilou
2007LFthreads: A Lock-Free Thread Library
In: 11th International Conference On Principles Of Distributed Systems (OPODIS), 217-231
Gidenstam2007a
Hide details for Gidenstam, Papatriantafilou, Sundell, TsigasGidenstam, Papatriantafilou, Sundell, Tsigas
2009Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting
In: IEEE Transactions on Parallel and Distributed Systems [20], 1173-1187
Gidenstam200902
Hide details for Gidenstam, Papatriantafilou, TsigasGidenstam, Papatriantafilou, Tsigas
2010NBmalloc: Allocating Memory in a Lock-Free Manner
In: Algorithmica [58], 304-338
Gidenstam2010
2009NBmalloc : Allocating Memory in a Lock-Free Manner
In: Algorithmica [Online First], 1-35
Gidenstam200903
Hide details for GiesenGiesen
2008Conjoint Analysis for Measuring the Perceived Quality in Volume Rendering
In: IEEE Transactions on Visualization and Computer Graphics [13], 1664-1671
Giesen2007c
2008Delaunay Triangulation Approximates Anchor Hull
In: Computational Geometry - Theory and Applications [36], 131-143
Giesen2007b
2008The Flow Complex: A Data Structure for Geometric Modeling
In: Computational Geometry - Theory and Applications [39], 178-190
Giesen2008z
2007Medial Axis Approximation from Inner Voronoi Balls: A Demo of the Mesecina Tool
In: 23d Annual ACM Symposium on Computational Geometry, 123-124
Giesen2007e
2007The Combinatorial Structure of Polyhedral Choice Based Conjoint Analysis
In: Conjoint Measurement: Methods and Applications, 259-271
Giesen2007conj
Hide details for Giesen, ManjunathGiesen, Manjunath
2009Minimizing Absolute Gaussian Curvature over Meshes
In: Computational Geometry, 1-16
Manjunath2009a
Hide details for Giesen, Mitsche, SchuberthGiesen, Mitsche, Schuberth
2007Attachment IconCollaborative Ranking: an aggregation algorithm for individuals' preference estimation
In: Algorithmic Aspects in Information and Management : Third International Conference, AAIM 2007, 58-67
Giesen2007col
Hide details for Giesen, Schuberth, Simon, Zolliker, ZweifelGiesen, Schuberth, Simon, Zolliker, Zweifel
2007Image-Dependent Gamut Mapping as Optimization Problem
In: IEEE Transactions on Image Processing [16], 2401-2410
Giesen2007
Hide details for Gnewuch, Wahlström, WinzenGnewuch, Wahlström, Winzen
2012A New Randomized Algorithm to Approximate the Star Discrepancy Based on Threshold Accepting
In: SIAM Journal on Numerical Analysis [50], 781-807
GnewuchWW12
Hide details for Goemans, SkutellaGoemans, Skutella
2004Attachment IconCooperative facility location games
In: Journal of Algorithms [50], 194-214
GoemansSkutella2004
Hide details for Goesele, Kautz, Lang, Lensch, SeidelGoesele, Kautz, Lang, Lensch, Seidel
20027th ACM Symposium on Solid Modeling and Applications; Tutorial T1: Geometric Algorithms for Planning and Simulation Tasks in Virtual PrototypingGoeseleEtal2003
Hide details for Goldberg, MacKenzie, Paterson, SrinivasanGoldberg, MacKenzie, Paterson, Srinivasan
2000Contention resolution with constant expected delay
In: Journal of the ACM [42], 1048-1096
GoldbergMacKenziePhilipPatersonSrinivasan2000
Hide details for Golin, Raman, Schwarz, SmidGolin, Raman, Schwarz, Smid
1998Randomized Data Structures for the Dynamic Closest-Pair Problem
In: SIAM Journal on Computing [27], 1036-1072
GolinRamanSchwarzSmidSIAMJCOMPUT1998
1995Simple randomized algorithms for closest pair problems
In: Nordic Journal of Computing [2], 3-27
Schwarz-Smid-et-al95
Hide details for Golumbic, Mintz, RoticsGolumbic, Mintz, Rotics
2006Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial k-trees
In: Discrete Applied Mathematics [154], 1465-1477
GolumbicMR06
Hide details for Goodrich, RamosGoodrich, Ramos
1997Bounded-independence derandomization of geometric partitioning with applications to parallel fixed-dimensional linear programming
In: Discrete and Computational Geometry [18], 397-420
Goodrich-Ramos97
Hide details for Gotsman, Kaligosi, Mehlhorn, Michail, PyrgaGotsman, Kaligosi, Mehlhorn, Michail, Pyrga
2007Attachment IconCycle Bases of Graphs and Sampled Manifolds
In: Computer Aided Geometric Design [24], 464
GKMMP06
Hide details for Gotthilf, Hermelin, Landau, LewensteinGotthilf, Hermelin, Landau, Lewenstein
2010Restricted LCS
In: 17th International Symposium on String Processing and Information Retrieval, 250-257
HermelinLCS2010
Hide details for Govindarajan, Dietze, Agarwal, ClarkGovindarajan, Dietze, Agarwal, Clark
2008Attachment IconA scalable algorithm for dispersing population
In: Journal of Intellingent Information Systems [29], 39-61
Govindarajan2007
Hide details for Granados, Hachenberger, Hert, Kettner, Mehlhorn, SeelGranados, Hachenberger, Hert, Kettner, Mehlhorn, Seel
2003Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementationecg:ghh-boscd-03
2003Attachment IconBoolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation
In: Algorithms - ESA 2003: 11th Annual European Symposium, 654-666
ghhkms-bo3ds-03
Hide details for Grigoriev, van Loon, Sitters, UetzGrigoriev, van Loon, Sitters, Uetz
2006How to Sell a Graph: Guidelines for Graph Retailers
In: Graph-Theoretic Concepts in Computer Science : 32nd International Workshop, WG 2006, 125-136
Sitters2006c
Hide details for GroveGrove
1995On-line Bin Packing with Lookahead
In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95), 430-436
Grove95
Hide details for Grove, Kao, Krishnan, VitterGrove, Kao, Krishnan, Vitter
1995Online Perfect Matching and Mobile Computing
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 194-205
Grove-et-al95
Hide details for Gugelmann, SpöhelGugelmann, Spöhel
2011On balanced coloring games in random graphs
In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 425-430
Spoehel2011a
Hide details for Guibas, Milosavljevic, MotskinGuibas, Milosavljevic, Motskin
2010Attachment IconConnected Dominating Sets on Dynamic Geometric Graphs
In: Proceedings of the 22nd Canadian Conference on Computational Geometry (CCCG2010), 27-30
Milosavljevic2009
Hide details for GuillaumeGuillaume
1997Praktisches Paralleles Paralleles List Ranking
Universität des Saarlandes
Guillaume97
Hide details for Gunopulos, Mannila, SalujaGunopulos, Mannila, Saluja
1997Discovering all most specific sentences by randomized algorithms
In: Proceedings of the 6th International Conference on Database Theory (ICDT-97), 215-229
Gunopulos-et-al97
Hide details for Günther, König, MegowGünther, König, Megow
2010Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width
In: Approximation and Online Algorithms : 7th International Workshop, WAOA 2009, 170-181
GuentherKM2010
Hide details for Günther, Maurer, Megow, WieseGünther, Maurer, Megow, Wiese
2013A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio
In: 24st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013),
MegowWiese-SODA2013
Hide details for Guo, Sun, ZhuGuo, Sun, Zhu
2011Greedy Construction of 2-Approximate Minimum Manhattan Networks
In: International Journal of Computational Geometry and Applications [21], 331-350
Sun2011c
Hide details for Gupta, Janardan, SmidGupta, Janardan, Smid
1999Efficient algorithms for counting and reporting pairwise intersections between convex polygons
In: Information Processing Letters [69], 7-13
GuptaJanardanSmid99
1996Algorithms for generalized halfspace range searching and other intersection searching problems
In: Computational Geometry [5], 321-340
GuptaJanardanSmid96a-1
1996Algorithms for generalized halfspace range searching and other intersection searching problems
In: Computational Geometry [6], 1-19
GuptaJanardanSmid96a-2
1996Fast algorithms for collision and proximity problems involving moving geometric objects
In: Computational Geometry [6], 371-391
GuptaJanardanSmid96b
1995Further results on generalized intersection searching problems:
counting, reporting, and dynamization
In: Journal of Algorithms [19], 282-317
Gupta-Janardan-Smid-1-95
1995The rectangle enclosure and point-dominance problems revisited
In: 11th Annual !CM Symposium on Computational Geometry, 162-171
Gupta-Janardan-Smid-2-95
Hide details for Gupta, Janardan, Smid, DasguptaGupta, Janardan, Smid, Dasgupta
1997The rectangle enclosure and point-dominance problems revisited
In: International Journal of Computational Geometry and Applications [7], 437-456
GuptaJanardanSmidDasgupta1997
1995The rectangle enclosure and point-dominance problems revisited
In: 11th Annual ACM Symposium on Computing Geometry, 162-171
Gupta-et-al95
Hide details for Gupta, Kaller, Mahajan, ShermerGupta, Kaller, Mahajan, Shermer
1996Vertex partitioning problems on partial k-trees
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 161-172
GuptaKallerMahajanShermer96
Hide details for Gupta, MahajanGupta, Mahajan
1997Using amplification to compute majority with small majority gates
In: Computational Complexity [6], 46-63
GuptaMahajan1997
Hide details for GurvichGurvich
1991Criteria for repetition-freeness of functions in the algebra of logic
In: Soviet Math. Dokl. [43], 721-726
Gurvich91
1977On repetition-free Boolean functions
In: Uspekhi Mat. Nauk. (Russian Math. Surveys) [32], 183-184
Gurvich77
Hide details for Güttler, Mehlhorn, SchneiderGüttler, Mehlhorn, Schneider
1980Attachment IconBinary Search Trees: Average and Worst Case Behavior
In: Elektronische Informationsverarbeitung und Kybernetik [16], 41-61
mehhorn80e
1976Binary Search Trees: Average and Worst Case Behaviormehlhorn76
Hide details for Güttler, Mehlhorn, Schneider, WernetGüttler, Mehlhorn, Schneider, Wernet
1976Binary Search Trees: Average and Worst Case Behavior
In: GI - 6. Jahrestagung, 301-313
mehlhorn76g
Hide details for GutwengerGutwenger
1999Design und Implementierung einer Algorithmen-Bibliothek zum Zeichnen von Graphen
Universität des Saarlandes
Gutwenger1999
Hide details for Gutwenger, MutzelGutwenger, Mutzel
1998Planar Polyline Drawings with Good Angular Resolution
In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 167-182
GutwengerMutzel1998
Hide details for HachenbergerHachenberger
2006Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms Optimized Implementation, Experiments and Applications
Universität des Saarlandes
Diss06Hach
1999Dynamic shortest Path Algorithms for Planar and Outerplanar Graphs
Universität des Saarlandes
Hachenberger1999
Hide details for Hachenberger, KettnerHachenberger, Kettner
2005Boolean Operations on 3D Selective Nef Complexes: Optimized Implementation and Experiments
In: ACM Symposium on Solid and Physical Modeling (SPM 2005), 163-174
HachenbergerKettner2005Nef
Hide details for Hachenberger, Kettner, MehlhornHachenberger, Kettner, Mehlhorn
2007Attachment IconBoolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, Optimized Implementation and Experiments
In: Computational Geometry: Theory and Applications [38], 64-99
Kettner2007Nef3
Hide details for HagedoornHagedoorn
2003Nearest Neighbors Can Be Found Efficiently If the Dimension Is Small Relative to the Input Size
In: Database Theory - ICDT 2003 : 9th International Conference, 440-454
Hagedoorn2003:nncbfe
Hide details for Hagedoorn, Overmars, VeltkampHagedoorn, Overmars, Veltkamp
2000A New Visibility Partition for Affine Pattern Matching
In: Discrete Geometry for Computer Imagery, Proceedings of the 9th International Conference (DGCI-00), 358-370
Hagedoorn2000:nvpapm
Hide details for HagerupHagerup
2000Dynamic algorithms for graphs of bounded treewidth
In: Algorithmica [27], 292-315
Hagerup2000a
2000Parallel preprocessing for path queries without concurrent reading
In: Information and Computation [158], 18-28
Hagerup00
1998Simpler and Faster Dictionaries on the AC° RAM
In: Proceedings of the 25th International Colloquium on Automata, Languages and Programming (ICALP-98), 79-90
HagerupICAL98
1998Sorting and Searching on the Word RAM
In: Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS-98), 366-398
Hagerup98
1997Allocating Independent Tasks to Parallel Processors: An Experimental Study
In: Journal of Parallel and Distributed Computing [47], 185-197
Hagerup-97b
1997Dynamic algorithms for graphs of bounded treewidth
In: Proceedings of the 24th International Colloquium on Automata, Languages, and Programming (ICALP-97), 292-302
Hagerup97a
1996Allocating Independent Tasks to Parallel Processors: An Experimental Study
In: Parallel Algorithms for Irregularly Structured Problems: 3rd International Workshop (IRREGULAR'96), 1-33
Hagerup-et-al-1-96
1995A Lower Bound for the Emulation of PRAM Memories on Processor Networks
In: Information and Computation [119], 124-128
Hagerup-1-95
1995Fast Deterministic Processor Allocation
In: Journal of Algorithms [18], 629-649
Hagerup-2-95
1995The Parallel Complexity of Integer Prefix Summation
In: Information Processing Letters [56], 59-64
Hagerup-3-95
Hide details for Hagerup, Katajainen, Nishimura, RagdeHagerup, Katajainen, Nishimura, Ragde
1995Characterizations of k-Terminal Flow Networks and Computing Network Flows in
Partial k-Trees
In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95), 641-649
Hagerup-et-al-2-95
Hide details for Hagerup, KellerHagerup, Keller
1995Fast Parallel Permutation Algorithms
In: Parallel Processing Letters [5], 139-148
Hagerup-Keller95
Hide details for Hagerup, KutylowskiHagerup, Kutylowski
1997Fast integer merging on the EREW PRAM
In: Algorithmica [17], 55-66
Hagerup-Kutylowski97
Hide details for Hagerup, Mehlhorn, MunroHagerup, Mehlhorn, Munro
1993Attachment IconMaintaining Discrete Probability Distributions Optimally
In: Automata, languages and programming (ICALP-93) : 20th international colloquium, 253-264
Mehlhorn93d
Hide details for Hagerup, Sanders, TräffHagerup, Sanders, Träff
1998An Implementation of the Binary Blocking Flow Algorithm
In: Proceedings of the 2nd Workshop on Algorithm Engineering (WAE-98), 143-154
HagSanTra98
Hide details for Hajiaghayi, Khandekar, Kortsarz, MestreHajiaghayi, Khandekar, Kortsarz, Mestre
2010The Checkpoint Problem
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 13th International Workshop, APPROX 2010 and 14th International Workshop, RANDOM 2010, 219-231
approxMestre2010
Hide details for Hall, Hippler, SkutellaHall, Hippler, Skutella
2003Attachment IconMulticommodity Flows Over Time: Efficient Algorithms and Complexity
In: Automata, languages and programming : 30th International Colloquium, ICALP 2003, 397-409
HallHipplerSkutella2003
Hide details for Hall, Langkau, SkutellaHall, Langkau, Skutella
2003An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, 71-82
HallLangkauSkutella2003
Hide details for HammerschmidtHammerschmidt
1999Konzeption und Entwicklung des streng strukturierten und erweiterbaren Datentyps html_page für LEDA
Universität des Saarlandes
Hammerschmidt1999
Hide details for Han, Kelsen, Ramachandran, TarjanHan, Kelsen, Ramachandran, Tarjan
1995Computing minimal spanning subgraphs in linear time
In: SIAM Journal on Computing [24], 1332-1358
Kelsen-et-al95
Hide details for Han, Lam, Lee, To, WongHan, Lam, Lee, To, Wong
2010Deadline scheduling and power management for speed bounded processors
In: Theoretical Computer Science [411], 3587-3600
Lee2010c
Hide details for HappHapp
2009Analyses of Evolutionary Algorithms
Universität des Saarlandes
HappPhD2009
Hide details for Happ, Johannsen, Klein, NeumannHapp, Johannsen, Klein, Neumann
2008Attachment IconRigorous Analyses of Fitness-Proportional Selection for Optimizing Linear Functions
In: Genetic and Evolutionary Computation Conference 2008, 953-960
HappJohannsenKleinNeumann2008a
Hide details for Hariharan, KapoorHariharan, Kapoor
1995Algorithms for Enumerating all Spanning Trees of an Undirected Graph
In: SIAM Journal on Computing [24], 247-265
Hariharan-Kapoor95
Hide details for Hariharan, Kelsen, MahajanHariharan, Kelsen, Mahajan
1996Coloring 2-colorable hypergraphs with a sublinear number of colors
In: Scandinavian Workshop on Algorithm Theory (SWAT96), 41-52
Hariharan-Kelsen-Mahajan96
Hide details for Hariharan, MahajanHariharan, Mahajan
1995Derandomizing semidefinite programming based approximation algorithms
In: 36th IEEE Symposium on Foundations of Computer Science, 162-16
Hariharan-Mahajan95
Hide details for Hariharan, MuthukrishnanHariharan, Muthukrishnan
1995String Matching over a General Matching Relation
In: Information and Computation [122], 140-148
Hariharan-Muthukrishnan95
Hide details for Hariharan, Telikepalli, MehlhornHariharan, Telikepalli, Mehlhorn
2006Attachment IconA Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs
In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Part I, 250-261
HTM06a
Hide details for Harks, Hoefer, Klimm, SkopalikHarks, Hoefer, Klimm, Skopalik
2013Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games
In: Mathematical Programming [141], 193-215
HarksHKS2013
Hide details for HarrenHarren
2010Two-dimensional packing problems
Universität des Saarlandes
HarrenPhD2010
2009Attachment IconApproximation Algorithms for Orthogonal Packing Problems for Hypercubes
In: Theoretical Computer Science [410], 4504-4532
Harren2009a
2007Mehrdimensionale Packungsprobleme - Approximation geometrischer Verallgemeinerungen klassischer PackungsproblemeHarren2007b
2006Attachment IconApproximating the Orthogonal Knapsack Problem for Hypercubes
In: Automata, Languages and Programming, 238-249
Harren2006a
2006Approximation mehrdimensionaler Packungsprobleme
Universität Dortmund
Harren2006b
Hide details for Harren, Jansen, Prädel, van SteeHarren, Jansen, Prädel, van Stee
2011Attachment IconA (5/3 + ε)-Approximation for Strip Packing
In: Algorithms and Data Structures : 12th International Symposium, WADS 2011, 475-487
HaJaPS11
Hide details for Harren, KernHarren, Kern
2012Improved Lower Bound for Online Strip Packing
In: Approximation and Online Algorithms : 9th International Workshop ,WAOA 2011, 211-218
HarKer11
Hide details for Harren, van SteeHarren, van Stee
2012Absolute Approximation Ratios for Packing Rectangles into Bins
In: Journal of Scheduling [15], 63-75
HarSte12
2009Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 12th International Workshop, APPROX 2009 and 13th International Workshop, RANDOM 2009, 177-189
HarrenvanStee2009b
2008Attachment IconPacking Rectangles into 2 OPT Bins using Rotations
In: 11th Scandinavian Workshop on Algorithm Theory, 306-318
HarrenvanStee2008
Hide details for HazbounHazboun
1999Molekül-Docking-Reaktionen
Universität des Saarlandes
Hazboun1999
Hide details for HebbinghausHebbinghaus
2007Attachment IconDiscrepancy of Sums of two Arithmetic ProgressionsHebbinghaus2007
Hide details for Heinz, Kasprzik, KötzingHeinz, Kasprzik, Kötzing
2012Learning in the limit with lattice-structured hypothesis spaces
In: Theoretical Computer Science [457], 111 - 127
HeinyKasprzikKoetzing2012
Hide details for Helwig, Neumann, WankaHelwig, Neumann, Wanka
2009Particle Swarm Optimization with Velocity Adaptation
In: 2009 International Conference on Adaptive and Intelligent Systems ICAIS 2009 : proceedings, 146-151
HelNeuWan2009
Hide details for HemmerHemmer
2009Modular Arithmetic, CGAL - Computational Geometry Algorithms Library, release 3.4mod-hemmer-2009
2009Polynomials, CGAL - Computational Geometry Algorithms Library, release 3.4poly-hemmer-2009
2008CGAL package for modular arithmetic operationsACS-TR-243406-01
2008CGAL package: Algebraic FoundationsACS-TR-243400-04
2008Evaluation of different approaches in 3D curved kernel for arrangements of quadricsACS-TR-363501-01
2008Attachment IconExact Computation of the Adjacency Graph of an Arrangement of Quadrics
Johannes Gutenberg-Universität Mainz
Hemmer2008
2007Algebraic Foundations, CGAL - Computational Geometry Algorithms Library, release 3.3af-hemmer-2007
2002Reliable computation of planar and spatial arrangements of quadrics
Universität des Saarlandes
Hemmer2002
Hide details for Hemmer, Dupont, Petitjean, SchömerHemmer, Dupont, Petitjean, Schömer
2008Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangment of QuadricsACS-TR-241402-01
Hide details for Hemmer, Dupon, Petitjean, SchomerHemmer, Dupon, Petitjean, Schomer
2011A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics
In: Journal of Symbolic Computation [46], 467-494
Hemmer2011
Hide details for Hemmer, Hert, Kettner, Pion, SchirraHemmer, Hert, Kettner, Pion, Schirra
2007Number Types, CGAL - Computational Geometry Algorithms Library, release 3.3nt-hemmer-2007
Hide details for Hemmer, HülseHemmer, Hülse
2009Attachment IconGeneric implementation of a modular GCD over Algebraic Extension Fields
In: EuroCG'09 : 25th European Workshop on Computational Geometry, 321-324
hh-mgcd-2009
2007Traits classes for polynomial gcd computation over algebraic extensionsACS-TR-241405-03
Hide details for Hemmer, Kettner, SchömerHemmer, Kettner, Schömer
2004Effects of a Modular Filter on Geometric Applicationsecg:hks-emfga-04
Hide details for Hemmer, LimbachHemmer, Limbach
2008Arrangements of quadrics in 3D: continued work on experimental implementationACS-TR-363606-01
2007Benchmarks on a generic univariate algebraic kernelACS-TR-243306-03
Hide details for Hemmer, Limbach, SchömerHemmer, Limbach, Schömer
2009Attachment IconContinued Work on the Computation of an Exact Arrangement of Quadrics
In: EuroCG'09 : 25th European Workshop on Computational Geometry, 313-316
hls-qarr-2009
Hide details for Hemmer, Tsigaridas, Zafeirakopoulos, Emiris, Karavelas, MourrainHemmer, Tsigaridas, Zafeirakopoulos, Emiris, Karavelas, Mourrain
2009Experimental evaluation and cross-benchmarking of univariate real solvers
In: Symbolic Numeric Computation 2009 (SNC 2009), 45-54
HTZ-AKCROSS-2009
Hide details for Henzinger, LeonardiHenzinger, Leonardi
2003Scheduling multicasts on unit-capacity trees and meshes
In: Journal of Computer and System Sciences [66], 567-611
Leonardi03
Hide details for Henz, Müller, ThielHenz, Müller, Thiel
2004Global constraints for round robin tournament scheduling
In: European Journal of Operational Research [153], 92-101
HMT04:round-robin
Hide details for Hermelin, Huang, Kratsch, WahlströmHermelin, Huang, Kratsch, Wahlström
2011Parameterized Two-Player Nash Equilibrium
In: Graph-Theoretic Concepts in Computer Science : 37th International Workshop, WG 2011, 215-226
HermelinHuangKratschWahlstrom2011
Hide details for Hermelin, Levy, Weimann, YusterHermelin, Levy, Weimann, Yuster
2011Distance Oracles for Vertex-Labeled Graphs
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 490-501
HermelinLevyWeimanYuster2011
Hide details for Hermelin, Mestre, RawitzHermelin, Mestre, Rawitz
2012Optimization Problems in Dotted Interval Graphs
In: Graph-Theoretic Concepts in Computer Science : 38th InternationalWorkshop, WG 2012, 46-56
HermelinMestreRawitz2012
Hide details for Hermelin, Mnich, van LeeuwenHermelin, Mnich, van Leeuwen
2012Parameterized complexity of induced H-matching on claw-free graphs
In: Algorithms - ESA 2012 : 20th Annual European Symposium, 624-635
HermelinMnichvanLeeuwen2012
Hide details for Hermelin, Mnich, van Leeuwen, WoegingerHermelin, Mnich, van Leeuwen, Woeginger
2011Domination When the Stars Are Out
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 462-473
HermelinMnichVanLeeuwenWoeginger2011
Hide details for Hermelin, RawitzHermelin, Rawitz
2011Optimization problems in multiple subtree graphs
In: Discrete Applied Mathematics [159], 588-594
HermelinRawitz2011
Hide details for Hermelin, Rizzi, VialetteHermelin, Rizzi, Vialette
2012Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph
In: Algorithms and Computation : 23rd International Symposium, ISAAC 2012, 465-474
Hermelin2012
Hide details for Hermelin, WuHermelin, Wu
2012Weak compositions and their applications to polynomial lower bounds for kernelization
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 104-113
HermelinWu2012
Hide details for HertHert
2001Attachment IconConnected Area Partitioning
In: Proceedings of the 17th European Workshop on Computational Geometry (CG-01), 35-38
h-cap-01
Hide details for Hertel, Mäntylä, Mehlhorn, NievergeltHertel, Mäntylä, Mehlhorn, Nievergelt
1984Attachment IconSpace Sweep Solves Intersection of Convex Polyhedra
In: Acta Informatica [21], 501-519
mehlhorn84oz
Hide details for Hertel, MehlhornHertel, Mehlhorn
1985Attachment IconFast Triangulation of the Plane with Respect to Simple Polygons
In: Information and Control [64], 52-76
mehlhorn85e
1983Fast Triangulation of Simple Polygons
In: Fundamentals of Computation Theory, Proceedings of the 1983 International FCT-Conference (FCT 1983), 207-218
mehlhorn83f
Hide details for Hertel, Mehlhorn, Mäntylä, NievergeltHertel, Mehlhorn, Mäntylä, Nievergelt
1984Attachment IconSpace sweep solves intersection of two convex polyhedra elegantlyHertel84/02
Hide details for Hert, Hoffmann, Kettner, Pion, SeelHert, Hoffmann, Kettner, Pion, Seel
2007An adaptable and extensible geometry kernel
In: Computational Geometry: Theory and Applications [38], 16-36
Kettner2007CGALKernel
2001An Adaptable and Extensible Geometry Kernel
In: Proceedings of the 5th International Workshop on Algorithm Engineering (WAE-01), 79-90
hhkps-aegk-01
Hide details for Hert, LumelskyHert, Lumelsky
1999Motion Planning in R^3 for Multiple Tethered Robots
In: IEEE Transactions on Robotics and Automation [15], 623-639
Hert1999
Hide details for Hert, RichardsHert, Richards
2002Multiple Robot Motion Planning = Parallel Processing + Geometry
In: Sensor Based Intelligent Robots, 183-205
hr-mrmpipppg-01
Hide details for HeydrichHeydrich
2012Dividing connected chores fairly
Universität des Saarlandes
HeidrichBachelor2012
Hide details for Heydrich, van SteeHeydrich, van Stee
2015Dividing Connected Chores Fairly
In: Theoretical Computer Science [593], 51-61
Heydrich2015
2013Attachment IconDividing connected chores fairly
In: 6th International Symposium on Algorithmic Game Theory, 420-433
HeySte13
Hide details for Heydthausen, MehlhornHeydthausen, Mehlhorn
1976Top Down Parsing of Macro Grammars
In: GI - 6. Jahrestagung, 95-108
mehlhorn76f
1976Top down parsing of macro grammars (preliminary report)mehlhorn76z
Hide details for HilpertHilpert
1996Heuristiken fur das euklidische Travelling Salesman Problem
Universitat des Saarlandes
Hilpert96
Hide details for HoeferHoefer
2013Local Matching Dynamics in Social Networks
In: Information & Computation [222], 20-35
Hoefer2013
2013Strategic Cooperation in Cost Sharing Games
In: International Journal of Game Theory [42], 29-53
Hoefer-IJGT-2013
2003Experimental comparison of heuristic and approximation algorithms for uncapacitated facility location
In: 2nd International Workshop on Experimental and Efficient Algorithms (WEA-03), 165-178
Hoefer03
Hide details for Hoefer, KesselheimHoefer, Kesselheim
2013Brief Announcement: Universally Truthful Secondary Spectrum Auctions
In: 25th Symposium on Parallelism in Algorithms and Architectures (SPAA-13), 99-101
HoeferK2013
Hide details for Hoefer, Kesselheim, VöckingHoefer, Kesselheim, Vöcking
2013Truthfulness and Stochastic Dominance with Monetary Transfers.
In: 14th Conf. Electronic Commerce (EC-13), 567-582
HoeferKV2013
Hide details for Hoefer, SauerwaldHoefer, Sauerwald
2013Brief Announcement: Threshold Load Balancing in Networks
In: 32nd Symposium on Principles of Distributed Computing (PODC-13), 54-56
HoeferS2013
Hide details for Hoefer, SkopalikHoefer, Skopalik
2013Altruism in Atomic Congestion Games
In: ACM Transactions on Economics and Computation [1], 21
HoeferS-TEAC-2013
2013On the Complexity of Pareto-optimal Nash and Strong Equilibria
In: Theory of Computing Systems [53], 441-453
HoeferS-TOCS-2013
Hide details for Hoefer, WagnerHoefer, Wagner
2013Designing Profit Shares in Matching and Coalition Formation Games
In: 9th Conference on Web and Internet Economics (WINE-13), 249-262
HoeferW-WINE-2013
2013Locally Stable Marriage with Strict Preferences
In: 40th International Colloquium on Automata, Languages and Programming (ICALP-13), 620-631
HoeferW2013
Hide details for Hoepman, Papatriantafilou, TsigasHoepman, Papatriantafilou, Tsigas
1995Self-Stabilization in Wait-Free Shared Memory Objects
In: Distributed Algorithms: 9th International Workshop (WDAG95), 273-287
Hoepman-Papatr-Tsigas95
Hide details for Hoffmann, MehlhornHoffmann, Mehlhorn
1984Intersecting a line and a simple polygon
In: EATCS Bulletin [22], 120-121
mehlhorn84l
Hide details for Hoffmann, Mehlhorn, Rosenstiehl, TarjanHoffmann, Mehlhorn, Rosenstiehl, Tarjan
1986Attachment IconSorting Jordan Sequences in Linear Time Using Level-Linked Search Trees
In: Information and Control [68], 170-184
IC::HoffmanMRT1986
1985Sorting Jordan sequences in linear time
In: Computational geometry (SCG-85) : 1st symposium, 196-203
mehlhorn85e
1984Sorting Jordan sequences in linear timemehlhorn93k
Hide details for Höhn, Jacobs, MegowHöhn, Jacobs, Megow
2012On Eulerian extensions and their application to no-wait flowshop scheduling
In: Journal of Scheduling [15], 295-309
Megow2012-eulerian
Hide details for Hong, MehlhornHong, Mehlhorn
1982Cost tradeoffs in graph embeddings, with applicationsmehlhorn82g
Hide details for Hong, Mehlhorn, RosenbergHong, Mehlhorn, Rosenberg
1983Attachment IconCost Trade-offs in Graph Embeddings, with Applications
In: Journal of the ACM [30], 709-728
mehlhorn83f
1981Cost Tradeoffs in Graph Embeddings, with Applications (Preliminary Version)
In: Automata, languages and programming (ICALP-81) : 8th international colloquium, 41-55
mehlhorn81a
Hide details for Hoogeveen, Skutella, WoegingerHoogeveen, Skutella, Woeginger
2003Attachment IconPreemptive scheduling with rejection
In: Mathematical Programming [94], 361-374
HoogeveenSkutellaWoeginger2003
Hide details for Horoba, NeumannHoroba, Neumann
2009Additive Approximations of Pareto-Optimal Sets by Evolutionary Multi-Objective Algorithms
In: FOGA'09 : Revised Selected Papers from ACM SIGEVO Foundations of Genetic Algorithms X, 79-86
HorNeuFOGA2009
2008Benefits and Drawbacks for the Use of epsilon-Dominance in Evolutionary Multi-Objective Optimization
In: Genetic and Evolutionary Computation Conference 2008, 641-680
HorNeuGECCO2008
Hide details for HuangHuang
2012Non-preemptive Speed Scaling
In: Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops, 249-260
Huang2012a
2010Circular stable matching and 3-way kidney transplant
In: Algorithmica [58], 137-150
Huang2010a
2010Classified stable matching
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1235-1253
Huang2010
Hide details for Huang, KavithaHuang, Kavitha
2011Near-popular matchings in the Roommates problem
In: 19th European Symposium on Algorithms (ESA),
Huang2011b
2011Popular Matchings in the Stable Marriage Problem
In: 38th International Colloquium on Automata, Languages and Programming (ICALP),
Huang2011a
Hide details for Huang, Kavitha, Michael, NasrHuang, Kavitha, Michael, Nasr
2011Bounded Unpopularity Matchings
In: Algorithmica [61], 738-757
Huang2011
Hide details for Huang, Kavitha, Michail, NasreHuang, Kavitha, Michail, Nasre
2008Bounded Unpopularity Matchings
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), 127-137
HKMN08
Hide details for HuberHuber
2010Randomized rounding and rumor spreading with stochastic dependencies
Universität des Saarlandes
HuberPhD2010
Hide details for Huddleston, MehlhornHuddleston, Mehlhorn
1982A New Data Structure for Representing Sorted Lists
In: Acta Informatica [17], 157-184
mehlhorn82c
1981Attachment IconRobust balancing in B-trees
In: Theoretical computer science : 5th GI-conference, 234-244
mehlhorn81c
Hide details for HumbleHumble
1997Die Berechnung maximaler Flüsse in Netzwerken
Universität des Saarlandes
Humble97
Hide details for Hundack, Mutzel, Pouchkarev, ThomeHundack, Mutzel, Pouchkarev, Thome
1997ArchE: A Graph Drawing System for Archaeology
In: Proceedings of the 5th Symposium on Graph Drawing (GD-97), 297-302
HMPT97
Hide details for Hundack, Prömel, StegerHundack, Prömel, Steger
1997Extremal Graph Problems for Graphs with a Color-Critical Vertex
In: Combinatorics, Geometry and Probability, 421-433
HundackPrömelSteger97
Hide details for Hutchinson, Sanders, VitterHutchinson, Sanders, Vitter
2005Duality Between Prefetching and Queued Writing with Parallel Disks
In: SIAM Journal on Computing [34], 1443-1463
Sanders2005
2001Duality Between Prefetching and Queued Writing with Parallel Disks
In: Proceedings of the 9th Annual European Symposium on Algorithms (ESA-01), 62-73
HutSanVit2001
2001The Power of Duality for Prefetching and Sorting with Parallel Disks
In: Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-01), 334-335
HutSanVit2001a
Hide details for Iacono, Ramezani, Soranzo, AltafaniIacono, Ramezani, Soranzo, Altafani
2010Determining the distance to monotonicity of a biological network: a graph-theoretical approach
In: IET Systems Biology [4], 223-235
Ramezani2010
Hide details for ImmichImmich
2001Berechnung der Momente von quadratischen Komplexen
Universität des Saarlandes
ImmichDipl01
Hide details for IngalalliIngalalli
2011Evolutionary algorithms to compute lower bounds for the star discrepancy
Universität des Saarlandes
IngalalliMaster2011
Hide details for Irving, Telikepalli, Mehlhorn, Michail, PaluchIrving, Telikepalli, Mehlhorn, Michail, Paluch
2006Attachment IconRank-Maximal Matchings
In: ACM Transactions on Algorithms [2], 602-610
ITMMP2006
Hide details for IssacIssac
2015Sampling in Space Restricted Settings
In: Computing and Combinatorics 2015,
Issac2015Sampling
Hide details for Jain, Kötzing, StephanJain, Kötzing, Stephan
2012Enlarging Learnable Classes
In: Algorithmic Learning Theory : 23rd International Conference, ALT 2012, 36-50
JainKoetzingStephan2011
Hide details for Janardan, SmidJanardan, Smid
1995On the width and roundness of a set of points in the plane
In: 7th Canadian Conference on Computational Geometry, 193-198
Janardan-Smid95
Hide details for JansenJansen
1998A New Characterization for Parity Graphs and a Coloring Problem with Costs
In: Proceedings of the 3rd Latin American Symposium on Theoretical Informatics (Latin-98), 249-260
Jansen-Latin-98
1998The Mutual Exclusion Scheduling Problem for Permutation and Comparability Graphs
In: Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS-98), 287-297
Jansen-STACS-98
Hide details for Jansen, Kratsch, Marx, SchlotterJansen, Kratsch, Marx, Schlotter
2010Bin Packing with Fixed Number of Bins Revisited
In: Algorithm Theory - SWAT 2010 : 12th Scandinavian Symposium and Workshops
on Algorithm Theory, 260-272
JansenKMS2010
Hide details for Jansen, NeumannJansen, Neumann
2010Editorial for the Special Issue on Theoretical Aspects of Evolutionary Multi-Objective Optimization
In: Evolutionary Computation [18], 333-334
JansenNeumann2010
Hide details for Jansen, PorkolabJansen, Porkolab
2002Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks
In: Algorithmica [32], 507-520
JansenPorkolab2002
Hide details for Jansen, Solis-Oba, SviridenkoJansen, Solis-Oba, Sviridenko
2000Linear time approximation schemes for shop scheduling problems
In: Approximation and complexity in numerical optimization, 338-346
JansenSolisObaSviridenko2000
Hide details for JezJez
2014A really Simple Approximation of Smallest Grammar
In: 25th Annual Symposium on Combinatorial Pattern Matching (CPM 2014), 182-191
Jez2014CPM
2014Context Unification is in PSPACE
In: 41st International Colloquium on Automata, Languages, and Programming (ICALP 2014), 244-255
Jez2014ICALP
2014The Complexity of Compressed Membership Problems for Finite Automata
In: Theory of Computing Systems [55], 685-718
Jez2012STACS
2013Attachment IconApproximation of Grammar-Based Compression via Recompression
In: 24th Annual Symposium on Combinatorial Pattern Matching (CPM 2013), 165-176
Jez2013CPM
2013Attachment IconOne-Variable Word Equations in Linear Time
In: 40th International Colloquium on Automata, Languages, and Programming (ICALP 2013), 324-335
Jez2013ICALP
2013Attachment IconRecompression: a simple and powerful technique for word equations
In: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), 233-244
Jez2013STACS
2013Attachment IconRecompression: Word Equations and Beyond
In: 17th International Conference on Developments in Language Theory (DLT 2013), 12-26
Jez2013DLTII
Hide details for Jez, LohreyJez, Lohrey
2014Attachment IconApproximation of smallest linear tree grammar
In: 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 445-457
Jez2014STACS
Hide details for Jez, MalettiJez, Maletti
2013Hyper-minimization for deterministic tree automata
In: International Journal of Foundations of Computer Science [24], 815-830
JezMaletti2013
Hide details for Jez, OkhotinJez, Okhotin
2014Computational completeness of equations over sets of natural numbers
In: Information and Computation [237], 56-94
Jez2008ICALP
2013Unambiguous Conjunctive Grammars over a One-Letter Alphabet
In: 17th International Conference on Developments in Language Theory (DLT 2013), 277-288
Jez2013DLT
Hide details for JohannsenJohannsen
2010Attachment IconRandom combinatorial structures and randomized search heuristics
Universität des Saarlandes
JohannsenPhD2010
2006Attachment IconSampling Rooted 3-Connected Planar Graphs in Deterministic Polynomial Time
Humboldt-Universität zu Berlin
Johannsen2006a
Hide details for Johannsen, LenglerJohannsen, Lengler
2010Attachment IconCan Quantum Search Accelerate Evolutionary Algorithms?
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1433-1440
JohannsenLK2010
Hide details for Johannsen, PanagiotouJohannsen, Panagiotou
2010Attachment IconVertices of Degree k in Random Maps
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1436-1447
JohannsenPanagiotou2010
Hide details for Johannsen, Razgon, WahlströmJohannsen, Razgon, Wahlström
2009Attachment IconSolving 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
JohannsenRazgonWahlstroem2008
Hide details for JungJung
1996Die hierarchische Darstellung konvexer Polyeder und einige Anwendungen
Universität des Saarlandes
Jung96
Hide details for Jünger, Lee, Mutzel, OdenthalJünger, Lee, Mutzel, Odenthal
1997A Polyhedral Approach to the Multi-Layer Crossing Minimization Problem
In: Proceedings of the 5th Symposium on Graph Drawing (GD-97), 13-24
JMO97
Hide details for Jünger, Leipert, MutzelJünger, Leipert, Mutzel
1998A Note on Computing a Maximal Planar Subgraph using PQ-Trees
In: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems [17], 609-612
JLM98
1998Level Planarity Testing in Linear Time
In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 224-237
JLM1998
1997Pitfalls of using PQ-Trees in Automatic graph Drawing
In: Proceedings of the 5th Symposium on Graph Drawing (GD-97), 193-204
LJM97
Hide details for Jünger, MutzelJünger, Mutzel
19972-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
In: Journal of Graph Algorithms and Applications [1], 1-25
Juenger-Mutzel-1-97
1996Exact and heuristic algorithms for 2-layer straightline crossing minimization
In: Graph Drawing (GD95), -
Juenger-Mutzel-2-96
1996Maximum planar subgraphs and nice embeddings: Practical layout tools
In: Algorithmica [16], 33-59
Juenger-Mutzel96
1995The Polyhedral Approach to the Maximum Planar Subgraph Problem:
New Chances for Related Problems
In: Graph Drawing: DIMACS International Workshop (GD94), 119-130
Juenger-Mutzel95
Hide details for Jünger, Mutzel, Odenthal, ScharbrodtJünger, Mutzel, Odenthal, Scharbrodt
1998The thickness of a minor-excluded class of graphs
In: Discrete Mathematics [182], 169-176
Mutzel-et-al-1-97
Hide details for Jung, Lenhof, Müller, RübJung, Lenhof, Müller, Rüb
2000Simulating synthetic polymer chains in parallel
In: Future Generation Computer Systems [16], 513-522
JungLenhofMuellerRueb2000
1999Simulating synthetic polymer chains in parallel
In: Proceedings of the 7th International Conference on High-Performance Computing and Networking Europe (HPCN Europe-99), 13-22
JungLenhofMüllerRüb1999
1997Langevin dynamics simulations of macromolecules on parallel computers
In: Macromolecular Theory and Simulation [6], 507-521
Lenhof-et-al-2-97
1997Parallel MD-simulations of synthetic polymers
In: Parallel processing for scientific computing (PPSC-97) : 8th SIAM conference, CD-ROM
Lenhof-et-al-3-97
Hide details for Jung, MehlhornJung, Mehlhorn
1988Attachment IconParallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees
In: Information Processing Letters [27], 227-236
IPL::JungM1988
1987Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning treesmehlhorn87z
Hide details for JurkiewiczJurkiewicz
2013Attachment IconToward Better Computation Models for Modern Machines
Universität des Saarlandes
Jurkiewicz2013
2009Cycle Bases in Graphs
Universität des Saarlandes
jurkiewicz2009
Hide details for Jurkiewicz, DanilewskiJurkiewicz, Danilewski
2011Efficient Quicksort and 2D Convex Hull for CUDA, and MSIMD as a Realistic Model of Massively Parallel Computations.JurkiewiczDanilewski2011
Hide details for Jurkiewicz, MehlhornJurkiewicz, Mehlhorn
2013The cost of address translation
In: Proceedings of the Meeting on Algorithm Engineering & Experiments,
VAT2013
Hide details for Juurlink, MutzelJuurlink, Mutzel
1995?
In: Conference on High-Performance Computing, 125-130
Juurlink-Mutzel95
Hide details for Juurlink, SibeynJuurlink, Sibeyn
1995Fast Routing on Weak Hypercubes: Making the Valiant-Brebner Algorithm More Practical
In: Conference on High-Performance Computing, 755-760
Juurlink-Sibeyn95
Hide details for Juurlink, Sibeyn, RaoJuurlink, Sibeyn, Rao
1996Worm-Hole Gossiping on Meshes and Tori
In: 2nd Euro-Par Conference, 361-369
Sibeyn-et-al-3-96
Hide details for Kagaris, Pantziou, Tragoudas, ZaroliagisKagaris, Pantziou, Tragoudas, Zaroliagis
1999Transmissions in a network with capacities and delays
In: Networks [33
], 167-174
Zaro-et-al-1-97
1995On the Computation of Fast Data Transmissions in Networks
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 291-302
Zaro-et-al-3-95
1995Quickest Paths: Parallelization and Dynamization
In: 28th Annual Hawaii International Conference on System Sciences (HICSS-28), 39-44
Zaro-et-al-2-95
Hide details for KaligosiKaligosi
2003Length bounded network flows
Universität des Saarlandes
Kaligosi/Master03
Hide details for Kaligosi, Mehlhorn, Munro, SandersKaligosi, Mehlhorn, Munro, Sanders
2005Attachment IconTowards Optimal Multiple Selection
In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, 103-114
mehlhorn05o
Hide details for Kaligosi, SandersKaligosi, Sanders
2006How Branch Mispredictions Affect Quicksort
In: Algorithms - ESA 2006, 14th Annual European Symposium, 780-791
Kaligosi2006a
Hide details for Kamran AzamKamran Azam
2005Branch-and-Cut Techniques for Generalized Asymmetric Traveling Salesman Problem
Universität des Saarlandes
KamranDipl05
Hide details for Kane, Mehlhorn, Sauerwald, SunKane, Mehlhorn, Sauerwald, Sun
2012Counting Arbitrary Subgraphs in Data Streams
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 598-609
Sun2012b
Hide details for Kao, Leung, Sun, ZhangKao, Leung, Sun, Zhang
2010Deterministic Polynomial-Time Algorithms for Designing Short DNA Words
In: Theory and Applications of Models of Computation : 7th Annual Conference, TAMC 2010, 308-319
Sun2010
Hide details for KapoorKapoor
1996On minimum 3-cuts and approximating k-cuts using cut trees
In: Integer Programming and Combinatorial Optimization : International Conference (IPCO-5), 132-146
Kapoor96
Hide details for Kapoor, SmidKapoor, Smid
1996New techniques for exact and approximate dynamic closest-point problems
In: SIAM Journal on Computing [25], 775-796
KapoorSmid96
Hide details for KappelKappel
1998Eine Methode zur Berechnung von Vorzeichen ganzzahliger Determinanten
Universität des Saarlandes
Kappel98
Hide details for KärkkäinenKärkkäinen
2002Computing the threshold for q-gram filters
In: Algorithm theory, SWAT 2002 : 8th Scandinavian Workshop on Algorithm Theory, 348-357
Karkkainen2002
Hide details for Kärkkäinen, RaoKärkkäinen, Rao
2003Full-Text Indexes in External Memory
In: Algorithms for Memory Hierarchies, 149-170
Karkkainen2003a
Hide details for Kärkkäinen, SandersKärkkäinen, Sanders
2003Simple Linear Work Suffix Array Construction
In: Automata, languages and programming : 30th International Colloquium, ICALP 2003, 943-955
KarkkainenSanders2003
Hide details for Karp, Schindelhauer, Shenker, VöckingKarp, Schindelhauer, Shenker, Vöcking
2000Randomized Rumor Spreading
In: 41th Annual Symposium on Foundations of Computer Science (FOCS-00), 565-574
Voecking2000
Hide details for KarrenbauerKarrenbauer
2007Attachment IconEngineering combinatorial optimization algorithms to improve the lifetime of OLED displays
Universität des Saarlandes
KarrenbauerPhD
2004Packing Boxes with Arbitrary Rotations
Universität des Saarlandes
Karrenbauer2004
Hide details for KasanKasan
1995Die Beschreibung der Design Features fr die rechnerunterstützte Konstruktion und ihre formale Repräsentation
Universität des Saarlandes
Kasan95
Hide details for Kasprzik, KötzingKasprzik, Kötzing
2010String Extension Learning Using Lattices
In: Language and Automata Theory and Applications : 4th International Conference, LATA 2010, 380-391
Koetzing2010LatticeLearning
Hide details for Katajainen, TräffKatajainen, Träff
1997A meticulous analysis of mergesort programs
In: Proceedings of the 3rd Italian Conference on Algorithms and Complexity (CIAC-97), 217-228
Katajainen-Traeff97
Hide details for KatrielKatriel
2004Constraints and Changes
Universität des Saarlandes
KatrielThesis2004
2004Dynamic Heaviest Paths in DAGs with Arbitrary Edge Weights
In: Integration of AI and OR techniques in constraint programming for combinatorial optimization problems : First International Conference, CPAIOR 2004, 190-199
Katriel2004a
2004Attachment IconOn Algorithms for Online Topological Ordering and SortingKatriel2004
2004On the Algebraic Complexity of Set Equality and Inclusion
In: Information Processing Letters [92], 175-178
Katriel2004b
Hide details for Katriel, BodlaenderKatriel, Bodlaender
2005Online Topological Ordering
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 443-450
SODATO2004
Hide details for Katriel, MeyerKatriel, Meyer
2003Elementary Graph Algorithms in External Memory
In: Algorithms for Memory Hierarchies, 62-84
KatMey03
Hide details for Katriel, Michel, Van HentenryckKatriel, Michel, Van Hentenryck
2005Maintaining Longest Paths Incrementally
In: Constraints [10], 159-183
KMV2005
Hide details for Katriel, Sanders, TräffKatriel, Sanders, Träff
2003A Practical Minimum Spanning Tree Algorithm Using the Cycle Property
In: Algorithms - ESA 2003: 11th Annual European Symposium, 679-690
KatSanTra03
Hide details for Katriel, ThielKatriel, Thiel
2005Complete Bound Consistency for the Global Cardinality Constraint
In: Constraints [10], 191-217
KatrielThielGCC
2003Fast Bound-Consistency for the Global Cardinality Constraint
In: Principles and Practice of Constraint Programming - CP 2003 : 9th International Conference, CP 2003, 437-451
KT03:gcc
Hide details for Kaufmann, MehlhornKaufmann, Mehlhorn
1994Attachment IconA linear-time algorithm for the homotopic routing problem in grid graphs
In: SIAM Journal on Computing [23], 227-246
Mehlhorn94h
1992Attachment IconOn local routing of two-terminal nets
In: Journal of Combinatorial Theory / Series B [55], 33-72
Mehlhorn92k
1990Routing problems in grid graphs
In: Paths, Flows, and VLSI-Layout, 165–184
mehlhorn90y
1989Routing Problems in Grid Graphsmehlhorn89
1989Routing problems in grid graphsmehlhorn89z
1988A Linear-Time Algorithm for the Homotopic Routing Problem in Grid Graphsmehlhorn88z
1987On Local Routing of Two-Terminal Nets
In: STACS '87 : 4th Annual Symposium on Theoretical Aspects of Computer Science, 40-52
STACS::KaufmannM1987
1986On Local Routing of Two-Terminal Netsmehlhorn86y
1986Attachment IconRouting through a Generalized Switchbox
In: Journal of Algorithms [7], 510-531
JALGO::KaufmannM1986
1984Attachment IconLocal routing of two-terminal nets is easyKaufmann84/12
1984Attachment IconRouting through a generalized switchboxmehlhorn84g
Hide details for Kaufmann, Meyer, SibeynKaufmann, Meyer, Sibeyn
1997Matrix Transpose on Meshes: Theory and Practice
In: Computers and Artificial Intelligence [16], 107-140
Kaufmann-Meyer-Sibeyn97a
1997Matrix Transpose on Meshes: Theory and Practice
In: Proceedings of the 11th International Parallel Processing Symposium (IPPS-97), 315-319
Kaufmann-Meyer-Sibeyn97b
1994Towards Practical Permutation Routing on Meshes
In: Proceedings of the 6th IEEE Symposium on Parallel and Distributed Processing, 656-663
Kaufmann-Meyer-Sibeyn94
Hide details for Kaufmann, Raman, SibeynKaufmann, Raman, Sibeyn
1997Routing on Meshes with Buses
In: Algorithmica [18], 417-444
Kaufmann-Raman-Sibeyn97
Hide details for Kaufmann, Schröder, SibeynKaufmann, Schröder, Sibeyn
1995Asymptotically Optimal and Practical Routing on the Reconfigurable Mesh
In: Parallel Processing Letters [5], 81-95
Kaufmann-Schroeder-Sibeyn95
Hide details for Kaufmann, SibeynKaufmann, Sibeyn
1997Randomized Multipacket Routing and Sorting on Meshes
In: Algorithmica [17], 224-244
Sibeyn-Kaufmann97
1995Solving Cheap Graph Problems on Meshes
In: Mathematical Foundations of Computer Science 1995: 20th International Symposium (MFCS95), 412-422
Kaufmann-Sibeyn-1-95
Hide details for Kaufmann, Sibeyn, SuelKaufmann, Sibeyn, Suel
1995Beyond the Worst-Case Bisection Bound:
Fast Ranking and Counting on Meshes
In: Algorithms - ESA'95: 3rd Annual European Symposium, 75-88
Kaufmann-Sibeyn-Suel95
Hide details for KavithaKavitha
2008On a Special Co-cycle Basis of Graphs
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), 343-354
Kav08
Hide details for Kavitha, Liebchen, Mehlhorn, Michail, Rizzi, Ueckerdt, ZweigKavitha, Liebchen, Mehlhorn, Michail, Rizzi, Ueckerdt, Zweig
2009Attachment IconCycle Bases in Graphs: Characterization, Algorithms, Complexity, and Applications
In: Computer Science Review [3], 199-243
SurveyCycleBases
Hide details for Kavitha, MehlhornKavitha, Mehlhorn
2007Attachment IconAlgorithms to compute minimum cycle basis in directed graphs
In: Theory of Computing Systems [40], 485-505
Kavitha2007TCS
2005Attachment IconA Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs
In: STACS 2005 : 22nd Annual Symposium on Theoretical Aspects of Computer Science, 654-665
KM2005
Hide details for Kavitha, Mehlhorn, MichailKavitha, Mehlhorn, Michail
2011New Approximation Algorithms for Minimum Cycle Bases of Graphs
In: Algorithmica [59], 471-488
KavithaALG2011
2007Attachment IconNew Approximation Algorithms for Minimum Cycle Bases of Graphs
In: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, 512-523
KMM07
Hide details for Kavitha, Mehlhorn, Michail, PaluchKavitha, Mehlhorn, Michail, Paluch
2007Attachment IconStrongly stable matchings in time O(nm) and extension to the hospitals-residents problem
In: ACM Transactions on Algorithms [3], 15.1-15.18
a15-kavitha
2004Attachment IconA Faster Algorithm for Minimum Cycle Basis of Graphs
In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, 846-857
KMMP2004c
2004Attachment IconStrongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents Problem
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 222-233
Michail2004b
Hide details for Kavitha, MestreKavitha, Mestre
2012Max-coloring paths: tight bounds and extensions
In: Journal of Combinatiorial Optimization [24], 1-14
Kavitha2012
2010Max-coloring paths: Tight bounds and extensions
In: Journal of Combinatorial Optimization [Online First], 1 - 14
KavithaMestre2010
2009Max-coloring paths: Tight bounds and extensions
In: Algorithms and Computation : 20th International Symposium, ISAAC 2009, 87-96
KavithaMestre2008
Hide details for Kavitha, Mestre, NasreKavitha, Mestre, Nasre
2011Popular mixed matchings
In: Theoretical Computer Science [412], 2679-2690
KavithaTCS2011
2009Popular Mixed Matchings
In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, 574-584
Mestre2009
Hide details for Kavitha, NasreKavitha, Nasre
2008Optimal Popular MatchingsKM08
Hide details for Kavvadias, Pantziou, Spirakis, ZaroliagisKavvadias, Pantziou, Spirakis, Zaroliagis
1996Hammock-on-ears decomposition : a technique for the efficient parallel solution of shortest paths and other problems
In: Theoretical Computer Science [168], 121-154
KavvadiasPantziouSpirakisZaroliagis96
Hide details for Kayal, SahaKayal, Saha
2012Attachment IconOn the Sum of Square Roots of Polynomials and Related Problems
In: The ACM Transactions on Computation Theory [4], 9:1-9:15
KS12
2011Attachment IconOn the Sum of Square Roots of Polynomials and Related Problems
In: 26th IEEE Conference on Computational Complexity (CCC), 292-299
KS11
Hide details for Kececioglu, Lenhof, Mehlhorn, Mutzel, Reinert, VingronKececioglu, Lenhof, Mehlhorn, Mutzel, Reinert, Vingron
2000Attachment IconA polyhedral approach to sequence alignment problems
In: Discrete Applied Mathematics [104], 143-186
KLM+2000
Hide details for Keizer, Antoniol, Congdon, Deb, Doerr, Hansen, Holmes, Hornby, Howard, Kennedy, Kumar, Lobo, Miller, Moore, NeKeizer, Antoniol, Congdon, Deb, Doerr, Hansen, Holmes, Hornby, Howard, Kennedy, Kumar, Lobo, Miller, Moore, Neumann, Pelikan, Pollack, Sastry, Stanley, Stoica, Talbi, Wegener (ed.)
2008GECCO 2008: Proceedings of the 10th Annual Conference on Genetic and Evolutionary ComputationDoerr2008GeccoProc
Hide details for KelsenKelsen
1996Neighborhood graphs and distributed "^" + 1-coloring
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 223-233
Kelsen96
Hide details for Kelsen, Mahajan, RameshKelsen, Mahajan, Ramesh
1996Approximate hypergraph coloring
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 41-52
KelsenMahajanRamesh96
Hide details for KerberKerber
2009Division-Free Computation of Subresultants Using Bezout Matrices
In: International Journal of Computer Mathematics [86], 2186-2200
kerber-ijcm-2009
2009Geometric Algorithms for Algebraic Curves and Surfaces
Universität des Saarlandes
KerberPhD2009
2009Attachment IconOn the Complexity of Reliable Root Approximation
In: Computer Algebra in Scientific Computing : 11th International Workshop, CASC 2009, 155-167
Kerber_CASC_2009
2008Attachment IconOn filter methods in CGAL's 2D curved kernelacs-tr-243404-03
2006Attachment IconAnalysis of Real Algebraic Plane Curves
Universität des Saarlandes
Kerber2006
Hide details for Kerber, SagraloffKerber, Sagraloff
2012A worst-case bound for topology computation of algebraic curves
In: Journal of Symbolic Computation [47], 239-258
KerberSagraloff_JSC_2012
2011A Note on the Complexity of Real Algebraic Hypersurfaces
In: Graphs and Combinatorics [27], 419-430
ks-ncrah-10
2011Efficient Real Root Approximation
In: ISSAC 2011 : Proceedings of the 36th International Symposium on Symbolic and Algebraic Computation, 209-216
KerberSagraloff:RootApprox:2011
Hide details for KerzmannKerzmann
2000Zwangsbasierte Dynamiksimulationen im R2 unter Verwendung von Kreiskanten
Universität des Saarlandes
Kerzmann2000
Hide details for Kesselman, Guez, RosenKesselman, Guez, Rosen
2004Packet-Mode Policies for Input-Queued Switches
In: Sixteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-04), 93-102
Kesselmann2004b
Hide details for Kesselman, KoganKesselman, Kogan
2005Non-Preemptive Scheduling of Optical Switches
In: 2004 IEEE Global Telecommunications Conference workshops (GLOBECOM'04), 1840-1844
Kesselmann2004a
Hide details for Kesselman, KowalskiKesselman, Kowalski
2005Fast Distributed Algorithm for Convergecast in Ad Hoc Geometric Radio Networks
In: Second Annual Conference on Wireless On-demand Network Systems and Services (WONS'05), 119-124
Kesselmann2005wons
Hide details for Kesselman, Kowalski, SegalKesselman, Kowalski, Segal
2005Attachment IconEnergy efficient communication in ad hoc networks from user's and designer's perspective
In: Proceedings of the n?th Conference on, 15-26
In: ACM SIGMOBILE Mobile Computing and Communications Review [9], 15-26
KKS
Hide details for Kesselman, Lotker, Mansour, Patt-Shamir, Schieber, SviridenkoKesselman, Lotker, Mansour, Patt-Shamir, Schieber, Sviridenko
2004Buffer Overflow Management in QoS Switches
In: SIAM Journal on Computing [33], 563-583
Kesselmann2004c
Hide details for Kesselman, MansourKesselman, Mansour
2004Harmonic Buffer Management for Shared-Memory Switches
In: Theoretical Computer Science [324], 161-182
Kesselmann2004d
Hide details for KesslerKessler
2002Robust Computation of Visibility Maps
Universität des Saarlandes
KesslerDipl02
Hide details for Keßler, TräffKeßler, Träff
1997Language and library support for practical PRAM programming
In: Proceedings of the 5th Euromicro Workshop on Parallel and Distributed Processing (PDP-97), 216-221
Kessler-Traeff97
1996A Library of basic PRAM Algorithms and its Implementation in FORK
In: 8th Annual ACM Symposium on Parallel Algorithms and Architechtures (SPAA'96), 193-195
Traeff-Kessler96
Hide details for KettnerKettner
2006Reference Counting in Library Design---Optionally and with Union-Find Optimization
In: Proceedings of the First International Workshop on Library-Centric Software Design, LCSD'05, 34-43
Kettner2006Handle
2005Reference Counting in Library Design---Optionally and with Union-Find Optimization
In: Library-Centric Software Design (LCSD'05), 1-10
Kettner2005Handle
1998Eine Implementation von k-Server-Algorithmen
Universität des Saarlandes
Kettner98
Hide details for Kettner, Kirkpatrick, Mantler, Snoeyink, Speckmann, TakeuchiKettner, Kirkpatrick, Mantler, Snoeyink, Speckmann, Takeuchi
2003Tight Degree Bounds for Pseudo-triangulations of Points
In: Computational Geometry - Theory and Applications [25], 3-12
Kettner2003DegreeBound
Hide details for Kettner, Mehlhorn, Pion, Schirra, YapKettner, Mehlhorn, Pion, Schirra, Yap
2008Attachment IconClassroom Examples of Robustness Problems in Geometric Computations
In: Computational Geometry: Theory and Applications [40], 61-78
Kettner2007Classroom
2006Reply to "Backward Error Analysis ..."
In: Computational Science and Its Applications - ICCSA 2006, I, 60-60
mehlhorn06
2004Classroom Examples of Robustness Problems in Geometric Computationsecg:kmp-cerpg-03
2004Attachment IconClassroom Examples of Robustness Problems in Geometric Computations
In: ESA 2004: 12th Annual European Symposium on Algorithms, 702-713
Kettner2004Classroom
Hide details for Kettner, NäherKettner, Näher
2004Two Computational Geometry Libraries: LEDA and CGAL
In: Handbook of Discrete and Computational Geometry, 1435-1463
Kettner2004Handbook
Hide details for Kettner, Rossignac, SnoeyinkKettner, Rossignac, Snoeyink
2003The Safari Interface for Visualizing Time-dependent Volume Data Using Iso-surfaces and Contour Spectra
In: Computational Geometry - Theory and Applications [25], 97-116
Kettner2003Safari
Hide details for Khachiyan, Boros, Borys, Elbassioni, GurvichKhachiyan, Boros, Borys, Elbassioni, Gurvich
2008Generating All Vertices of a Polyhedron Is Hard
In: Discrete & Computational Geometry [39], 174-190
Elbassioni2008k
2006Generating All Vertices of a Polyhedron is Hard
In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06, 758-765
Elbassioni2006a
2005Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 156-165
Elbassioni2005f
Hide details for Khachiyan, Boros, Borys, Elbassioni, Gurvich, MakinoKhachiyan, Boros, Borys, Elbassioni, Gurvich, Makino
2008Generating Cut Conjunctions in Graphs and Related Problems
In: Algorithmica [51], 239-263
Elbassioni2008m
2006Enumerating Spanning and Connected Subsets in Graphs and Matroids
In: Algorithms - ESA 2006, 14th Annual European Symposium, 444-455
Elbassioni2006f
Hide details for Khachiyan, Boros, Borys, Elbassioni, Gurvich, Rudolf, ZhaoKhachiyan, Boros, Borys, Elbassioni, Gurvich, Rudolf, Zhao
2008On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction
In: Theory Comput. Syst. [43], 204-233
Elbassioni2008f
Hide details for Khachiyan, Boros, Elbassioni, GurvichKhachiyan, Boros, Elbassioni, Gurvich
2008Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions
In: Discrete Applied Mathematics [156], 2020-2034
Elbassioni2008j
2008On Enumerating Minimal Dicuts and Strongly Connected Subgraphs
In: Algorithmica [50], 159-172
Elbassioni2008n
2007A global parallel algorithm for the hypergraph transversal problem
In: Information Processing Letters [101], 148-155
Elbassioni2007h
2007On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs
In: Theoretical Computer Science [382], 139-150
Elbassioni2007j
2005A New Algorithm for the Hypergraph Transversal Problem
In: Computing and combinatorics : 11th Annual International Conference, COCOON 2005, 767-776
Elbassioni2005d
2005Generating All Minimal Integral Solutions to Monotone $\wedge,\vee$-Systems of Linear, Transversal and Polymatroid Inequalities
In: Mathematical Foundations of Computer Science 2005 : 30th International Symposium, MFCS 2005, 556-567
Elbassioni2005e
Hide details for Khachiyan, Boros, Elbassioni, Gurvich, MakinoKhachiyan, Boros, Elbassioni, Gurvich, Makino
2007Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data
In: Theoretical Computer Science [379], 361-376
Elbassioni2007i
2007Enumerating disjunctions and conjunctions of paths and cuts in reliability theory
In: Discrete Applied Mathematics [155], 137-149
Elbassioni2007g
2005On the Complexity of Some Enumeration Problems for Matroids
In: SIAM Journal on Discrete Mathematics [19], 966-984
Elbassioni2005jb
Hide details for Khachiyan, PorkolabKhachiyan, Porkolab
2000Integer optimization on convex semialgebraic sets
In: Discrete & Computational Geometry [23], 207-224
KhachiyanPorkolab2000
Hide details for KhoslaKhosla
2013Balls into Bins Made Faster
In: Algorithms - ESA 2013,
Khosla2013
Hide details for Khuller, Malekian, MestreKhuller, Malekian, Mestre
2007To Fill or Not to Fill: The Gas Station Problem
In: 15th Annual European Symposium on Algorithms, 534-545
conf/esa/KhullerMM2007
Hide details for Khuller, MestreKhuller, Mestre
2008An Optimal Incremental Algorithm for Minimizing Lateness with Rejection
In: 16th Annual European Symposium on Algorithms (ESA), 601-610
conf/esa/KhullerM2008
Hide details for Kim, Paul, PhilipKim, Paul, Philip
2012Attachment IconA Single-exponential FPT Algorithm for the K4-Minor Cover Problem
In: Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops, 119-130
KimPaulPhilip2012
Hide details for Kirousis, Spirakis, TsigasKirousis, Spirakis, Tsigas
1996Simple Atomic Snapshots: A Linear Complexity Solution with Unbounded Time-Stamps
In: Information Processing Letters [58], 47-53
Tsigas-et-al96
Hide details for KlärKlär
1994Verdrahtungsproblem auf planaren Graphen
Universität des Saarlandes
Klaer94
Hide details for KlauKlau
2002A Combinatorial Approach to Orthogonal Placement Problems
Universität des Saarlandes
KlauDiss01
1998Attachment IconVisuelle Zeitenwende: Bilder - Technik - Reflexionen. Quasi-orthogonales ZeichnenKlau1997b
1997Attachment IconQuasi-orthogonales Zeichnen planarer Graphen mit wenigen Knicken
Universität des Saarlandes
Klau97a
Hide details for KlaukKlauk
2004Ein Algorithmus zur Konstruktion des Voronoidiagramms von Kreisbögen
Universität des Saarlandes
Klauk/Diplom04
Hide details for Klau, Klein, MutzelKlau, Klein, Mutzel
2001An Experimental Comparison of Orthogonal Compaction Algorithms
In: Proceedings of the 8th International Symposium on Graph Drawing (GD-00), 37-51
KKM01
Hide details for Klau, MutzelKlau, Mutzel
2003Automatic Layout and Labelling of State Diagrams
In: Mathematics: Key Technology for the Future : Joint Projects Between Universities and Industry, 584-608
KM03a
2000Optimal Labelling of Point Features in the Slider Model
In: Computing and Combinatorics, Proceedings of the 6th Annual International Conference (COCOON-00), 340-350
KM00a
1999Combining Graph Labeling and Compaction
In: Proceedings of the 7th International Symposium on Graph Drawing (GD-99), 27-37
KlauMutzel1999
1999Optimal Compaction of Orthogonal Grid Drawings
In: Proceedings of the 7th International Conference on Integer Programming and Combinatorial Optimization (IPCO-99), 304-319
KlauMutzel1999a
Hide details for KleinKlein
2004Attachment IconA Fast Root Checking AlgorithmKlein2004b
2004Attachment IconControlled Perturbation for Voronoi Diagrams
Universität des Saarlandes
Klein2004
2000Flußbasierte orthogonale Zeichenverfahren für Graphen mit variablen Knotengrößen
Universität des Saarlandes
Klein2000
Hide details for Klein, KutzKlein, Kutz
2007Attachment IconComputing Geometric Minimum-Dilation Graphs Is NP-Hard
In: Graph Drawing : 14th International Symposium, GD 2006, 196-207
KlKu2006a
2006Attachment IconThe Density of Iterated Crossing Points and a Gap Result for Triangulations of Finite Point Sets
In: Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06, 264-272
KlKu2006b
Hide details for Klein, Mehlhorn, MeiserKlein, Mehlhorn, Meiser
1993Attachment IconRandomized incremental construction of abstract Voronoi diagrams
In: Computational Geometry: Theory and Applications [3], 157-184
Mehlhorn93g
1992Randomized incremental construction of abstract Voronoi diagrams
In: Informatik---Festschrift zum 60.~Geburtstag von Günter Hotz, 283-308
Mehlhorn92m
1990On the Construction of Abstract Voronoi Diagrams, II
In: Algorithms (ISA-90) : 1st international symposium (SIGAL-90), 138-154
KleMehMei90
1989Attachment IconOn the construction of abstract Voronoi diagrams, II.Klein03/89
Hide details for Knauer, Schlipf, Schmidt, TiwaryKnauer, Schlipf, Schmidt, Tiwary
2012Largest Inscribed Rectangles in Convex Polygons
In: Journal of Discrete Algorithms [13], 78-85
Knauer2012
Hide details for KobelKobel
2011Certified numerical root finding
Universität des Saarlandes
KobelMaster2011
2008Automated Generation of Kempe Linkages for Algebraic Curves in a Dynamic Geometry System
Universität des Saarlandes
KobelBachelor2008
Hide details for Kobel, SagraloffKobel, Sagraloff
2013Fast Approximate Polynomial Multipoint Evaluation and Applications
In: arXiv [abs/1304.8069], 17
DBLP:journals/corr/abs-1304-8069
Hide details for Kohlbacher, LenhofKohlbacher, Lenhof
2000BALL - Rapid Software Prototyping in Computational Molecular Biology
In: Bioinformatics [16], 815-824
KohlbacherLenhof2000
1999Rapid Software Prototyping in Computational Molecular Biology
In: Proceedings of the German Conference on Bioinformatics (GCB'99), 81-92
KohlbacherLenhof1999
Hide details for KoldehofeKoldehofe
1999Animation and Analysis of Distributed Algorithms
Universität des Saarlandes
Koldehofe1999
Hide details for Koller, Mehlhorn, NiehrenKoller, Mehlhorn, Niehren
2000Attachment IconA Polynomial-Time Fragment of Dominance Constraints
In: Proceedings of the 38th Annual Meeting of the Association of Computational Linguistics (ACL-00), 368-375
Koller-et-al:dominance-constraints
Hide details for KolliasKollias
2013Nonpreemptive Coordination Mechanisms for Identical Machines
In: Theory of Computing Systems [53], 424-440
Kollias2012
Hide details for KönemannKönemann
1997Fast combinatorial algorithms for packing and covering problems
Universität des Saarlandes
joe97
Hide details for Konidaris, Mehlhorn, ShellKonidaris, Mehlhorn, Shell
2004Attachment IconAn optimal algorithm for finding edge segment adjacencies in configurations of convex polygonsmehlhorn
Hide details for KontogiannisKontogiannis
2002Lower Bounds & Competitive Algorithms for Online Scheduling of Unit-Size Tasks to Related Machines
In: Proceedings of the 34th ACM Symposium on Theory of Computing (STOC-02), 124-133
Kontogiannis2002
Hide details for Kontogiannis, Pantziou, Spirakis, YungKontogiannis, Pantziou, Spirakis, Yung
2000Attachment IconRobust Parallel Computations through Randomization
In: Theory of Computing Systems [33], 427-464
Kontogiannis2000
Hide details for Konwar, Kowalski, ShvartsmanKonwar, Kowalski, Shvartsman
2004The Join problem in dynamic network algorithms
In: 2004 International Conference on Dependable Systems and Networks (DSN 2004), 315-324
KKS-DSN
Hide details for KötzingKötzing
2011Iterative Learning from Positive Data and Counters
In: Algorithmic Learning Theory : 22nd International Conference, ALT 2011, 40-54
KoetzingALT2011
Hide details for Kötzing, Lehre, Neumann, OlivetoKötzing, Lehre, Neumann, Oliveto
2010Ant Colony Optimization and the Minimum Cut Problem
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1393-1400
Koe-Leh-Neu-Oli:c:10:AcoMinCut
Hide details for Kötzing, MolterKötzing, Molter
2012ACO beats EA on a dynamic pseudo-Boolean function
In: Parallel Problem Solving from Nature - PPSN XII : 12th International Conference, 113-122
KoetzingMolter2012
Hide details for Kötzing, Neumann, Röglin, WittKötzing, Neumann, Röglin, Witt
2012Theoretical analysis of two ACO approaches for the traveling salesman problem
In: Swarm Intelligence [6], 1-21
KoetzingNRW2012
2010Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem
In: Swarm Intelligence : 7th International Conference, ANTS 2010, 324-335
Koe-Neu-Roe-Wit:c:10:ACOTSP
Hide details for Kötzing, Neumann, SpöhelKötzing, Neumann, Spöhel
2011PAC learning and genetic programming
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 2091-2096
KoetzingNS11GP
Hide details for Kötzing, Neumann, Sudholt, WagnerKötzing, Neumann, Sudholt, Wagner
2011Simple max-min ant systems and the optimization of linear pseudo-Boolean functions
In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, 209-218
Koe-Neu-Sud-Wag:c:Foga11AcoLinFun
Hide details for Kötzing, Sudholt, TheileKötzing, Sudholt, Theile
2011How crossover helps in pseudo-Boolean optimization
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 989-996
KoetzingST2011
Hide details for Kötzing, Sutton, Neumann, O'ReillyKötzing, Sutton, Neumann, O'Reilly
2012The max problem revisited: the importance of mutation in genetic programming
In: GECCO’12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, 1333-1340
KoetzingSNO2011
Hide details for KovácsKovács
2007Fast Algorithms for Two Scheduling Problems
Universität des Saarlandes
Kov07
2006Tighter Approximation Bounds for LPT Scheduling in Two Special Cases
In: Algorithms and Complexity : 6th Italian Conference, CIAC 2006, 187-198
Kovacs2006
2005Fast monotone 3-approximation algorithm for scheduling related machines
In: Algorithms - ESA 2005: 13th Annual European Symposium, 616-627
Kovacs2005b
2005Polynomial Time Preemptive Sum-Multicoloring on Paths
In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, 840-852
Kovacs2005a
2004Sum-Multicoloring on Paths
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 68-80
Kovacs2004
Hide details for KowalikKowalik
2009Improved edge-coloring with three colors
In: Theoretical Computer Science [410], 3733-3742
Kowalik2009
2007Adjacency Queries in Dynamic Sparse Graphs
In: Inf. Proc. Lett. [-], -
KowalikAdjSparseGraphs
2006Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 557-566
KowalikISAAC2006
2006Improved Edge Coloring with Three Colors
In: Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, WG 2006, 90-101
Kowalik2005
Hide details for Kowalski, Musial, ShvartsmanKowalski, Musial, Shvartsman
2005Explicit combinatorial structures for cooperative distributed algorithms
In: 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05), 49-58
KMS-ICDCS
Hide details for Kowalski, PelcKowalski, Pelc
2005Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism
In: Theoretical Computer Science [333], 355-371
KP-TCS
2004Centralized deterministic broadcasting in undirected multi-hop radio networks
In: Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques. 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004, and 8th International Workshop on Randomization and Computation, RANDOM 2004, 171-182
KP-APPROX
2004Polynomial deterministic rendezvous in arbitrary graphs
In: Algorithms and Computation: 15th International Symposium, ISAAC 2004, 644-656
KP-ISAAC
2004Time of deterministic broadcasting in radio networks with local knowledge
In: SIAM Journal on Computing [33], 870-891
Kowalski2003b
2003Time of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism
In: Proceedings of the 10th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2003), 195-210
KP-SIROCCO
Hide details for Kowalski, ShvartsmanKowalski, Shvartsman
2004Writing-All deterministically and optimally using a non-trivial number of asynchronous processors
In: Sixteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-04), 311-320
Kowalski-SPAA-2004
Hide details for Krandick, MehlhornKrandick, Mehlhorn
2006Attachment IconNew bounds for the Descartes method
In: Journal of Symbolic Computation [41], 49-66
mehlhorn06e
2004New Bounds for the Descartes MethodKrandickMehlhorn2004a
Hide details for KratschKratsch
2010Kernelization of generic problems : upper and lower bounds
Universität des Saarlandes
KratschPhD2010
2009Polynomial Kernelizations For MIN F+Pi1 And MAX NP
In: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS), 601-612
Kratsch2008
Hide details for Kratsch, Lehre, Neumann, OlivetoKratsch, Lehre, Neumann, Oliveto
2010Fixed Parameter Evolutionary Algorithms and Maximum Leaf Spanning Trees: A Matter of Mutation
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 204-213
KratschLNO2010
Hide details for Kratsch, Marx, WahlströmKratsch, Marx, Wahlström
2010Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems
In: Mathematical Foundations of Computer Science 2010 : 35th International Symposium, MFCS 2010, 489-500
KMW2010
Hide details for Kratsch, McConnell, Mehlhorn, SpinradKratsch, McConnell, Mehlhorn, Spinrad
2006Attachment IconCertifying Algorithms for Recognizing Interval Graphs and Permutation Graphs
In: Siam Journal on Computing, 326-353
In: SIAM Journal on Computing [36], 326-353
mehlhorn06b
2003Attachment IconCertifying Algorithms for Recognizing Interval Graphs and Permutation Graphs
In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 158-167
Kratsch-et-al:interval
Hide details for Kratsch, NeumannKratsch, Neumann
2009Fixed-Parameter Evolutionary Algorithms and the Vertex Cover Problem
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 293-300
KraNeuGECCO2009
Hide details for Kratsch, Pilipczuk, Pilipczuk, WahlströmKratsch, Pilipczuk, Pilipczuk, Wahlström
2012Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs
In: Automata, Languages, and Programming ; 39th International Colloquium, ICALP 2012, 581-593
KratschPilipczukPilipczukWahlstroem2012
Hide details for Kratsch, SchweitzerKratsch, Schweitzer
2010Isomorphism for Graphs of Bounded Feedback Vertex Set Number
In: Algorithm Theory - SWAT 2010 : 12th Scandinavian Symposium and Workshops
on Algorithm Theory, 81-92
KratschS2010
Hide details for Kratsch, WahlströmKratsch, Wahlström
2012Compression via matroids: a randomized polynomial kernel for odd cycle transversal
In: Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 94-103
KratschWahlstroem2012a
2012Representative Sets and Irrelevant Vertices: New Tools for Kernelization
In: IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS-12), 450-459
KratschWahlstroem2012b
2010Preprocessing of Min Ones Problems: A Dichotomy
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010, 653-665
KW2010b
2009Two Edge Modification Problems without Polynomial Kernels
In: Parameterized and Exact Computation : 4th International Workshop, IWPEC 2009, 264-275
KratschW2009
Hide details for Krick, Meyer auf der Heide, Räcke, Vöcking, WestermannKrick, Meyer auf der Heide, Räcke, Vöcking, Westermann
2003Data Management in Networks: Experimental Evaluation of a Provably Good Strategy
In: Theory of Computing Systems [35], 217-245
Vöcking2003
Hide details for Krithivasan, Rema, Schirra, VijaykumarKrithivasan, Rema, Schirra, Vijaykumar
1996Velocity planning for a robot moving along the shortest straight line path among moving obstacles
In: Canadian Conference on Computational Geometry (CCCG '96), 149-154
Schirra-et-al-3-96
Hide details for Krivelevich, SpöhelKrivelevich, Spöhel
2012Creating small subgraphs in Achlioptas processes with growing parameter
In: SIAM Journal on Discrete Mathematics [26], 670-686
SpoehelK2012
Hide details for Kroeske, Ghandar, Michalewicz, NeumannKroeske, Ghandar, Michalewicz, Neumann
2008Learning Fuzzy Rules with Evolutionary Algorithms - An Analytic Approach
In: Parallel Problem Solving from Nature (PPSN X), 1051-1060
KroGhaMicNeuPPSN2008
Hide details for KrohmerKrohmer
2012Finding cliques in scale-free networks
Universität des Saarlandes
KrohmerMaster2012
Hide details for Krumke, Schwahn, van Stee, WestphalKrumke, Schwahn, van Stee, Westphal
2008Attachment IconA monotone approximation algorithm for scheduling with precedence constraints
In: Operations Research Letters [36], 247-249
vanStee2008f
Hide details for Krumke, van Stee, WestphalKrumke, van Stee, Westphal
2009Attachment IconOnline job admissions
In: Fundamental Problems in Computing : Essays in Honor of Professor Daniel J. Rosenkrantz, 435-454
KrStWe2009
Hide details for KrystaKrysta
2003Approximating Minimum Size 1,2-Connected Networks
In: Discrete Applied Mathematics [125], 267-288
Krysta2003b
2001Approximation Algorithms for Combinatorial Optimization Problems in Graph Coloring and Network Design
Universität des Saarlandes
Krysta2001b
Hide details for Krysta, KumarKrysta, Kumar
2001Approximation Algorithms for Minimum Size 2-connectivity Problems
In: Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science (STACS-01), 431-442
Krysta2001
Hide details for Krysta, LorysKrysta, Lorys
1999Efficient approximation algorithms for the achromatic number
In: Proceedings of the 7th Annual European Symposium on Algorithms (ESA-99), 402-413
KrystaLorys1999
Hide details for Krysta, PacholskiKrysta, Pacholski
1999The STO problem is NP-complete
In: Journal of Symbolic Computation [27], 207-219
Krysta1999a
Hide details for Krysta, Sanders, VöckingKrysta, Sanders, Vöcking
2003Scheduling and Traffic Allocation for Tasks with Bounded Splittability
In: Mathematical foundations of computer science 2003 : 28th International Symposium, MFCS 2003, 500-510
KSV03
Hide details for Krysta, Solis-ObaKrysta, Solis-Oba
2001Approximation Algorithms for Bounded Facility Location
In: Journal of Combinatorial Optimization [5], 233-247
Krysta2001c
1999Approximation algorithms for bounded facility location
In: Proceedings of the 5th Annual International Conference on Computing and Combinatorics (COCOON-99), 241-250
Solis-Oba1999h
Hide details for KsinsikKsinsik
1996Approximative Bewegungsplanung für einen rechteckigen Roboter mit Hilfe von Voronoidiagrammen
Universität des Saarlandes
Ksinsik96
Hide details for Kucera, Mehlhorn, Preis, SchwarzeneckerKucera, Mehlhorn, Preis, Schwarzenecker
1993Attachment IconExact Algorithms for a Geometric Packing Problem (Extended Abstract)
In: Theoretical aspects of computer science (STACS-93) : 10th annual symposium, 317-322
Mehlhorn93a
Hide details for Kuhn, Panagiotou, Spencer, StegerKuhn, Panagiotou, Spencer, Steger
2010Synchrony and Asynchrony in Neural Networks
In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 949-964
KPSS2010
Hide details for KumarKumar
2001Coupling vs. conductance for the Jerrum-Sinclair chain
In: Random Structures & Algorithms [18], 1-17
Kumar2001a
Hide details for Kumar, Arya, RameshKumar, Arya, Ramesh
2000Hardness of Set Cover with Intersection 1
In: Automata, Languages and Programming, Proceedings of the 27th International Colloquium (ICALP-00), 624-635
Kumar2000
Hide details for Kumar, RameshKumar, Ramesh
1999Covering Rectilinear Polygons with Axis-Parallel Rectangles
In: Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC-99), 445-454
Kumar1999a
1999Markovian Coupling vs. Conductance for the Jerrum-Sinclair Chain
In: Proceedings of the 40th Annual Symposium on Foundations of Computer Science (FOCS-99), 241-251
Kumar1999b
Hide details for KursaweKursawe
1998Exploration von geometrischen Umgebungen mit Hindernissen
Universität des Saarlandes
Kursawe98
Hide details for KutzKutz
2006Computing Shortest Non-Trivial Cycles on Orientable Surfaces of Bounded Genus in Almost Linear Time.
In: Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06, 430-437
Kutz2006
2005Conway's Angel in three dimensions
In: Theoretical Computer Science [349], 443-451
Kutz3dAngel
2005Weak Positional Games on Hypergraphs of Rank Three
In: 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 31-36
KutzHGames:2004
Hide details for Kutz, Elbassioni, Katriel, MahajanKutz, Elbassioni, Katriel, Mahajan
2008Simultaneous matchings: Hardness and approximation
In: J. Comput. Syst. Sci. [74], 884-897
Elbassioni2008g
Hide details for Kutz, PórKutz, Pór
2005Attachment IconAngel, Devil, and King
In: Computing and Combinatorics : 11th Annual International Conference, COCOON 2005, 925-934
Kutz05
Hide details for Kutz, SchweitzerKutz, Schweitzer
2007ScrewBox: a Randomized Certifying Graph Non-Isomorphism Algorithm
In: 9th Workshop on Algorithm Engineering and Experiments (ALENEX'07), 150-157
KutzSchw2006
Hide details for KwappikKwappik
1998Exact Linear Programming
Universität des Saarlandes
Kwappik98
Hide details for Kwek, MehlhornKwek, Mehlhorn
2003Attachment IconOptimal Search for Rationals
In: Information Processing Letters [86], 23-26
KwekMehlhorn2003
Show details for LambertLambert

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