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

MPI-INF D1 Publications

MPI-INF D1 Publications

Entries sorted by: 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
Hide details for Abed, HuangAbed, Huang
2012Preemptive Coordination Mechanisms for Unrelated Machines
In: Algorithms - ESA 2012 : 20th Annual European Symposium, 12-23
Abed2012
Hide details for Abo-HasnaAbo-Hasna
1994Verdrahtung von Kanälen mit Seitenanschlüssen
Universität des Saarlandes
Ziad94
Hide details for Abraham, Cechlárová, Manlove, MehlhornAbraham, Cechlárová, Manlove, Mehlhorn
2005Pareto Optimality in House Allocation Problems
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 1163-1175
mehlhorn06y
2004Attachment IconPareto-optimality in house allocation problems
In: Algorithms and Computation: 15th International Symposium, ISAAC 2004, 3-15
ACMM04
Hide details for Abraham, Irving, Kavitha, MehlhornAbraham, Irving, Kavitha, Mehlhorn
2007Attachment IconPopular Matchings
In: SIAM Journal on Computing [37], 1030-1045
Abraham2007Popular
Hide details for Abraham, Irving, Mehlhorn, TelikepalliAbraham, Irving, Mehlhorn, Telikepalli
2005Attachment IconPopular Matchings
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 424-432
AIKM05
Hide details for Adamaszek, WieseAdamaszek, Wiese
2013Approximation Schemes for Maximum Weight Independent Set of Rectangles
In: Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2013),
AdamaszekWiese2013
Hide details for Adler, Räcke, Sivadasan, Sohler, VöckingAdler, Räcke, Sivadasan, Sohler, Vöcking
2003Attachment IconRandomized Pursuit-Evasion in Graphs
In: Combinatorics, Probability and Computing [12], 225-244
Sivadas2003
2002Randomized Pursuit-Evasion in Graphs
In: Automata, Languages and Programming : 29th International Colloquium, ICALP 2002, 901-912
NSBV+02
Hide details for Afshani, Agrawal, Doerr, Doerr, Larsen, MehlhornAfshani, Agrawal, Doerr, Doerr, Larsen, Mehlhorn
2013The Query Complexity of Finding a Hidden Permutation
In: Space-Efficient Data Structures, Streams, and Algorithms, 1-11
Afshani2013
Hide details for Afshani, Agrawal, Doerr, Green Larsen, Mehlhorn, WinzenAfshani, Agrawal, Doerr, Green Larsen, Mehlhorn, Winzen
2012The Query Complexity of Finding a Hidden Permutation
In: Electronic Colloquium on Computational Complexity (ECCC): Report Series [87 (Revision 1)], 1-36
AfshaniADGLMW12eccc
Hide details for Agarwal, Agarwal, Chopra, Feldmann, Kammenhuber, Krysta, VöckingAgarwal, Agarwal, Chopra, Feldmann, Kammenhuber, Krysta, Vöcking
2003An experimental study of k-splittable scheduling for DNS-based traffic allocation
In: Euro-Par 2003 parallel processing : 9th International Euro-Par Conference ; proceedings, 230-235
Agarwal03
Hide details for Agarwal, Arge, Brodal, VitterAgarwal, Arge, Brodal, Vitter
1999I/O-Efficient Dynamic Point Location in Monotone Subdivisions
In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), 11-20
Agarwal99
Hide details for Agarwal, Hagerup, Ray, Sharir, Smid, WelzlAgarwal, Hagerup, Ray, Sharir, Smid, Welzl
2002Translating a Planar Object to Maximize Point Containment
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 42-53
Rahul2002b
Hide details for Agrawal, Saha, Saptharishi, SaxenaAgrawal, Saha, Saptharishi, Saxena
2012Attachment IconJacobian hits circuits: hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits
In: STOC'12 : Proceedings of the 2012 ACM Symposium on Theory of Computing, 599-614
ASSS12
Hide details for Agrawal, Saha, SaxenaAgrawal, Saha, Saxena
2013A Case of Depth-3 Identity Testing, Sparse Factorization and Duality
In: 45th ACM Symposium on the Theory of Computing (STOC-13), toappear
SSS13
2012Attachment IconQuasi-polynomial Hitting-set for Set-depth-Delta Formulas
In: arXiv [abs/1209.2333], 1-13
ASS12
Hide details for Ahuja, Baltz, Doerr, Privetivy, SrivastavAhuja, Baltz, Doerr, Privetivy, Srivastav
2007On the Minimum Load Coloring Problem
In: Journal of Discrete Algorithms [5], 533-545
Doerr2007nitin
2005Attachment IconOn the Minimum Load Coloring Problem
In: Third Workshop on Approximation and Online Algorithms (WAOA 2005), 15-26
Doerr2005minload
Hide details for Ahuja, Baltz, Doerr, SrivastavAhuja, Baltz, Doerr, Srivastav
2004Coloring Graphs with Minimal Load
In: Electronic Notes in Discrete Mathematics [17], 129-133
MinLoad2004
Hide details for Ahuja, Mehlhorn, Orlin, TarjanAhuja, Mehlhorn, Orlin, Tarjan
1990Attachment IconFaster algorithms for the shortest path problem
In: Journal of the ACM [37], 213-223
Ahuja-Mehlhorn-Orlin-Tarjan/90
1988Faster Algorithms for the Shortest Path Problemmehlhorn88l
1988Faster Algorithms for the Shortest Path Problemmehlhorn88z
Hide details for Ailon, Avigdor-Elgrabli, Liberty, van ZuylenAilon, Avigdor-Elgrabli, Liberty, van Zuylen
2012Improved Approximation Algorithms for Bipartite Correlation Clustering
In: SIAM Journal on Computing [41], 1110-1121
Ailon2012
2011Improved Approximation Algorithms for Bipartite Correlation Clustering
In: Algorithms - ESA 2011 : 19th Annual European Symposium, 25-36
AilonESA2011
Hide details for AjwaniAjwani
2005Design, Implementation and Experimental Study of External Memory BFS Algorithms
Universität des Saarlandes
Ajwani05
Hide details for Ajwani, Dementiev, MeyerAjwani, Dementiev, Meyer
2006Attachment IconA computational study of external memory BFS algorithms
In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06, 601-610
Ajwani06
Hide details for Ajwani, Elbassioni, Govindarajan, RayAjwani, Elbassioni, Govindarajan, Ray
2012Conflict-free coloring for rectangle ranges using O(n .382) colors
In: Discrete & Computational Geometry [48], 39-52
Ajwani2012
2007Conflict-free coloring for rectangle ranges using $n^.382$ colors
In: SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallel Algorithms and Architectures, 181-187
Elbassioni2007f
2007Conflict-Free Coloring for Rectangle Ranges Using $\tildeO(n^.382+\epsilon)$ Colors
In: 19th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 07), (to-appear)
Elbassioni2007a
Hide details for Ajwani, FriedrichAjwani, Friedrich
2010Average-case Analysis of Incremental Topological Ordering
In: Discrete Applied Mathematics [158], 240-250
AF10
2007Average-Case Analysis of Online Topological Ordering
In: Algorithms and Computation : 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007. Proceedings, 464-475
OTO_ISAAC_2007
Hide details for Ajwani, Friedrich, MeyerAjwani, Friedrich, Meyer
2008An $O(n^2.75)$ algorithm for incremental topological ordering
In: ACM Transactions on Algorithms [4], 1-14
AFM08
2006Attachment IconAn $O(n^2.75)$ algorithm for online topological ordering
In: Algorithm theory - SWAT 2006 : 10th Scandinavian Workshop on Algorithm Theory, 53-64
AFM06
Hide details for Ajwani, Malinger, Meyer, ToledoAjwani, Malinger, Meyer, Toledo
2008Characterizing the Performance of Flash Memory Storage Devices and Its Impact on Algorithm Design
In: Proc. 7th Intern. Workshop on Experimental Algorithms (WEA), 208-219
Flash-WEA-2008
Hide details for Ajwani, Meyer, OsipovAjwani, Meyer, Osipov
2009Breadth first search on massive graphs
In: The shortest path problem : ninth DIMACS implemenation challenge, 291-307
AjwaniMeyerOsipov2009
2007Improved external memory BFS implementations
In: 9th Workshop on Algorithm Engineering and Experiments (ALENEX), 3-12
Ajwani07
Hide details for Ajwani, Ray, Seidel, TiwaryAjwani, Ray, Seidel, Tiwary
2007On Computing the Centroid of the Vertices of an Arrangement and Related Problems
In: 10th Workshop on Algorithms and Data Structures (WADS), 519-528
WadsCentroid07
Hide details for Akbari, Berenbrink, SauerwaldAkbari, Berenbrink, Sauerwald
2012A simple approach for adapting continuous load balancing processes to discrete settings
In: PODC'12 : Proceedings of the 2012 ACM Symposium on Principles of Distributed Computing, 271-280
AkbariBS2012
Hide details for AlbersAlbers
1999Better bounds for online scheduling
In: SIAM Journal on Computing [29], 459-473
Albers2000
1999Online-Algorithmen
Universität des Saarlandes
Albers1999
1998A competitive analysis of the list update problem with lookahead
In: Theoretical Computer Science [197], 95-109
Albers1998a
1998Improved randomized on-line algorithms for the list update problem
In: SIAM Journal on Computing [27], 682-693
Albers1998b
1997Better Bounds for Online Scheduling
In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC-97), 130-139
Albers97a
1997On the Influence of Lookahead in Competitive Paging Algorithms
In: Algorithmica [18], 283-305
Albers97b
1995Improved randomized on-line algorithms for the list update problem
In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95), 412-419
Albers95
Hide details for Albers, Arora, KhannaAlbers, Arora, Khanna
1999Page replacement for general caching problems
In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), 31-40
AlbersAroraKhanna1999
Hide details for Albers, Charikar, MitzenmacherAlbers, Charikar, Mitzenmacher
1998On delayed information and action in on-line algorithms
In: Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science (FOCS-98), 71-80
AlbersCharikarMitzenmacher1998
Hide details for Albers, Garg, LeonardiAlbers, Garg, Leonardi
2000Minimizing stall time in single and parallel disk systems
In: Journal of the ACM [47], 969-986
AlbersGargLeonardi2000
1998Minimizing stall time in single and parallel disk systems
In: Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC-98), 454-462
AlbersGargLeonardi1998
Hide details for Albers, HagerupAlbers, Hagerup
1997Improved Parallel Integer Sorting without Concurrent Writing
In: Information and Computation [136], 25-51
AlbersHagerup97
Hide details for Albers, HenzingerAlbers, Henzinger
1997Exploring Unknown Environments
In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC-97), 416-425
AlbersHenzinger97
Hide details for Albers, KogaAlbers, Koga
1998New on-line algorithms for the page replication problem
In: Journal of Algorithms [27], 75-96
AlbersKoga1998
1995Page migration with limited local memory capacity
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 412-158
Albers-Koga95
Hide details for Albers, KursaweAlbers, Kursawe
1999Exploring unknown environments with obstacles
In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), 842-843
AlbersKursaweSchuierer1999
Hide details for Albers, Kursawe, SchuiererAlbers, Kursawe, Schuierer
2002Exploring unkown environments with obstacles
In: Algorithmica [32], 123-143
Kursawe2002
Hide details for Albers, MitzenmacherAlbers, Mitzenmacher
2000Average-Case Analyses of First Fit and Random Fit Bin Packing
In: Random Structures & Algorithms [16], 240 - 259
Albers/Mitzenmacher/2000
1998Average case analyses of First-Fit and Random-Fit bin packing
In: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-98), 290-299
AlbersMitzenmacher1998b
1998Average case analyses of list update algorithms, with applications to data compression
In: Algorithmica [21], 312-329
AlbersMitzenmacher1998a
1997Revisiting the COUNTER algorithms for list update
In: Information Processing Letters [64], 155-160
AlbersMitzenmacher97
1996Average Case Analysis of List Update Algorithms, with Applications to Data Compression
In: Automata, Languages and Programming: 23rd International Colloquium (ICALP'96), 514-525
Albers96
Hide details for Albers, von Stengel, WechnerAlbers, von Stengel, Wechner
1995A combined BIT and TIMESTAMP algorithm for the list update problem
In: Information Processing Letters [56], 135-139
Albers-et-al95
Hide details for Albers, WestbrookAlbers, Westbrook
1998Self-organizing data structures
In: Online Algorithms: The State of the Art, 13-51
AlbersWestbrook1998
Hide details for Alberts, Cattaneo, Italiano, Nanni, ZaroliagisAlberts, Cattaneo, Italiano, Nanni, Zaroliagis
1998A Software Library of Dynamic Graph Algorithms
In: Proceedings of Workshop on Algorithms and Experiments (ALEX-98), 129-136
Alberts-et-al-98
Hide details for Alberts, Gutwenger, Mutzel, NäherAlberts, Gutwenger, Mutzel, Näher
1997AGD-Library: A Library of Algorithms for Graph Drawing
In: Proceedings of the Workshop on Algorithm Engineering (WAE-97), 112-123
AGMN97
Hide details for Albrecht, Jung, Mehlhorn (ed.)Albrecht, Jung, Mehlhorn (ed.)
1987Parallel algorithms and architectures (WPAA-87) : international workshopAlbrecht:1987:PAA
1987Parallel algorithms and architectures : International WorkshopAlbrecht:1987:PAA
Hide details for Albrecht, Karrenbauer, XuAlbrecht, Karrenbauer, Xu
2008A clipper-free Algorithm for efficient HW-Implementation of local dimming LED-Backlight
In: Proceedings of the 28th International Display Research Conference (IDRC), 286-289
AKX08
Hide details for Alcaraz, Friedrich, Kötzing, Krohmer, Müller, Pauling, BaumbachAlcaraz, Friedrich, Kötzing, Krohmer, Müller, Pauling, Baumbach
2012Efficient key pathway mining: combining networks and OMICS data
In: Integrative Biology [4], 756-764
AlcarayFKKMPB2012
Hide details for Alefragis, Goumopoulos, Sanders, Takkula, WedelinAlefragis, Goumopoulos, Sanders, Takkula, Wedelin
1998Parallel Crew Scheduling in PAROS
In: Proceedings of the 4th International Euro-Par Conference (Euro-Par-98), 1104-1113
AGHSTW98
Hide details for Alkassar, Böhme, Mehlhorn, RizkallahAlkassar, Böhme, Mehlhorn, Rizkallah
2013A Framework for the Verification of Certifying ComputationsVerificationCertComp12
2011Verification of Certifying Computations
In: Computer Aided Verification : 23rd International Conference, CAV 2011, 67-82
FormalVerificationofCertifyingComputations
Hide details for Alon, Bradford, FleischerAlon, Bradford, Fleischer
1996Matching nuts and bolts faster
In: Information Processing Letters [59], 123-127
Bradford-Fleischer-96
Hide details for Altenkamp, MehlhornAltenkamp, Mehlhorn
1980Attachment IconCodes: Unequal Probabilities, Unequal Letter Cost
In: Journal of the ACM [27], 412-427
mehlhorn80d
[Replication or Save Conflict]
1978Codes: Unequal Probabilities, Unequal Letter Costmehlhorn78xx
1978Codes: Unequal Probabilities, Unequal Letter Cost
In: Automata, languages and programming (ICALP-78): 5th international colloquium, 15-25
mehlhorn78
Hide details for AlthausAlthaus
2001Curve Reconstruction and the Traveling Salesman Problem
Universität des Saarlandes
Althaus2001d
1998Attachment IconBerechnung optimaler Steinerbäume in der Ebene
Universität des Saarlandes
Althaus1998
Hide details for Althaus, Altmeyer, NaujoksAlthaus, Altmeyer, Naujoks
2010A New Combinatorial Approach to Parametric Path AnalysisNaujoks10a
Hide details for Althaus, Baumann, Schömer, WerthAlthaus, Baumann, Schömer, Werth
2007Trunk Packing Revisited
In: Experimental Algorithms, 6th International Workshop, 420-432
Althaus2007a
Hide details for Althaus, Bockmayr, Elf, Kasper, Jünger, MehlhornAlthaus, Bockmayr, Elf, Kasper, Jünger, Mehlhorn
2002Attachment IconSCIL - Symbolic Constraints in Integer Linear Programming.
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 75-87
Althaus2002
Hide details for Althaus, Calinescu, Mandoiu, Prasad, Tchervenski, ZelikovslyAlthaus, Calinescu, Mandoiu, Prasad, Tchervenski, Zelikovsly
2006Power efficient range assignment for symmetric connectivity in static ad-hoc wireless networks
In: Wireless Networks [12], 287-299
Althaus2006
[Replication or Save Conflict]
2003Power Efficient Range Assignment in Ad-hoc Wireless
In: Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC-03), 1889-1894
Althaus2003
Hide details for Althaus, CanzarAlthaus, Canzar
2008A Lagrangian relaxation approach for the multiple sequence alignment problem
In: Journal of Combinatorial Optimization [16], 127-154
AltCanJOC08
2008LASA: A tool for non-heuristic alignment of multiple sequences
In: Bioinformatics Research and Development (BIRD’08), 489-498
AltCan2008
2007A Lagrangian relaxation approach for the multiple sequence alignment problem
In: Combinatorial Optimization and Applications : First International Conference, COCOA 2007, 267-278
Althaus2007
Hide details for Althaus, Canzar, Elbassioni, Karrenbauer, MestreAlthaus, Canzar, Elbassioni, Karrenbauer, Mestre
2011Approximation Algorithms for the Interval Constrained Coloring Problem
In: Algorithmica [61], 342-361
Elbassioni2011l
2008Approximating the Interval Constrained Coloring Problem
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), 210-221
conf/swat/AlthausCEKM2008
Hide details for Althaus, Canzar, Emmett, Karrenbauer, Marshall, Meyer-Bäse, ZhangAlthaus, Canzar, Emmett, Karrenbauer, Marshall, Meyer-Bäse, Zhang
2008Computing H/D-exchange speeds of single residues from data of peptic fragments
In: 23rd Annual ACM Symposium on Applied Computing (SAC), 1273-1277
AltCanKar08
Hide details for Althaus, Caprara, Lenhof, ReinertAlthaus, Caprara, Lenhof, Reinert
2006Aligning multiple sequences by cutting planes
In: Mathematical Programming [2006], 387-425
Althaus2006
2002Multiple sequence alignment with arbitrary gap costs: Computing an optimal solution using polyhedral combinatorics
In: Proceedings of the European Conference on Computational Biology (ECCB 2002), S4-S16
Althaus2002b
Hide details for Althaus, Duchier, Koller, Mehlhorn, Niehren, ThielAlthaus, Duchier, Koller, Mehlhorn, Niehren, Thiel
2003Attachment IconAn Efficient Algorithm for the Configuration Problem of Dominance Graphs
In: Journal of Algorithms [48], 194-219
ADKMNT03:dominance
2001An Efficient Algorithm for the Configuration Problem of Dominance Graphs
In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), 815-824
ADKMNT2001
Hide details for Althaus, DumitriuAlthaus, Dumitriu
2009Fast and Accurate Bounds on Linear Programs
In: Experimental Algorithms : 8th International Symposium on Experimental Algorithms (SEA 2009), 40-50
AlthausD09
Hide details for Althaus, Eisenbrand, Funke, MehlhornAlthaus, Eisenbrand, Funke, Mehlhorn
2004Attachment IconPoint Containment in the Integer Hull of a Polyhedron
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 929-933
AEFM2004
Hide details for Althaus, FinkAlthaus, Fink
2002A Polyhedral Approach to Surface Reconstruction from Planar Contours.
In: Proceedings of the 9th International Conference on Integer Programming and Combinatorial Optimization, 258-272
Althaus2002a
Hide details for Althaus, Funke, Har-Peled, Könemann, Ramos, SkutellaAlthaus, Funke, Har-Peled, Könemann, Ramos, Skutella
2005Approximating k-Hop Minimum-Spanning Trees
In: Operations Research Letters [33], 115-120
AFHKRS05
Hide details for Althaus, Karamanis, KollerAlthaus, Karamanis, Koller
2004Computing Locally Coherent Discourses.
In: Proceedings of the conference and workshops, 42nd annual meeting of the Association for Computational Linguistics, 399-406
Althaus2004
Hide details for Althaus, Kohlbacher, Lenhof, MüllerAlthaus, Kohlbacher, Lenhof, Müller
2002A combinatorial approach to protein docking with flexible side chains
In: Journal of Computational Biology [9], 597-612
ALKM2001
2000A Combinatorial Approach to Protein Docking with Flexible Side-Chains
In: Proceedings of the 4th Annual International Conference on Computational Molecular Biology (RECOMB-00), 15-24
AKL+2000
Hide details for Althaus, Kupilas, NaujoksAlthaus, Kupilas, Naujoks
2011On the Low-Dimensional Steiner Minimum Tree Problem in Hamming Metric
In: Theory and Applications of Models of Computation : 8th Annual Conference, TAMC 2011, 308-319
Althaus2011
Hide details for Althaus, MehlhornAlthaus, Mehlhorn
2001Attachment IconTraveling Salesman-Based Curve Reconstruction in Polynomial Time
In: SIAM Journal on Computing [31], 27-66
AltMeh2001j
2000TSP-Based Curve Reconstruction in Polynomial Time
In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00), 686-695
AlthausMehlhorn1999
1998Attachment IconMaximum Network Flow with Floating Point Arithmetic
In: Information Processing Letters [66], 109-113
althaus-mehlhorn98
Hide details for Althaus, Mehlhorn, Näher, SchirraAlthaus, Mehlhorn, Näher, Schirra
2000Attachment IconExperiments on curve reconstruction
In: Proceedings of 2nd Workshop on Algorithm Engineering and Experiments (ALENEX-00), 103-114
Althaus-et-al:experimental-curve
Hide details for Althaus, NaujoksAlthaus, Naujoks
2008Reconstructing Phylogenetic Networks with One Recombination
In: Experimental Algorithms, 7th International Workshop, WEA 2008, 275-288
ALNA2008
2006Attachment IconComputing Steiner Minimal Trees in Hamming Metric
In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06, 172-181
Naujoks2006
Hide details for Althaus, Polzin, Vahdati DaneshmandAlthaus, Polzin, Vahdati Daneshmand
2003Improving Linear Programming Approaches for the Steiner Tree Problem
In: Experimental and efficient algorithms : Second International Workshop, WEA 2003, 1-14
AlPoVa2003-lpimprove
Hide details for Alt, Blum, Mehlhorn, PaulAlt, Blum, Mehlhorn, Paul
1991Attachment IconComputing a maximum cardinality matching in a bipartite graph in time $O(n^1.5 \sqrtm/\log n)$
In: Information Processing Letters [37], 237-240
Mehlhorn91a
Hide details for Alt, Fleischer, Kaufmann, Mehlhorn, Näher, Schirra, UhrigAlt, Fleischer, Kaufmann, Mehlhorn, Näher, Schirra, Uhrig
1992Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
In: Algorithmica [8], 391-408
Mehlhorn92a
1990Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures
In: Computational geometry (SCG-90) : 6th annual symposium, 281-289
SCG90*281
Hide details for Alt, Geffert, MehlhornAlt, Geffert, Mehlhorn
1992Attachment IconA lower bound for the nondeterministic space complexity of context-free recognition
In: Information Processing Letters [42], 25-27
Mehlhorn92j
Hide details for Alt, Guibas, Mehlhorn, Karp, WigdersonAlt, Guibas, Mehlhorn, Karp, Wigderson
1996Attachment IconA Method for Obtaining Randomized Algorithms with Small Tail Probabilities
In: Algorithmica [16], 543-547
AltGuibasMehlhornKarp96
1991Attachment IconA Method for Obtaining Randomized Algorithms with Small Tail Probabilitiesmehlhorn91e
Hide details for Alt, Hagerup, Mehlhorn, PreparataAlt, Hagerup, Mehlhorn, Preparata
1987Attachment IconDeterministic Simulation of Idealized Parallel Computers on more Realistic Ones
In: Parallel Algorithms and Architectures : International Workshop, 11-15
Albrecht:1987:PAAa
1987Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
In: SIAM Journal on Computing [16], 808-835
SICOMP::AltHMP1987
1986Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
In: Mathematical Foundations of Computer Science, 12th Symposium (MFCS 1986), 199-208
MFCS::AltHMP1986
1985Deterministic simulation of idealized parallel computers on more realistic onesmehlhorn85kz
Hide details for Alt, MehlhornAlt, Mehlhorn
1985Attachment IconSearching Semisorted Tables
In: SIAM Journal on Computing [14], 840-848
mehlhorn85b
1979Attachment IconComplexity arguments in algebraic language theory
In: Revue française d'automatique, d'informatique et de recherche opérationnelle : RAIRO / Association Française pour la Cybernétique Economique et Technique [13], 217-225
mehlhorn79a
1978Complexity Arguments in Algebraic Language Theorymehlhorn78w
1976Attachment IconLower Bounds for the Space Complexity of Context-Free Recognition
In: Third International Colloquium on Automata, Languages and Programming, 338-354
mehlhorn76e
1975Attachment IconA Language over a One Symbol Alphabet Requiring only O(log log n) Space
In: SIGACT News [7], 31-33
mehlhorn75bz
1975Untere Schranken für den Platzbedarf bei der kontext-freien Analysemehlhorn75
Hide details for Alt, Mehlhorn, MunroAlt, Mehlhorn, Munro
1984On the complexity of partial match retrieval
In: Information Processing Letters [19], 61-65
mehlhorn84o
1984Attachment IconPartial match retrieval in implicit data structures
In: Information Processing Letters [19], 61-65
mehlhorn84i
1981Partial Match Retrieval in Implicit Data Structures
In: Mathematical foundations of computer science (MFCS-81) : 10th symposium, ,, 156-161
mehlhorn81e
Hide details for Alt, Mehlhorn, Wagener, WelzlAlt, Mehlhorn, Wagener, Welzl
1988Attachment IconCongruence, Similarity, and Symmetries of Geometric Objects
In: Discrete and Computational Geometry [3], 237-256
journals/dcg/AltMWW88
1987Attachment IconCongruence, similarity and symmetries of geometric objectsAlt02/87
1987Convergence, Similarity and Symmetries of Geometric Objects
In: Computational geometry (SCG-87) : 3rd symposium, 308-315
Welzl87a
Hide details for Alvarez, Bringmann, Curticapean, RayAlvarez, Bringmann, Curticapean, Ray
2012Attachment IconCounting Crossing Free Structures
In: Proceedings of the Twenty-Eight Annual Symposium on Computational Geometry (SCG'12), 61-68
AlvarezBCS12
Hide details for Alvarez, Bringmann, Ray, SeidelAlvarez, Bringmann, Ray, Seidel
2013Counting Triangulations Approximately
In: 25th Canadian Conference on Computational Geometry (CCCG-13), 85-89
AlvarezBRS13
Hide details for Amaldi, Iuliano, Jurkiewicz, Mehlhorn, RizziAmaldi, Iuliano, Jurkiewicz, Mehlhorn, Rizzi
2009Breaking the $O(m^2n)$ Barrier for Minimum Cycle Bases
In: Algorithms - ESA 2009 : 17th Annual European Symposium, 301-312
AmaldiIulianoetal009
2009Breaking the $O(m^2n)$ Barrier for Minimum Cycle Bases
In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, 301-312
AIJMR09
Hide details for Amato, Goodrich, RamosAmato, Goodrich, Ramos
2000Linear-Time Triangulation of a Simple Polygon Made Easier Via Randomization
In: Proceedings of the 16th Annual Symposium on Computational Geometry (SCG-00), 201-212
Ramos2000a
Hide details for Ambalath, Balasundaram, H., Koppula, Misra, Philip, RamanujanAmbalath, Balasundaram, H., Koppula, Misra, Philip, Ramanujan
2010Attachment IconOn the Kernelization Complexity of Colorful Motifs
In: Parameterized and Exact Computation - 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings, 14-25
AmbalathBalasundaramHKoppulaMisraPhilipRamanujan2010
Hide details for Amini, ManjunathAmini, Manjunath
2010Riemann-Roch for sublattices of the root lattice $A\_n$
In: Electronic Journal of Combinatorics [17], R124,1-R124,50
Manjunath2010
Hide details for Amini, Peleg, Pérennes, Sau, SaurabhAmini, Peleg, Pérennes, Sau, Saurabh
2009Degree-Constrained Subgraph Problems: Hardness and Approximation Results
In: Approximation and Online Algorithms : 6th International Workshop, WAOA 2008, 29-42
Aminietal2009
Hide details for Amini, Pérennes, SauAmini, Pérennes, Sau
2009Hardness and approximation of traffic grooming
In: Theoretical Computer Science [410], 3751-3760
Amini2009a
Hide details for Anagnostopoulos, Grandoni, Leonardi, WieseAnagnostopoulos, Grandoni, Leonardi, Wiese
2013Constant Integrality Gap LP formulations of Unsplittable Flow on a Path
In: Proceedings of the 16th Conference on Integer Programming and Combinatorial Optimization (IPCO 2013),
Anagnostopoulos2013
Hide details for Anand, Bringmann, Friedrich, Garg, KumarAnand, Bringmann, Friedrich, Garg, Kumar
2013Minimizing maximum (weighted) flow-time on related and unrelated machines
In: Automata, Languages, and Programming - 40th International Colloquium (ICALP-13), 13-24
AnandBFGK13
Hide details for Anand, Garg, MegowAnand, Garg, Megow
2011Meeting deadlines: How much speed suffices?
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011. - Pt. I, 232-243
Megow2011-speed
Hide details for Andersson, Hagerup, Hastad, PeterssonAndersson, Hagerup, Hastad, Petersson
2000Tight bounds for searching a sorted array of strings
In: SIAM Journal on Computing [30], 1552-1578
AnderssonHagerupetal2000
Hide details for Andersson, Hagerup, Nilsson, RamanAndersson, Hagerup, Nilsson, Raman
1995Sorting in Linear Time?
In: 27th Annual ACM Symposium on Theory of Computing (STOC95), 427-436
Hagerup-et-al-1-95
Hide details for Andreou, Fotakis, Nikoletseas, Papadopoulou, SpirakisAndreou, Fotakis, Nikoletseas, Papadopoulou, Spirakis
2002Attachment IconOn Radiocoloring Hierarchically Specified Planar Graphs: PSPACE-Completeness and Approximations
In: Mathematical Foundations of Computer Science 2002 : 27th International Symposium, MFCS 2002, 81-92
AFNPS02
Hide details for AngelopoulosAngelopoulos
2010On the Competitiveness of the Online Asymmetric and Euclidean Steiner Tree Problems
In: Approximation and Online Algorithms : 7th International Workshop, WAOA 2009, 1-12
Angelopoulos:waoa2009
2009Online Priority Steiner Tree Problems
In: Algorithms and Data Structures : 11th International Symposium, WADS 2009, 37-48
Angelopoulos:wads2009
2008A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry
In: 16th Annual European Symposium on Algorithms (ESA 2008), 76-87
Ang:08.steiner
2007Improved bounds for the online steiner tree problem in graphs of bounded edge-asymmetry
In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, 248-257
Angelopoulos2007SODA1
Hide details for Angelopoulos, BorodinAngelopoulos, Borodin
2010Randomized Priority Algorithms
In: Theoretical Computer Science [411], 2542-2558
Angelopoulos.Borodin:randomized.2010
Hide details for Angelopoulos, Doerr, Huber, PanagiotouAngelopoulos, Doerr, Huber, Panagiotou
2009Tight bounds for quasirandom rumor spreading
In: The Electronic Journal of Combinatorics [16], R102,1-R102,19
ADHP2009
Hide details for Angelopoulos, Dorrigiv, Lopez-OrtizAngelopoulos, Dorrigiv, Lopez-Ortiz
2008List Update with Locality of Reference
In: 8th Latin American Symposium on Theoretical Informatics (LATIN 2008), 399-410
ADLO:08.listupdate
2007On the separation and equivalence of paging strategies
In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, 229-237
Angelopoulos2007SODA2
Hide details for Angelopoulos, Lopez-OrtizAngelopoulos, Lopez-Ortiz
2009Intertruptible Algorithms for Multi Problem Solving
In: Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI 09), 380-386
AngLop:ijcai09
Hide details for Angelopoulos, Lopez-Ortiz, HamelAngelopoulos, Lopez-Ortiz, Hamel
2008Optimal Scheduling of Contract Algorithms with Soft Deadlines
In: 23rd National Conference on Artificial Intelligence (AAAI 2008), 868-873
ALOH:08.soft
Hide details for Angelopoulos, SchweitzerAngelopoulos, Schweitzer
2009Paging and List Update under Bijective Analysis
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 1136-1145
AngSch:2009.bijective
Hide details for Anshelevich, Bhardwaj, HoeferAnshelevich, Bhardwaj, Hoefer
2013Friendship and Stable Matching.
In: 21st European Symposium on Algorithms (ESA-13), 49-60
AnshelevichBH2013
Hide details for Antoniadis, Huang, Ott, VerschaeAntoniadis, Huang, Ott, Verschae
2013How to Pack Your Items When You Have to Buy Your Knapsack
In: Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, 62-73
Ott2013
Hide details for Aranov, Asano, Katoh, Mehlhorn, TokuyamaAranov, Asano, Katoh, Mehlhorn, Tokuyama
2004Attachment IconPolyline Fitting of Planar Points Under Min-sum Criteria
In: Algorithms and Computation: 15th International Symposium, ISAAC 2004, 77-88
Mehlhorn2004PolylineApprox
Hide details for Arge, Meyer, TomaArge, Meyer, Toma
2004External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs
In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, 146-157
ArMeTo04
Hide details for Arge, Meyer, Toma, ZehArge, Meyer, Toma, Zeh
2003On external-memory planar depth first search
In: Journal of Graph Algorithms and Applications [7], 105-129
AMTZ03
2001On External-Memory Planar Depth First Search
In: Proceedings of the 7th International Workshop on Algorithms and Data Structures (WADS-01), 471-482
ArMeToZe2001
Hide details for Arikati, Chaudhuri, ZaroliagisArikati, Chaudhuri, Zaroliagis
1998All-Pairs Min-Cut in Sparse Networks
In: Journal of Algorithms [29], 82-110
Arikati-Chaudhuri-Zaroliagis-98
1995All-Pairs Min-Cut in Sparse Networks
In: Foundations of software technology and theoretical computer science (FSTTCS-95) : 15th conference, 363-376
Arikati-et-al95
Hide details for Arikati, Chen, Chew, Das, Smid, ZaroliagisArikati, Chen, Chew, Das, Smid, Zaroliagis
1996Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane
In: Algorithms - ESA '96: 4th Annual European Symposium, 514-528
Zaroliagis96
Hide details for Arikati, Dessmark, Lingas, MaratheArikati, Dessmark, Lingas, Marathe
2001Approximation algorithms for maximum two-dimensional pattern matching
In: Theoretical Computer Science [255], 51-62
ArikatiDessmarketal2001
1996Approximation algorithms for maximum two-dimensional pattern matching
In: Combinatorial Pattern Matching: 7th Annual Symposium, CPM96, 348-360
Arikati-et-al96
Hide details for Arikati, MaheshwariArikati, Maheshwari
1996Realizing degree sequences in parallel
In: SIAM Journal of Computing [9], 317-338
Arikati-Maheshwari96
Hide details for Arikati, Maheshwari, ZaroliagisArikati, Maheshwari, Zaroliagis
1997Efficient Computation of implicit representations of sparse graphs
In: Discrete Applied Mathematics [78], 1-16
ArikatiMaheshwariZaroliagis97
Hide details for Arikati, MehlhornArikati, Mehlhorn
1999Attachment IconA correctness certificate for the Stoer-Wagner min-cut algorithm
In: Information Processing Letters [70], 251-254
Arikati-Mehlhorn
Hide details for Aronov, Asano, FunkeAronov, Asano, Funke
2007Optimal Triangulation with Steiner Points
In: Algorithms and Computation : 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007. Proceedings, 681-691
Funke2007
Hide details for Aronov, Asano, Katoh, Mehlhorn, TokuyamaAronov, Asano, Katoh, Mehlhorn, Tokuyama
2006Polyline Fitting of Planar Points under Min-sum Criteria
In: International Journal of Computational Geometry and Applications [16], 97-116
mehlhorn06z
Hide details for Arumugam, Chandrasekar, Misra, Philip, SaurabhArumugam, Chandrasekar, Misra, Philip, Saurabh
2011Attachment IconAlgorithmic Aspects of Dominator Colorings in Graphs
In: Combinatorial Algorithms - 22nd International Workshop, IWOCA 2011, Victoria, BC, Canada, July 20-22, 2011, Revised Selected Papers, 19-30
arumugamchandrasekarmisraphilipsaurabh2011
Hide details for Arya, Das, Mount, Salowe, SmidArya, Das, Mount, Salowe, Smid
1995Euclidean spanners: short, thin, and lanky
In: 27th Annual ACM Symposium on Theory of Computing (STOC95), 489-498
Arya-Smid95
Hide details for Arya, Golin, MehlhornArya, Golin, Mehlhorn
1999On the Expected Depth of Random Circuits
In: Combinatorics, Probability and Computing [8], 209-228
mehlhorn99
Hide details for Arya, Malamatos, MountArya, Malamatos, Mount
2007A simple entropy-based algorithm for planar point location
In: ACM Transactions on Algorithms [3], 17
Malamatos2007b
2006On the Importance of Idempotence
In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, STOC'06, 564-573
AMM2006a
2006The Effect of Corners on the Complexity of Approximate Range Searching
In: Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06, 11-20
AMM2006b
2005Space-Time Tradeoffs for Approximate Spherical Range Counting
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 535-544
AMM2005
Hide details for Arya, Malamatos, Mount, WongArya, Malamatos, Mount, Wong
2007Optimal expected-case planar point location
In: SIAM Journal on Computing [37], 584-610
Malamatos2007a
Hide details for Arya, MountArya, Mount
2000Approximate range searching
In: Computational Geometry [17], 135-152
AryaMount2000
1995Approximate range searching
In: 11th Annual ACM Symposium on Computational Geometry (SCG95), 172-181
Arya-Mount95
Hide details for Arya, Mount, NarayanArya, Mount, Narayan
1996Accounting for boundary effects in nearest neighbor searching
In: Discrete & Computational Geometry [16], 155-176
Arya-Mount-Narayan96
1995Accounting for boundary effects in nearest neighbor searching
In: 11th Annual ACM Symposium on Computational Geometry (SCG95), 336-344
Arya-Mount-Narayan95
Hide details for Arya, SmidArya, Smid
1997Efficient construction of a bounded degree spanner with low weight
In: Algorithmica [17], 33-54
Arya-Smid96
Hide details for Asano, DoerrAsano, Doerr
2011Memory-constrained algorithms for shortest path problem
In: 23rd Annual Canadian Conference on Computational Geometry (CCCG 2011), 315-319
DoerrA11CCCG
Hide details for AshoffAshoff
2000Agorithmen der modularen Arithmetik
Universität des Saarlandes
Ashoff2000
Hide details for Auger, Doerr (ed.)Auger, Doerr (ed.)
2011Theory of Randomized Search HeuristicsAugerD11
Hide details for Auletta, Dinitz, Nutov, ParenteAuletta, Dinitz, Nutov, Parente
1999A 2-approximation algorithm for finding an optimum 3-vertex-connected spanning subgraph
In: Journal of Algorithms [32], 21-30
AulettaDinitzNutuvDomenico1999
Hide details for Awerbuch, Azar, Grove, Kao, Krishnan, VitterAwerbuch, Azar, Grove, Kao, Krishnan, Vitter
1995Load Balancing in the Euclidean Norm
In: 36th Annual Symposium on Foundations of Computer Science, 383-391
Grove-et-al-1-95a
Hide details for Babenko, Gawrychowski, Kociumaka, StarikovskayaBabenko, Gawrychowski, Kociumaka, Starikovskaya
2014Computing Minimal and Maximal Suffixes of a Substring Revisited
In: Combinatorial Pattern Matching - 25th Annual Symposium, CPM 2014, Moscow, Russia, June 16-18, 2014. Proceedings, 30-39
Gawrychowski2014d
Hide details for Bachrach, El-Yaniv, ReinstädtlerBachrach, El-Yaniv, Reinstädtler
2002On the competitive theory and practice of online list accessing algorithms
In: Algorithmica [32], 201-246
BachrachEl-YanivReinstädtler2002
Hide details for Bacik, MahajanBacik, Mahajan
1995Semidefinite programming and its applications to NP problems
In: Computing and Combinatorics: 1st Annual International Conference (COCOON95), 566-575
Bacik-Mahajan95
Hide details for BackesBackes
1998Berechnung kürzester Gittervektoren
Univesität des Saarlandes
Backes1998Diplom
Hide details for Bader, Moret, SandersBader, Moret, Sanders
2002Algorithm Engineering for Parallel Computation
In: Experimental Algorithmics, 1-23
Sanders2002a
Hide details for Bäsken, Brönnimann, Frank, Devillers, Ester, Fabri, Flato, Gärtner, Giezeman, Halperin, Hanniel, Har-Peled, HeBäsken, Brönnimann, Frank, Devillers, Ester, Fabri, Flato, Gärtner, Giezeman, Halperin, Hanniel, Har-Peled, Herrmann, Hert, Hirsch, Hoffmann, Kettner, Nechushtan, Neyer, Pasechnik, Pion, Schirra, Schönherr, Seel, Teillaud, Veltkamp, Wein, Wesselink, Yvinec
2001CGAL Reference and User Manualscgal-manual-2001
Hide details for BanderierBanderier
2001Combinatoire Analytique des chemins et des cartes
Université de Paris 6
Banderier2001_T
2001Random Maps, Coalescing Saddles, Singularity Analysis, and Airy Phenomena
In: Random Structures & Algorithms [19], 194-246
Banderier2001_2
2000A Generalized Cover Time for Random Walks on Graphs
In: Proceedings of FPSAC'00, 113-124
Banderier2000
2000Planar Maps and Airy Phenomena,
In: Proceedings of ICALP'00, 388-402
Banderier-LNCS1853-2000
1999An Introduction to Analytic Number TheoryBanderier1999a
1999On Generating Functions of Generating Trees
In: Proceedings of FPSAC'99, 40-52
Banderier1999b
Hide details for Banderier, Beier, MehlhornBanderier, Beier, Mehlhorn
2003Attachment IconSmoothed Analysis of Three Combinatorial Problems
In: Mathematical foundations of computer science 2003 : 28th International Symposium, MFCS 2003, 198-207
Beier2003a
Hide details for Banderier, Bousquet-Mélou, Denise, Flajolet, Gardy, Gouyou-BeauchampsBanderier, Bousquet-Mélou, Denise, Flajolet, Gardy, Gouyou-Beauchamps
2002Generating Functions for Generating Trees
In: Discrete Mathematics [246], 29-55
Banderier2001_3
Hide details for Banderier, FlajoletBanderier, Flajolet
2002Basic analytic combinatorics of directed lattice paths
In: Theoretical Computer Science [281], 37-80
Banderier2002
Hide details for Bannai, Gawrychowski, Inenaga, TakedaBannai, Gawrychowski, Inenaga, Takeda
2013Converting SLP to LZ78 in almost Linear Time
In: Combinatorial Pattern Matching, 24th Annual Symposium (CPM 2013), 38-49
Gawrychowski2013converting
Hide details for Bansal, ChanBansal, Chan
2009Weighted flow time does not admit O(1)-competitive algorithms
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 1238-1244
Chan2008
Hide details for Bansal, Chan, PruhsBansal, Chan, Pruhs
2011Competitive Algorithms for Due Date Schedulin
In: Algorithmica [59], 569-582
Chan2011
2009Speed Scaling with an Arbitrary Power Function
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 693-701
Chan2008b
Hide details for Bansal, Gupta, Li, Mestre, Nagarajan, RudraBansal, Gupta, Li, Mestre, Nagarajan, Rudra
2010When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings (Extended Abstract)
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. II, 218-229
Bansal2010
Hide details for Bar-Yehuda, Flysher, Mestre, RawitzBar-Yehuda, Flysher, Mestre, Rawitz
2007Approximation of Partial Capacitated Vertex Cover
In: 15th Annual European Symposium on Algorithms, 335-346
conf/esa/Bar-YehudaFMR2007
Hide details for Bar-Yehuda, Hermelin, RawitzBar-Yehuda, Hermelin, Rawitz
2011Minimum vertex cover in rectangle graphs
In: Computational Geometry [44], 356-364
Bar-YehudaHermelinRawitz2011
2010Minimum Vertex Cover in Rectangle Graphs
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. I, 255-266
Hermelin2010
Hide details for Bárány, DoerrBárány, Doerr
2006Attachment IconBalanced partitions of vector sequences
In: Linear Algebra and Its Applications [414], 464-469
Mcbg2006
Hide details for BaraqueBaraque
2002Effiziente Multiplikationsverfahren: ein numerischer Vergleich
Universität des Saarlandes
BaraqueDipl02
Hide details for Barnes, EdmondsBarnes, Edmonds
1998Time-Space Lower Bounds for Directed st-Connectivity on Graph Automata Models
In: SIAM Journal on Computing [27], 1190-1202
BarnesEdmondsSIAMJCOMPUT1998
Hide details for Bartal, Leonardi, Shallom, SittersBartal, Leonardi, Shallom, Sitters
2006On the value of preemption in scheduling
In: 9th Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX, 39-48
Sitters2006d
Hide details for Baruah, Bonifaci, D'Angelo, Li, Marchetti-Spaccamela, Megow, StougieBaruah, Bonifaci, D'Angelo, Li, Marchetti-Spaccamela, Megow, Stougie
2012Scheduling Real-Time Mixed-Criticality Jobs
In: IEEE Transactions on Computers [61], 1140-1152
Megow2011-MCsched
2010Attachment IconScheduling Real-Time Mixed-Criticality Jobs
In: Mathematical Foundations of Computer Science 2010 : 35th International Symposium, MFCS 2010, 90-101
Bonifaci:2010:c
Hide details for Baruah, Bonifaci, D'Angelo, Marchetti-Spaccamela, van der Ster, StougieBaruah, Bonifaci, D'Angelo, Marchetti-Spaccamela, van der Ster, Stougie
2011Attachment IconMixed-criticality scheduling of sporadic task systems
In: Algorithms - ESA 2011 : 19th Annual European Symposium, 555-566
Bonifaci:2011:c
Hide details for Baruah, Bonifaci, Marchetti-Spaccamela, StillerBaruah, Bonifaci, Marchetti-Spaccamela, Stiller
2010Attachment IconImproved Multiprocessor Global Schedulability Analysis
In: Real-Time Systems [46], 3-24
Baruah:2010
Hide details for Barve, Grove, VitterBarve, Grove, Vitter
1995An Application-Controlled Paging Algorithm for a Shared Cache
In: 36th Annual Symposium on Foundations of Computer Science, 204-213
Grove-et-al-2-95
Hide details for Basit, Mustafa, Ray, RazaBasit, Mustafa, Ray, Raza
2010Centerpoints and Tverberg's technique
In: Computational Geometry [43], 593-600
Basit2010
Hide details for BastBast
2009Car or Public Transport -- Two Worlds
In: Efficient Algorithms : Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday, 355-367
Bast2009
2006Intelligente Suche mit garantiert schnellen Antwortzeiten
In: MPG Jahrbuch [?],
Bast2006b
2005Attachment IconPräzisionssuche im homöopathischen Netz
In: Homöopathie-Zeitschrift [I/05], 119-122
bast05hz
2004Dimension Reduction: A Powerful Principle for Automatically Finding Concepts in Unstructured Data
In: International Workshop on Self-* Properties in Complex Information Systems (SELF-STAR 2004), 113-116
bast04selfstar
2002Scheduling at Twilight the Easy Way
In: STACS 2002 : 19th Annual Symposium on Theoretical Aspects of Computer Science, 166-178
Bast2002a
2000On Scheduling Parallel Tasks at Twilight
In: Theory of Computing Systems [33], 489-563
Bast2000b
2000Attachment IconProvably Optimal Scheduling of Similar Tasks
Universität des Saarlandes
BastPhD2000
1998Dynamic Scheduling with Incomplete Information
In: Proceedings of the 10th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-98), 182-191
Bast1998
1994Fast Parallel Space Allocation, Estimation and Integer Sorting
Universität des Saarlandes
Bast94
Hide details for Bast, Chitea, Suchanek, WeberBast, Chitea, Suchanek, Weber
2007ESTER: Efficient Search in Text, Entities, and Relations
In: 30th International Conference on Research and Development in Information Retrieval (SIGIR'07), 671-678
bastetal07sigir
Hide details for Bast, Dietzfelbinger, HagerupBast, Dietzfelbinger, Hagerup
1992A Perfect Parallel Dictionary
In: 17th International Symposium on Mathematical Foundations of Computer Science (MFCS'92), 133-141
BastDH92
Hide details for Bast, Dupret, Majumdar, PiwowarskiBast, Dupret, Majumdar, Piwowarski
2006Discovering a Term Taxonomy from Term Similarities Using Principal Component Analysis
In: Semantics, web and mining : Joint International Workshops, EWMF 2005 and KDO 2005, 103-120
BastDMP06
Hide details for Bast, Funke, MatijevicBast, Funke, Matijevic
2009Ultrafast shortest-path queries via transit nodes
In: The shortest path problem : ninth DIMACS implemenation challenge, 175-192
BastFunkeMatjevic2009
2006TRANSIT: Ultrafast Shortest-Path Queries with Linear-Time Preprocessing
In: 9th DIMACS Implementation Challenge --- Shortest Path,
BastFM06
Hide details for Bast, Funke, Matijevic, Sanders, SchultesBast, Funke, Matijevic, Sanders, Schultes
2007In Transit to Constant Time Shortest-Path Queries in Road Networks
In: 9th Workshop on Algorithm Enginneering and Experiments (ALENEX'07), 46-59
BastFMSS07
Hide details for Bast, Funke, Sanders, SchultesBast, Funke, Sanders, Schultes
2007Fast Routing in Road Networks using Transit Nodes
In: Science [316], 566
BFSS07
Hide details for Bast, HagerupBast, Hagerup
1995Fast Parallel Space Allocation, Estimation, and Integer Sorting
In: Information and Computation [123], 72-110
Bast-Hagerup95
1991Fast and Reliable Parallel Hashing
In: 3rd Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'91), 50-61
BastH91
Hide details for Bast, HertBast, Hert
2000The Area Partitioning Problem
In: Proceedings of the 12th Annual Canadian Conference on Computational Geometry (CCCG-00), 163-171
bh-app-00
Hide details for Bast, MajumdarBast, Majumdar
2005Attachment IconWhy Spectral Retrieval Works
In: 28th Annual International Conference on Research and Development in Information Retrieval (SIGIR'05), 11-18
bastmajumdar05sigir
Hide details for Bast, Majumdar, Schenkel, Theobald, WeikumBast, Majumdar, Schenkel, Theobald, Weikum
2006IO-Top-k at TREC 2006: Terabyte Track
In: The Fifteenth Text Retrieval Conference Proceedings, TREC 2006, 1-5
BastMSTW2006trec
2006Attachment IconIO-Top-k: Index-Access Optimized Top-k Query ProcessingTechReportGDF2006
2006Attachment IconIO-Top-k: Index-Access Optimized Top-k Query Processing
In: Proceedings of the 32nd International Conference on Very Large Data Bases, VLDB 2006, 475-486
BastMSTW2006a
Hide details for Bast, Majumdar, WeberBast, Majumdar, Weber
2007Efficient interactive query expansion with CompleteSearch
In: 16th Conference on Information and Knowledge Management (CIKM'07), 857-860
BastMW07
Hide details for Bast, Mehlhorn, Schäfer, TamakiBast, Mehlhorn, Schäfer, Tamaki
2006Attachment IconMatching Algorithms are Fast in Sparse Random Graphs
In: Theory of Computing Systems [39], 3-14
BMST05
2004Attachment IconMatching Algorithms Are Fast in Sparse Random Graphs
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 81-92
bast04stacs
2003Attachment IconA Heuristic for Dijkstra's Algorithm With Many Targets and its Use in Weighted Matching Algorithms
In: Algorithmica [36], 75-88
BMST03
Hide details for Bast, Mortensen, WeberBast, Mortensen, Weber
2006Attachment IconOutput-Sensitive Autocompletion Search
In: String Processing and Information Retrieval : 13th International Conference, SPIRE 2006, 150-162
bastetal06spire
Hide details for Bast, WeberBast, Weber
2007Managing Helpdesk Tasks with CompleteSearch: A Case Study
In: 4th Conference on Professional Knowledge Management (WM'07), 101-108
bastweber07gwem
2007Attachment IconThe CompleteSearch Engine: Interactive, Efficient, and Towards IR & DB integration
In: CIDR 2007 : 3rd Biennial Conference on Innovative Data Systems Research, 88-95
bastweber07cidr
2006Attachment IconType Less, Find More: Fast Autocompletion Search with a Succinct Index
In: SIGIR 2006: Proceedings of the 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 364-371
bastweber06sigir
2006When You're Lost For Words: Faceted Search With Autocompletion
In: SIGIR'06 Workshop on Faceted Search, 31-35
bastweber06faceted
2005Don't Compare Averages
In: 4th International Workshop on Efficient and Experimental Algorithms (WEA'05), 67-76
bastweber05wea
2005Insights from Viewing Ranked Retrieval as Rank Aggregation
In: Workshop on Challenges in Web Information Retrieval and Integration (WIRI'05), 243-248
bastweber05wiri
Hide details for Baswana, Biswas, Doerr, Friedrich, Kurur, NeumannBaswana, Biswas, Doerr, Friedrich, Kurur, Neumann
2009Computing Single Source Shortest Paths using Single-Objective Fitness Functions
In: FOGA'09 : revised selected papers from ACM SIGEVO
Foundations of Genetic Algorithms X, 59-66
BBDFKN09
Hide details for Baswana, Goyal, SenBaswana, Goyal, Sen
2005Attachment IconAll-pairs nearly 2-approximate shortest paths in $O(n^2 \mathrm polylog n)$ time
In: STACS 2005 : 22nd Annual Symposium on Theoretical Aspects of Computer Science, 666-679
BGS2005
Hide details for Baswana, Kavitha, Mehlhorn, PettieBaswana, Kavitha, Mehlhorn, Pettie
2011Additive Spanners and (α, β)-Spanners
In: ACM Transactions on Algorithms [7], 5:1-5:26
MehlhornTALG2011
Hide details for Baswana, SenBaswana, Sen
2007A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
In: Random Structures & Algorithms [30], 532-563
BaswanaSen2007
2004Attachment IconApproximate distance oracle for unweighted graphs in Expected O(n²) time
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 271-280
BS2004
2004Randomized graph data-structures for approximate shortest path problem
In: Handbook of Data Structures and Applications, 38.1-38.19
Baswana2004b
Hide details for Baswana, Telikepalli, Mehlhorn, PettieBaswana, Telikepalli, Mehlhorn, Pettie
2005Attachment IconNew Constructions of (alpha, beta)-Spanners and Purely Additive Spanners
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 672-681
BaswanaEtal2005
Hide details for Batra, SharmaBatra, Sharma
2010Bounds on absolute positiveness of multivariate polynomials
In: Journal of Symbolic Computation [45], 617-628
BatraSharma2010
Hide details for Baumann, KöhlerBaumann, Köhler
2004Approximating Earliest Arrival Flows with Flow-Dependent Transit Times
In: Mathematical foundations of computer science 2004 : 29th International Symposium, MFCS 2004, 599-610
Baumann2004
Hide details for Baumbach, Friedrich, Kötzing, Krohmer, Müller, PaulingBaumbach, Friedrich, Kötzing, Krohmer, Müller, Pauling
2012Efficient algorithms for extracting biological key pathways with global constraints
In: GECCO'12 : Proceedings of the Fourteenth International Conference on
Genetic and Evolutionary Computation, 169-176
BaumbachFKKMP2011
Hide details for Baumgarten, Jung, MehlhornBaumgarten, Jung, Mehlhorn
1994Attachment IconDynamic point location in general subdivisions
In: Journal of Algorithms [3], 342-380
Mehlhorn94f
1992Dynamic Point Location in General Subdivisions
In: Discrete algorithms (SODA-92) : 3rd annual ACM-SIAM symposium, 250-258
Mehlhorn92g
Hide details for BausBaus
2005Symbolic Constraints in Linear Integer Programming
Universität des Saarlandes
BausDipl05
2004Symbolic Constraints in Linear Integer Programming
Universität des Saarlandes
Baus/Diplom04
Hide details for Becchetti, Leonardi, Marchetti-Spaccamela, SchäferBecchetti, Leonardi, Marchetti-Spaccamela, Schäfer
2003Scheduling to minimize flow time metrics
In: International Parallel and Distributed Processing Symposium (IPDPS-03), 223b-CDROM
Becchetti2003
Hide details for Becchetti, Leonardi, Marchetti-Spaccamela, Schäfer, VredeveldBecchetti, Leonardi, Marchetti-Spaccamela, Schäfer, Vredeveld
2003Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm
In: 44th Annual Symposium on Foundations of Computer Science (FOCS-03), 462-471
Schäfer2003
Hide details for BeckerBecker
2012The Bolzano Method to Isolate the Roots of a Bitstream Polynomial
Universität des Saarlandes
BachBecker2012
1996Allgemeine approximative Kongruenz zweier Punktmengen im R³
Universität des Saarlandes
Becker96
Hide details for Becker, Degenhardt, Doenhardt, Hertel, Kaninke, Kerber, Mehlhorn, Näher, Rohnert, WinterBecker, Degenhardt, Doenhardt, Hertel, Kaninke, Kerber, Mehlhorn, Näher, Rohnert, Winter
1982Attachment IconA Probabilistic Algorithm for Vertex Connectivity of Graphs
In: Information Processing Letters [15], 135-136
mehlhorn82e
Hide details for Becker, MehlhornBecker, Mehlhorn
1986Attachment IconAlgorithms for Routing in Planar Graphs
In: Acta Informatica [23], 163-176
ACTAI::BeckerM1986
1984Attachment IconAlgorithms for routing in planar graphsmehlhorn84d
Hide details for BehleBehle
2007Attachment IconOn threshold BDDs and the optimal variable ordering problem
In: Combinatorial Optimization and Applications : First International Conference, COCOA 2007, 124-135
Behle2007
Hide details for Behle, Jünger, LiersBehle, Jünger, Liers
2007Attachment IconA Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem
In: Experimental Algorithms : 6th International Workshop, WEA 2007, 379-392
Behle2007A
Hide details for BehrensBehrens
2000Solid Modeling durch Boolesche Operationen
Universität des Saarlandes
Behrens2000
Hide details for BeiBei
2015Solving Linear Programming with Constraints Unknown
In: Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I., 129-142
Bei2015
Hide details for BeierBeier
2004Probabilistic Analysis of Discrete Optimization Problems
Universität des Saarlandes
BeierDiss04
2000Eine Heuristik für das Gossiping-Problem
Universität des Saarlandes
Beier2000
Hide details for Beier, Czumaj, Krysta, VöckingBeier, Czumaj, Krysta, Vöcking
2006Attachment IconComputing Equilibria for a Service Provider Game with (Im)perfect Information
In: ACM Transactions on Algorithms [2], 679-706
Beier2006c
Hide details for Beier, Funke, Matijevic, SandersBeier, Funke, Matijevic, Sanders
2011Energy-Efficient Paths in Radio Networks
In: Algorithmica [61], 298-319
Beier2011
Hide details for Beier, Krysta, Czumaj, VöckingBeier, Krysta, Czumaj, Vöcking
2004Computing Equilibria for Congestion Games with (Im)perfect Information
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 739-748
Beier2004b
Hide details for Beier, Röglin, VöckingBeier, Röglin, Vöcking
2007Attachment IconThe Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
In: Integer Programming and Combinatorial Optimization : 12th International IPCO Conference, 53-67
Beier2007
Hide details for Beier, Sanders, SivadasanBeier, Sanders, Sivadasan
2002Energy Optimal Routing in Radio Networks Using Geometric Data Structures
In: Automata, Languages and Programming : 29th International Colloquium, ICALP 2002, 366-376
Sanders2002h
Hide details for Beier, SibeynBeier, Sibeyn
2000A powerful heuristic for telephone gossiping
In: Proceedings of the 7th International Colloquium on Structural Information and Communication Complexity (SIROCCO-00), 17-36
BeierSibeyn00
Hide details for Beier, VöckingBeier, Vöcking
2006Attachment IconAn Experimental Study of Random Knapsack Problems
In: Algorithmica [45], 121-136
Beier2006b
2006Attachment IconTypical Properties of Winners and Losers in Discrete Optimization
In: SIAM Journal on Computing [35], 855-881
Beier2006
2004Probabilistic Analysis of Knapsack Core Algorithms
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 461-470
Beier2004a
2004Random knapsack in expected polynomial time
In: Journal of Computer and System Sciences [69], 306-329
Beier2004e
2004Typical Properties of Winners and Losers in Discrete Optimization
In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC-04), 343-352
Beier2004c
2003Random Knapsack in Expected Polynomial Time
In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC-03), 232-241
Beier2003
Hide details for Bein, Fleischer, LarmoreBein, Fleischer, Larmore
2000Limited bookmark randomized online algorithms for the paging problem
In: Information Processing Letters [76], 155-162
BeinFleischerLarmore2000
Hide details for Beldiceanu, Carlsson, ThielBeldiceanu, Carlsson, Thiel
2003Sweep Synchronization as a Global Propagation Mechanism
In: Fifth International Workshop on Integration of AI and OR Techniques
in Constraint Programming for Combinatorial Optimization Problems, 139-152
BCT03:SweepSynchro
2002Cost-Filtering Algorithms for the two Sides of the Sum of Weights of Distinct Values ConstraintBCT2002:SumOfWeights
Hide details for Beldiceanu, Guo, ThielBeldiceanu, Guo, Thiel
2001Non-overlapping Constraints between Convex Polytopes
In: Proceedings of the 7th International Symposium on Principles and Practice of Constraint Programming (CP-01), 392-407
BGT01:non-overlap
Hide details for Beldiceanu, Katriel, ThielBeldiceanu, Katriel, Thiel
2007Filtering Algorithms for the Same and UsedBy Constraints
In: Archives of Control Sciences [to appear], to appear
Same2005
2005GCC-like Restrictions on the Same constraint
In: Constraint Satisfaction and Constraint Logic Programming : ERCIM/CoLogNet International Workshop, CSCLP 2004, 1-11
In: Recent Advances in Constraints [3419], 1-11
KatrielSWC2004
2004Attachment IconFiltering algorithms for the Same and UsedBy constraintsBeldiceanuKatrielThiel2004
2004Filtering algorithms for the Same constraint
In: Integration of AI and OR techniques in constraint programming for combinatorial optimization problems : First International Conference, CPAIOR 2004, 65-79
SameCPAIOR2004
Hide details for Belfrage, Mütze, SpöhelBelfrage, Mütze, Spöhel
2012Probabilistic one-player Ramsey games via deterministic two-player games
In: SIAM Journal on Discrete Mathematics [26], 1031-1049
SpoehelBM2012
Hide details for Ben-Asher, Schuster, SibeynBen-Asher, Schuster, Sibeyn
1995Load balancing: A programmer's approach or the impact of task-length parameter on the load balancing performance of parallel programs
In: International Journal on High-Speed Computing [7], 303-326
Ben-Asher-Schuster-Sibeyn95
Hide details for Ben-Zwi, Hermelin, Lokshtanov, NewmanBen-Zwi, Hermelin, Lokshtanov, Newman
2011Treewidth governs the complexity of target set selection
In: Discrete Optimization [8], 87-96
BenZwiHermelinLokshtanovNewman2011
Hide details for BerberichBerberich
2008Robust and Efficient Software for Problems in 2.5-Dimensional Non-Linear Geometry - Algorithms and Implementations
Universität des Saarlandes
Berberich2008
2004Exact Arrangements of Quadric Intersection Curves
Universität des Saarlandes
Dipl04/Berberich
Hide details for Berberich, Caroli, WolpertBerberich, Caroli, Wolpert
2007Exact Computation of Arrangements of Rotated Conicsacs:bcw-carc-07
2007Attachment IconExact Computation of Arrangements of Rotated Conics
In: Proceedings of 23rd European Workshop on Computational Geometry, 231-234
BCW-ECARC2007
Hide details for Berberich, Ebert, Fogel, KettnerBerberich, Ebert, Fogel, Kettner
2006Web-site with benchmark instances for planar curve arrangementsacs:bek-wbipca-06
Hide details for Berberich, Ebert, KettnerBerberich, Ebert, Kettner
2006Definition of file format for benchmark instances for arrangements of Quadricsacs:bek-dffbiaq-06
Hide details for Berberich, Eigenwillig, Emiris, Fogel, Hemmer, Halperin, Kakargias, Kettner, Mehlhorn, Pion, Schömer, TeillaudBerberich, Eigenwillig, Emiris, Fogel, Hemmer, Halperin, Kakargias, Kettner, Mehlhorn, Pion, Schömer, Teillaud, Wein, Wolpert
2004Attachment IconAn Empirical Comparison of Software for Constructing Arrangements of Curved Arcsbeef-ecscaca-04
Hide details for Berberich, Eigenwillig, Fogel, Halperin, Hert, Kettner, Teillaud, WeinBerberich, Eigenwillig, Fogel, Halperin, Hert, Kettner, Teillaud, Wein
2003Specification of the traits classes for CGAL arrangements of curvesecg:fhw-stcca-03
Hide details for Berberich, Eigenwillig, Hemmer, Hert, Kettner, Mehlhorn, Reichel, Schmitt, Schömer, Weber, WolpertBerberich, Eigenwillig, Hemmer, Hert, Kettner, Mehlhorn, Reichel, Schmitt, Schömer, Weber, Wolpert
2004EXACUS: Efficient and Exact Algorithms for Curves and Surfacesecg:beh-eeeac-04
Hide details for Berberich, Eigenwillig, Hemmer, Hert, Kettner, Mehlhorn, Reichel, Schmitt, Schömer, WolpertBerberich, Eigenwillig, Hemmer, Hert, Kettner, Mehlhorn, Reichel, Schmitt, Schömer, Wolpert
2005Attachment IconEXACUS: Efficient and exact algorithms for curves and surfaces
In: 13th Annual European Symposium on Algorithms (ESA 2005), 155-166
Berberich05
Hide details for Berberich, Eigenwillig, Hemmer, Hert, Mehlhorn, SchömerBerberich, Eigenwillig, Hemmer, Hert, Mehlhorn, Schömer
2002Attachment IconA Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 174-186
behhms-cbcabocp-2002
Hide details for Berberich, EmeliyanenkoBerberich, Emeliyanenko
2008CGAL's Curved Kernel via Analysisacs:tr123203-04-08
Hide details for Berberich, Emeliyanenko, Kobel, SagraloffBerberich, Emeliyanenko, Kobel, Sagraloff
2013Exact symbolic–numeric computation of planar algebraic curves
In: Theoretical Computer Science [491], 1-32
Berberich20131
2012Exact Symbolic-Numeric Computation of Planar Algebraic Curves
In: arXiv [abs/1201.1548v1], 1-46
BEKS:GEOTOP:2011
2011Arrangement Computation for Planar Algebraic Curves
In: arXiv [abs/1103.4697],
beks:snc:2011a
2011Arrangement Computation for Planar Algebraic Curves
In: Proceedings of the 4th Internal Workshop on Symbolic-Numeric Computation, 88-98
beks:snc:2011
Hide details for Berberich, Emeliyanenko, SagraloffBerberich, Emeliyanenko, Sagraloff
2011An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks
In: 2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX), 35-47
bes-bisolve-2011
2010An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks
In: CoRR [abs/1010.1386], 1-16
bes-bisolve-arxiv-2010
Hide details for Berberich, Fogel, Halperin, Kerber, SetterBerberich, Fogel, Halperin, Kerber, Setter
2010Arrangements on Parametric Surfaces II: Concretizations and Applications
In: Mathematics in Computer Science [4], 67-91
bfhks-aos2-2010
Hide details for Berberich, Fogel, Halperin, Mehlhorn, WeinBerberich, Fogel, Halperin, Mehlhorn, Wein
2010Arrangements on Parametric Surfaces I: General Framework and Infrastructure
In: Mathematics in Computer Science [4], 45-66
bfhmw-aos1-2010
2007Sweeping and Maintaining Two-Dimensional Arrangements on Quadricsacs:bfhmw-smtaoq-07
2007Attachment IconSweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step
In: Algorithms - ESA 2007, 15th Annual European Symposium, 645-656
bfhmw-samtdaosafs-07
Hide details for Berberich, Fogel, Halperin, WeinBerberich, Fogel, Halperin, Wein
2007Attachment IconSweeping and Maintaining Two-Dimensional Arrangements on Surfaces
In: Proceedings of 23rd European Workshop on Computational Geometry, 223-226
BFHW-SMTDAS2007
Hide details for Berberich, Fogel, MeyerBerberich, Fogel, Meyer
2007Updated Website to include Benchmark Instances for Arrangements of Quadrics and Planar Algebraic Curvesacs:bfm-uwibaqpac-07
Hide details for Berberich, Hagen, Hiller, MoserBerberich, Hagen, Hiller, Moser
2010Experiments
In: Algorithm Engineering : Bridging the Gap between Algorithm Theory and Practice, 325-388
bhhm-giae-exp-2010
Hide details for Berberich, Halperin, Kerber, PogalnikovaBerberich, Halperin, Kerber, Pogalnikova
2012Deconstructing Approximate Offsets
In: Discrete & Computational Geometry [48], 964-989
bhkp-deconstruct-journal-2012
2011Deconstructing Approximate Offsets
In: arXiv [abs/1109.2158],
bhkp-minkowksideconstructiondcg-2011a
2011Deconstructing Approximate Offsets
In: Proceedings of the 27th Annual Symposium on Computational Geometry (SCG'11), 187-196
bhkp-minkowksideconstruction-2011
2010Polygonal Reconstruction from Approximate Offsets
In: 26th European Workshop on Computational Geometry : Workshop Proceedings, 65-68
bhkp-reconstruction-eurocg-2010
Hide details for Berberich, HemmerBerberich, Hemmer
2007Definition of the 3D Quadrical Kernel Contentacs:bh-dtqkc-07
2006Prototype implementation of the algebraic kernelACS-TR-121202-01
Hide details for Berberich, Hemmer, Karavelas, Pion, Teillaud, TsigaridasBerberich, Hemmer, Karavelas, Pion, Teillaud, Tsigaridas
2008Prototype implementation of the algebraic kernelACS-TR-121202-01
2006Interface specification of algebraic kernelACS-TR-123101-01
Hide details for Berberich, Hemmer, Karavelas, TeillaudBerberich, Hemmer, Karavelas, Teillaud
2007Revision of interface specification of algebraic kernelacs:bhkt-risak-06
Hide details for Berberich, Hemmer, KerberBerberich, Hemmer, Kerber
2011A Generic Algebraic Kernel for Non-linear Geometric Applications
In: Proceedings of the 27th Annual Symposium on Computational Geometry (SCG'11), 179-186
bhk-ak2-2011
2010A Generic Algebraic Kernel for Non-linear Geometric Applicationsbhk-ak2-inria-2010
Hide details for Berberich, Hemmer, Kettner, Schömer, WolpertBerberich, Hemmer, Kettner, Schömer, Wolpert
2005An Exact, Complete and Efficient Implementation for Computing Planar Maps of Quadric Intersection Curves
In: 21st Annual Symposium on Computational Geometry (SCG'05), 99-106
bhksw-eceicpmqic-05
Hide details for Berberich, KerberBerberich, Kerber
2008Attachment IconArrangements on Surfaces of Genus One: Tori and Dupin Cyclides
In: 24th European Workshop on Computational Geometry - Collection of Abstracts, 209-212
bk-aosogo-08
2008Attachment IconExact Arrangements on Tori and Dupin Cyclides
In: Proceedings of the 2008 ACM Symposium on Solid and Physical Modeling, 59-66
bk-eatdc-08
Hide details for Berberich, Kerber, SagraloffBerberich, Kerber, Sagraloff
2010An efficient algorithm for the stratification and triangulation of an algebraic surface
In: Computational Geometry: Theory and Applications (CGTA) [43], 257-278
bks-cgta-2009
2008Attachment IconExact Geometric-Topological Analysis of Algebraic Surfaces
In: Proceedings of the 24th ACM Symposium on Computational Geometry, 164-173
bks-egtaas-08
2008Attachment IconGeometric Analysis of Algebraic Surfaces Based on Planar Arrangements
In: 24th European Workshop on Computational Geometry - Collection of Abstracts, 29-32
bks-gaoasbopa-08
Hide details for Berberich, KettnerBerberich, Kettner
2007Linear-Time Reordering in a Sweep-line Algorithm for Algebraic Curves Intersecting in a Common Pointbk-reorder-07
Hide details for Berberich, MeyerovitchBerberich, Meyerovitch
2007Computing Envelopes of Quadricsacs:bm-ceq-07
2007Attachment IconComputing Envelopes of Quadrics
In: Proceedings of 23rd European Workshop on Computational Geometry, 235-238
BM-CEQ2007
Hide details for Berberich, SagraloffBerberich, Sagraloff
2009A Generic and Flexible Framework for the Geometrical and Topological Analysis of (Algebraic) Surfaces
In: Computer Aided Geometric Design (CAGD) [26], 627-647
bs-agffgtaas-cagd-09
2008Attachment IconA Generic and Flexible Framework for the Geometrical and Topological Analysis of (Algebraic) Surfaces
In: Proceedings of the 2008 ACM Symposium on Solid and Physical Modeling, 171-182
bs-agffgtaas-08
Hide details for Berenbrink, Cooper, Friedetzky, Friedrich, SauerwaldBerenbrink, Cooper, Friedetzky, Friedrich, Sauerwald
2011Randomized Diffusion for Indivisible Loads
In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 429-439
Berenbrink2011b
Hide details for Berenbrink, Friedetzky, Elsaesser, Nagel, SauerwaldBerenbrink, Friedetzky, Elsaesser, Nagel, Sauerwald
2011Faster Coupon Collecting via Replication with Applications in Gossiping
In: 36th International Symposium on Mathematical Foundations of Computer Science (MFCS-11), 72-83
BerenbrinkEFNS11
Hide details for Berenbrink, Hoefer, SauerwaldBerenbrink, Hoefer, Sauerwald
2011Distributed Selfish Load Balancing on Networks
In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 1487-1497
Berenbrink2011
Hide details for Berghammer, Friedrich, NeumannBerghammer, Friedrich, Neumann
2010Set-based Multi-Objective Optimization, Indicators, and Deteriorative Cycles
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 495-502
BFN2010
Hide details for Berg, Kreveld, SchirraBerg, Kreveld, Schirra
1995A new approach to subdivision simplification
In: ACSM/ASPRS Annual Convention & Exposition Technical Papers, 79-88
deBerg-vanKreveld-Schirra95
Hide details for Berman, KrystaBerman, Krysta
2003Optimizing Misdirection
In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 192-201
Berman2003+
Hide details for Berthomé, Duboux, Hagerup, Newman, SchusterBerthomé, Duboux, Hagerup, Newman, Schuster
1995Self-Simulation for the Passive Optical Star Model
In: Algorithms-ESA'95: 3rd Annual European Symposium, 268-380
Hagerup-et-al95
Hide details for Bhaskar, Fleischer, Hoy, HuangBhaskar, Fleischer, Hoy, Huang
2009Attachment IconEquilibria of Atomic Flow Games are not Unique
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 748-757
Huang2008
Hide details for Biedl, Kaufmann, MutzelBiedl, Kaufmann, Mutzel
1998Drawing Planar Partitions II: HH-Drawings
In: Proceedings of the 24th Workshop on Graph-Theoretic Concepts in Computer Science (WG-98), 124-136
BiedlKaufmannMutzel1998
Hide details for Bifet, Castillo, Chirita, WeberBifet, Castillo, Chirita, Weber
2005An Analysis of Factors Used in Search Engine Ranking
In: 1st International Workshop on Adversarial Information Retrieval on the Web (AIRWeb'05), 1-10
weberetal05airweb
Hide details for Bilardi, Chaudhuri, Dubhashi, MehlhornBilardi, Chaudhuri, Dubhashi, Mehlhorn
1994Attachment IconA lower bound for area-universal graphs
In: Information Processing Letters [51], 101-105
Mehlhorn94e
Hide details for BirkBirk
1997Lösung von Varianten des Post-Office-Problems mit Hilfe von Skip List Range Trees
Universität des Saarlandes
Birk97
Hide details for BlanchebarbeBlanchebarbe
1996Untersuchung zur Implementierung eines parallelen Algorithmus mit guter asymptotischer Laufzeit auf einem Rechner mit verteiltem Speicher und Message-Passing
Universität des Saarlandes
Blanchebarbe96
Hide details for Blelloch, FarzanBlelloch, Farzan
2010Succinct Representations of Separable Graphs
In: Combinatorial Pattern Matching : 21st Annual Symposium, CPM 2010, 138-150
Farzan2010a
Hide details for Blum, MehlhornBlum, Mehlhorn
1980Attachment IconOn the Average Number of Rebalancing Operations in Weight-Balanced Trees
In: Theoretical Computer Science [11], 303-320
mehlhorn80c
1979Attachment IconMittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten Bäumen
In: Theoretical Computer Science, 4th GI-Conference, 67-78
mehlhorn79g
1978On the Average Number of Rebalancing Operations in Weight-Balanced Treesmehlhorn78t
Hide details for Bodirsky, Gröpl, Johannsen, KangBodirsky, Gröpl, Johannsen, Kang
2007Attachment IconA Direct Decomposition of 3-connected Planar Graphs
In: Séminaire Lotharingien de Combinatoire [B54Ak], 15
BodirskyGroeplJohannsenKang2007a
Hide details for Bodirsky, KutzBodirsky, Kutz
2007Determining the consistency of partial tree descriptions
In: Artificial Intelligence [171], 185-196
BodirskyKutz2007
Hide details for Bodlaender, Deogun, Jansen, Kloks, Kratsch, Müller, TuzaBodlaender, Deogun, Jansen, Kloks, Kratsch, Müller, Tuza
1998Ranking of Graphs
In: SIAM Journal on Discrete Mathematics [11], 168-181
BodlaenderDeogunJansenKloksKratschMüllerTuza98
Hide details for Bodlaender, Feremans, Grigoriev, Penninkx, Sitters, WolleBodlaender, Feremans, Grigoriev, Penninkx, Sitters, Wolle
2006On the minimum corridor connection and other generalized geometric problems
In: 4th Workshop on Approximation and Online Algorithms, WAOA, 69-82
Sitters2006
Hide details for Bodlaender, HagerupBodlaender, Hagerup
1998Parallel Algorithms with Optimal Speedup for Bounded Treewidth
In: SIAM Journal on Computing [27], 1725-1746
BodlaenderHagerup98
1995Parallel Algorithms with Optimal Speedup for Bounded Treewidth
In: Automata, Languages, and Programming: 22nd International Colloquium (ICALP95), 268-279
Bodlaender-Hagerup95
Hide details for Böcker, Hüffner, Truss, WahlströmBöcker, Hüffner, Truss, Wahlström
2009A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams
In: Parameterized and Exact Computation : 4th International Workshop, IWPEC 2009, 38-49
BHTWahlstroem2009
Hide details for Böttcher, Doerr, NeumannBöttcher, Doerr, Neumann
2010Optimal fixed and adaptive mutation rates for the LeadingOnes problem
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 1-10
BDN2010
Hide details for Bogdan, Sauerwald, Stauffer, SunBogdan, Sauerwald, Stauffer, Sun
2013Balls into Bins via Local Search
In: 24th ACM-SIAM Symposium on Discrete Algorithms (SODA-13), 16-34
BogdanSSS2012
Hide details for Boghossian, Kohlbacher, LenhofBoghossian, Kohlbacher, Lenhof
1999BALL: Biochemical Algorithms Library
In: Algorithm engineering (WAE-99) : 3rd International Workshop, WAE'99, 330-344
BoghossianKohlbacherLenhof1999
Hide details for Bonifaci, Chan, Marchetti-Spaccamela, MegowBonifaci, Chan, Marchetti-Spaccamela, Megow
2012Algorithms and Complexity for Periodic Real-Time Scheduling
In: ACM Transactions on Algorithms [9], 601-619
BonifaciCMM2012
2010Attachment IconAlgorithms and Complexity for Periodic Real-Time Scheduling
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1350-1359
Bonifaci:2010:b
Hide details for Bonifaci, Harks, SchäferBonifaci, Harks, Schäfer
2010Attachment IconStackelberg Routing in Arbitrary Networks
In: Mathematics of Operations Research [35], 330 - 346
Bonifaci:2009:a
Hide details for Bonifaci, Korteweg, Marchetti-Spaccamela, StougieBonifaci, Korteweg, Marchetti-Spaccamela, Stougie
2011Attachment IconMinimizing Flow Time in the Wireless Gathering Problem
In: ACM Transactions on Algorithms [7], 33:1-33:20
Bonifaci:2011:b
2011Attachment IconThe Distributed Wireless Gathering Problem
In: Theoretical Computer Science [412], 633-641
Bonifaci:2011:a
Hide details for Bonifaci, Marchetti-SpaccamelaBonifaci, Marchetti-Spaccamela
2012Attachment IconFeasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems
In: Algorithmica [63], 763-780
Bonifaci2011:b
2010Attachment IconFeasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. II, 230-241
Bonifaci:2010:d
Hide details for Bonifaci, Marchetti-Spaccamela, Megow, WieseBonifaci, Marchetti-Spaccamela, Megow, Wiese
2013Polynomial-Time Exact Schedulability Tests for Harmonic Real-Time Tasks
In: Proceedings of the 34th IEEE Real-Time Systems Symposium (RTSS 2013),
Bonifaci2013b
Hide details for Bonifaci, Marchetti-Spaccamela, StillerBonifaci, Marchetti-Spaccamela, Stiller
2012Attachment IconA Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
In: Algorithmica [62], 1034-1049
Bonifaci2012b
Hide details for Bonifaci, Marchetti-Spaccamela, Stiller, WieseBonifaci, Marchetti-Spaccamela, Stiller, Wiese
2013Feasibility Analysis in the Sporadic DAG Task Model
In: Proceedings of the 25th Euromicro Conference on Real-Time Systems (ECRTS 2013),
Bonifaci2013
Hide details for Bonifaci, Mehlhorn, VarmaBonifaci, Mehlhorn, Varma
2012Physarum Can Compute Shortest Paths
In: Journal of Theoretical Biology [309], 121-133
Bonifaci2012c
2012Physarum Can Compute Shortest Paths
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 233-240
Bonifaci2012a
Hide details for Boros, Borys, Elbassioni, Gurvich, Makino, RudolfBoros, Borys, Elbassioni, Gurvich, Makino, Rudolf
2007Generating Minimal k-Vertex Connected Spanning Subgraphs
In: Computing and Combinatorics, 13th Annual International Conference, COCOON 2007, Proceedings, 222-231
Elbassioni2007e
Hide details for Boros, Elbassioni, Fouz, Gurvich, Makino, MantheyBoros, Elbassioni, Fouz, Gurvich, Makino, Manthey
2011Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 147-158
Elbassioni2011e
Hide details for Boros, Elbassioni, GurvichBoros, Elbassioni, Gurvich
2004Attachment IconAlgorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems
In: Algorithms – ESA 2004: 12th Annual European Symposium, 122-133
Elbassioni2004g
Hide details for Boros, Elbassioni, Gurvich, KhachiyanBoros, Elbassioni, Gurvich, Khachiyan
2004Attachment IconAn Efficient Implementation of a Joint Generation Algorithm
In: Experimental and efficient algorithms : Third International Workshop, WEA 2004, 114-128
Elbassioni2004a
2004Attachment IconEnumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems
In: Integer programming and combinatorial optimization : 10th International IPCO Conference, 152-162
Elbassioni2004e
2004Attachment IconGenerating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections
In: LATIN 2004: Theoretical Informatics, 6th Latin American Symposium, 488-498
Elbassioni2004d
2003Attachment IconAlgorithms for Enumerating Circuits in Matroids.
In: Algorithms and Computation, 14th International Symposium, ISAAC 2003, 485-494
Elbassioni2003c
Hide details for Boros, Elbassioni, Gurvich, Khachiyan, MakinoBoros, Elbassioni, Gurvich, Khachiyan, Makino
2004Attachment IconGenerating Paths and Cuts in Multi-pole (Di)graphs
In: Mathematical foundations of computer science 2004 : 29th International Symposium, MFCS 2004, 298-309
Elbassioni2004b
2003Attachment IconAn Intersection Inequality for Discrete Distributions and Related Generation Problems
In: Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, 543-555
Elbassioni2003d
Hide details for Boros, Elbassioni, Gurvich, MakinoBoros, Elbassioni, Gurvich, Makino
2012Every Stochastic Game with Perfect Information Admits a Canonical Form
In: 2nd International ICST Conference on Game Theory for Networks (GameNets 2011),
Elbassioni2011h
2012On Nash equilibria and improvement cycles in pure positional strategies for Chess-like and Backgammon-like n-person games
In: Discrete Mathematics [312], 772-788
Elbassioni2011n
2011A lower bound for discounting algorithms solving two-person zero-sum limit average payoff stochastic gamesElbassioni2011d
2010A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information
In: Integer Programming and Combinatorial Optimization : 14th International Conference, IPCO 2010, 341-354
Elbassioni2009d
2010On effectivity functions of game forms
In: Games and Economic Behavior [68], 512-531
BorosElbassioniGurvich2010
2010On Nash Equilibria and Improvement Cycles in Pure Positional Strategies for Chess-like and Backgammon-like $n$-person GamesElbassioni2010h
2007Generating Vertices of Polyhedra and Related Monotone Generation ProblemsElbassioni2007c
Hide details for Boros, Elbassioni, Gurvich, Makino, OudalovBoros, Elbassioni, Gurvich, Makino, Oudalov
2008A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2x2 subgames
In: Computer Science - Theory and Applications, Third International Computer Science Symposium in Russia, CSR 2008, 99-109
Elbassioni2008d
Hide details for Boros, Elbassioni, Gurvich, TiwaryBoros, Elbassioni, Gurvich, Tiwary
2011The negative cycles polyhedron and hardness of checking some polyhedral properties
In: Annals of Operations Research [188], 63-76
Elbassioni2011k
2008Characterization of the vertices and extreme directions of the negative cycle polyhedron and hardness of generating vertices of 0/1-polyhedra
In: CoRR [abs/0801.3790], x-x
Elbassioni2008
Hide details for Boros, Elbassioni, Khachiyan, GurvichBoros, Elbassioni, Khachiyan, Gurvich
2003Attachment IconAn Efficient Implementation of a Quasi-polynomial Algorithm for Generating Hypergraph Transversals
In: Algorithms - ESA 2003, 11th Annual European Symposium, 556-567
Elbassioni2003e
2003Attachment IconAn Inequality for Polymatroid Functions and its Applications
In: Discrete Applied mathematics [131], 27
Elbassioni2003a
2003Attachment IconExtending the Balas-Yu Bounds on the Number of Maximal Independent Sets in Graphs to Hypergraphs and Lattices
In: Mathematical Programming, Ser. B [98], 14
Elbassioni2003b
2002Attachment IconGenerating Dual-Bounded Hypergraphs
In: Optimization Methods and Software [17], 33
Elbassioni2002bz
[Replication or Save Conflict]
2002Attachment IconMatroid Intersections, Polymatroid Inequalities, and Related Problems
In: Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, 143-154
Elbassioni2002b
2000Attachment IconAn Efficient Incremental Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension
In: Parallel Processing Letters [10], 14
Elbassioni2000
Hide details for Boros, Elbassioni, Khachiyan, Gurvich, MakinoBoros, Elbassioni, Khachiyan, Gurvich, Makino
2002Attachment IconDual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities
In: SIAM Journal on Computing [31], 20
Elbassioni2002a
2001Attachment IconOn Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities
In: Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, 92-103
Elbassioni2001
Hide details for Boros, Elbassioni, MakinoBoros, Elbassioni, Makino
2010Left-to-right multiplication for monotone Boolean dualization
In: SIAM Journal on Computing [39], 3424-3439
BorosElabassioniMakino2010
2008On Berge Multiplication for Monotone Boolean Dualization
In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, 48-59
Elbassioni2008c
Hide details for BoullayBoullay
1996Eine parallelisierbare Heuristik für das Min-Cost-Flow Problem
Universität des Saarlandes
Boullay96
Hide details for Bouziane, El KahouiBouziane, El Kahoui
2002Attachment IconComputation of the dual of a plane projective curve
In: Journal of Symbolic Computation [34], 105-117
ElKahoui2002a
Hide details for Bradford, CapoyleasBradford, Capoyleas
1997Weak epsilon-Nets for Points on a Hypersphere
In: Discrete & Computational Geometry [18], 83-91
Bradford-Capoyleas97
Hide details for Bradford, Choppela, RawlinsBradford, Choppela, Rawlins
1995Lower Bounds for the Matrix Chain Ordering Problem
In: LATIN'95: Theoretical Informatics, 2nd Latin American Symposium, 112-130
Bradford-et-al95
Hide details for Bradford, FleischerBradford, Fleischer
1995Matching nuts and bolts faster
In: Algorithms and Computation: 6th International Symposium (ISAAC'95), 402-408
Bradford-Fleischer95
Hide details for Bradford, Fleischer, SmidBradford, Fleischer, Smid
1997More efficient parallel totally monotone matrix searching
In: Journal of Algorithms [23], 386-400
BrFlSm97
Hide details for Bradford, Golin, LarmoreBradford, Golin, Larmore
2002Optimal prefix-free codes for unequal letter costs: Dynamic programming with the Monge property
In: Journal of Algorithms [42], 277-303
BradfordGolinLarmore2002
Hide details for Bradford, Golin, Larmore, RytterBradford, Golin, Larmore, Rytter
1998Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 43-54
BradfordGolinLarmoreRytter1998
Hide details for Bradford, Rawlins, ShannonBradford, Rawlins, Shannon
1998Efficient Matrix Chain Ordering in Polylog Time
In: SIAM Journal on Computing [27], 466-490
Bradford-et-al.98
Hide details for Bradford, ReinertBradford, Reinert
1996Lower Bounds for Row Minima Searching
In: Automata Languages and Programming: 23rd International Colloquium (ICALP'96), 454-465
Bradford-Reinert-96
Hide details for Bradonjić, Elsässer, Friedrich, Sauerwald, StaufferBradonjić, Elsässer, Friedrich, Sauerwald, Stauffer
2010Efficient Broadcast on Random Geometric Graphs
In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1412-1421
FriedrichRGG2010
Hide details for BramerBramer
2003Zwei Algorithmen zur Bestimmung kostenminimaler Flüsse in Netzwerken
Universität des Saarlandes
BramerDipl03
Hide details for Brandenburg, Jünger, MutzelBrandenburg, Jünger, Mutzel
1997Algorithmen zum automatischen Zeichnen von Graphen
In: Informatik Spektrum [20], 199-207
BJM97
Hide details for Brandenburg, Jünger, Mutzel, LengauerBrandenburg, Jünger, Mutzel, Lengauer
1997SPP 731 : Algorithmen zum automatischen Zeichnen von Graphen im Rahmen des DFG-Schwerpunkts "Effiziente Algorithmen für diskrete Probleme und ihre Anwendungen"
In: Informatik '97 : Informatik als Innovationsmotor : 27. Jahrestagung der Gesellschaft für Informatik, 58-67
BrandenburgJuengerMutzelLengauer97
Hide details for Brandenburg, Schreiber, Jünger, Marks, MutzelBrandenburg, Schreiber, Jünger, Marks, Mutzel
1999Graph Drawing Contest Report
In: Proceedings of the 7th International Symposium on Graph Drawing (GD-99), 400-409
GDCompRep1999
Hide details for BraunBraun
2000Entwicklung und Test von für statische Graphen optimierte Datentypen
Universität des Saarlandes
Braun2000
Hide details for Bredereck, Nichterlein, Niedermeier, PhilipBredereck, Nichterlein, Niedermeier, Philip
2011Attachment IconPattern-Guided Data Anonymization and Clustering
In: Mathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011. Proceedings, 182-193
brederecknichterleinniedermeierphilip2011a
2011Attachment IconThe Effect of Homogeneity on the Complexity of $k$-Anonymity
In: Fundamentals of Computation Theory - 18th International Symposium, FCT 2011, Oslo, Norway, August 22-25, 2011. Proceedings, 53-64
BredereckNichterleinNiedermeierPhilip2011b
Hide details for BremerBremer
1995Analyse und Simulation eines Maximum-Flow Algorithmus für das Gitter
Universität des Saarlandes
Bremer95
Hide details for BrengelBrengel
2000Externe Prioritätswarteschlangen
Universität des Saarlandes
Brengel2000
Hide details for Brengel, Crauser, Meyer, FerraginaBrengel, Crauser, Meyer, Ferragina
1999An Experimental Study of Priority Queues in External Memory
In: Algorithm engineering (WAE-99) : 3rd International Workshop, WAE'99, 345-359
BCMP1999
Hide details for Breslauer, Jiang, JiangBreslauer, Jiang, Jiang
1997Rotations of periodic strings and short superstrings
In: Journal of Algorithms [24], 340-353
BrelauerJiangJiang97
Hide details for Breslauer, RameshBreslauer, Ramesh
1996Optimal Parallel Construction of Minimal Suffix and Factor Automata
In: Parallel Processing Letters [6], 35-44
BreslauerRamesh96
Hide details for Brightwell, Panagiotou, StegerBrightwell, Panagiotou, Steger
2012Extremal subgraphs of random graphs
In: Random Structures & Algorithms [41], 147-178
Brightwell2012
Hide details for BringmannBringmann
2013Bringing Order to Special Cases of Klee’s Measure Problem
In: 38th International Symposium on Mathematical Foundations of Computer Science (MFCS-13), 207-218
Bringmann13
2012Attachment IconAn improved algorithm for Klee's measure problem on fat boxes
In: Computational Geometry: Theory and Applications [45], 225-233
BringmannCGTA12
Hide details for Bringmann, Doerr, Neumann, SliacanBringmann, Doerr, Neumann, Sliacan
2013Online Checkpointing with Improved Worst-Case Guarantees
In: Automata, Languages, and Programming - 40th International Colloquium (ICALP 2013), 255-266
BringmannDoerrNeumannSliacan2013
Hide details for Bringmann, Engels, Manthey, Raghavendra RaoBringmann, Engels, Manthey, Raghavendra Rao
2013Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems
In: 38th International Symposium on Mathematical Foundations of Computer Science (MFCS-13), 219-230
BringmannEMR13
Hide details for Bringmann, FriedrichBringmann, Friedrich
2013Approximation Quality of the Hypervolume Indicator
In: Artificial Intelligence [195], 265–290
BringmannFjournal13
2013Exact and Efficient Generation of Geometric Random Variates and Random Graphs
In: Automata, Languages, and Programming - 40th International Colloquium (ICALP-13), 267-278
BringmannF13-2
2013Parameterized Average-Case Complexity of the Hypervolume Indicator
In: 15th Annual Conference on Genetic and Evolutionary Computation (GECCO-13), 575-582
BringmannF13
2012Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
In: Theoretical Computer Science [425], 104-116
Bringmann2012d
2012Attachment IconConvergence of Hypervolume-Based Archiving Algorithms II: Competitiveness
In: GECCO'12 : Proceedings of the Fourteenth International Conference on
Genetic and Evolutionary Computation, 457-464
BringmannF12
2011Convergence of Hypervolume-Based Archiving Algorithms I: Effectiveness
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 745-752
BringmannF2011
2010An Efficient Algorithm for Computing Hypervolume Contributions
In: Evolutionary Computation [18], 383-402
TF_ECJ4
2010Approximating the volume of unions and intersections of high-dimensional geometric objects
In: Computational Geometry [43], 601-610
TF_CGTA1
2010The Maximum Hypervolume Set Yields Near-optimal Approximation
In: 12th annual conference on Genetic and evolutionary computation (GECCO 2010), 511-518
BF2010GECCO
2010Tight Bounds for the Approximation Ratio of the Hypervolume Indicator
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 607-616
BF2010PPSN
2009Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
In: Evolutionary Multi-Criterion Optimization : 5th International Conference, EMO 2009, 6-20
BF09b
2009Don't be greedy when calculating hypervolume contributions
In: FOGA'09 : revised selected papers from ACM SIGEVO
Foundations of Genetic Algorithms X, 103-112
BF09a
2008Approximating the volume of unions and intersections of high-dimensional geometric objects.
In: Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC 2008), 436-447
BF08
Hide details for Bringmann, Friedrich, Igel, VoßBringmann, Friedrich, Igel, Voß
2013Speeding Up Many-Objective Optimization by Monte Carlo Approximations
In: Artificial Intelligence [204], 22–29
BringmannFIV13
Hide details for Bringmann, Friedrich, Neumann, WagnerBringmann, Friedrich, Neumann, Wagner
2011Approximation-guided evolutionary multi-objective optimization
In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI 2011), 1198-1203
BringmannFNW2011
Hide details for Bringmann, Green LarsenBringmann, Green Larsen
2013Succinct Sampling from Discrete Distributions
In: 45th ACM Symposium on Theory of Computing (STOC-13), 775-782
BringmannGL
Hide details for Bringmann, Mehlhorn, NeumannBringmann, Mehlhorn, Neumann
2012Attachment IconRemarks on Category-Based Routing in Social Networkscategory_based_routing_2012
Hide details for Bringmann, PanagiotouBringmann, Panagiotou
2012Attachment IconEfficient Sampling Methods for Discrete Distributions
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 133-144
BringmannP12
Hide details for Bringmann, Sauerwald, Stauffer, SunBringmann, Sauerwald, Stauffer, Sun
2014Balls into bins via local search: cover time and maximum load
In: 31st Symposium on Theoretical Aspects of Computer Science (STACS-14), accepted
BringmannSSS14
Hide details for BrockenauerBrockenauer
1997Separierung von Kuratowski-Ungleichungen für das größte planare Untergraphenproblem
Universität des Saarlandes
Brockenauer97
Hide details for Brockhoff, Friedrich, Hebbinghaus, Klein, Neumann, ZitzlerBrockhoff, Friedrich, Hebbinghaus, Klein, Neumann, Zitzler
2009On the Effects of Adding Objectives to Plateau Functions
In: IEEE Transactions on Evolutionary Computation [13], 591-603
BroetalTEC2009
2007Do Additional Objectives Make a Problem Harder?
In: Genetic and Evolutionary Computation Conference 2007, 765-772
addobj07
Hide details for Brockhoff, Friedrich, NeumannBrockhoff, Friedrich, Neumann
2008Analyzing Hypervolume Indicator Based Algorithms
In: Parallel Problem Solving from Nature (PPSN X), 651-660
BroFriNeuPPSN2008
Hide details for BrodalBrodal
1998Finger Search Trees with Constant Update Time
In: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-98), 540-549
Brodal98a
1997Predecessor Queries in Dynamic Integer Sets
In: Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science (STACS-97), 21-32
Brodal97a
1996Priority queues on parallel machines
In: 5th Scandinavian Workshop on Algorithm Theory (SWAT96), 416-427
Brodal96
Hide details for Brodal, Chaudhuri, RadhakrishnanBrodal, Chaudhuri, Radhakrishnan
1996The randomized complexity of maintaining the minimum
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 4-15
BrodalChaudhuriRadhakrishnan96-CPM-7
1996The randomized complexity of maintaining the minimum
In: Nordic Journal of Computing [3], 337-351
Brodal-Chaudhuri-Radhakrishnan
Hide details for Brodal, Fagerberg, Meyer, ZehBrodal, Fagerberg, Meyer, Zeh
2004Cache-oblivious data structures and algorithms for undirected breadth-first search and shortest paths
In: Algorithm theory, SWAT 2004 : 9th Scandinavian Workshop on Algorithm Theory ; Humlebæk, Denmark, July 8-10, 2004 ; proceedings, 480-492
BFMZ04
Hide details for Brodal, GasieniecBrodal, Gasieniec
1996Approximate Dictionary Queries
In: Combinatorial Pattern Matching: 7th Annual Symposium (CPM'96), 65-74
Gasieniec2-96
Hide details for Brodal, Kaligosi, Katriel, KutzBrodal, Kaligosi, Katriel, Kutz
2006Faster Algorithms for Computing Longest Common Increasing Subsequences
In: Combinatorial Pattern Matching, 17th Annual Symposium, CPM 2006, 330-341
Kaligosi2006b
Hide details for Brodal, KatajainenBrodal, Katajainen
1998Worst-Case Efficient External-Memory Priority Queues
In: Proceedings of the 6th Scandinavian Workshop on Algorithm Theory (SWAT-98), 107-118
Brodal1998b
Hide details for Brodal, PinottiBrodal, Pinotti
1998Comparator Networks for Binary Heap Construction
In: Proceedings of the 6th Scandinavian Workshop on Algorithm Theory (SWAT-98), 158-168
Brodal1998c
Hide details for Brodal, Träff, ZaroliagisBrodal, Träff, Zaroliagis
1998A Parallel Priority Queue with Constant Time Operations
In: Journal of Parallel and Distributed Computing, Special Issue on Parallel Data Structures [49], 4-21
Brodal1998d
1997A parallel priority data structure with applications
In: 11th Internatinal Parallel Processing Symposium (IPPS-97), 689-693
Brodal-Traeff-Zaro97
Hide details for Brönnimann, Burnikel, PionBrönnimann, Burnikel, Pion
2001Interval arithmetic yields efficient dynamic filters for computational geometry
In: Discrete Applied Mathematics [109], 25-47
BrönnimannBurnikelPion2001
1998Interval analysis yields efficient dynamic filters for computational geometry
In: Proceedings of the 14th International Annual ACM Symposium on Computational Geometry (SCG-98), 165-174
BBP:SCG98
Hide details for Brönnimann, Kettner, Pocchiola, SnoeyinkBrönnimann, Kettner, Pocchiola, Snoeyink
2006Attachment IconCounting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm
In: SIAM Journal on Computing [36], 721-739
Kettner2006PseudoTEnum
2005Counting and enumerating pointed pseudo-triangulations with the greedy flip algorithm
In: Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics
(ALENEX/ANALCO 2005), 98-110
Kettner2005PseudoTriangEnum
Hide details for Brönnimann, Kettner, Schirra, VeltkampBrönnimann, Kettner, Schirra, Veltkamp
2000Applications of the Generic Programming Paradigm in the Design of CGAL
In: Generic programming - International Seminar on Generic Programming Dagstuhl Castle, Germany, April 27 - May 1, 1998, selected papers, 206-216
Schirra2000GenericProgramming
Hide details for Brown, El Kahoui, Novotni, WeberBrown, El Kahoui, Novotni, Weber
2006Attachment IconAlgorithmic methods for investigating equilibria in epidemic modeling
In: Journal of Symbolic Computation [41], 1157-1173
ElKahoui2005d
Hide details for Buchberger, Mehlhorn, Näher, Nievergelt (ed.)Buchberger, Mehlhorn, Näher, Nievergelt (ed.)
1994Special issue on “algorithms: implementation, libraries and use”mehlhorn94
Hide details for BuchheitBuchheit
1999Oberflächenrekonstruktion mithilfe von Voronoi-Diagrammen
Universität des Saarlandes
Buchheit1999
Hide details for Bundy, Hebbinghaus, StellmacherBundy, Hebbinghaus, Stellmacher
2006Attachment IconThe Local C(G,T) Theorem
In: Journal of Algebra [300], 741-789
Hebbinghaus2006a
Hide details for BurkhardtBurkhardt
2002Filter Algorithms for Approximate String Matching
Universität des Saarlandes
BurkhardtDiss02
Hide details for Burkhardt, Crauser, Ferragina, Lenhof, Rivals, VingronBurkhardt, Crauser, Ferragina, Lenhof, Rivals, Vingron
1999q-gram Based Database Searching Using a Suffix Array (QUASAR)
In: Proceedings of the 3rd Annual International Conference on Computational Molecular Biology (RECOMB-99), 77-83
Burkhardt1999/1
Hide details for Burkhardt, KärkkäinenBurkhardt, Kärkkäinen
2003Better Filtering with Gapped q-Grams
In: Fundamenta Informaticae [56], 51-70
BurkhardtKarkkainen2003
2003Attachment IconFast Lightweight Suffix Array Construction and Checking
In: Combinatorial Pattern Matching: 14th Annual Symposium, CPM 2003, 55-69
Burkhardt2003
2002One-Gapped q-Gram Filters for Levenshtein Distance
In: Combinatorial Pattern Matching : 13th Annual Symposium, CPM 2002, 225-234
Burkhardt2002
2001Better Filtering with Gapped q-Grams
In: Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching, 73-85
Burkhardt2001
Hide details for BurnikelBurnikel
1996Exact Computation of Voronoi Diagrams and Line Segment Intersections
Universität des Saarlandes
Burnikel-Diss96
Hide details for Burnikel, Fleischer, Mehlhorn, SchirraBurnikel, Fleischer, Mehlhorn, Schirra
2000Attachment IconA strong and easily computable separation bound for arithmetic expressions involving radicals
In: Algorithmica [27], 87-99
BFMS2000
1999Attachment IconEfficient exact geometric computation made easy
In: Proceedings of the 15th Annual Symposium on Computational Geometry (SCG-99), 341-350
BFMS1999
Hide details for Burnikel, Funke, Mehlhorn, Schirra, SchmittBurnikel, Funke, Mehlhorn, Schirra, Schmitt
2009A Separation Bound for Real Algebraic Expressions
In: Algorithmica [55], 14-28
Burnikel2009
2001Attachment IconA Separation Bound for Real Algebraic Expressions
In: Proceedings of the 9th Annual European Symposium on Algorithms (ESA-01), 254-265
BFMSS2001
Hide details for Burnikel, Funke, SeelBurnikel, Funke, Seel
2001Exact geometric computation using Cascading
In: International Journal of Computational Geometry & Applications [11], 245-266
BurnikelFunkeSeel2001
1998Exact Geometric Predicates using Cascaded Computation
In: Proceedings of the 14th International Annual ACM Symposium on Computational Geometry (SCG-98), 175-183
Funke1998
Hide details for Burnikel, Könemann, Mehlhorn, Näher, Schirra, UhrigBurnikel, Könemann, Mehlhorn, Näher, Schirra, Uhrig
1995Attachment IconExact Geometric Computation in LEDA
In: 11th ACM Symposium on Computational Geometry (SCG95), C18-C19
Burnikel-et-al95
Hide details for Burnikel, Mehlhorn, SchirraBurnikel, Mehlhorn, Schirra
1994Attachment IconHow to Compute the Voronoi Diagram of Line Segments:
Theoretical and Experimental Results
In: Algorithms (ESA-94) : 2nd annual European symposium, 227-239
Mehlhorn94b
1994Attachment IconOn degeneracy in geometric computations
In: Discrete algorithms (SODA-94) : 5th annual ACM-SIAM symposium, 16-23
Mehlhorn94gz
Hide details for BuschBusch
2011Analysis of the KIT email graph, with an application of randomized rumour spreading protocols
Universität des Saarlandes
BuschBach2011
Hide details for Butman, Hermelin, Lewenstein, RawitzButman, Hermelin, Lewenstein, Rawitz
2010Optimization problems in multiple-interval graphs
In: ACM Transactions on Algorithms [6], 40,1-40,18
Hermelin2010b
Hide details for ButzButz
1997Robuste Implementierung eines Algorithmus zur Berechnung eines Voronoi-Diagramms für Polygone
Universitaet des Saarlandes
Butz98
Hide details for Cai, Lu, XiaCai, Lu, Xia
2013Dichotomy for Holant* Problems with a Function on Domain Size 3
In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 1278-1295
Xia2013-soda-clx
Hide details for Calinescu, Fernandes, Finkler, KarloffCalinescu, Fernandes, Finkler, Karloff
1998A Better Approximation Algorithm for Finding Planar Subgraphs
In: Journal of Algorithms [27], 269-302
Finkler-et-al97
1996A better approximation algorithm for finding planar subgraphs
In: 7th ACM-SIAM Symposium on Discrete Algorithms (SODA96), 16-25
Finkler-et-al96
Hide details for Cameron, Johannsen, Prellberg, SchweitzerCameron, Johannsen, Prellberg, Schweitzer
2008Attachment IconCounting Defective Parking Functions
In: Electronic Journal of Combinatorics [15], R92
CameronJohannsenPrellbergSchweitzer2008
Hide details for Canzar, El-Kebir, Pool, Elbassioni, Malde, Mark, Geerke, Stougie, KlauCanzar, El-Kebir, Pool, Elbassioni, Malde, Mark, Geerke, Stougie, Klau
2012Charge Group Partitioning in Biomolecular Simulation
In: Research in Computational Molecular Biology : 16th Annual International Conference, RECOMB 2012, 29-43
Elbassioni2012c
Hide details for Canzar, Elbassioni, Elmasry, RamanCanzar, Elbassioni, Elmasry, Raman
2010On the Approximability of the Maximum Interval Constrained Coloring Problem
In: Algorithms and Computation : 21st International Symposium, ISAAC 2010. - Pt. II, 168-179
Elbassioni2010
Hide details for Canzar, Elbassioni, Klau, MestreCanzar, Elbassioni, Klau, Mestre
2011On Tree-Constrained Matchings and GeneralizationsElbassioni2012j
2011On Tree-Constrained Matchings and Generalizations
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 98-109
Elbassioni2011f
Hide details for Canzar, Elbassioni, MestreCanzar, Elbassioni, Mestre
2010A polynomial delay algorithm for enumerating approximate solutions to the interval coloring problem
In: Workshop on Algorithm Engineering and Experiments 2010 (ALENEX10), 23-33
Mestre2010a
Hide details for Canzar, RemyCanzar, Remy
2006Shape Distributions and Protein Similarity
In: GCB, 1-10
Canzar2006
Hide details for Caragiannis, Fishkin, Kaklamanis, PapaioannouCaragiannis, Fishkin, Kaklamanis, Papaioannou
2007A tight bound for online colouring of disk graphs
In: Theoretical Computer Science [384], 152-160
Caragioannis2007
2007Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs
In: 29th Symposium on Mathematical Foundations of Computer Science MFCS 2004, 119-136
CaragiannisFishkin2007
Hide details for CaroliCaroli
2007Evaluation of a Generic Method for Analyzing Controlled-Perturbation Algorithms
Universität des Saarlandes
Caroli07Evaluation
2006Exakte Arrangement-Berechnung gedrehter Quadratischer Kurven
Universität des Saarlandes
BachCaroli06
Hide details for Case, KötzingCase, Kötzing
2013Memory-limited non-U-shaped learning with solved open problems
In: Theoretical Computer Science [473], 100-123
CaseKoetzing2012:MemLim
2012Computability-theoretic learning complexity
In: Philosophical Transaction of the Royal Society A [370], 3570-3596
CaseKoetzing2012:PhilTrans
2012Learning secrets interactively. Dynamic modeling in inductive inference
In: Information and Computation [220-221], 60-73
CaseKoetzing2012:DynMod
2011Measuring Learning Complexity with Criteria Epitomizers
In: 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011), 320-331
Cas-Koe:c:11:StacsEpit
2010Solutions to Open Questions for Non-U-Shaped Learning with Memory Limitations
In: Algorithmic Learning Theory : 21st International Conference, ALT 2010, 285-299
Koetzing2010NUMemLimited
2010Strongly Non-U-Shaped Learning Results by General Techniques
In: COLT 2010 : The 23rd Conference on Learning Theory, 181-193
Koetzing2010NUTechniques
Hide details for Celikik, BastCelikik, Bast
2009Attachment IconFast Error-Tolerant Search on Very Large Texts
In: The 24th Annual ACM Symposium on Applied Computing, 1724-1731
bastcelikik2009sac
2009Fast Single-Pass Construction of a Half-Inverted Index
In: String processing and information retrieval : 16th International Symposium, SPIRE 2009, 194-205
celikikbast2009spire
Hide details for Celikik, Bast, ManolacheCelikik, Bast, Manolache
2011Attachment IconEfficient Index-Based Snippet Generationbastcelikikmanolache2009-snippets
Hide details for Chandran, SivadasanChandran, Sivadasan
2004Attachment IconOn the Hadwiger's Conjecture for Graph ProductsChandranSivadasan2004
Hide details for ChangChang
2007Attachment IconMultiple pass streaming algorithms for learning mixtures of distributions in $R^d$
In: Algorithmic Learning Theory, 18th International Conference, Proceedings, 16
Chang2007
Hide details for Chang, JohnsonChang, Johnson
2008Attachment IconOnline and offline selling in limit order markets
In: 4th International Workshop on Internet and Network Economics (WINE 2008), 41-52
Chang2008a
Hide details for Chang, KannanChang, Kannan
2006Attachment IconThe Space Complexity of Pass-Efficient Algorithms for Clustering
In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06, 1157-1166
Chang2006
Hide details for Chan, Dhamdhere, Gupta, Kleinberg, SlivkinsChan, Dhamdhere, Gupta, Kleinberg, Slivkins
2009Metric Embeddings with Relaxed Guarantees
In: SIAM Journal on Computing [38], 2303-2329
CDGKS2009
Hide details for Chan, Edmonds, Lam, Lee, Marchetti-Spaccamela, PruhsChan, Edmonds, Lam, Lee, Marchetti-Spaccamela, Pruhs
2011Nonclairvoyant speed scaling for flow and energy
In: Algorithmica [61], 507-517
Lee2010d
2009Nonclairvoyant Speed Scaling for Flow and Energy
In: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS), 255-264
Chan2008c
Hide details for Chan, Edmonds, PruhsChan, Edmonds, Pruhs
2009Speed Scaling of Processes with Arbitrary Speedup Curves on a Multiprocessor
In: SPAA'09 : proceedings of the Twenty-First Annual Symposium on Parallelism in Algorithms and Architectures, 1-10
ChanSPAA2009
Hide details for Chan, ElbassioniChan, Elbassioni
2011A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics
In: Discrete & Computational Geometry [46], 704-723
Elbassioni2011j
Hide details for Chan, GuptaChan, Gupta
2009Small Hop-diameter Sparse Spanners for Doubling Metrics
In: Discrete and Computational Geometry [41], 28-44
ChanGupta2009
Hide details for Chan, Lam, LeeChan, Lam, Lee
2011Scheduling for weighted flow time and energy with rejection penalty
In: 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011), 392-403
Lee2011b
2010Non-clairvoyant speed scaling for weighted flow time
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. I, 23-35
Lee2010b
Hide details for Chan, Lam, Lee, TingChan, Lam, Lee, Ting
2012Continuous Monitoring of Distributed Data Streams over a Time-Based Sliding Window
In: Algorithmica [62], 1088-1111
LeeLK2012
2010Continuous monitoring of distributed data streams over a time-based sliding window
In: 27th International Symposium on Theoretical Aspects of Computer Science
STACS 2010, 179-190
Lee2010a
Hide details for Chan, Megow, Sitters, van SteeChan, Megow, Sitters, van Stee
2012Attachment IconA note on sorting buffers offline
In: Theoretical Computer Science [423], 11-18
ChMeSS12
Hide details for ChaudhuriChaudhuri
1996Sensitive functions and approximate problems
In: Information and Computation [126], 161-168
Chaudhuri96
Hide details for Chaudhuri, Dimopoulos, ZaroliagisChaudhuri, Dimopoulos, Zaroliagis
1996On the Parallel Complexity of Acyclic Logic Programs
In: Parallel Processing Letters [6], 223-230
Chaudhuri-Zaroliagis-96
Hide details for Chaudhuri, DubhashiChaudhuri, Dubhashi
1997Probabilistic recurrence relations revisited
In: Theoretical Computer Science [181], 45-56
ChaudhuriDubhashi97
1995Probabilistic Recurrence Relations Revisited
In: LATIN'95: Theoretical Informatics, Second Latin American Symposium, 207-219
Shiva-Dubhashi95
Hide details for Chaudhuri, Garg, RaviChaudhuri, Garg, Ravi
1998The $p$-neighbor $k$-center problem
In: Information Processing Letters [65], 131-134
ChaudhuriGargRavi
Hide details for Chaudhuri, HagerupChaudhuri, Hagerup
1995Prefix Graphs and their Applications
In: Graph-theoretic Concepts in Computer Science: 20th International Workshop (WG94), 206-218
Shiva-Hagerup95
Hide details for Chaudhuri, RadhakrishnanChaudhuri, Radhakrishnan
1997The Complexity of Parallel Prefix Problems on Small Domains
In: Information and Computation [138], 1-22
Chaudhuri-Radhakrishnan97
1996Deterministic restrictions in circuit complexity
In: Theory of Computing : 28th Annual ACM Symposium (STOC-28), 30-36
ChaudhuriRadhakrishnan96
Hide details for Chaudhuri, Subrahmanyam, Wagner, ZaroliagisChaudhuri, Subrahmanyam, Wagner, Zaroliagis
2000Computing mimicking networks
In: Algorithmica [26], 31-49
ChaudhuriSubrahmanyamWagnerZaroliagis2000
1998Computing Mimicking Networks
In: Proceedings of the 25th International Colloquium on Automata, Languages and Programming (ICALP-98), 556-567
Chauduri-Subrahmanyam-Wagner-Zaroliagis-98
Hide details for Chaudhuri, ZaroliagisChaudhuri, Zaroliagis
2000Shortest paths in digraphs of small treewidth. Part I, Sequential algorithms
In: Algorithmica [27], 212-226
ChaudhuriZaroliagis2000
1998Shortest paths in digraphs of small treewidth. Part II: Optimal parallel algorithms
In: Theoretical Computer Science [203], 205-223
Chaudhuri-Zaroliagis-2-97
1995Optimal Parallel Shortest Paths in Small Treewidth Digraphs
In: Algorithms - ESA'95: 3rd Annual European Symposium, 31-45
Shiva-Zaro-2-95
1995Shortest Path Queries in Digraphs of Small Treewidth
In: Automata, Languages, and Programming: 22nd International Colloquium (ICALP95), 244-255
Shiva-Zaro-1-95
Hide details for Cheng, Funke, Golin, Kumar, Poon, RamosCheng, Funke, Golin, Kumar, Poon, Ramos
2003Curve Reconstruction from Noisy Samples
In: Proceedings of the 19th Annual Symposium on Computational Geometry (SCG-03), 420-429
CFGKPR2003
Hide details for Chen, Das, SmidChen, Das, Smid
1996Lower bounds for computing geometric spanners and approximate shortest paths
In: 8th Canadian Conference on Computing, 155-160
Chen-Das-Smid96
Hide details for Chen, Doerr, Hu, Ma, van Stee, WinzenChen, Doerr, Hu, Ma, van Stee, Winzen
2012Attachment IconThe Price of Anarchy for Selfish Ring Routing is Two
In: Internet and Network Economics : 8th International Workshop, WINE 2012, 420-433
CDHMSW12
Hide details for Chen, Epstein, Kleiman, van SteeChen, Epstein, Kleiman, van Stee
2013Attachment IconMaximizing the minimum load: The cost of selfishness
In: Theoretical Computer Science [482], 9-19
ChEpKS13
Hide details for Cheriyan, HagerupCheriyan, Hagerup
1995A Randomized Maximum-Flow Algorithm
In: SIAM Journal on Computing [24], 203-226
Cheriyan-Hagerup95
Hide details for Cheriyan, Hagerup, MehlhornCheriyan, Hagerup, Mehlhorn
1996An o(n³)-Time Maximum-Flow-Algorithm: Can a Maximum Flow be Computed in o(nm) Time?
In: SIAM Journal on Computing [25], 1144-1170
Cheriyan-Hagerup-Mehlhorn96
1990Can A Maximum Flow be Computed in o(nm) Time?
In: Automata, languages and programming (ICALP-90) : 17th international colloquium, 235-248
Mehlhorn90c
1990Attachment IconCan a maximum flow be computed in $o(nm)$ time?mehlhorn86e
Hide details for Cheriyan, MehlhornCheriyan, Mehlhorn
1999Attachment IconAn analysis of the highest-level selection rule in the preflow-push max-flow algorithm
In: Information Processing Letters [69], 239-242
Cheriyan-Mehlhorn99
1996Attachment IconAlgorithms for Dense Graphs and Networks on the Random Access Computer
In: Algorithmica [15], 521-549
Cheriyan-Mehlhorn96
Hide details for Chian, Goodrich, Grove, Tamassia, Vengroff, VitterChian, Goodrich, Grove, Tamassia, Vengroff, Vitter
1995External-Memory Graph Algorithms
In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95), 139-149
Grove-et-al-1-95b
Hide details for Ching, Mehlhorn, SmidChing, Mehlhorn, Smid
1990Dynamic deferred data structuring
In: Information Processing Letters [35], 37-40
Ching:1990:DDD
Hide details for Chin, Guo, SunChin, Guo, Sun
2011Minimum Manhattan Network is NP-Complete
In: Discrete & Computational Geometry [45], 701-722
Sun2011b
Hide details for Chlebus, Czumaj, Gasieniec, Kowaluk, PlandowskiChlebus, Czumaj, Gasieniec, Kowaluk, Plandowski
1996Parallel Alternating-Direction Access Machine
In: Mathematical Foundations of Computer Science 1996: 21st International Symposium (MFCS'96), 255-266
Gasieniec4-96
Hide details for Chlebus, Czumaj, SibeynChlebus, Czumaj, Sibeyn
1997Routing on the PADAM: Degrees of Optimality
In: Proceedings of the 3rd International Euro-Par Conference on Parallel Processing (Euro-Par-97), 272-279
ChlebusCzumajSibeyn97
Hide details for Chlebus, KowalskiChlebus, Kowalski
2005Cooperative asynchronous update of shared memory
In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC 2005), 733-739
CK-STOC
2004A better wake-up in radio networks
In: Proceedings of the 23rd Annual ACM Symposium on Principles of Distributed Computing, PODC 2004, 266-274
CK-PODC
2004Randomization helps to perform independent tasks reliably
In: Random Structures and Algorithms [24], 11-41
Kowalski2003a
Hide details for Chlebus, Kowalski, ShvartsmanChlebus, Kowalski, Shvartsman
2004Collective asynchronous reading with polylogarithmic worst-case overhead
In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC-04), 321-330
Kowalski-STOC-2004
Hide details for ChongChong
1996Finding minimum spanning trees on the EREW PRAM
In: International Computer Symposium, 7-14
Chong-1-96
Hide details for Chong, LamChong, Lam
1998Approximating Biconnectivity in Parallel
In: Algorithmica [21], 395-410
Chong1998
1996Towards more precise parallel biconnectivity approximation
In: 7th Annual International Symposium on Algorithms and Computation, 223-232
Chong-Lam96
Hide details for Chong, RamosChong, Ramos
1998Improved deterministic parallel padded sorting
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 405-416
Chong-Ramos1998
Hide details for ChristodoulouChristodoulou
2008Price of Anarchy
In: Encyclopedia of Algorithms, 1-99
Christodoulou2008
Hide details for Christodoulou, Chung, Ligett, Pyrga, van SteeChristodoulou, Chung, Ligett, Pyrga, van Stee
2010Attachment IconOn the price of stability for undirected network design
In: Approximation and Online Algorithms : 7th International Workshop, WAOA 2009, 86-97
CCLPS2009
Hide details for Christodoulou, Elbassioni, FouzChristodoulou, Elbassioni, Fouz
2010Truthful Mechanisms for Exhibitions
In: Internet and Network Economics : 6th International Workshop, WINE 2010, 170-181
Elbassioni2010i
Hide details for Christodoulou, Gourves, PascualChristodoulou, Gourves, Pascual
2007Attachment IconScheduling Selfish Tasks: About the Performance of Truthful Algorithms
In: Computing and Combinatorics : 13th Annual International Conference, COCOON 2007, 187-197
CGP2007
Hide details for Christodoulou, KoutsoupiasChristodoulou, Koutsoupias
2009Mechanism Design for Scheduling
In: Bulletin of European Association for Theoretical Computer Science [97], 40-59
CK2009
Hide details for Christodoulou, Koutsoupias, KovácsChristodoulou, Koutsoupias, Kovács
2010Mechanism Design for Fractional Scheduling on Unrelated Machines
In: ACM Transactions on Algorithms [6], 38:1-38:18
CKK2009
2007Attachment IconMechanism design for fractional scheduling on unrelated machines
In: Automata, Languages and Programming : 34th International Colloquium, ICALP 2007, 40-52
CKK07
Hide details for Christodoulou, Koutsoupias, NanavatiChristodoulou, Koutsoupias, Nanavati
2009Coordination Mechanisms
In: Theoretical Computer Science [410], 3327-3336
CKV2009
Hide details for Christodoulou, Koutsoupias, VidaliChristodoulou, Koutsoupias, Vidali
2009A lower bound for scheduling mechanisms
In: Algorithmica [85], 729-740
CKValgorithmica2008
2008A Characterization of 2-Player Mechanisms for Scheduling
In: Algorithms - ESA 2008, 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings., 297-307
ChristodoulouKV2008
2007A lower bound for scheduling mechanisms
In: ACM-SIAM Symposium on Discrete Algorithms (SODA), 1163-1170
CKV07
Hide details for Christodoulou, KovácsChristodoulou, Kovács
2010A deterministic truthful PTAS for scheduling related machines
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1005-1016
ChristodoulouKavacs2010
Hide details for Christodoulou, Kovács, SchapiraChristodoulou, Kovács, Schapira
2008Bayesian Combinatorial Auctions
In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I, 820-832
ChristodoulouKS2008
Hide details for Christodoulou, Kovacs, van SteeChristodoulou, Kovacs, van Stee
2013Attachment IconA truthful constant approximation for maximizing the minimum load on related machines
In: Theoretical Computer Science [489-490], 88-98
ChKoSt2013
2010A truthful constant approximation for maximizing the minimum load on related machines
In: Internet and Network Economics : 6th International Workshop, WINE 2010, 182-193
ChKoSt10
Show details for Christodoulou, Ligett, PyrgaChristodoulou, Ligett, Pyrga

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