max planck institut
informatik

# MPI-INF D1 Publications

## MPI-INF D1 Publications

### Entries sorted by: 7. Library - 4. Category, Keywords

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
 ideal theory
 identity testing
 implementation
 in-approximability
 Incompressibility
 incremental algorithm
 incremental algorithms
 incremental generation algorithms
 Incremental polynomial time
 Independent Feedback Vertex Set
 independent set
 indexing
 induced subgraph
 Inefficiency of Equilibria
 Infinite games
 Information Brokerage
 information retrieval
 insertions
 Instruments
 integer division
 Integer Linear Programming
 Integer Linear Programs
 integer multiplication
 Integer Optimization
 integer program
 Integer Programming
 Integer Programming Graph Drawing
 Interconnection Networks
 Internet Routing
 intersection computation
 interval arithmetic
 Inversions
 IP networks
 Irregular
 Isooriented Rectangles
 I.3.5 [Computational Geometry and Object Modeling]: Curve
 I/O Komplexität
 job shop scheduling
 k-splittable flow
 k mismatches problem
 Kemeny Aggregation
 Kernel lower bounds
 Kernelization
 Knapsack Problem
 Knapsack problem - Random instances - Experimental study - Pareto optimality
 Komplexitaetstheorie
 Kürzeste-Wege-Berechnung
 Language equations
 Latent Semantic Indexing
 lattice
 lattices
 Layout
 Lectins
 LEDA
 Levenshtein Distance
 Library
 limiting distribution
 line segments
 Line simplification
 Linear complementarity problem (LCP)
 linear programming
 linear systems
 List-Ranking
 List Ranking
 Local algorithm
 Location Freeness
 lock-free
 Loops
 Lossy minimization.
 Lov
 low-discrepancy point sets
 lower bound
 Lower Envelopes
 LP relaxation
 manifolds
 Map Labeling
 Mapping
 Market Equilibria
 massive data set
 massive data sets
 Mastermind
 matching
 matchings
 Mathematical economics
 Mathematical Techniques--Geometry
 Mathematical Techniques--Trees
 mathematics
 matrix multiplication.
 matroid
 Max-Cut
 max-min fairness
 Maximal frequent set
 maximum flow
 maximum weight matching
 mean payoff games
 membership queries
 memory-restricted algorithms
 memory hierarchy
 Menge
 Meshes
 meshing
 Meticulous Analysis
 metric spaces
 MIMD
 Min-Max Priority Queues
 Minimization
 Minimum Cycle Basis
 Minimum Diameter
 Minimum Fill-In
 Mixed Criticality
 Möbius transformations
 Modified Uspensky method
 Modular Arithmetic
 Molecular Modeling
 moments
 Monotone Boolean dualization
 Monotone Boolean function
 monotone discrete binary functions
 monotone inequalities
 Mordell-Weil group
 Motion Planning
 MSIMD
 Multi-Objective Optimization
 multi merge
 multicommodity flow
 multicore algorithms
 multicores
 Multiobjective Optimization
 multiple robots
 multipoint evaluation
 Multiprocessor
 multiprocessors
 Narrowing
 natural algorithm
 nearest neighbors
 network design
 Network flow
 Network Flows
 Network Routing Games
 Networks
 noiseless coding
 non-trivial cycles
 nonuniform deterministic simulation
 Normal polynomials
 NP-completeness
 NP-hard
 numerical integration
 Numerical solver
 Object Modeling
 object oriented programming
 observer
 On-line algorithm
 on-line algorithms
 One-Sided Crossing Minimization
 One variable equations
 online algorithm
 Online Algorithms
 online process
 Operations Research
 optimal networks
 Optimization
 optimization heuristics
 Optimization problems
 orthogonal
 output maximization
 packet switching
 Paging
 Pairing Heaps
 Parallel
 parallel algorithm analysis
 parallel algorithms
 parallel backtrack search
 Parallel Computation
 Parallel Computing
 parallel disks
 Parallel linear algebra. Tridiagonal systems. Alternating direction implicit method
 Parallel Loop
 Parallel Loops
 parallel processing
 parallel RAM
 parallel random permutation
 Parameterized Algorithms
 Parameterized Complexity
 Parametric Search
 parametric searching
 Parking Functions
 Partition trees
 Path planning
 Pathwidth-One Deletion
 pattern matching
 Performance
 Permutation Routing
 Persistence
 Persistent data structures
 Perturbation
 Physarum
 Planar Augmentation
 planar graph
 Planar Graphs
 Planarization
 plotting
 Point location
 points
 Polygon Covering
 polygon partitioning
 polygons
 Polyhedral Combinatorics
 polyline fitting
 Polymatroid
 polymatroid function
 polymatroid functions
 Polynomial-time approximation algorithms
 polynomial average time algorithms
 polynomial average time.
 polynomial division
 Polynomial gcd
 polynomial interpolation
 Polynomial Kernels
 Polynomial real root isolation
 Polynomial systems
 polynomial time approximation scheme
 poset
 poset.
 positional game
 Power Control
 power of choices
 PRAM
 PRAM Simulation
 precedence constraints
 precision
 Precision Problem
 preemption
 Preemptive Scheduling
 Prefetching
 prefix codes
 Preprocessing
 Preprocessing Heuristics
 price of anarchy
 Price of fairness
 price of stability
 Primal-dual algorithms - Approximation algorithms - Min-sum scheduling problems
 Priority Deques
 priority queues
 probabalistic analysis
 probabilistic analysis.
 probabilistic methods
 processing modules
 Processor Speedup Factor
 project scheduling
 Propagation
 Pursuit-evasion
 QUASAR
 quasi-polynomial time
 quasi-polynomial.
 Quasi-Randomness
 Quasirandomness
 query complexity
 Ramsey property
 Ramsey Theory
 random access machine
 random graph
 random graphs
 random insertions and deletions
 random permutation
 random planar graphs sampling enumeration
 Random Structures
 Random walk
 Randomized
 randomized algorithm
 Randomized algorithms
 Randomized Local Search
 Randomized Rounding
 Randomized search heuristics
 Range searching
 rank
 rank-maximal
 Rapid Prototyping
 Rapid Software Prototyping
 Real-Time Scheduling
 real algebraic numbers
 Real Root Isolation
 reals
 Recompression
 rectangle packing
 Recursion tree analysis
 redundant assignments
 regression analysis
 regular discrete functions
 regular discrete functions.
 Relaxation
 Resource augmentation
 Resource management
 resultants
 Rigid body simulations
 robotics
 robustness
 rolling motion
 Root Approximation
 root isolation
 root refinement
 root separation
 Root separation bounds
 Root Solving
 Rotation
 Routing
 Row-Major
 running time analysis
 Runtime Analysis
 Safety-Critical Systems
 Satisfiability
 scene
 Schedulability
 Schedulability test
 Scheduling
 scheduling algorithms
 scientific space instrument
 search tree
 search trees
 searching
 Second order unification
 secondary memory
 Selection
 Semi-algebraic Sets
 semi-random graphs
 Semialgebraic geometry
 Semidefinite Programming
 sensor cover
 separation bound
 separation bounds
 Set associative cache
 set cover
 set cover polytope
 set equality
 shape recognition
 shared memory
 shortest-path
 Shortest-Paths
 Shortest-Paths Problems
 Shortest path
Baswana, Surender
Goyal, Vishrut
Sen, Sandeep
2005All-pairs nearly 2-approximate shortest paths in $O(n^2 \mathrm polylog n)$ time
In: STACS 2005 : 22nd Annual Symposium on Theoretical Aspects of Computer Science, 666-679
Proceedings Article
Baswana, Surender
Sen, Sandeep
2004Approximate distance oracle for unweighted graphs in Expected O(n²) time
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 271-280
Proceedings Article
Bonifaci, Vincenzo
Mehlhorn, Kurt
Varma, Girish
2012Physarum Can Compute Shortest Paths
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 233-240
Proceedings Article
Meyer, Ulrich2001Single-Source Shortest-Paths on Arbitrary Directed Graphs in Linear Average-Case Time
In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), 797-806
Proceedings Article
Meyer, Ulrich
Sanders, Peter
2000Parallel Shortest Path for Arbitrary Graphs
In: Euro-Par 2000 Parallel Processing, Proceedings of the 6th International Euro-Par Conference (Euro-Par-00), 461-470
Proceedings Article
 Shortest Paths
 SIMD
 simplex algorithm
 Simulated Annealing
 Simulation
 single-source shortest-path problem
 Single Source Shortest Path
 ski rental problem
 slime mold
 slivers
 SLP
 small subgraph
 Smoothed analysis
 smoothed analysis}
 snap rounding
 Snippet generation
 Social Choice Theory
 Software Libraries
 software library
 software reuse
 solar orbiter PHI instrument
 solid
 solving NP-hard problem instances to optimality
 Sortieren
 Sorting
 sorting lower bound
 space curves
 Space vehicles
 spanning tree
 Sparse graphs
 Sparse spanners
 spectral
 Spectral Retrieval
 Spelling variants
 splines
 SPQR-trees
 square rooting
 Stackelberg Routing
 star-discrepancy
 statistics
 Steiner Problem
 Steiner tree
 Steiner Tree Problem
 Steiner Trees
 STL LEDA Graphiterators Iterator Design Pattern
 storage systems
 streaming
 streaming algorithms
 string matching
 string unification
 strip packing
 Strong -nets
 Strongly Connected Component.
 Structural Alignment
 Sturm-Habicht sequence
 subdivision simplification
 Subexponential-time Algorithms
 submodular function
 Subresultant
 Suchbaum
 Suchen
 suffix array
 Suffix Array Construction
 Sum of square roots
 suppressions
 surface
 Surface analysis
 surface reconstruction
 Surfaces
 Sweep-line algorithm
 Sweepline
 Symbolic–numeric algorithms
 synchronization
 system of loops
 system of polymatroid inequalities
 Systems
 systems of inequalities
 Taylor shift
 Term rewriting
 terrain covering
 Text Indexing
 Theory
 Theory of Randomized Search Heuristics
 threshold
 threshold accepting
 time-varying access probabilities
 time bound
 time forward processing
 Topological Ordering
 topology
 topology computation
 Topology Control
 Tori
 torsion-group
 torus
 Total completion time
 Total Edge Cover
 Total Vertex Cover
 Touching distances
 Transformation
 Transveral hypergraphs
 Transversal
 transversal hypergraph
 Tree-grammars
 Tree compression
 tree decompositions
 trees
 Treewidth
 TRIES
 Trunk Packing
 two-dimensional bin packing
 Unary languages
 Uncertainty
 Undecidability
 unequal letter costs
 unequal probabilities
 Unification Algorithms
 union of balls
 Union of Cubes
 Unit-Ball Graph
 universal cover
 universal hashing
 unsplittable flow
 Vertex Deletion Problems
 visibility
 visible parts
 Visualization
 VLSI-theory
 VLSI computation
 Voronoi diagram
 Voronoi Diagrams
 wake consideration
 Weierstrass function
 weighted bipartite matching problem
 Weighted Matching
 Wind farm design
 wireless
 wireless communication
 Wireless LANs
 Wireless networks
 Wireless Sensor Networks
 Word equations
 work-stealing
 Worst-Case Execution Times
 worst case ratio
 Zigzag persistent homology
 zufällige Graphen
 $k$-Anonymity
 $k$-anonymous
 (1+1)-EA
 >> Categories and Subject Descriptors F.2.2 [Nonnumerical Algorithms and Problems]: Geometrical problems and computations
 (Not Categorized)

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