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: 7. Library - 4. Category, Keywords

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

Author/EditorYearTitleType
Show details for ideal theoryideal theory
Show details for identity testingidentity testing
Show details for implementationimplementation
Show details for in-approximabilityin-approximability
Show details for IncompressibilityIncompressibility
Show details for incremental algorithmincremental algorithm
Show details for incremental algorithmsincremental algorithms
Show details for incremental generation algorithmsincremental generation algorithms
Show details for Incremental polynomial timeIncremental polynomial time
Show details for Independent Feedback Vertex SetIndependent Feedback Vertex Set
Show details for independent setindependent set
Show details for indexingindexing
Show details for induced subgraphinduced subgraph
Show details for Inefficiency of EquilibriaInefficiency of Equilibria
Show details for Infinite gamesInfinite games
Show details for Information BrokerageInformation Brokerage
Show details for information retrievalinformation retrieval
Show details for insertionsinsertions
Show details for InstrumentsInstruments
Show details for integer divisioninteger division
Show details for Integer Linear ProgrammingInteger Linear Programming
Show details for Integer Linear ProgramsInteger Linear Programs
Show details for integer multiplicationinteger multiplication
Show details for Integer OptimizationInteger Optimization
Show details for integer programinteger program
Show details for Integer ProgrammingInteger Programming
Show details for Integer Programming Graph DrawingInteger Programming Graph Drawing
Show details for Interconnection NetworksInterconnection Networks
Show details for Internet RoutingInternet Routing
Show details for intersection computationintersection computation
Show details for interval arithmeticinterval arithmetic
Show details for InversionsInversions
Show details for IP networksIP networks
Show details for IrregularIrregular
Show details for Isooriented RectanglesIsooriented Rectangles
Show details for I.3.5 [ComputationalI.3.5 [Computational
Geometry and Object Modeling]: Curve
Show details for I/O KomplexitätI/O Komplexität
Show details for job shop schedulingjob shop scheduling
Show details for k-splittable flowk-splittable flow
Show details for k mismatches problemk mismatches problem
Show details for Kemeny AggregationKemeny Aggregation
Show details for Kernel lower boundsKernel lower bounds
Show details for KernelizationKernelization
Show details for Knapsack ProblemKnapsack Problem
Show details for Knapsack problem - Random instances - Experimental study - Pareto optimalityKnapsack problem - Random instances - Experimental study - Pareto optimality
Show details for KomplexitaetstheorieKomplexitaetstheorie
Show details for Kürzeste-Wege-BerechnungKürzeste-Wege-Berechnung
Show details for Language equationsLanguage equations
Show details for Latent Semantic IndexingLatent Semantic Indexing
Show details for latticelattice
Show details for latticeslattices
Show details for LayoutLayout
Show details for LectinsLectins
Show details for LEDALEDA
Show details for Levenshtein DistanceLevenshtein Distance
Show details for LibraryLibrary
Show details for limiting distributionlimiting distribution
Show details for line segmentsline segments
Show details for Line simplificationLine simplification
Show details for Linear complementarity problem (LCP)Linear complementarity problem (LCP)
Show details for linear programminglinear programming
Show details for linear systemslinear systems
Show details for List-RankingList-Ranking
Show details for List RankingList Ranking
Show details for Load BalancingLoad Balancing
Show details for load balancing random loadsload balancing random loads
Show details for Local algorithmLocal algorithm
Show details for Location FreenessLocation Freeness
Show details for lock-freelock-free
Show details for LoopsLoops
Show details for Lossy minimization.Lossy minimization.
Show details for LovLov
Show details for low-discrepancy point setslow-discrepancy point sets
Show details for lower boundlower bound
Show details for Lower EnvelopesLower Envelopes
Show details for LP relaxationLP relaxation
Show details for manifoldsmanifolds
Show details for Map LabelingMap Labeling
Show details for MappingMapping
Show details for Market EquilibriaMarket Equilibria
Show details for massive data setmassive data set
Show details for massive data setsmassive data sets
Show details for MastermindMastermind
Show details for matchingmatching
Show details for matchingsmatchings
Show details for Mathematical economicsMathematical economics
Show details for Mathematical Techniques--GeometryMathematical Techniques--Geometry
Show details for Mathematical Techniques--TreesMathematical Techniques--Trees
Show details for mathematicsmathematics
Show details for matrix multiplication.matrix multiplication.
Show details for matroidmatroid
Show details for Max-CutMax-Cut
Show details for max-min fairnessmax-min fairness
Show details for Maximal frequent setMaximal frequent set
Show details for maximum flowmaximum flow
Show details for maximum load deviationmaximum load deviation
Show details for maximum weight matchingmaximum weight matching
Show details for mean payoff gamesmean payoff games
Show details for membership queriesmembership queries
Show details for memory-restricted algorithmsmemory-restricted algorithms
Show details for memory hierarchymemory hierarchy
Show details for MengeMenge
Show details for MeshesMeshes
Show details for meshingmeshing
Show details for Meticulous AnalysisMeticulous Analysis
Show details for metric spacesmetric spaces
Show details for MIMDMIMD
Show details for Min-Max Priority QueuesMin-Max Priority Queues
Show details for MinimizationMinimization
Show details for Minimum Cycle BasisMinimum Cycle Basis
Show details for Minimum DiameterMinimum Diameter
Show details for Minimum Fill-InMinimum Fill-In
Show details for Mixed CriticalityMixed Criticality
Show details for Möbius transformationsMöbius transformations
Show details for Modified Uspensky methodModified Uspensky method
Show details for Modular ArithmeticModular Arithmetic
Show details for Molecular ModelingMolecular Modeling
Show details for momentsmoments
Show details for Monotone Boolean dualizationMonotone Boolean dualization
Show details for Monotone Boolean functionMonotone Boolean function
Show details for monotone discrete binary functionsmonotone discrete binary functions
Show details for monotone inequalitiesmonotone inequalities
Show details for Mordell-Weil groupMordell-Weil group
Show details for Motion PlanningMotion Planning
Show details for MSIMDMSIMD
Show details for Multi-Objective OptimizationMulti-Objective Optimization
Show details for multi mergemulti merge
Show details for multicommodity flowmulticommodity flow
Show details for multicore algorithmsmulticore algorithms
Show details for multicoresmulticores
Show details for Multiobjective OptimizationMultiobjective Optimization
Show details for multiple robotsmultiple robots
Show details for multipoint evaluationmultipoint evaluation
Show details for MultiprocessorMultiprocessor
Show details for multiprocessorsmultiprocessors
Show details for multithreaded computationsmultithreaded computations
Show details for multithreadingmultithreading
Show details for NarrowingNarrowing
Show details for natural adaptive networksnatural adaptive networks
Show details for natural algorithmnatural algorithm
Show details for nearest neighbor load balancing algorithmnearest neighbor load balancing algorithm
Show details for nearest neighborsnearest neighbors
Show details for network designnetwork design
Show details for Network flowNetwork flow
Show details for Network FlowsNetwork Flows
Show details for Network Routing GamesNetwork Routing Games
Show details for NetworksNetworks
Show details for noiseless codingnoiseless coding
Show details for non-trivial cyclesnon-trivial cycles
Show details for nonuniform deterministic simulationnonuniform deterministic simulation
Show details for Normal polynomialsNormal polynomials
Show details for NP-completenessNP-completeness
Show details for NP-hardNP-hard
Show details for numerical integrationnumerical integration
Show details for Numerical solverNumerical solver
Show details for Object ModelingObject Modeling
Show details for object oriented programmingobject oriented programming
Show details for observerobserver
Show details for On-line algorithmOn-line algorithm
Show details for on-line algorithmson-line algorithms
Show details for One-Sided Crossing MinimizationOne-Sided Crossing Minimization
Show details for One variable equationsOne variable equations
Show details for online algorithmonline algorithm
Show details for Online AlgorithmsOnline Algorithms
Show details for online processonline process
Show details for Operations ResearchOperations Research
Show details for optimal networksoptimal networks
Show details for OptimizationOptimization
Show details for optimization heuristicsoptimization heuristics
Show details for Optimization problemsOptimization problems
Show details for orthogonalorthogonal
Show details for output maximizationoutput maximization
Show details for packet switchingpacket switching
Show details for PagingPaging
Show details for Pairing HeapsPairing Heaps
Show details for ParallelParallel
Show details for parallel algorithm analysisparallel algorithm analysis
Show details for parallel algorithmsparallel algorithms
Show details for parallel backtrack searchparallel backtrack search
Show details for Parallel ComputationParallel Computation
Show details for Parallel ComputingParallel Computing
Show details for parallel disksparallel disks
Show details for Parallel linear algebra. Tridiagonal systems. Alternating direction implicit methodParallel linear algebra. Tridiagonal systems. Alternating direction implicit method
Show details for Parallel LoopParallel Loop
Show details for Parallel LoopsParallel Loops
Show details for parallel processingparallel processing
Show details for parallel RAMparallel RAM
Show details for parallel random permutationparallel random permutation
Show details for Parameterized AlgorithmsParameterized Algorithms
Show details for Parameterized ComplexityParameterized Complexity
Show details for Parametric SearchParametric Search
Show details for parametric searchingparametric searching
Show details for Parking FunctionsParking Functions
Show details for Partition treesPartition trees
Show details for Path planningPath planning
Show details for Pathwidth-One DeletionPathwidth-One Deletion
Show details for pattern matchingpattern matching
Show details for PerformancePerformance
Show details for Periodic Task SystemPeriodic Task System
Show details for Permutation RoutingPermutation Routing
Show details for PersistencePersistence
Show details for Persistent data structuresPersistent data structures
Show details for PerturbationPerturbation
Show details for PhysarumPhysarum
Show details for Planar AugmentationPlanar Augmentation
Show details for planar graphplanar graph
Show details for Planar GraphsPlanar Graphs
Show details for PlanarizationPlanarization
Show details for plottingplotting
Show details for Point locationPoint location
Show details for pointspoints
Show details for Polygon CoveringPolygon Covering
Show details for polygon partitioningpolygon partitioning
Show details for polygonspolygons
Show details for Polyhedral CombinatoricsPolyhedral Combinatorics
Show details for polyline fittingpolyline fitting
Show details for PolymatroidPolymatroid
Show details for polymatroid functionpolymatroid function
Show details for polymatroid functionspolymatroid functions
Show details for Polynomial-time approximation algorithmsPolynomial-time approximation algorithms
Show details for polynomial average time algorithmspolynomial average time algorithms
Show details for polynomial average time.polynomial average time.
Show details for polynomial divisionpolynomial division
Show details for Polynomial gcdPolynomial gcd
Show details for polynomial interpolationpolynomial interpolation
Show details for Polynomial KernelsPolynomial Kernels
Show details for Polynomial real root isolationPolynomial real root isolation
Show details for Polynomial systemsPolynomial systems
Show details for polynomial time approximation schemepolynomial time approximation scheme
Show details for posetposet
Show details for poset.poset.
Show details for positional gamepositional game
Show details for Power ControlPower Control
Show details for power of choicespower of choices
Show details for PRAMPRAM
Show details for PRAM SimulationPRAM Simulation
Show details for precedence constraintsprecedence constraints
Show details for precisionprecision
Show details for Precision ProblemPrecision Problem
Show details for preemptionpreemption
Show details for Preemptive SchedulingPreemptive Scheduling
Show details for PrefetchingPrefetching
Show details for prefix codesprefix codes
Show details for PreprocessingPreprocessing
Show details for Preprocessing HeuristicsPreprocessing Heuristics
Show details for price of anarchyprice of anarchy
Show details for Price of fairnessPrice of fairness
Show details for price of stabilityprice of stability
Show details for Primal-dual algorithms - Approximation algorithms - Min-sum scheduling problemsPrimal-dual algorithms - Approximation algorithms - Min-sum scheduling problems
Show details for Priority DequesPriority Deques
Show details for priority queuespriority queues
Show details for probabalistic analysisprobabalistic analysis
Show details for probabilistic analysis.probabilistic analysis.
Show details for probabilistic methodsprobabilistic methods
Show details for processing modulesprocessing modules
Show details for Processor Speedup FactorProcessor Speedup Factor
Show details for project schedulingproject scheduling
Show details for PropagationPropagation
Show details for Pursuit-evasionPursuit-evasion
Show details for Quadratic Interval RefinementQuadratic Interval Refinement
Show details for QuadricsQuadrics
Show details for QUASARQUASAR
Show details for quasi-polynomial timequasi-polynomial time
Show details for quasi-polynomial.quasi-polynomial.
Show details for Quasi-RandomnessQuasi-Randomness
Show details for QuasirandomnessQuasirandomness
Show details for query complexityquery complexity
Show details for Ramsey propertyRamsey property
Show details for Ramsey TheoryRamsey Theory
Show details for random access machinerandom access machine
Show details for random graphrandom graph
Show details for random graphsrandom graphs
Show details for random insertions and deletionsrandom insertions and deletions
Show details for random permutationrandom permutation
Show details for random planar graphs sampling enumerationrandom planar graphs sampling enumeration
Show details for Random StructuresRandom Structures
Show details for Random walkRandom walk
Show details for RandomizedRandomized
Show details for randomized algorithmrandomized algorithm
Show details for Randomized algorithmsRandomized algorithms
Show details for randomized load balancing algorithmrandomized load balancing algorithm
Show details for Randomized Local SearchRandomized Local Search
Show details for Randomized RoundingRandomized Rounding
Show details for Randomized search heuristicsRandomized search heuristics
Show details for Range searchingRange searching
Show details for rankrank
Show details for rank-maximalrank-maximal
Show details for Rapid PrototypingRapid Prototyping
Show details for Rapid Software PrototypingRapid Software Prototyping
Show details for ReadabilityReadability
Show details for Real-Time SchedulingReal-Time Scheduling
Show details for real algebraic numbersreal algebraic numbers
Show details for Real Root IsolationReal Root Isolation
Show details for realsreals
Show details for RecompressionRecompression
Show details for reconfiguration overheadreconfiguration overhead
Show details for rectangle packingrectangle packing
Show details for Recursion tree analysisRecursion tree analysis
Show details for redundant assignmentsredundant assignments
Show details for regression analysisregression analysis
Show details for regular discrete functionsregular discrete functions
Show details for regular discrete functions.regular discrete functions.
Show details for RelaxationRelaxation
Show details for Resource augmentationResource augmentation
Show details for Resource managementResource management
Show details for resultantsresultants
Show details for Rigid body simulationsRigid body simulations
Show details for roboticsrobotics
Show details for robustnessrobustness
Show details for rolling motionrolling motion
Show details for Root ApproximationRoot Approximation
Show details for root isolationroot isolation
Show details for root refinementroot refinement
Show details for root separationroot separation
Show details for Root separation boundsRoot separation bounds
Show details for Root SolvingRoot Solving
Show details for RotationRotation
Show details for RoutingRouting
Show details for Row-MajorRow-Major
Show details for Rumor SpreadingRumor Spreading
Show details for running time analysisrunning time analysis
Show details for Runtime AnalysisRuntime Analysis
Show details for Safety-Critical SystemsSafety-Critical Systems
Show details for SatisfiabilitySatisfiability
Show details for scenescene
Show details for SchedulabilitySchedulability
Show details for Schedulability testSchedulability test
Show details for SchedulingScheduling
Show details for scheduling algorithmsscheduling algorithms
Show details for scientific space instrumentscientific space instrument
Show details for search treesearch tree
Show details for search treessearch trees
Show details for searchingsearching
Show details for Second order unificationSecond order unification
Show details for secondary memorysecondary memory
Show details for SelectionSelection
Show details for Self-Adjusting StructuresSelf-Adjusting Structures
Show details for Semi-algebraic SetsSemi-algebraic Sets
Show details for semi-random graphssemi-random graphs
Show details for Semialgebraic geometrySemialgebraic geometry
Show details for Semidefinite ProgrammingSemidefinite Programming
Show details for sensor coversensor cover
Show details for separation boundseparation bound
Show details for separation boundsseparation bounds
Show details for Set associative cacheSet associative cache
Show details for set coverset cover
Show details for set cover polytopeset cover polytope
Show details for set equalityset equality
Show details for shape recognitionshape recognition
Show details for shared memoryshared memory
Show details for shortest-pathshortest-path
Show details for Shortest-PathsShortest-Paths
Show details for Shortest-Paths ProblemsShortest-Paths Problems
Show details for Shortest pathShortest path
Show details for Shortest PathsShortest Paths
Show details for SIMDSIMD
Show details for simplex algorithmsimplex algorithm
Show details for Simulated AnnealingSimulated Annealing
Show details for SimulationSimulation
Show details for single-source shortest-path problemsingle-source shortest-path problem
Show details for Single Source Shortest PathSingle Source Shortest Path
Show details for ski rental problemski rental problem
Show details for slime moldslime mold
Show details for sliversslivers
Show details for SLPSLP
Show details for small subgraphsmall subgraph
Show details for Smoothed analysisSmoothed analysis
Show details for smoothed analysis}smoothed analysis}
Show details for snap roundingsnap rounding
Show details for Snippet generationSnippet generation
Show details for Social Choice TheorySocial Choice Theory
Show details for Software LibrariesSoftware Libraries
Show details for software librarysoftware library
Show details for software reusesoftware reuse
Show details for solar orbiter PHI instrumentsolar orbiter PHI instrument
Show details for solidsolid
Show details for solving NP-hard problem instances to optimalitysolving NP-hard problem instances to optimality
Show details for SortierenSortieren
Show details for SortingSorting
Show details for sorting lower boundsorting lower bound
Show details for space curvesspace curves
Show details for Space vehiclesSpace vehicles
Show details for spanning treespanning tree
Show details for Sparse graphsSparse graphs
Show details for Sparse spannersSparse spanners
Show details for spectralspectral
Show details for Spectral RetrievalSpectral Retrieval
Show details for Spelling variantsSpelling variants
Show details for splinessplines
Show details for Sporadic task systemSporadic task system
Show details for Sporadic TasksSporadic Tasks
Show details for SPQR-treesSPQR-trees
Show details for square rootingsquare rooting
Show details for Stackelberg RoutingStackelberg Routing
Show details for star-discrepancystar-discrepancy
Show details for statisticsstatistics
Show details for Steiner ProblemSteiner Problem
Show details for Steiner treeSteiner tree
Show details for Steiner Tree ProblemSteiner Tree Problem
Show details for Steiner TreesSteiner Trees
Show details for STL LEDA Graphiterators Iterator Design PatternSTL LEDA Graphiterators Iterator Design Pattern
Show details for storage systemsstorage systems
Show details for streamingstreaming
Show details for streaming algorithmsstreaming algorithms
Show details for string matchingstring matching
Show details for string unificationstring unification
Show details for strip packingstrip packing
Show details for Strong -netsStrong -nets
Show details for Strongly Connected Component.Strongly Connected Component.
Show details for Structural AlignmentStructural Alignment
Show details for Sturm-Habicht sequenceSturm-Habicht sequence
Show details for subdivision simplificationsubdivision simplification
Show details for Subexponential-time AlgorithmsSubexponential-time Algorithms
Show details for submodular functionsubmodular function
Show details for SubresultantSubresultant
Show details for SuchbaumSuchbaum
Show details for SuchenSuchen
Show details for suffix arraysuffix array
Show details for Suffix Array ConstructionSuffix Array Construction
Show details for Sum of square rootsSum of square roots
Show details for suppressionssuppressions
Show details for surfacesurface
Show details for Surface analysisSurface analysis
Show details for surface reconstructionsurface reconstruction
Show details for SurfacesSurfaces
Show details for Sweep-line algorithmSweep-line algorithm
Show details for SweeplineSweepline
Show details for Symbolic–numeric algorithmsSymbolic–numeric algorithms
Show details for synchronizationsynchronization
Show details for system of loopssystem of loops
Show details for system of polymatroid inequalitiessystem of polymatroid inequalities
Show details for SystemsSystems
Show details for systems of inequalitiessystems of inequalities
Show details for task allocationtask allocation
Show details for Taylor shiftTaylor shift
Show details for Term rewritingTerm rewriting
Show details for terrain coveringterrain covering
Show details for Text IndexingText Indexing
Show details for TheoryTheory
Show details for Theory of Randomized Search HeuristicsTheory of Randomized Search Heuristics
Show details for thresholdthreshold
Show details for threshold acceptingthreshold accepting
Show details for time-varying access probabilitiestime-varying access probabilities
Show details for time boundtime bound
Show details for time forward processingtime forward processing
Show details for Topological OrderingTopological Ordering
Show details for topologytopology
Show details for topology computationtopology computation
Show details for Topology ControlTopology Control
Show details for ToriTori
Show details for torsion-grouptorsion-group
Show details for torustorus
Show details for Total completion timeTotal completion time
Show details for Total Edge CoverTotal Edge Cover
Show details for Total Vertex CoverTotal Vertex Cover
Show details for Touching distancesTouching distances
Show details for TransformationTransformation
Show details for Transveral hypergraphsTransveral hypergraphs
Show details for TransversalTransversal
Show details for transversal hypergraphtransversal hypergraph
Show details for Tree-grammarsTree-grammars
Show details for Tree compressionTree compression
Show details for tree decompositionstree decompositions
Show details for treestrees
Show details for TreewidthTreewidth
Show details for TRIESTRIES
Show details for Trunk PackingTrunk Packing
Show details for two-dimensional bin packingtwo-dimensional bin packing
Show details for Unary languagesUnary languages
Show details for UncertaintyUncertainty
Show details for UndecidabilityUndecidability
Show details for unequal letter costsunequal letter costs
Show details for unequal probabilitiesunequal probabilities
Show details for Unification AlgorithmsUnification Algorithms
Show details for union of ballsunion of balls
Show details for Union of CubesUnion of Cubes
Show details for Unit-Ball GraphUnit-Ball Graph
Show details for universal coveruniversal cover
Show details for universal hashinguniversal hashing
Show details for unsplittable flowunsplittable flow
Show details for Vertex Deletion ProblemsVertex Deletion Problems
Show details for virtual address translationvirtual address translation
Show details for visibilityvisibility
Show details for visible partsvisible parts
Show details for VisualizationVisualization
Show details for VLSI-theoryVLSI-theory
Show details for VLSI computationVLSI computation
Show details for Voronoi diagramVoronoi diagram
Show details for Voronoi DiagramsVoronoi Diagrams
Show details for wake considerationwake consideration
Show details for Weierstrass functionWeierstrass function
Show details for weighted bipartite matching problemweighted bipartite matching problem
Show details for Weighted MatchingWeighted Matching
Show details for Wind farm designWind farm design
Show details for wirelesswireless
Show details for wireless communicationwireless communication
Show details for Wireless LANsWireless LANs
Show details for Wireless networksWireless networks
Show details for Wireless Sensor NetworksWireless Sensor Networks
Show details for Word equationsWord equations
Show details for work-stealingwork-stealing
Show details for Worst-Case Execution TimesWorst-Case Execution Times
Show details for worst case ratioworst case ratio
Show details for Zigzag persistent homologyZigzag persistent homology
Show details for zufällige Graphenzufällige Graphen
Show details for $k$-Anonymity$k$-Anonymity
Show details for $k$-anonymous$k$-anonymous
Show details for (1+1)-EA(1+1)-EA
Show details for >> Categories and Subject Descriptors>> Categories and Subject Descriptors
F.2.2 [Nonnumerical Algorithms and Problems]: Geometrical
problems and computations
Hide details for (Not Categorized)(Not Categorized)
Abed, Fidaa
Huang, Chien-Chung
2012Preemptive Coordination Mechanisms for Unrelated Machines
In: Algorithms - ESA 2012 : 20th Annual European Symposium, 12-23
Proceedings Article
Abo-Hasna, Ziad1994Verdrahtung von Kanälen mit Seitenanschlüssen
Universität des Saarlandes
Thesis - Master's thesis
Abraham, David
Cechlárová, Katarina
Manlove, David F.
Mehlhorn, Kurt
2004Attachment IconPareto-optimality in house allocation problems
In: Algorithms and Computation: 15th International Symposium, ISAAC 2004, 3-15
Proceedings Article
Abraham, David
Irving, Robert W.
Mehlhorn, Kurt
Telikepalli, Kavitha
2005Attachment IconPopular Matchings
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 424-432
Proceedings Article
Abraham, David J.
Cechlárová, Katarína
Manlove, David
Mehlhorn, Kurt
2005Pareto Optimality in House Allocation Problems
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 1163-1175
Proceedings Article
Abraham, David J.
Irving, Robert W.
Kavitha, Telikepalli
Mehlhorn, Kurt
2007Attachment IconPopular Matchings
In: SIAM Journal on Computing [37], 1030-1045
Journal Article
Adamaszek, Anna
Wiese, Andreas
2013Approximation Schemes for Maximum Weight Independent Set of Rectangles
In: Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2013),
Proceedings Article
Adler, Micah
Räcke, Harald
Sivadasan, Naveen
Sohler, Christian
Vöcking, Berthold
2003Attachment IconRandomized Pursuit-Evasion in Graphs
In: Combinatorics, Probability and Computing [12], 225-244
Journal Article
Afshani, Peyman
Agrawal, Manindra
Doerr, Benjamin
Doerr, Carola
Larsen, Kasper Green
Mehlhorn, Kurt
2013The Query Complexity of Finding a Hidden Permutation
In: Space-Efficient Data Structures, Streams, and Algorithms, 1-11
Part of a Book
Afshani, Peyman
Agrawal, Manindra
Doerr, Benjamin
Green Larsen, Kasper
Mehlhorn, Kurt
Winzen, Carola
2012The Query Complexity of Finding a Hidden Permutation
In: Electronic Colloquium on Computational Complexity (ECCC): Report Series [87 (Revision 1)], 1-36
Electronic Journal Article
Agarwal, Amit
Agarwal, Tarun
Chopra, Sumit
Feldmann, Anja
Kammenhuber, Nils
Krysta, Piotr
Vöcking, Berthold
2003An experimental study of k-splittable scheduling for DNS-based traffic allocation
In: Euro-Par 2003 parallel processing : 9th International Euro-Par Conference ; proceedings, 230-235
Proceedings Article
Agarwal, Pankaj
Arge, Lars
Brodal, Gerth Stølting
Vitter, Jeffrey Scott
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
Proceedings Article
Agrawal, Manindra
Saha, Chandan
Saptharishi, Ramprasad
Saxena, Nitin
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
Proceedings Article
Agrawal, Manindra
Saha, Chandan
Saxena, Nitin
2013A Case of Depth-3 Identity Testing, Sparse Factorization and Duality
In: 45th ACM Symposium on the Theory of Computing (STOC-13), toappear
Proceedings Article
Agrawal, Manindra
Saha, Chandan
Saxena, Nitin
2012Attachment IconQuasi-polynomial Hitting-set for Set-depth-Delta Formulas
In: arXiv [abs/1209.2333], 1-13
Electronic Journal Article
Ahuja, Nitin
Baltz, Andreas
Doerr, Benjamin
Privetivy, Ales
Srivastav, Anand
2005Attachment IconOn the Minimum Load Coloring Problem
In: Third Workshop on Approximation and Online Algorithms (WAOA 2005), 15-26
Proceedings Article
Ahuja, Nitin
Baltz, Andreas
Doerr, Benjamin
Srivastav, Anand
2004Coloring Graphs with Minimal Load
In: Electronic Notes in Discrete Mathematics [17], 129-133
Journal Article
Ahuja, Ravindra K.
Mehlhorn, Kurt
Orlin, James B.
Tarjan, Robert E.
1990Attachment IconFaster algorithms for the shortest path problem
In: Journal of the ACM [37], 213-223
Journal Article
Ahuja, Ravindra K.
Mehlhorn, Kurt
Orlin, James B.
Tarjan, Robert E.
1988Faster Algorithms for the Shortest Path ProblemReport
Ahuja, Ravindra K.
Mehlhorn, Kurt
Orlin, James B.
Tarjan, Robert E.
1988Faster Algorithms for the Shortest Path ProblemReport
Ailon, Nir
Avigdor-Elgrabli, Noa
Liberty, Edo
van Zuylen, Anke
2012Improved Approximation Algorithms for Bipartite Correlation Clustering
In: SIAM Journal on Computing [41], 1110-1121
Journal Article
Ailon, Nir
Avigdor-Elgrabli, Noa
Liberty, Noa
van Zuylen, Anke
2011Improved Approximation Algorithms for Bipartite Correlation Clustering
In: Algorithms - ESA 2011 : 19th Annual European Symposium, 25-36
Proceedings Article
Ajwani, Deepak2005Design, Implementation and Experimental Study of External Memory BFS Algorithms
Universität des Saarlandes
Thesis - Master's thesis
Ajwani, Deepak
Dementiev, Roman
Meyer, Ulrich
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
Proceedings Article
Ajwani, Deepak
Elbassioni, Khaled
Govindarajan, Sathish
Ray, Saurabh
2012Conflict-free coloring for rectangle ranges using O(n .382) colors
In: Discrete & Computational Geometry [48], 39-52
Journal Article
Ajwani, Deepak
Elbassioni, Khaled
Govindarajan, Sathish
Ray, Saurabh
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
Proceedings Article
Ajwani, Deepak
Elbassioni, Khaled M.
Govindarajan, Sathish
Ray, Saurabh
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)
Proceedings Article
Ajwani, Deepak
Friedrich, Tobias
2010Average-case Analysis of Incremental Topological Ordering
In: Discrete Applied Mathematics [158], 240-250
Journal Article
Ajwani, Deepak
Friedrich, Tobias
Meyer, Ulrich
2008An $O(n^2.75)$ algorithm for incremental topological ordering
In: ACM Transactions on Algorithms [4], 1-14
Journal Article
Ajwani, Deepak
Friedrich, Tobias
Meyer, Ulrich
2006Attachment IconAn $O(n^2.75)$ algorithm for online topological ordering
In: Algorithm theory - SWAT 2006 : 10th Scandinavian Workshop on Algorithm Theory, 53-64
Proceedings Article
Ajwani, Deepak
Malinger, Itay
Meyer, Ulrich
Toledo, Sivan
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
Proceedings Article
Ajwani, Deepak
Meyer, Ulrich
Osipov, Vitaly
2009Breadth first search on massive graphs
In: The shortest path problem : ninth DIMACS implemenation challenge, 291-307
Part of a Book
Ajwani, Deepak
Meyer, Ulrich
Osipov, Vitaly
2007Improved external memory BFS implementations
In: 9th Workshop on Algorithm Engineering and Experiments (ALENEX), 3-12
Proceedings Article
Ajwani, Deepak
Ray, Saurabh
Seidel, Raimund
Tiwary, Hans Raj
2007On Computing the Centroid of the Vertices of an Arrangement and Related Problems
In: 10th Workshop on Algorithms and Data Structures (WADS), 519-528
Proceedings Article
Akbari, Hoda
Berenbrink, Petra
Sauerwald, Thomas
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
Proceedings Article
Albers, Susanne1999Better bounds for online scheduling
In: SIAM Journal on Computing [29], 459-473
Journal Article
Albers, Susanne1999Online-Algorithmen
Universität des Saarlandes
Thesis - Habilitation thesis
Albers, Susanne1998A competitive analysis of the list update problem with lookahead
In: Theoretical Computer Science [197], 95-109
Journal Article
Albers, Susanne1998Improved randomized on-line algorithms for the list update problem
In: SIAM Journal on Computing [27], 682-693
Journal Article
Albers, Susanne1997Better Bounds for Online Scheduling
In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC-97), 130-139
Proceedings Article
Albers, Susanne1997On the Influence of Lookahead in Competitive Paging Algorithms
In: Algorithmica [18], 283-305
Journal Article
Albers, Susanne1995Improved randomized on-line algorithms for the list update problem
In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95), 412-419
Proceedings Article
Albers, Susanne
Arora, Sanjeev
Khanna, Sanjeev
1999Page replacement for general caching problems
In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), 31-40
Proceedings Article
Albers, Susanne
Charikar, Moses
Mitzenmacher, Michael
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
Proceedings Article
Albers, Susanne
Garg, Naveen
Leonardi, Stefano
2000Minimizing stall time in single and parallel disk systems
In: Journal of the ACM [47], 969-986
Journal Article
Albers, Susanne
Garg, Naveen
Leonardi, Stefano
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
Proceedings Article
Albers, Susanne
Hagerup, Torben
1997Improved Parallel Integer Sorting without Concurrent Writing
In: Information and Computation [136], 25-51
Journal Article
Albers, Susanne
Henzinger, Monika R.
1997Exploring Unknown Environments
In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC-97), 416-425
Proceedings Article
Albers, Susanne
Koga, Hisashi
1998New on-line algorithms for the page replication problem
In: Journal of Algorithms [27], 75-96
Journal Article
Albers, Susanne
Koga, Hisashi
1995Page migration with limited local memory capacity
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 412-158
Proceedings Article
Albers, Susanne
Kursawe, Klaus
1999Exploring unknown environments with obstacles
In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), 842-843
Proceedings Article
Albers, Susanne
Kursawe, Klaus
Schuierer, Sven
2002Exploring unkown environments with obstacles
In: Algorithmica [32], 123-143
Journal Article
Albers, Susanne
Mitzenmacher, Michael
2000Average-Case Analyses of First Fit and Random Fit Bin Packing
In: Random Structures & Algorithms [16], 240 - 259
Journal Article
Albers, Susanne
Mitzenmacher, Michael
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
Proceedings Article
Albers, Susanne
Mitzenmacher, Michael
1998Average case analyses of list update algorithms, with applications to data compression
In: Algorithmica [21], 312-329
Journal Article
Albers, Susanne
Mitzenmacher, Michael
1997Revisiting the COUNTER algorithms for list update
In: Information Processing Letters [64], 155-160
Journal Article
Albers, Susanne
Mitzenmacher, Michael
1996Average Case Analysis of List Update Algorithms, with Applications to Data Compression
In: Automata, Languages and Programming: 23rd International Colloquium (ICALP'96), 514-525
Proceedings Article
Albers, Susanne
von Stengel, Bernhard
Wechner, Ralph
1995A combined BIT and TIMESTAMP algorithm for the list update problem
In: Information Processing Letters [56], 135-139
Journal Article
Albers, Susanne
Westbrook, Jeffery
1998Self-organizing data structures
In: Online Algorithms: The State of the Art, 13-51
Part of a Book
Alberts, David
Cattaneo, G
Italiano, Giuseppe
Nanni, Umberto
Zaroliagis, Christos
1998A Software Library of Dynamic Graph Algorithms
In: Proceedings of Workshop on Algorithms and Experiments (ALEX-98), 129-136
Proceedings Article
Albrecht, Jung, Mehlhorn (ed.)1987Parallel algorithms and architectures (WPAA-87) : international workshopProceedings
Albrecht, Jung, Mehlhorn (ed.)1987Parallel algorithms and architectures : International WorkshopProceedings
Albrecht, Marc
Karrenbauer, Andreas
Xu, Chihao
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
Proceedings Article
Alcaraz, Nicolas
Friedrich, Tobias
Kötzing, Timo
Krohmer, Anton
Müller, Joachim
Pauling, Josch
Baumbach, Jan
2012Efficient key pathway mining: combining networks and OMICS data
In: Integrative Biology [4], 756-764
Journal Article
Alefragis, Panayiotis
Goumopoulos, Christos
Sanders, Peter
Takkula, Tuomo
Wedelin, Dag
1998Parallel Crew Scheduling in PAROS
In: Proceedings of the 4th International Euro-Par Conference (Euro-Par-98), 1104-1113
Proceedings Article
Alkassar, Eyad
Böhme, Sascha
Mehlhorn, Kurt
Rizkallah, Christine
2013A Framework for the Verification of Certifying ComputationsUnpublished/Draft
Alon, Noga
Bradford, Phillip Gnassi
Fleischer, Rudolf
1996Matching nuts and bolts faster
In: Information Processing Letters [59], 123-127
Journal Article
Show details for Altenkamp, Doris
Mehlhorn, KurtAltenkamp, Doris
Mehlhorn, Kurt
1978Codes: Unequal Probabilities, Unequal Letter CostReport
Altenkamp, Doris
Mehlhorn, Kurt
1978Codes: Unequal Probabilities, Unequal Letter Cost
In: Automata, languages and programming (ICALP-78): 5th international colloquium, 15-25
Proceedings Article
Althaus, Ernst2001Curve Reconstruction and the Traveling Salesman Problem
Universität des Saarlandes
Thesis - Doctoral dissertation
Althaus, Ernst
Baumann, Tobias
Schömer, Elmar
Werth, Kai
2007Trunk Packing Revisited
In: Experimental Algorithms, 6th International Workshop, 420-432
Proceedings Article
Althaus, Ernst
Bockmayr, Alexander
Elf, Matthias
Kasper, Thomas
Jünger, Michael
Mehlhorn, Kurt
2002Attachment IconSCIL - Symbolic Constraints in Integer Linear Programming.
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 75-87
Proceedings Article
Show details for Althaus, Ernst
Calinescu, Gruia
Mandoiu, Ion
Prasad, Sushil
Tchervenski, Nickolay
Zelikovsly, AlexanderAlthaus, Ernst
Calinescu, Gruia
Mandoiu, Ion
Prasad, Sushil
Tchervenski, Nickolay
Zelikovsly, Alexander
2006Power efficient range assignment for symmetric connectivity in static ad-hoc wireless networks
In: Wireless Networks [12], 287-299
Journal Article
Althaus, Ernst
Calinescu, Gruia
Mandoiu, Ion
Prasad, Sushil
Tchervenski, Nickolay
Zelikovsly, Alexander
2003Power Efficient Range Assignment in Ad-hoc Wireless
In: Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC-03), 1889-1894
Proceedings Article
Althaus, Ernst
Canzar, Stefan
2008A Lagrangian relaxation approach for the multiple sequence alignment problem
In: Journal of Combinatorial Optimization [16], 127-154
Journal Article
Althaus, Ernst
Canzar, Stefan
2008LASA: A tool for non-heuristic alignment of multiple sequences
In: Bioinformatics Research and Development (BIRD’08), 489-498
Proceedings Article
Althaus, Ernst
Canzar, Stefan
2007A Lagrangian relaxation approach for the multiple sequence alignment problem
In: Combinatorial Optimization and Applications : First International Conference, COCOA 2007, 267-278
Proceedings Article
Althaus, Ernst
Canzar, Stefan
Elbassioni, Khaled
Karrenbauer, Andreas
Mestre, Julian
2011Approximation Algorithms for the Interval Constrained Coloring Problem
In: Algorithmica [61], 342-361
Journal Article
Althaus, Ernst
Canzar, Stefan
Elbassioni, Khaled
Karrenbauer, Andreas
Mestre, Julián
2008Approximating the Interval Constrained Coloring Problem
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), 210-221
Proceedings Article
Althaus, Ernst
Canzar, Stefan
Emmett, Mark
Karrenbauer, Andreas
Marshall, Alan
Meyer-Bäse, Anke
Zhang, Huimin
2008Computing H/D-exchange speeds of single residues from data of peptic fragments
In: 23rd Annual ACM Symposium on Applied Computing (SAC), 1273-1277
Proceedings Article
Althaus, Ernst
Caprara, Alberto
Lenhof, Hans-Peter
Reinert, Knut
2006Aligning multiple sequences by cutting planes
In: Mathematical Programming [2006], 387-425
Journal Article
Althaus, Ernst
Caprara, Alberto
Lenhof, Hans-Peter
Reinert, Knut
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
Proceedings Article
Althaus, Ernst
Duchier, Denys
Koller, Alexander
Mehlhorn, Kurt
Niehren, Joachim
Thiel, Sven
2003Attachment IconAn Efficient Algorithm for the Configuration Problem of Dominance Graphs
In: Journal of Algorithms [48], 194-219
Journal Article
Althaus, Ernst
Duchier, Denys
Koller, Alexander
Mehlhorn, Kurt
Niehren, Joachim
Thiel, Sven
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
Proceedings Article
Althaus, Ernst
Dumitriu, Daniel
2009Fast and Accurate Bounds on Linear Programs
In: Experimental Algorithms : 8th International Symposium on Experimental Algorithms (SEA 2009), 40-50
Proceedings Article
Althaus, Ernst
Eisenbrand, Friedrich
Funke, Stefan
Mehlhorn, Kurt
2004Attachment IconPoint Containment in the Integer Hull of a Polyhedron
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 929-933
Proceedings Article
Althaus, Ernst
Fink, Christian
2002A Polyhedral Approach to Surface Reconstruction from Planar Contours.
In: Proceedings of the 9th International Conference on Integer Programming and Combinatorial Optimization, 258-272
Proceedings Article
Althaus, Ernst
Karamanis, Nikiforos
Koller, Alexander
2004Computing Locally Coherent Discourses.
In: Proceedings of the conference and workshops, 42nd annual meeting of the Association for Computational Linguistics, 399-406
Proceedings Article
Althaus, Ernst
Kohlbacher, Oliver
Lenhof, Hans-Peter
Müller, Peter
2002A combinatorial approach to protein docking with flexible side chains
In: Journal of Computational Biology [9], 597-612
Journal Article
Althaus, Ernst
Kupilas, Joschka
Naujoks, Rouven
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
Proceedings Article
Althaus, Ernst
Mehlhorn, Kurt
2001Attachment IconTraveling Salesman-Based Curve Reconstruction in Polynomial Time
In: SIAM Journal on Computing [31], 27-66
Journal Article
Althaus, Ernst
Mehlhorn, Kurt
2000TSP-Based Curve Reconstruction in Polynomial Time
In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00), 686-695
Proceedings Article
Althaus, Ernst
Mehlhorn, Kurt
Näher, Stefan
Schirra, Stefan
2000Attachment IconExperiments on curve reconstruction
In: Proceedings of 2nd Workshop on Algorithm Engineering and Experiments (ALENEX-00), 103-114
Electronic Proceedings Article
Althaus, Ernst
Naujoks, Rouven
2008Reconstructing Phylogenetic Networks with One Recombination
In: Experimental Algorithms, 7th International Workshop, WEA 2008, 275-288
Proceedings Article
Althaus, Ernst
Naujoks, Rouven
2006Attachment IconComputing Steiner Minimal Trees in Hamming Metric
In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06, 172-181
Proceedings Article
Althaus, Ernst
Polzin, Tobias
Vahdati Daneshmand, Siavash
2003Improving Linear Programming Approaches for the Steiner Tree Problem
In: Experimental and efficient algorithms : Second International Workshop, WEA 2003, 1-14
Proceedings Article
Alt, Helmut
Blum, Norbert
Mehlhorn, Kurt
Paul, Markus
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
Journal Article
Alt, Helmut
Fleischer, Rudolf
Kaufmann, Michael
Mehlhorn, Kurt
Näher, Stefan
Schirra, Stefan
Uhrig, Christian
1992Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
In: Algorithmica [8], 391-408
Journal Article
Alt, Helmut
Fleischer, Rudolf
Kaufmann, Michael
Mehlhorn, Kurt
Näher, Stefan
Schirra, Stefan
Uhrig, Christian
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
Proceedings Article
Alt, Helmut
Geffert, Viliam
Mehlhorn, Kurt
1992Attachment IconA lower bound for the nondeterministic space complexity of context-free recognition
In: Information Processing Letters [42], 25-27
Journal Article
Alt, Helmut
Guibas, L.
Mehlhorn, Kurt
Karp, Richard M.
Wigderson, A.
1996Attachment IconA Method for Obtaining Randomized Algorithms with Small Tail Probabilities
In: Algorithmica [16], 543-547
Journal Article
Alt, Helmut
Guibas, L.
Mehlhorn, Kurt
Karp, Richard M.
Wigderson, A.
1991Attachment IconA Method for Obtaining Randomized Algorithms with Small Tail ProbabilitiesReport
Alt, Helmut
Hagerup, Torben
Mehlhorn, Kurt
Preparata, Franco P.
1986Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
In: Mathematical Foundations of Computer Science, 12th Symposium (MFCS 1986), 199-208
Proceedings Article
Alt, Helmut
Hagerup, Torben
Mehlhorn, Kurt
Preparata, Franco P.
1985Deterministic simulation of idealized parallel computers on more realistic onesReport
Alt, Helmut
Hagerup,Torben
Mehlhorn, Kurt
Preparata, Franco P.
1987Attachment IconDeterministic Simulation of Idealized Parallel Computers on more Realistic Ones
In: Parallel Algorithms and Architectures : International Workshop, 11-15
Proceedings Article
Alt, Helmut
Mehlhorn, Kurt
1985Attachment IconSearching Semisorted Tables
In: SIAM Journal on Computing [14], 840-848
Journal Article
Alt, Helmut
Mehlhorn, Kurt
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
Journal Article
Alt, Helmut
Mehlhorn, Kurt
1978Complexity Arguments in Algebraic Language TheoryReport
Alt, Helmut
Mehlhorn, Kurt
1976Attachment IconLower Bounds for the Space Complexity of Context-Free Recognition
In: Third International Colloquium on Automata, Languages and Programming, 338-354
Proceedings Article
Alt, Helmut
Mehlhorn, Kurt
1975Attachment IconA Language over a One Symbol Alphabet Requiring only O(log log n) Space
In: SIGACT News [7], 31-33
Journal Article
Alt, Helmut
Mehlhorn, Kurt
1975Untere Schranken für den Platzbedarf bei der kontext-freien AnalyseReport
Alt, Helmut
Mehlhorn, Kurt
Munro, J.
1984On the complexity of partial match retrieval
In: Information Processing Letters [19], 61-65
Journal Article
Alt, Helmut
Mehlhorn, Kurt
Munro, J. Ian
1984Attachment IconPartial match retrieval in implicit data structures
In: Information Processing Letters [19], 61-65
Journal Article
Alt, Helmut
Mehlhorn, Kurt
Munro, J. Ian
1981Partial Match Retrieval in Implicit Data Structures
In: Mathematical foundations of computer science (MFCS-81) : 10th symposium, ,, 156-161
Proceedings Article
Alt, Helmut
Mehlhorn, Kurt
Wagener, Hubert
Welzl, Emo
1988Attachment IconCongruence, Similarity, and Symmetries of Geometric Objects
In: Discrete and Computational Geometry [3], 237-256
Journal Article
Alt, Helmut
Mehlhorn, Kurt
Wagener, Hubert
Welzl, Emo
1987Attachment IconCongruence, similarity and symmetries of geometric objectsReport
Alt, Helmut
Mehlhorn, Kurt
Wagener, Hubert
Welzl, Emo
1987Convergence, Similarity and Symmetries of Geometric Objects
In: Computational geometry (SCG-87) : 3rd symposium, 308-315
Proceedings Article
Alvarez, Victor
Bringmann, Karl
Curticapean, Radu
Ray, Saurabh
2012Attachment IconCounting Crossing Free Structures
In: Proceedings of the Twenty-Eight Annual Symposium on Computational Geometry (SCG'12), 61-68
Proceedings Article
Alvarez, Victor
Bringmann, Karl
Ray, Saurabh
Seidel, Raimund
2013Counting Triangulations Approximately
In: 25th Canadian Conference on Computational Geometry (CCCG-13), 85-89
Proceedings Article
Amaldi, Edoardo
Iuliano, Claudio
Jurkiewicz, Tomasz
Mehlhorn, Kurt
Rizzi, Romeo
2009Breaking the $O(m^2n)$ Barrier for Minimum Cycle Bases
In: Algorithms - ESA 2009 : 17th Annual European Symposium, 301-312
Proceedings Article
Amato, Nancy M.
Goodrich, Michael T.
Ramos, Edgar A.
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
Proceedings Article
Amini, Omid
Manjunath, Madhusudan
2010Riemann-Roch for sublattices of the root lattice $A\_n$
In: Electronic Journal of Combinatorics [17], R124,1-R124,50
Electronic Journal Article
Amini, Omid
Peleg, David
Pérennes, Stéphane
Sau, Ignasi
Saurabh, Saket
2009Degree-Constrained Subgraph Problems: Hardness and Approximation Results
In: Approximation and Online Algorithms : 6th International Workshop, WAOA 2008, 29-42
Proceedings Article
Amini, Omid
Pérennes, Stéphane
Sau, Ignasi
2009Hardness and approximation of traffic grooming
In: Theoretical Computer Science [410], 3751-3760
Journal Article
Anagnostopoulos, Aris
Grandoni, Fabrizio
Leonardi, Stefano
Wiese, Andreas
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),
Proceedings Article
Anand, S
Bringmann, Karl
Friedrich, Tobias
Garg, Naveen
Kumar, Amit
2013Minimizing maximum (weighted) flow-time on related and unrelated machines
In: Automata, Languages, and Programming - 40th International Colloquium (ICALP-13), 13-24
Proceedings Article
Anand, S.
Garg, Naveen
Megow, Nicole
2011Meeting deadlines: How much speed suffices?
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011. - Pt. I, 232-243
Proceedings Article
Andersson, Arne
Hagerup, Torben
Hastad, Johan
Petersson, Ola
2000Tight bounds for searching a sorted array of strings
In: SIAM Journal on Computing [30], 1552-1578
Journal Article
Andersson, Arne
Hagerup, Torben
Nilsson, Stefan
Raman, Rajeev
1995Sorting in Linear Time?
In: 27th Annual ACM Symposium on Theory of Computing (STOC95), 427-436
Proceedings Article
Andreou, Maria
Fotakis, Dimitris
Nikoletseas, Sotiris
Papadopoulou, Vicky
Spirakis, Paul G.
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
Proceedings Article
Angelopoulos, Spyros2010On the Competitiveness of the Online Asymmetric and Euclidean Steiner Tree Problems
In: Approximation and Online Algorithms : 7th International Workshop, WAOA 2009, 1-12
Proceedings Article
Angelopoulos, Spyros2009Online Priority Steiner Tree Problems
In: Algorithms and Data Structures : 11th International Symposium, WADS 2009, 37-48
Proceedings Article
Angelopoulos, Spyros2008A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry
In: 16th Annual European Symposium on Algorithms (ESA 2008), 76-87
Proceedings Article
Angelopoulos, Spyros
Borodin, Allan
2010Randomized Priority Algorithms
In: Theoretical Computer Science [411], 2542-2558
Journal Article
Angelopoulos, Spyros
Doerr, Benjamin
Huber, Anna
Panagiotou, Konstantinos
2009Tight bounds for quasirandom rumor spreading
In: The Electronic Journal of Combinatorics [16], R102,1-R102,19
Electronic Journal Article
Angelopoulos, Spyros
Dorrigiv, Reza
Lopez-Ortiz, Alejandro
2008List Update with Locality of Reference
In: 8th Latin American Symposium on Theoretical Informatics (LATIN 2008), 399-410
Proceedings Article
Angelopoulos, Spyros
Lopez-Ortiz, Alejandro
2009Intertruptible Algorithms for Multi Problem Solving
In: Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI 09), 380-386
Proceedings Article
Angelopoulos, Spyros
Lopez-Ortiz, Alejandro
Hamel,Angele
2008Optimal Scheduling of Contract Algorithms with Soft Deadlines
In: 23rd National Conference on Artificial Intelligence (AAAI 2008), 868-873
Proceedings Article
Angelopoulos, Spyros
Schweitzer, Pascal
2009Paging and List Update under Bijective Analysis
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 1136-1145
Proceedings Article
Anshelevich, Elliot
Bhardwaj, Onkar
Hoefer, Martin
2013Friendship and Stable Matching.
In: 21st European Symposium on Algorithms (ESA-13), 49-60
Proceedings Article
Antoniadis, Antonios
Huang, Chien-Chung
Ott, Sebastian
Verschae, José
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
Proceedings Article
Aranov, Boris
Asano, Tetsuo
Katoh, Naoki
Mehlhorn, Kurt
Tokuyama, Takeshi
2004Attachment IconPolyline Fitting of Planar Points Under Min-sum Criteria
In: Algorithms and Computation: 15th International Symposium, ISAAC 2004, 77-88
Proceedings Article
Arge, Lars
Meyer, Ulrich
Toma, Laura
2004External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs
In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, 146-157
Proceedings Article
Arge, Lars
Meyer, Ulrich
Toma, Laura
Zeh, Norbert
2003On external-memory planar depth first search
In: Journal of Graph Algorithms and Applications [7], 105-129
Journal Article
Arge, Lars
Meyer, Ulrich
Toma, Laura
Zeh, Norbert
2001On External-Memory Planar Depth First Search
In: Proceedings of the 7th International Workshop on Algorithms and Data Structures (WADS-01), 471-482
Proceedings Article
Arikati, Srinivasa Rao
Chaudhuri, Shiva
Zaroliagis, Christos
1998All-Pairs Min-Cut in Sparse Networks
In: Journal of Algorithms [29], 82-110
Journal Article
Arikati, Srinivasa Rao
Chaudhuri, Shiva
Zaroliagis, Christos
1995All-Pairs Min-Cut in Sparse Networks
In: Foundations of software technology and theoretical computer science (FSTTCS-95) : 15th conference, 363-376
Proceedings Article
Arikati, Srinivasa Rao
Chen, Danny Z.
Chew, L. Paul
Das, Gautam
Smid, Michiel
Zaroliagis, Christos
1996Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane
In: Algorithms - ESA '96: 4th Annual European Symposium, 514-528
Proceedings Article
Arikati, Srinivasa Rao
Dessmark, Anders
Lingas, Andrzej
Marathe, Madhav V.
2001Approximation algorithms for maximum two-dimensional pattern matching
In: Theoretical Computer Science [255], 51-62
Journal Article
Arikati, Srinivasa Rao
Dessmark, Anders
Lingas, Andrzej
Marathe, Madhav V.
1996Approximation algorithms for maximum two-dimensional pattern matching
In: Combinatorial Pattern Matching: 7th Annual Symposium, CPM96, 348-360
Proceedings Article
Arikati, Srinivasa Rao
Maheshwari, Anil
1996Realizing degree sequences in parallel
In: SIAM Journal of Computing [9], 317-338
Journal Article
Arikati, Srinivasa Rao
Maheshwari, Anil
Zaroliagis, Christos
1997Efficient Computation of implicit representations of sparse graphs
In: Discrete Applied Mathematics [78], 1-16
Journal Article
Arikati, Srinivasa Rao
Mehlhorn, Kurt
1999Attachment IconA correctness certificate for the Stoer-Wagner min-cut algorithm
In: Information Processing Letters [70], 251-254
Journal Article
Aronov, Boris
Asano, Tetsuo
Funke, Stefan
2007Optimal Triangulation with Steiner Points
In: Algorithms and Computation : 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007. Proceedings, 681-691
Proceedings Article
Arya, Sunil
Das, Gautam
Mount, David M.
Salowe, Jeffrey S.
Smid, Michiel
1995Euclidean spanners: short, thin, and lanky
In: 27th Annual ACM Symposium on Theory of Computing (STOC95), 489-498
Proceedings Article
Arya, Sunil
Golin, Mordecai J.
Mehlhorn, Kurt
1999On the Expected Depth of Random Circuits
In: Combinatorics, Probability and Computing [8], 209-228
Journal Article
Arya, Sunil
Malamatos, Theocharis
Mount, David M.
2007A simple entropy-based algorithm for planar point location
In: ACM Transactions on Algorithms [3], 17
Journal Article
Arya, Sunil
Malamatos, Theocharis
Mount, David M.
2006On the Importance of Idempotence
In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, STOC'06, 564-573
Proceedings Article
Arya, Sunil
Malamatos, Theocharis
Mount, David M.
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
Proceedings Article
Arya, Sunil
Malamatos, Theocharis
Mount, David M.
2005Space-Time Tradeoffs for Approximate Spherical Range Counting
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 535-544
Proceedings Article
Arya, Sunil
Malamatos, Theocharis
Mount, David M.
Wong, Ka Chun
2007Optimal expected-case planar point location
In: SIAM Journal on Computing [37], 584-610
Journal Article
Arya, Sunil
Mount, David M.
1995Approximate range searching
In: 11th Annual ACM Symposium on Computational Geometry (SCG95), 172-181
Proceedings Article
Arya, Sunil
Mount, David M.
Narayan, Oruttom
1996Accounting for boundary effects in nearest neighbor searching
In: Discrete & Computational Geometry [16], 155-176
Journal Article
Arya, Sunil
Mount, David M.
Narayan, Oruttom
1995Accounting for boundary effects in nearest neighbor searching
In: 11th Annual ACM Symposium on Computational Geometry (SCG95), 336-344
Proceedings Article
Arya, Sunil
Smid, Michiel
1997Efficient construction of a bounded degree spanner with low weight
In: Algorithmica [17], 33-54
Journal Article
Asano, Tetsuo
Doerr, Benjamin
2011Memory-constrained algorithms for shortest path problem
In: 23rd Annual Canadian Conference on Computational Geometry (CCCG 2011), 315-319
Proceedings Article
Ashoff, Oliver2000Agorithmen der modularen Arithmetik
Universität des Saarlandes
Thesis - Master's thesis
Auger, Doerr (ed.)2011Theory of Randomized Search HeuristicsBook
Auletta, Vincenzo
Dinitz, Yefim
Nutov, Zeev
Parente, Domenico
1999A 2-approximation algorithm for finding an optimum 3-vertex-connected spanning subgraph
In: Journal of Algorithms [32], 21-30
Journal Article
Awerbuch, Baruch
Azar, Yossi
Grove, Edward
Kao, Ming-Yang
Krishnan, P.
Vitter, Jeffrey Scott
1995Load Balancing in the Euclidean Norm
In: 36th Annual Symposium on Foundations of Computer Science, 383-391
Proceedings Article
Babenko, Maxim A.
Gawrychowski, Pawel
Kociumaka, Tomasz
Starikovskaya, Tatiana A.
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
Proceedings Article
Bachrach, Ran
El-Yaniv, Ran
Reinstädtler, Martin
2002On the competitive theory and practice of online list accessing algorithms
In: Algorithmica [32], 201-246
Journal Article
Bacik, Roman
Mahajan, Sanjeev
1995Semidefinite programming and its applications to NP problems
In: Computing and Combinatorics: 1st Annual International Conference (COCOON95), 566-575
Proceedings Article
Backes, Werner1998Berechnung kürzester Gittervektoren
Univesität des Saarlandes
Thesis - Master's thesis
Bader, David
Moret, Bernard
Sanders, Peter
2002Algorithm Engineering for Parallel Computation
In: Experimental Algorithmics, 1-23
Part of a Book
Banderier, Cyril2001Combinatoire Analytique des chemins et des cartes
Université de Paris 6
Thesis - Doctoral dissertation
Banderier, Cyril2001Random Maps, Coalescing Saddles, Singularity Analysis, and Airy Phenomena
In: Random Structures & Algorithms [19], 194-246
Journal Article
Banderier, Cyril2000A Generalized Cover Time for Random Walks on Graphs
In: Proceedings of FPSAC'00, 113-124
Proceedings Article
Banderier, Cyril2000Planar Maps and Airy Phenomena,
In: Proceedings of ICALP'00, 388-402
Proceedings Article
Banderier, Cyril1999An Introduction to Analytic Number TheoryMiscellaneous
Banderier, Cyril1999On Generating Functions of Generating Trees
In: Proceedings of FPSAC'99, 40-52
Proceedings Article
Banderier, Cyril
Beier, Rene
Mehlhorn, Kurt
2003Attachment IconSmoothed Analysis of Three Combinatorial Problems
In: Mathematical foundations of computer science 2003 : 28th International Symposium, MFCS 2003, 198-207
Proceedings Article
Banderier, Cyril
Bousquet-Mélou, Mireille
Denise, Alain
Flajolet, Philippe
Gardy, Danièle
Gouyou-Beauchamps, Dominique
2002Generating Functions for Generating Trees
In: Discrete Mathematics [246], 29-55
Journal Article
Banderier, Cyril
Flajolet, Philippe
2002Basic analytic combinatorics of directed lattice paths
In: Theoretical Computer Science [281], 37-80
Journal Article
Bannai, Hideo
Gawrychowski, Pawel
Inenaga, Shunsuke
Takeda, Masayuki
2013Converting SLP to LZ78 in almost Linear Time
In: Combinatorial Pattern Matching, 24th Annual Symposium (CPM 2013), 38-49
Proceedings Article
Bansal, Nikhil
Chan, Ho-Leung
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
Proceedings Article
Bansal, Nikhil
Chan, Ho-Leung
Pruhs, KIrk
2011Competitive Algorithms for Due Date Schedulin
In: Algorithmica [59], 569-582
Journal Article
Bansal, Nikhil
Chan, Ho-Leung
Pruhs, Kirk
2009Speed Scaling with an Arbitrary Power Function
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 693-701
Proceedings Article
Bansal, Nikhil
Gupta, Anupam
Li, Jian
Mestre, Julián
Nagarajan, Viswanath
Rudra, Atri
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
Proceedings Article
Bar-Yehuda, Reuven
Hermelin, Danny
Rawitz, Dror
2011Minimum vertex cover in rectangle graphs
In: Computational Geometry [44], 356-364
Journal Article
Bar-Yehuda, Reuven
Hermelin, Danny
Rawitz, Dror
2010Minimum Vertex Cover in Rectangle Graphs
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. I, 255-266
Proceedings Article
Bárány, Imre
Doerr, Benjamin
2006Attachment IconBalanced partitions of vector sequences
In: Linear Algebra and Its Applications [414], 464-469
Journal Article
Baraque, Raef2002Effiziente Multiplikationsverfahren: ein numerischer Vergleich
Universität des Saarlandes
Thesis - Master's thesis
Barnes, Greg
Edmonds, Jeff A.
1998Time-Space Lower Bounds for Directed st-Connectivity on Graph Automata Models
In: SIAM Journal on Computing [27], 1190-1202
Journal Article
Bartal, Yair
Leonardi, Stefano
Shallom, Gill
Sitters, Rene
2006On the value of preemption in scheduling
In: 9th Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX, 39-48
Proceedings Article
Baruah, Sanjoy
Bonifaci, Vincenzo
D'Angelo, Gianlorenzo
Li, Haohan
Marchetti-Spaccamela, Alberto
Megow, Nicole
Stougie, Leen
2012Scheduling Real-Time Mixed-Criticality Jobs
In: IEEE Transactions on Computers [61], 1140-1152
Journal Article
Barve, Rakesh D.
Grove, Edward
Vitter, Jeffrey Scott
1995An Application-Controlled Paging Algorithm for a Shared Cache
In: 36th Annual Symposium on Foundations of Computer Science, 204-213
Proceedings Article
Basit, Abdul
Mustafa, Nabil H.
Ray, Saurabh
Raza, Sarfraz
2010Centerpoints and Tverberg's technique
In: Computational Geometry [43], 593-600
Journal Article
Bäsken, Matthias
Brönnimann, Hervé
Frank, Da
Devillers, Olivier
Ester, Ezra
Fabri, Andreas
Flato, Eyal
Gärtner, Bernd
Giezeman, Geert-Jan
Halperin, Dan
Hanniel, Iddo
Har-Peled, Sariel
Herrmann, Thomas
Hert, Susan
Hirsch, Shai
Hoffmann, Michael
Kettner, Lutz
Nechushtan, Oren
Neyer, Gabriele
Pasechnik, Dmitrii
Pion, Sylvain
Schirra, Stefan
Schönherr, Sven
Seel, Michael
Teillaud, Monique
Veltkamp, Remco
Wein, Ron
Wesselink, Wieger
Yvinec, Mariette
2001CGAL Reference and User ManualsUnknown Form: eBookForm
Bast, Hannah2009Car or Public Transport -- Two Worlds
In: Efficient Algorithms : Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday, 355-367
Part of a Book
Bast, Hannah2002Scheduling at Twilight the Easy Way
In: STACS 2002 : 19th Annual Symposium on Theoretical Aspects of Computer Science, 166-178
Proceedings Article
Bast, Hannah1994Fast Parallel Space Allocation, Estimation and Integer Sorting
Universität des Saarlandes
Thesis - Master's thesis
Bast, Hannah
Hagerup, Torben
1995Fast Parallel Space Allocation, Estimation, and Integer Sorting
In: Information and Computation [123], 72-110
Journal Article
Bast, Holger2006Intelligente Suche mit garantiert schnellen Antwortzeiten
In: MPG Jahrbuch [?],
Electronic Journal Article
Bast, Holger2005Attachment IconPräzisionssuche im homöopathischen Netz
In: Homöopathie-Zeitschrift [I/05], 119-122
Journal Article
Bast, Holger
Chitea, Alexandru
Suchanek, Fabian
Weber, Ingmar
2007ESTER: Efficient Search in Text, Entities, and Relations
In: 30th International Conference on Research and Development in Information Retrieval (SIGIR'07), 671-678
Proceedings Article
Bast, Holger
Dietzfelbinger, Martin
Hagerup, Torben
1992A Perfect Parallel Dictionary
In: 17th International Symposium on Mathematical Foundations of Computer Science (MFCS'92), 133-141
Proceedings Article
Bast, Holger
Dupret, Georges
Majumdar, Debapriyo
Piwowarski, Benjamin
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
Proceedings Article
Bast, Holger
Funke, Stefan
Matijevic, Domagoj
2009Ultrafast shortest-path queries via transit nodes
In: The shortest path problem : ninth DIMACS implemenation challenge, 175-192
Part of a Book
Bast, Holger
Funke, Stefan
Matijevic, Domagoj
2006TRANSIT: Ultrafast Shortest-Path Queries with Linear-Time Preprocessing
In: 9th DIMACS Implementation Challenge --- Shortest Path,
Electronic Proceedings Article
Bast, Holger
Funke, Stefan
Matijevic, Domagoj
Sanders, Peter
Schultes, Dominik
2007In Transit to Constant Time Shortest-Path Queries in Road Networks
In: 9th Workshop on Algorithm Enginneering and Experiments (ALENEX'07), 46-59
Proceedings Article
Bast, Holger
Funke, Stefan
Sanders, Peter
Schultes, Dominik
2007Fast Routing in Road Networks using Transit Nodes
In: Science [316], 566
Journal Article
Bast, Holger
Hagerup, Torben
1991Fast and Reliable Parallel Hashing
In: 3rd Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'91), 50-61
Proceedings Article
Bast, Holger
Majumdar, Debapriyo
Schenkel, Ralf
Theobald, Martin
Weikum, Gerhard
2006IO-Top-k at TREC 2006: Terabyte Track
In: The Fifteenth Text Retrieval Conference Proceedings, TREC 2006, 1-5
Electronic Proceedings Article
Bast, Holger
Majumdar, Debapriyo
Schenkel, Ralf
Theobald, Martin
Weikum, Gerhard
2006Attachment IconIO-Top-k: Index-Access Optimized Top-k Query ProcessingReport
Bast, Holger
Majumdar, Debapriyo
Schenkel, Ralf
Theobald, Martin
Weikum, Gerhard
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
Proceedings Article
Bast, Holger
Mehlhorn, Kurt
Schäfer, Guido
Tamaki, Hisao
2006Attachment IconMatching Algorithms are Fast in Sparse Random Graphs
In: Theory of Computing Systems [39], 3-14
Journal Article
Bast, Holger
Mehlhorn, Kurt
Schäfer, Guido
Tamaki, Hisao
2004Attachment IconMatching Algorithms Are Fast in Sparse Random Graphs
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 81-92
Proceedings Article
Bast, Holger
Mortensen, Christian Worm
Weber, Ingmar
2006Attachment IconOutput-Sensitive Autocompletion Search
In: String Processing and Information Retrieval : 13th International Conference, SPIRE 2006, 150-162
Proceedings Article
Bast, Holger
Weber, Ingmar
2007Managing Helpdesk Tasks with CompleteSearch: A Case Study
In: 4th Conference on Professional Knowledge Management (WM'07), 101-108
Proceedings Article
Bast, Holger
Weber, Ingmar
2007Attachment IconThe CompleteSearch Engine: Interactive, Efficient, and Towards IR & DB integration
In: CIDR 2007 : 3rd Biennial Conference on Innovative Data Systems Research, 88-95
Electronic Proceedings Article
Bast, Holger
Weber, Ingmar
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
Proceedings Article
Bast, Holger
Weber, Ingmar
2006When You're Lost For Words: Faceted Search With Autocompletion
In: SIGIR'06 Workshop on Faceted Search, 31-35
Proceedings Article
Bast, Holger
Weber, Ingmar
2005Don't Compare Averages
In: 4th International Workshop on Efficient and Experimental Algorithms (WEA'05), 67-76
Proceedings Article
Bast, Holger
Weber, Ingmar
2005Insights from Viewing Ranked Retrieval as Rank Aggregation
In: Workshop on Challenges in Web Information Retrieval and Integration (WIRI'05), 243-248
Proceedings Article
Baswana, Surender
Biswas, Somenath
Doerr, Benjamin
Friedrich, Tobias
Kurur, Piyush P.
Neumann, Frank
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
Proceedings Article
Baswana, Surender
Kavitha, Telikepalli
Mehlhorn, Kurt
Pettie, Seth
2011Additive Spanners and (α, β)-Spanners
In: ACM Transactions on Algorithms [7], 5:1-5:26
Journal Article
Baswana, Surender
Sen, Sandeep
2007A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
In: Random Structures & Algorithms [30], 532-563
Journal Article
Baswana, Surender
Telikepalli, Kavitha
Mehlhorn, Kurt
Pettie, Seth
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
Proceedings Article
Batra, Prashant
Sharma, Vikram
2010Bounds on absolute positiveness of multivariate polynomials
In: Journal of Symbolic Computation [45], 617-628
Journal Article
Baumbach, Jan
Friedrich, Tobias
Kötzing, Timo
Krohmer, Anton
Müller, Joachim
Pauling, Josch
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
Proceedings Article
Baumgarten, Hanna
Jung, Hermann
Mehlhorn, Kurt
1994Attachment IconDynamic point location in general subdivisions
In: Journal of Algorithms [3], 342-380
Journal Article
Baumgarten, Hanna
Jung, Hermann
Mehlhorn, Kurt
1992Dynamic Point Location in General Subdivisions
In: Discrete algorithms (SODA-92) : 3rd annual ACM-SIAM symposium, 250-258
Proceedings Article
Baus, Andreas2005Symbolic Constraints in Linear Integer Programming
Universität des Saarlandes
Thesis - Master's thesis
Baus, Andreas2004Symbolic Constraints in Linear Integer Programming
Universität des Saarlandes
Thesis - Master's thesis
Becchetti, Luca
Leonardi, Stefano
Marchetti-Spaccamela, Alberto
Schäfer, Guido
2003Scheduling to minimize flow time metrics
In: International Parallel and Distributed Processing Symposium (IPDPS-03), 223b-CDROM
Proceedings Article
Becchetti, Luca
Leonardi, Stefano
Marchetti-Spaccamela, Alberto
Schäfer, Guido
Vredeveld, Tjark
2003Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm
In: 44th Annual Symposium on Foundations of Computer Science (FOCS-03), 462-471
Proceedings Article
Becker, Jörg1996Allgemeine approximative Kongruenz zweier Punktmengen im R³
Universität des Saarlandes
Thesis - Master's thesis
Becker, Michael
Degenhardt, W.
Doenhardt, J.
Hertel, S.
Kaninke, G.
Kerber, W.
Mehlhorn, Kurt
Näher, Stefan
Rohnert, H.
Winter, T.
1982Attachment IconA Probabilistic Algorithm for Vertex Connectivity of Graphs
In: Information Processing Letters [15], 135-136
Journal Article
Becker, Michael
Mehlhorn, Kurt
1986Attachment IconAlgorithms for Routing in Planar Graphs
In: Acta Informatica [23], 163-176
Journal Article
Becker, Michael
Mehlhorn, Kurt
1984Attachment IconAlgorithms for routing in planar graphsReport
Becker, Ruben2012The Bolzano Method to Isolate the Roots of a Bitstream Polynomial
Universität des Saarlandes
Thesis - Bachelor thesis
Behle, Markus2007Attachment IconOn threshold BDDs and the optimal variable ordering problem
In: Combinatorial Optimization and Applications : First International Conference, COCOA 2007, 124-135
Proceedings Article
Behle, Markus
Jünger, Michael
Liers, Frauke
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
Proceedings Article
Behrens, Christian2000Solid Modeling durch Boolesche Operationen
Universität des Saarlandes
Thesis - Master's thesis
Beier, Rene2004Probabilistic Analysis of Discrete Optimization Problems
Universität des Saarlandes
Thesis - Doctoral dissertation
Beier, Rene2000Eine Heuristik für das Gossiping-Problem
Universität des Saarlandes
Thesis - Master's thesis
Beier, Rene
Funke, Stefan
Matijevic, Domagoj
Sanders, Peter
2011Energy-Efficient Paths in Radio Networks
In: Algorithmica [61], 298-319
Journal Article
Beier, Rene
Krysta, Piotr
Czumaj, Artur
Vöcking, Berthold
2004Computing Equilibria for Congestion Games with (Im)perfect Information
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 739-748
Proceedings Article
Beier, René
Röglin, Heiko
Vöcking, Berthold
2007Attachment IconThe Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
In: Integer Programming and Combinatorial Optimization : 12th International IPCO Conference, 53-67
Proceedings Article
Beier, Rene
Sanders, Peter
Sivadasan, Naveen
2002Energy Optimal Routing in Radio Networks Using Geometric Data Structures
In: Automata, Languages and Programming : 29th International Colloquium, ICALP 2002, 366-376
Proceedings Article
Beier, Rene
Sibeyn, Jop F.
2000A powerful heuristic for telephone gossiping
In: Proceedings of the 7th International Colloquium on Structural Information and Communication Complexity (SIROCCO-00), 17-36
Proceedings Article
Bei, Xiaohui2015Solving 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
Proceedings Article
Beldiceanu, Nicolas
Carlsson, Mats
Thiel, Sven
2003Sweep Synchronization as a Global Propagation Mechanism
In: Fifth International Workshop on Integration of AI and OR Techniques
in Constraint Programming for Combinatorial Optimization Problems, 139-152
Electronic Proceedings Article
Beldiceanu, Nicolas
Katriel, Irit
Thiel, Sven
2007Filtering Algorithms for the Same and UsedBy Constraints
In: Archives of Control Sciences [to appear], to appear
Journal Article
Beldiceanu, Nicolas
Katriel, Irit
Thiel, Sven
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
Proceedings Article
Beldiceanu, Nicolas
Katriel, Irit
Thiel, Sven
2004Attachment IconFiltering algorithms for the Same and UsedBy constraintsReport
Ben-Asher, Y.
Schuster, Assaf
Sibeyn, Jop F.
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
Journal Article
Ben-Zwi, Oren
Hermelin, Danny
Lokshtanov, Daniel
Newman, Ilan
2011Treewidth governs the complexity of target set selection
In: Discrete Optimization [8], 87-96
Journal Article
Berberich, Eric2008Robust and Efficient Software for Problems in 2.5-Dimensional Non-Linear Geometry - Algorithms and Implementations
Universität des Saarlandes
Thesis - Doctoral dissertation
Berberich, Eric2004Exact Arrangements of Quadric Intersection Curves
Universität des Saarlandes
Thesis - Master's thesis
Berberich, Eric
Caroli, Manuel
Wolpert, Nicola
2007Exact Computation of Arrangements of Rotated ConicsReport
Berberich, Eric
Ebert, Franziska
Fogel, Efi
Kettner, Lutz
2006Web-site with benchmark instances for planar curve arrangementsReport
Berberich, Eric
Ebert, Franziska
Kettner, Lutz
2006Definition of file format for benchmark instances for arrangements of QuadricsReport
Berberich, Eric
Eigenwillig, Arno
Emiris, Ioannis
Fogel, Efraim
Hemmer, Michael
Halperin, Dan
Kakargias, Athanasios
Kettner, Lutz
Mehlhorn, Kurt
Pion, Sylvain
Schömer, Elmar
Teillaud, Monique
Wein, Ron
Wolpert, Nicola
2004Attachment IconAn Empirical Comparison of Software for Constructing Arrangements of Curved ArcsReport
Berberich, Eric
Eigenwillig, Arno
Fogel, Efi
Halperin, Dan
Hert, Susan
Kettner, Lutz
Teillaud, Monique
Wein, Ron
2003Specification of the traits classes for CGAL arrangements of curvesReport
Berberich, Eric
Eigenwillig, Arno
Hemmer, Michael
Hert, Susan
Kettner, Lutz
Mehlhorn, Kurt
Reichel, Joachim
Schmitt, Susanne
Schömer, Elmar
Weber, Dennis
Wolpert, Nicola
2004EXACUS: Efficient and Exact Algorithms for Curves and SurfacesReport
Berberich, Eric
Eigenwillig, Arno
Hemmer, Michael
Hert, Susan
Kettner, Lutz
Mehlhorn, Kurt
Reichel, Joachim
Schmitt, Susanne
Schömer, Elmar
Wolpert, Nicola
2005Attachment IconEXACUS: Efficient and exact algorithms for curves and surfaces
In: 13th Annual European Symposium on Algorithms (ESA 2005), 155-166
Proceedings Article
Berberich, Eric
Emeliyanenko, Pavel
2008CGAL's Curved Kernel via AnalysisReport
Berberich, Eric
Emeliyanenko, Pavel
Kobel, Alexander
Sagraloff, Michael
2012Exact Symbolic-Numeric Computation of Planar Algebraic Curves
In: arXiv [abs/1201.1548v1], 1-46
Electronic Journal Article
Berberich, Eric
Emeliyanenko, Pavel
Kobel, Alexander
Sagraloff, Michael
2011Arrangement Computation for Planar Algebraic Curves
In: arXiv [abs/1103.4697],
Electronic Journal Article
Berberich, Eric
Emeliyanenko, Pavel
Kobel, Alexander
Sagraloff, Michael
2011Arrangement Computation for Planar Algebraic Curves
In: Proceedings of the 4th Internal Workshop on Symbolic-Numeric Computation, 88-98
Proceedings Article
Berberich, Eric
Emeliyanenko, Pavel
Sagraloff, Michael
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
Proceedings Article
Berberich, Eric
Emeliyanenko, Pavel
Sagraloff, Michael
2010An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks
In: CoRR [abs/1010.1386], 1-16
Electronic Journal Article
Berberich, Eric
Fogel, Efi
Halperin, Dan
Kerber, Michael
Setter, Ophir
2010Arrangements on Parametric Surfaces II: Concretizations and Applications
In: Mathematics in Computer Science [4], 67-91
Journal Article
Berberich, Eric
Fogel, Efi
Halperin, Dan
Mehlhorn, Kurt
Wein, Ron
2010Arrangements on Parametric Surfaces I: General Framework and Infrastructure
In: Mathematics in Computer Science [4], 45-66
Journal Article
Berberich, Eric
Fogel, Efi
Halperin, Dan
Mehlhorn, Kurt
Wein, Ron
2007Sweeping and Maintaining Two-Dimensional Arrangements on QuadricsReport
Berberich, Eric
Fogel, Efi
Halperin, Dan
Mehlhorn, Kurt
Wein, Ron
2007Attachment IconSweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step
In: Algorithms - ESA 2007, 15th Annual European Symposium, 645-656
Proceedings Article
Berberich, Eric
Fogel, Efi
Meyer, Andreas
2007Updated Website to include Benchmark Instances for Arrangements of Quadrics and Planar Algebraic CurvesReport
Berberich, Eric
Hagen, Matthias
Hiller, Benjamin
Moser, Hannes
2010Experiments
In: Algorithm Engineering : Bridging the Gap between Algorithm Theory and Practice, 325-388
Part of a Book
Berberich, Eric
Halperin, Dan
Kerber, Michael
Pogalnikova, Roza
2012Deconstructing Approximate Offsets
In: Discrete & Computational Geometry [48], 964-989
Journal Article
Berberich, Eric
Halperin, Dan
Kerber, Michael
Pogalnikova, Roza
2011Deconstructing Approximate Offsets
In: arXiv [abs/1109.2158],
Electronic Journal Article
Berberich, Eric
Halperin, Dan
Kerber, Michael
Pogalnikova, Roza
2011Deconstructing Approximate Offsets
In: Proceedings of the 27th Annual Symposium on Computational Geometry (SCG'11), 187-196
Proceedings Article
Berberich, Eric
Halperin, Dan
Kerber, Michael
Pogalnikova, Roza
2010Polygonal Reconstruction from Approximate Offsets
In: 26th European Workshop on Computational Geometry : Workshop Proceedings, 65-68
Electronic Proceedings Article
Berberich, Eric
Hemmer, Michael
2007Definition of the 3D Quadrical Kernel ContentReport
Berberich, Eric
Hemmer, Michael
Karavelas, Menelaos
Pion, Sylvain
Teillaud, Monique
Tsigaridas, Elias
2008Prototype implementation of the algebraic kernelReport
Berberich, Eric
Hemmer, Michael
Karavelas, Menelaos I.
Teillaud, Monique
2007Revision of interface specification of algebraic kernelReport
Berberich, Eric
Hemmer, Michael
Kerber, Michael
2011A Generic Algebraic Kernel for Non-linear Geometric Applications
In: Proceedings of the 27th Annual Symposium on Computational Geometry (SCG'11), 179-186
Proceedings Article
Berberich, Eric
Hemmer, Michael
Kerber, Michael
2010A Generic Algebraic Kernel for Non-linear Geometric ApplicationsReport
Berberich, Eric
Hemmer, Michael
Kettner, Lutz
Schömer, Elmar
Wolpert, Nicola
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
Proceedings Article
Berberich, Eric
Kerber, Michael
2008Attachment IconArrangements on Surfaces of Genus One: Tori and Dupin Cyclides
In: 24th European Workshop on Computational Geometry - Collection of Abstracts, 209-212
Proceedings Article
Berberich, Eric
Kerber, Michael
Sagraloff, Michael
2008Attachment IconGeometric Analysis of Algebraic Surfaces Based on Planar Arrangements
In: 24th European Workshop on Computational Geometry - Collection of Abstracts, 29-32
Proceedings Article
Berberich, Eric
Kettner, Lutz
2007Linear-Time Reordering in a Sweep-line Algorithm for Algebraic Curves Intersecting in a Common PointReport
Berberich, Eric
Meyerovitch, Michal
2007Computing Envelopes of QuadricsReport
Berenbrink, Petra
Cooper, Colin
Friedetzky, Tom
Friedrich, Tobias
Sauerwald, Thomas
2011Randomized Diffusion for Indivisible Loads
In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 429-439
Proceedings Article
Berenbrink, Petra
Friedetzky, Tom
Elsaesser, Robert
Nagel, Lars
Sauerwald, Thomas
2011Faster Coupon Collecting via Replication with Applications in Gossiping
In: 36th International Symposium on Mathematical Foundations of Computer Science (MFCS-11), 72-83
Proceedings Article
Berenbrink, Petra
Hoefer, Martin
Sauerwald, Thomas
2011Distributed Selfish Load Balancing on Networks
In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 1487-1497
Proceedings Article
Berghammer, Rudolf
Friedrich, Tobias
Neumann, Frank
2010Set-based Multi-Objective Optimization, Indicators, and Deteriorative Cycles
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 495-502
Proceedings Article
Berg, Marc de
Kreveld, Marc van
Schirra, Stefan
1995A new approach to subdivision simplification
In: ACSM/ASPRS Annual Convention & Exposition Technical Papers, 79-88
Proceedings Article
Berman, Piotr
Krysta, Piotr
2003Optimizing Misdirection
In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 192-201
Proceedings Article
Berthomé, P.
Duboux, T.
Hagerup, Torben
Newman, I.
Schuster, Assaf
1995Self-Simulation for the Passive Optical Star Model
In: Algorithms-ESA'95: 3rd Annual European Symposium, 268-380
Proceedings Article
Biedl, Therese
Kaufmann, Michael
Mutzel, Petra
1998Drawing Planar Partitions II: HH-Drawings
In: Proceedings of the 24th Workshop on Graph-Theoretic Concepts in Computer Science (WG-98), 124-136
Proceedings Article
Bifet, Albert
Castillo, Carlos
Chirita, Paul-Elexandru
Weber, Ingmar
2005An Analysis of Factors Used in Search Engine Ranking
In: 1st International Workshop on Adversarial Information Retrieval on the Web (AIRWeb'05), 1-10
Electronic Proceedings Article
Bilardi, Gianfranco
Chaudhuri, Shiva
Dubhashi, Devdatt
Mehlhorn, Kurt
1994Attachment IconA lower bound for area-universal graphs
In: Information Processing Letters [51], 101-105
Journal Article
Birk, Rüdiger1997Lösung von Varianten des Post-Office-Problems mit Hilfe von Skip List Range Trees
Universität des Saarlandes
Thesis - Master's thesis
Blanchebarbe, Markus1996Untersuchung zur Implementierung eines parallelen Algorithmus mit guter asymptotischer Laufzeit auf einem Rechner mit verteiltem Speicher und Message-Passing
Universität des Saarlandes
Thesis - Master's thesis
Blelloch, Guy E.
Farzan, Arash
2010Succinct Representations of Separable Graphs
In: Combinatorial Pattern Matching : 21st Annual Symposium, CPM 2010, 138-150
Proceedings Article
Blum, Norbert
Mehlhorn, Kurt
1980Attachment IconOn the Average Number of Rebalancing Operations in Weight-Balanced Trees
In: Theoretical Computer Science [11], 303-320
Journal Article
Blum, Norbert
Mehlhorn, Kurt
1979Attachment IconMittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten Bäumen
In: Theoretical Computer Science, 4th GI-Conference, 67-78
Proceedings Article
Blum, Norbert
Mehlhorn, Kurt
1978On the Average Number of Rebalancing Operations in Weight-Balanced TreesReport
Böcker, Sebastian
Hüffner, Falk
Truss, Anke
Wahlström, Magnus
2009A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams
In: Parameterized and Exact Computation : 4th International Workshop, IWPEC 2009, 38-49
Proceedings Article
Bodirsky, Manuel
Kutz, Martin
2007Determining the consistency of partial tree descriptions
In: Artificial Intelligence [171], 185-196
Journal Article
Bodlaender, Hans L.
Deogun, Jitender S.
Jansen, Klaus
Kloks, Ton
Kratsch, Dieter
Müller, Haiko
Tuza, Zsolt
1998Ranking of Graphs
In: SIAM Journal on Discrete Mathematics [11], 168-181
Journal Article
Bodlaender, Hans L.
Feremans, Corinne
Grigoriev, Alexander
Penninkx, Eelko
Sitters, Rene
Wolle, Thomas
2006On the minimum corridor connection and other generalized geometric problems
In: 4th Workshop on Approximation and Online Algorithms, WAOA, 69-82
Proceedings Article
Bodlaender, Hans L.
Hagerup, Torben
1998Parallel Algorithms with Optimal Speedup for Bounded Treewidth
In: SIAM Journal on Computing [27], 1725-1746
Journal Article
Bodlaender, Hans L.
Hagerup, Torben
1995Parallel Algorithms with Optimal Speedup for Bounded Treewidth
In: Automata, Languages, and Programming: 22nd International Colloquium (ICALP95), 268-279
Proceedings Article
Bogdan, Paul
Sauerwald, Thomas
Stauffer, Alexandre
Sun, He
2013Balls into Bins via Local Search
In: 24th ACM-SIAM Symposium on Discrete Algorithms (SODA-13), 16-34
Electronic Proceedings Article
Bonifaci, Vincenzo
Chan, Ho-Leung
Marchetti-Spaccamela, Alberto
Megow, Nicole
2012Algorithms and Complexity for Periodic Real-Time Scheduling
In: ACM Transactions on Algorithms [9], 601-619
Journal Article
Bonifaci, Vincenzo
Marchetti-Spaccamela, Alberto
Megow, Nicole
Wiese, Andreas
2013Polynomial-Time Exact Schedulability Tests for Harmonic Real-Time Tasks
In: Proceedings of the 34th IEEE Real-Time Systems Symposium (RTSS 2013),
Proceedings Article
Bonifaci, Vincenzo
Marchetti-Spaccamela, Alberto
Stiller, Sebastian
Wiese, Andreas
2013Feasibility Analysis in the Sporadic DAG Task Model
In: Proceedings of the 25th Euromicro Conference on Real-Time Systems (ECRTS 2013),
Proceedings Article
Boros, Endre
Borys, Konrad
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa
Rudolf, Gabor
2007Generating Minimal k-Vertex Connected Spanning Subgraphs
In: Computing and Combinatorics, 13th Annual International Conference, COCOON 2007, Proceedings, 222-231
Proceedings Article
Boros, Endre
Elbassioni, Khaled
Fouz, Mahmoud
Gurvich, Vladimir
Makino, Kazuhisa
Manthey, Bodo
2011Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 147-158
Proceedings Article
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa
2012Every Stochastic Game with Perfect Information Admits a Canonical Form
In: 2nd International ICST Conference on Game Theory for Networks (GameNets 2011),
Unpublished/Draft
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa
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
Journal Article
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa
2011A lower bound for discounting algorithms solving two-person zero-sum limit average payoff stochastic gamesUnpublished/Draft
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa
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
Proceedings Article
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa
2010On effectivity functions of game forms
In: Games and Economic Behavior [68], 512-531
Journal Article
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa
2010On Nash Equilibria and Improvement Cycles in Pure Positional Strategies for Chess-like and Backgammon-like $n$-person GamesUnpublished/Draft
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa
Oudalov, Vladimir
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
Proceedings Article
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Tiwary, Hans Raj
2011The negative cycles polyhedron and hardness of checking some polyhedral properties
In: Annals of Operations Research [188], 63-76
Journal Article
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Tiwary, Hans Raj
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
Journal Article
Boros, Endre
Elbassioni, Khaled
Makino, Kazuhisa
2010Left-to-right multiplication for monotone Boolean dualization
In: SIAM Journal on Computing [39], 3424-3439
Journal Article
Boros, Endre
Elbassioni, Khaled
Makino, Kazuhisa
2008On Berge Multiplication for Monotone Boolean Dualization
In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, 48-59
Proceedings Article
Boros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
2004Attachment IconAlgorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems
In: Algorithms – ESA 2004: 12th Annual European Symposium, 122-133
Proceedings Article
Boros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
Khachiyan, Leonid
2004Attachment IconAn Efficient Implementation of a Joint Generation Algorithm
In: Experimental and efficient algorithms : Third International Workshop, WEA 2004, 114-128
Proceedings Article
Boros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
Khachiyan, Leonid
2004Attachment IconEnumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems
In: Integer programming and combinatorial optimization : 10th International IPCO Conference, 152-162
Proceedings Article
Boros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
Khachiyan, Leonid
2004Attachment IconGenerating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections
In: LATIN 2004: Theoretical Informatics, 6th Latin American Symposium, 488-498
Proceedings Article
Boros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
Khachiyan, Leonid
2003Attachment IconAlgorithms for Enumerating Circuits in Matroids.
In: Algorithms and Computation, 14th International Symposium, ISAAC 2003, 485-494
Proceedings Article
Boros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
Khachiyan, Leonid
Makino, Kazuhisa
2004Attachment IconGenerating Paths and Cuts in Multi-pole (Di)graphs
In: Mathematical foundations of computer science 2004 : 29th International Symposium, MFCS 2004, 298-309
Proceedings Article
Boros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
Khachiyan, Leonid
Makino, Kazuhisa
2003Attachment IconAn Intersection Inequality for Discrete Distributions and Related Generation Problems
In: Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, 543-555
Proceedings Article
Boros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
Makino, Kazuhisa
2007Generating Vertices of Polyhedra and Related Monotone Generation ProblemsUnpublished/Draft
Boros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir
2003Attachment IconAn Efficient Implementation of a Quasi-polynomial Algorithm for Generating Hypergraph Transversals
In: Algorithms - ESA 2003, 11th Annual European Symposium, 556-567
Proceedings Article
Boros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir
2002Attachment IconMatroid Intersections, Polymatroid Inequalities, and Related Problems
In: Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, 143-154
Proceedings Article
Böttcher, Süntje
Doerr, Benjamin
Neumann, Frank
2010Optimal fixed and adaptive mutation rates for the LeadingOnes problem
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 1-10
Proceedings Article
Boullay, Johannes1996Eine parallelisierbare Heuristik für das Min-Cost-Flow Problem
Universität des Saarlandes
Thesis - Master's thesis
Bouziane, Driss
El Kahoui, M'hammed
2002Attachment IconComputation of the dual of a plane projective curve
In: Journal of Symbolic Computation [34], 105-117
Journal Article
Bradford, Phillip Gnassi
Capoyleas, Vasilis
1997Weak epsilon-Nets for Points on a Hypersphere
In: Discrete & Computational Geometry [18], 83-91
Journal Article
Bradford, Phillip Gnassi
Choppela, Venkatesh
Rawlins, Gregory J.E.
1995Lower Bounds for the Matrix Chain Ordering Problem
In: LATIN'95: Theoretical Informatics, 2nd Latin American Symposium, 112-130
Proceedings Article
Bradford, Phillip Gnassi
Fleischer, Rudolf
1995Matching nuts and bolts faster
In: Algorithms and Computation: 6th International Symposium (ISAAC'95), 402-408
Proceedings Article
Bradford, Phillip Gnassi
Fleischer, Rudolf
Smid, Michiel
1997More efficient parallel totally monotone matrix searching
In: Journal of Algorithms [23], 386-400
Journal Article
Bradford, Phillip Gnassi
Golin, Mordecai J.
Larmore, Lawrence L.
2002Optimal prefix-free codes for unequal letter costs: Dynamic programming with the Monge property
In: Journal of Algorithms [42], 277-303
Journal Article
Bradford, Phillip Gnassi
Golin, Mordecai J.
Larmore, Lawrence L.
Rytter, Wojciech
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
Proceedings Article
Bradford, Phillip Gnassi
Rawlins, Gregory J.E.
Shannon, Greogory E.
1998Efficient Matrix Chain Ordering in Polylog Time
In: SIAM Journal on Computing [27], 466-490
Journal Article
Bradford, Phillip Gnassi
Reinert, Knut
1996Lower Bounds for Row Minima Searching
In: Automata Languages and Programming: 23rd International Colloquium (ICALP'96), 454-465
Proceedings Article
Bradonjić, Milan
Elsässer, Robert
Friedrich, Tobias
Sauerwald, Thomas
Stauffer, Alexandre
2010Efficient Broadcast on Random Geometric Graphs
In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1412-1421
Proceedings Article
Bramer, Andreas2003Zwei Algorithmen zur Bestimmung kostenminimaler Flüsse in Netzwerken
Universität des Saarlandes
Thesis - Master's thesis
Brandenburg, Franz J.
Jünger, Michael
Mutzel, Petra
Lengauer, Thomas
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
Proceedings Article
Braun, Sebastian2000Entwicklung und Test von für statische Graphen optimierte Datentypen
Universität des Saarlandes
Thesis - Master's thesis
Bremer, Dirk1995Analyse und Simulation eines Maximum-Flow Algorithmus für das Gitter
Universität des Saarlandes
Thesis - Master's thesis
Brengel, Klaus2000Externe Prioritätswarteschlangen
Universität des Saarlandes
Thesis - Master's thesis
Brengel, Klaus
Crauser, Andreas
Meyer, Ulrich
Ferragina, Paolo
1999An Experimental Study of Priority Queues in External Memory
In: Algorithm engineering (WAE-99) : 3rd International Workshop, WAE'99, 345-359
Proceedings Article
Breslauer, Dany
Jiang, Tao
Jiang, Zhigen
1997Rotations of periodic strings and short superstrings
In: Journal of Algorithms [24], 340-353
Journal Article
Breslauer, Dany
Ramesh, Hariharan
1996Optimal Parallel Construction of Minimal Suffix and Factor Automata
In: Parallel Processing Letters [6], 35-44
Journal Article
Brightwell, Graham
Panagiotou, Konstantinos
Steger, Angelika
2012Extremal subgraphs of random graphs
In: Random Structures & Algorithms [41], 147-178
Journal Article
Bringmann, Karl2013Bringing Order to Special Cases of Klee’s Measure Problem
In: 38th International Symposium on Mathematical Foundations of Computer Science (MFCS-13), 207-218
Proceedings Article
Bringmann, Karl
Doerr, Benjamin
Neumann, Adrian
Sliacan, Jakub
2013Online Checkpointing with Improved Worst-Case Guarantees
In: Automata, Languages, and Programming - 40th International Colloquium (ICALP 2013), 255-266
Proceedings Article
Bringmann, Karl
Engels, Christian
Manthey, Bodo
Raghavendra Rao, B. V.
2013Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems
In: 38th International Symposium on Mathematical Foundations of Computer Science (MFCS-13), 219-230
Proceedings Article
Bringmann, Karl
Friedrich, Tobias
2013Approximation Quality of the Hypervolume Indicator
In: Artificial Intelligence [195], 265–290
Journal Article
Bringmann, Karl
Friedrich, Tobias
2013Exact and Efficient Generation of Geometric Random Variates and Random Graphs
In: Automata, Languages, and Programming - 40th International Colloquium (ICALP-13), 267-278
Proceedings Article
Bringmann, Karl
Friedrich, Tobias
2013Parameterized Average-Case Complexity of the Hypervolume Indicator
In: 15th Annual Conference on Genetic and Evolutionary Computation (GECCO-13), 575-582
Proceedings Article
Bringmann, Karl
Friedrich, Tobias
2012Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
In: Theoretical Computer Science [425], 104-116
Journal Article
Bringmann, Karl
Friedrich, Tobias
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
Proceedings Article
Bringmann, Karl
Friedrich, Tobias
2010An Efficient Algorithm for Computing Hypervolume Contributions
In: Evolutionary Computation [18], 383-402
Journal Article
Bringmann, Karl
Friedrich, Tobias
2010Approximating the volume of unions and intersections of high-dimensional geometric objects
In: Computational Geometry [43], 601-610
Journal Article
Bringmann, Karl
Friedrich, Tobias
2010The Maximum Hypervolume Set Yields Near-optimal Approximation
In: 12th annual conference on Genetic and evolutionary computation (GECCO 2010), 511-518
Proceedings Article
Bringmann, Karl
Friedrich, Tobias
2010Tight Bounds for the Approximation Ratio of the Hypervolume Indicator
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 607-616
Proceedings Article
Bringmann, Karl
Friedrich, Tobias
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
Proceedings Article
Bringmann, Karl
Friedrich, Tobias
2009Don't be greedy when calculating hypervolume contributions
In: FOGA'09 : revised selected papers from ACM SIGEVO
Foundations of Genetic Algorithms X, 103-112
Proceedings Article
Bringmann, Karl
Friedrich, Tobias
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
Proceedings Article
Bringmann, Karl
Friedrich, Tobias
Igel, Christian
Voß, Thomas
2013Speeding Up Many-Objective Optimization by Monte Carlo Approximations
In: Artificial Intelligence [204], 22–29
Journal Article
Bringmann, Karl
Green Larsen, Kasper
2013Succinct Sampling from Discrete Distributions
In: 45th ACM Symposium on Theory of Computing (STOC-13), 775-782
Proceedings Article
Bringmann, Karl
Mehlhorn, Kurt
Neumann, Adrian
2012Attachment IconRemarks on Category-Based Routing in Social NetworksUnpublished/Draft
Bringmann, Karl
Panagiotou, Konstantinos
2012Attachment IconEfficient Sampling Methods for Discrete Distributions
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 133-144
Proceedings Article
Bringmann, Karl
Sauerwald, Thomas
Stauffer, Alexandre
Sun, He
2014Balls into bins via local search: cover time and maximum load
In: 31st Symposium on Theoretical Aspects of Computer Science (STACS-14), accepted
Proceedings Article
Brockenauer, Ralf1997Separierung von Kuratowski-Ungleichungen für das größte planare Untergraphenproblem
Universität des Saarlandes
Thesis - Master's thesis
Brockhoff, Dimo
Friedrich, Tobias
Hebbinghaus, Nils
Klein, Christian
Neumann, Frank
Zitzler, Eckart
2009On the Effects of Adding Objectives to Plateau Functions
In: IEEE Transactions on Evolutionary Computation [13], 591-603
Journal Article
Brockhoff, Dimo
Friedrich, Tobias
Hebbinghaus, Nils
Klein, Christian
Neumann, Frank
Zitzler, Eckart
2007Do Additional Objectives Make a Problem Harder?
In: Genetic and Evolutionary Computation Conference 2007, 765-772
Proceedings Article
Brockhoff, Dimo
Friedrich, Tobias
Neumann, Frank
2008Analyzing Hypervolume Indicator Based Algorithms
In: Parallel Problem Solving from Nature (PPSN X), 651-660
Proceedings Article
Brodal, Gerth Stølting1998Finger Search Trees with Constant Update Time
In: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-98), 540-549
Proceedings Article
Brodal, Gerth Stølting1997Predecessor Queries in Dynamic Integer Sets
In: Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science (STACS-97), 21-32
Proceedings Article
Brodal, Gerth Stølting1996Priority queues on parallel machines
In: 5th Scandinavian Workshop on Algorithm Theory (SWAT96), 416-427
Proceedings Article
Brodal, Gerth Stølting
Chaudhuri, Shiva
Radhakrishnan, Jaikumar
1996The randomized complexity of maintaining the minimum
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 4-15
Proceedings Article
Brodal, Gerth Stølting
Chaudhuri, Shiva
Radhakrishnan, R.
1996The randomized complexity of maintaining the minimum
In: Nordic Journal of Computing [3], 337-351
Journal Article
Brodal, Gerth Stølting
Fagerberg, Rolf
Meyer, Ulrich
Zeh, Norbert
2004Cache-oblivious data structures and algorithms for undirected breadth-first search and shortest paths
In: Algorithm theory, SWAT 2004 : 9th Scandinavian Workshop on Algorithm Theory ; Humlebæk, Denmark, July 8-10, 2004 ; proceedings, 480-492
Proceedings Article
Brodal, Gerth Stølting
Gasieniec, Leszek
1996Approximate Dictionary Queries
In: Combinatorial Pattern Matching: 7th Annual Symposium (CPM'96), 65-74
Proceedings Article
Brodal, Gerth Stølting
Kaligosi, Kanela
Katriel, Irit
Kutz, Martin
2006Faster Algorithms for Computing Longest Common Increasing Subsequences
In: Combinatorial Pattern Matching, 17th Annual Symposium, CPM 2006, 330-341
Proceedings Article
Brodal, Gerth Stølting
Katajainen, Jyrki
1998Worst-Case Efficient External-Memory Priority Queues
In: Proceedings of the 6th Scandinavian Workshop on Algorithm Theory (SWAT-98), 107-118
Proceedings Article
Brodal, Gerth Stølting
Pinotti, M. Cristina
1998Comparator Networks for Binary Heap Construction
In: Proceedings of the 6th Scandinavian Workshop on Algorithm Theory (SWAT-98), 158-168
Proceedings Article
Brodal, Gerth Stølting
Träff, Jesper Larsson
Zaroliagis, Christos
1998A Parallel Priority Queue with Constant Time Operations
In: Journal of Parallel and Distributed Computing, Special Issue on Parallel Data Structures [49], 4-21
Journal Article
Brodal, Gerth Stølting
Träff, Jesper Larsson
Zaroliagis, Christos
1997A parallel priority data structure with applications
In: 11th Internatinal Parallel Processing Symposium (IPPS-97), 689-693
Proceedings Article
Brönnimann, Hervé
Burnikel, Christoph
Pion, Sylvain
2001Interval arithmetic yields efficient dynamic filters for computational geometry
In: Discrete Applied Mathematics [109], 25-47
Journal Article
Brönnimann, Hervé
Kettner, Lutz
Pocchiola, Michel
Snoeyink, Jack
2006Attachment IconCounting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm
In: SIAM Journal on Computing [36], 721-739
Journal Article
Brönnimann, Hervé
Kettner, Lutz
Pocchiola, Michel
Snoeyink, Jack
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
Proceedings Article
Brown, Christopher
El Kahoui, M'hammed
Novotni, Dominik
Weber, Andreas
2006Attachment IconAlgorithmic methods for investigating equilibria in epidemic modeling
In: Journal of Symbolic Computation [41], 1157-1173
Journal Article
Buchberger, Mehlhorn, Näher, Nievergelt (ed.)1994Special issue on “algorithms: implementation, libraries and use”Book
Bundy, David
Hebbinghaus, Nils
Stellmacher, Bernd
2006Attachment IconThe Local C(G,T) Theorem
In: Journal of Algebra [300], 741-789
Journal Article
Burkhardt, Stefan2002Filter Algorithms for Approximate String Matching
Universität des Saarlandes
Thesis - Doctoral dissertation
Burnikel, Christoph1996Exact Computation of Voronoi Diagrams and Line Segment Intersections
Universität des Saarlandes
Thesis - Doctoral dissertation
Burnikel, Christoph
Funke, Stefan
Mehlhorn, Kurt
Schirra, Stefan
Schmitt, Susanne
2009A Separation Bound for Real Algebraic Expressions
In: Algorithmica [55], 14-28
Journal Article
Burnikel, Christoph
Funke, Stefan
Seel, Michael
2001Exact geometric computation using Cascading
In: International Journal of Computational Geometry & Applications [11], 245-266
Journal Article
Burnikel, Christoph
Funke, Stefan
Seel, Michael
1998Exact Geometric Predicates using Cascaded Computation
In: Proceedings of the 14th International Annual ACM Symposium on Computational Geometry (SCG-98), 175-183
Proceedings Article
Burnikel, Christoph
Könemann, Jochen
Mehlhorn, Kurt
Näher, Stefan
Schirra, Stefan
Uhrig, Christian
1995Attachment IconExact Geometric Computation in LEDA
In: 11th ACM Symposium on Computational Geometry (SCG95), C18-C19
Proceedings Article
Burnikel, Christoph
Mehlhorn, Kurt
Schirra, Stefan
1994Attachment IconHow to Compute the Voronoi Diagram of Line Segments:
Theoretical and Experimental Results
In: Algorithms (ESA-94) : 2nd annual European symposium, 227-239
Proceedings Article
Burnikel, Christoph
Mehlhorn, Kurt
Schirra, Stefan
1994Attachment IconOn degeneracy in geometric computations
In: Discrete algorithms (SODA-94) : 5th annual ACM-SIAM symposium, 16-23
Proceedings Article
Busch, Philip Johannes2011Analysis of the KIT email graph, with an application of randomized rumour spreading protocols
Universität des Saarlandes
Thesis - Bachelor thesis
Butman, Ayelet
Hermelin, Danny
Lewenstein, Moshe
Rawitz, Dror
2010Optimization problems in multiple-interval graphs
In: ACM Transactions on Algorithms [6], 40,1-40,18
Journal Article
Butz, Bernd1997Robuste Implementierung eines Algorithmus zur Berechnung eines Voronoi-Diagramms für Polygone
Universitaet des Saarlandes
Thesis - Master's thesis
Cai, Jin-Yi
Lu, Pinyan
Xia, Mingji
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
Proceedings Article
Calinescu, Gruia
Fernandes, Cristina G.
Finkler, Ulrich
Karloff, Howard
1998A Better Approximation Algorithm for Finding Planar Subgraphs
In: Journal of Algorithms [27], 269-302
Journal Article
Calinescu, Gruia
Fernandes, Cristina G.
Finkler, Ulrich
Karloff, Howard
1996A better approximation algorithm for finding planar subgraphs
In: 7th ACM-SIAM Symposium on Discrete Algorithms (SODA96), 16-25
Proceedings Article
Canzar, Stefan
El-Kebir, Mohammed
Pool, Rene
Elbassioni, Khaled
Malde, Alpeshkumar K.
Mark, Alan E.
Geerke, Daan P.
Stougie, Leen
Klau, Gunnar W.
2012Charge Group Partitioning in Biomolecular Simulation
In: Research in Computational Molecular Biology : 16th Annual International Conference, RECOMB 2012, 29-43
Proceedings Article
Canzar, Stefan
Elbassioni, Khaled
Elmasry, Amr
Raman, Rajiv
2010On the Approximability of the Maximum Interval Constrained Coloring Problem
In: Algorithms and Computation : 21st International Symposium, ISAAC 2010. - Pt. II, 168-179
Proceedings Article
Canzar, Stefan
Elbassioni, Khaled
Klau, Gunnar W.
Mestre, Julian
2011On Tree-Constrained Matchings and GeneralizationsUnpublished/Draft
Canzar, Stefan
Elbassioni, Khaled
Mestre, Julian
2010A polynomial delay algorithm for enumerating approximate solutions to the interval coloring problem
In: Workshop on Algorithm Engineering and Experiments 2010 (ALENEX10), 23-33
Proceedings Article
Canzar, Stefan
Remy, Jan
2006Shape Distributions and Protein Similarity
In: GCB, 1-10
Proceedings Article
Canzar,Stefan
Elbassioni, Khaled
Klau, Gunnar W.
Mestre, Julian
2011On Tree-Constrained Matchings and Generalizations
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 98-109
Proceedings Article
Caragiannis, Ioannis
Fishkin, Aleksei V.
Kaklamanis, Christos
Papaioannou, Evi
2007A tight bound for online colouring of disk graphs
In: Theoretical Computer Science [384], 152-160
Journal Article
Caragiannis, Ioannis
Fishkin, Aleksei V.
Kaklamanis, Christos
Papaioannou, Evi
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
Proceedings Article
Caroli, Manuel2007Evaluation of a Generic Method for Analyzing Controlled-Perturbation Algorithms
Universität des Saarlandes
Thesis - Master's thesis
Caroli, Manuel2006Exakte Arrangement-Berechnung gedrehter Quadratischer Kurven
Universität des Saarlandes
Thesis - Bachelor thesis
Case, John
Kötzing, Timo
2013Memory-limited non-U-shaped learning with solved open problems
In: Theoretical Computer Science [473], 100-123
Electronic Journal Article
Case, John
Kötzing, Timo
2012Computability-theoretic learning complexity
In: Philosophical Transaction of the Royal Society A [370], 3570-3596
Journal Article
Case, John
Kötzing, Timo
2012Learning secrets interactively. Dynamic modeling in inductive inference
In: Information and Computation [220-221], 60-73
Journal Article
Case, John
Kötzing, Timo
2011Measuring Learning Complexity with Criteria Epitomizers
In: 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011), 320-331
Electronic Proceedings Article
Case, John
Kötzing, Timo
2010Solutions to Open Questions for Non-U-Shaped Learning with Memory Limitations
In: Algorithmic Learning Theory : 21st International Conference, ALT 2010, 285-299
Proceedings Article
Case, John
Kötzing, Timo
2010Strongly Non-U-Shaped Learning Results by General Techniques
In: COLT 2010 : The 23rd Conference on Learning Theory, 181-193
Proceedings Article
Celikik, Marjan
Bast, Hannah
2009Fast Single-Pass Construction of a Half-Inverted Index
In: String processing and information retrieval : 16th International Symposium, SPIRE 2009, 194-205
Proceedings Article
Chandran, L. Sunil
Sivadasan, Naveen
2004Attachment IconOn the Hadwiger's Conjecture for Graph ProductsReport
Chang, Kevin
Johnson, Aaron
2008Attachment IconOnline and offline selling in limit order markets
In: 4th International Workshop on Internet and Network Economics (WINE 2008), 41-52
Proceedings Article
Chan, Ho-Leung
Edmonds, Jeff
Lam, Tak-Wah
Lee, Lap-Kei
Marchetti-Spaccamela, Alberto
Pruhs, Kirk
2011Nonclairvoyant speed scaling for flow and energy
In: Algorithmica [61], 507-517
Journal Article
Chan, Ho-Leung
Edmonds, Jeff
Lam, Tak-Wah
Lee, Lap-Kei
Marchetti-Spaccamela, Alberto
Pruhs, Kirk
2009Nonclairvoyant Speed Scaling for Flow and Energy
In: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS), 255-264
Electronic Proceedings Article
Chan, Ho-Leung
Edmonds, Jeff
Pruhs, Kirk
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
Proceedings Article
Chan, Ho-Leung
Lam, Tak-Wah
Lee, Lap-Kei
Ting, Hing-Fung
2012Continuous Monitoring of Distributed Data Streams over a Time-Based Sliding Window
In: Algorithmica [62], 1088-1111
Journal Article
Chan, Ho-Leung
Lam, Tak-Wah
Lee, Lap-Kei
Ting, Hing-Fung
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
Electronic Proceedings Article
Chan, Ho-Leung
Megow, Nicole
Sitters, René
van Stee, Rob
2012Attachment IconA note on sorting buffers offline
In: Theoretical Computer Science [423], 11-18
Journal Article
Chan, Sze-Hang
Lam, Tak-Wah
Lee, Lap-Kei
2011Scheduling for weighted flow time and energy with rejection penalty
In: 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011), 392-403
Electronic Proceedings Article
Chan, Sze-Hang
Lam, Tak-Wah
Lee, Lap-Kei
2010Non-clairvoyant speed scaling for weighted flow time
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. I, 23-35
Proceedings Article
Chan, T-H. Hubert
Dhamdhere, Kedar
Gupta, Anupam
Kleinberg, Jon
Slivkins, Aleksandrs
2009Metric Embeddings with Relaxed Guarantees
In: SIAM Journal on Computing [38], 2303-2329
Journal Article
Chan, T.-H. Hubert
Elbassioni, Khaled
2011A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics
In: Discrete & Computational Geometry [46], 704-723
Journal Article
Chaudhuri, Shiva1996Sensitive functions and approximate problems
In: Information and Computation [126], 161-168
Journal Article
Chaudhuri, Shiva
Dimopoulos, Yannis
Zaroliagis, Christos
1996On the Parallel Complexity of Acyclic Logic Programs
In: Parallel Processing Letters [6], 223-230
Journal Article
Chaudhuri, Shiva
Dubhashi, Devdatt
1997Probabilistic recurrence relations revisited
In: Theoretical Computer Science [181], 45-56
Journal Article
Chaudhuri, Shiva
Dubhashi, Devdatt
1995Probabilistic Recurrence Relations Revisited
In: LATIN'95: Theoretical Informatics, Second Latin American Symposium, 207-219
Proceedings Article
Chaudhuri, Shiva
Garg, Naveen
Ravi, R.
1998The $p$-neighbor $k$-center problem
In: Information Processing Letters [65], 131-134
Journal Article
Chaudhuri, Shiva
Hagerup, Torben
1995Prefix Graphs and their Applications
In: Graph-theoretic Concepts in Computer Science: 20th International Workshop (WG94), 206-218
Proceedings Article
Chaudhuri, Shiva
Radhakrishnan, Jaikumar
1997The Complexity of Parallel Prefix Problems on Small Domains
In: Information and Computation [138], 1-22
Journal Article
Chaudhuri, Shiva
Radhakrishnan, Jaikumar
1996Deterministic restrictions in circuit complexity
In: Theory of Computing : 28th Annual ACM Symposium (STOC-28), 30-36
Proceedings Article
Chaudhuri, Shiva
Subrahmanyam, K. V.
Wagner, Frank
Zaroliagis, Christos
2000Computing mimicking networks
In: Algorithmica [26], 31-49
Journal Article
Chaudhuri, Shiva
Subrahmanyam, K. V.
Wagner, Frank
Zaroliagis, Christos
1998Computing Mimicking Networks
In: Proceedings of the 25th International Colloquium on Automata, Languages and Programming (ICALP-98), 556-567
Proceedings Article
Chaudhuri, Shiva
Zaroliagis, Christos
2000Shortest paths in digraphs of small treewidth. Part I, Sequential algorithms
In: Algorithmica [27], 212-226
Journal Article
Chaudhuri, Shiva
Zaroliagis, Christos
1998Shortest paths in digraphs of small treewidth. Part II: Optimal parallel algorithms
In: Theoretical Computer Science [203], 205-223
Journal Article
Chaudhuri, Shiva
Zaroliagis, Christos
1995Optimal Parallel Shortest Paths in Small Treewidth Digraphs
In: Algorithms - ESA'95: 3rd Annual European Symposium, 31-45
Proceedings Article
Chaudhuri, Shiva
Zaroliagis, Christos
1995Shortest Path Queries in Digraphs of Small Treewidth
In: Automata, Languages, and Programming: 22nd International Colloquium (ICALP95), 244-255
Proceedings Article
Cheng, Siu-Wing
Funke, Stefan
Golin, Mordecai J.
Kumar, Piyush
Poon, Sheung-Hung
Ramos, Edgar A.
2003Curve Reconstruction from Noisy Samples
In: Proceedings of the 19th Annual Symposium on Computational Geometry (SCG-03), 420-429
Proceedings Article
Chen, Danny Z.
Das, Gautam
Smid, Michiel
1996Lower bounds for computing geometric spanners and approximate shortest paths
In: 8th Canadian Conference on Computing, 155-160
Proceedings Article
Chen, Xujin
Doerr, Benjamin
Hu, Xiaodong
Ma, Weidong
van Stee, Rob
Winzen, Carola
2012Attachment IconThe Price of Anarchy for Selfish Ring Routing is Two
In: Internet and Network Economics : 8th International Workshop, WINE 2012, 420-433
Proceedings Article
Chen, Xujin
Epstein, Leah
Kleiman, Elena
van Stee, Rob
2013Attachment IconMaximizing the minimum load: The cost of selfishness
In: Theoretical Computer Science [482], 9-19
Journal Article
Cheriyan, Joseph
Hagerup, Torben
1995A Randomized Maximum-Flow Algorithm
In: SIAM Journal on Computing [24], 203-226
Journal Article
Cheriyan, Joseph
Hagerup, Torben
Mehlhorn, Kurt
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
Journal Article
Cheriyan, Joseph
Hagerup, Torben
Mehlhorn, Kurt
1990Can A Maximum Flow be Computed in o(nm) Time?
In: Automata, languages and programming (ICALP-90) : 17th international colloquium, 235-248
Proceedings Article
Cheriyan, Joseph
Hagerup, Torben
Mehlhorn, Kurt
1990Attachment IconCan a maximum flow be computed in $o(nm)$ time?Report
Cheriyan, Joseph
Mehlhorn, Kurt
1999Attachment IconAn analysis of the highest-level selection rule in the preflow-push max-flow algorithm
In: Information Processing Letters [69], 239-242
Journal Article
Cheriyan, Joseph
Mehlhorn, Kurt
1996Attachment IconAlgorithms for Dense Graphs and Networks on the Random Access Computer
In: Algorithmica [15], 521-549
Journal Article
Chian, Yi-Feng
Goodrich, Michael T.
Grove, Edward
Tamassia, Roberto
Vengroff, Darren Erik
Vitter, Jeffrey Scott
1995External-Memory Graph Algorithms
In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95), 139-149
Proceedings Article
Chin, Francis Y. L.
Guo, Zeyu
Sun, He
2011Minimum Manhattan Network is NP-Complete
In: Discrete & Computational Geometry [45], 701-722
Journal Article
Chlebus, Bogdan S.
Czumaj, Artur
Gasieniec, Leszek
Kowaluk, Miroslaw
Plandowski, Wojciech
1996Parallel Alternating-Direction Access Machine
In: Mathematical Foundations of Computer Science 1996: 21st International Symposium (MFCS'96), 255-266
Proceedings Article
Chlebus, Bogdan S.
Czumaj, Artur
Sibeyn, Jop F.
1997Routing on the PADAM: Degrees of Optimality
In: Proceedings of the 3rd International Euro-Par Conference on Parallel Processing (Euro-Par-97), 272-279
Proceedings Article
Chlebus, Bogdan S.
Kowalski, Dariusz
2005Cooperative asynchronous update of shared memory
In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC 2005), 733-739
Proceedings Article
Chlebus, Bogdan S.
Kowalski, Dariusz
2004A better wake-up in radio networks
In: Proceedings of the 23rd Annual ACM Symposium on Principles of Distributed Computing, PODC 2004, 266-274
Proceedings Article
Chlebus, Bogdan S.
Kowalski, Dariusz
2004Randomization helps to perform independent tasks reliably
In: Random Structures and Algorithms [24], 11-41
Journal Article
Chlebus, Bogdan S.
Kowalski, Dariusz
Shvartsman, Alex
2004Collective asynchronous reading with polylogarithmic worst-case overhead
In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC-04), 321-330
Proceedings Article
Chong, Ka Wong1996Finding minimum spanning trees on the EREW PRAM
In: International Computer Symposium, 7-14
Proceedings Article
Chong, Ka Wong
Lam, Tak Wah
1998Approximating Biconnectivity in Parallel
In: Algorithmica [21], 395-410
Journal Article
Chong, Ka Wong
Lam, Tak Wah
1996Towards more precise parallel biconnectivity approximation
In: 7th Annual International Symposium on Algorithms and Computation, 223-232
Proceedings Article
Chong, Ka Wong
Ramos, Edgar A.
1998Improved deterministic parallel padded sorting
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 405-416
Proceedings Article
Christodoulou, George2008Price of Anarchy
In: Encyclopedia of Algorithms, 1-99
Part of a Book
Christodoulou, George
Elbassioni, Khaled
Fouz, Mahmoud
2010Truthful Mechanisms for Exhibitions
In: Internet and Network Economics : 6th International Workshop, WINE 2010, 170-181
Proceedings Article
Christodoulou, George
Gourves, Laurent
Pascual, Fanny
2007Attachment IconScheduling Selfish Tasks: About the Performance of Truthful Algorithms
In: Computing and Combinatorics : 13th Annual International Conference, COCOON 2007, 187-197
Proceedings Article
Christodoulou, George
Koutsoupias, Elias
2009Mechanism Design for Scheduling
In: Bulletin of European Association for Theoretical Computer Science [97], 40-59
Journal Article
Christodoulou, George
Koutsoupias, Elias
Kovács, Annamária
2010Mechanism Design for Fractional Scheduling on Unrelated Machines
In: ACM Transactions on Algorithms [6], 38:1-38:18
Journal Article

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