 | Author/Editor | Year | | Title | Type | |
|---|
 |
approximation algorithm |
| |
|
| |
| Above-Guarantee Parameterization |
| |
| absolute worst-case ratio |
| |
| abstract data type |
| |
|
| |
| Ad-Hoc and Sensor Networks |
| |
| adaptive granularity control |
| |
| Adaptive Sorting |
| |
|
| |
| Advanced Search |
| |
|
| |
| Airline Crew Scheduling |
| |
| algebraic computation tree |
| |
| Algebraic curves |
| |
|
| |
| Algebraic Geometry |
| |
|
| |
| algebraic surface |
| |
|
| |
| algorithm |
| |
|
| |
| algorithmic game theory |
| |
|
| |
| Algorithms and Data Structures |
| |
|
| |
| Algorithmus |
| |
|
| |
| Analysis |
| |
| AND/OR precedence constraints |
| |
| Angel and Devil |
| |
|
| |
| Apex-Minor-Free Graphs |
| |
|
| |
| approximate algorithms |
| |
| approximate string matching |
| |
| Approximation |
| |
|
| |
| Approximation algorithms |
| |
|
| |
| Archiving Algorithms |
| |
| arithmetic circuit complexity |
| |
| Arithmetic Progressions |
| |
|
| |
| Arrangements |
| |
|
| |
| assignment problem |
| |
|
| |
| Average-case analysis |
| |
|
| |
| average case |
| |
|
| |
| average search time |
| |
|
| |
| Bahncard |
| |
|
| |
| bandwidth criterion |
| |
|
| |
| Baum |
| |
|
| |
| Bernstein basis |
| |
|
| |
| Bezout matrix |
| |
|
| |
| binary comparison model |
| |
|
| |
| binary trees |
| |
|
| |
| bipartite graphs |
| |
|
| |
| black-box model |
| |
| Bollobas-Eldridge conjecture |
| |
| Bound-Consistency |
| |
|
| |
| Bounded Ordered Dictionaries |
| |
|
| |
| Box-decomposition trees |
| |
|
| |
| Branch-and-Cut |
| |
|
| |
| Branch & Cut |
| |
|
| |
| broadcasting |
| |
|
| |
| buffer |
| |
| B.7.2 [Integrated Circuits]: Design Aids-placement and routing |
| |
| cache |
| |
|
| |
| CAD |
| |
|
| |
| Categories and Subject Descriptors: B.7. I [Integrated Circuits]: Types and Design Styles- VLSI (very large scale integration) |
| |
| Categories and Subject Descriptors: F.I.2 [Computation by Abstract Devices]: Modes of Computation-- alternation and nondeterminism |
| |
| Certifying Verification LEDA Isabelle VCC |
| |
|
| |
| Chernoff bounds |
| |
|
| |
| Chordal Graphs |
| |
|
| |
| Claw-free graphs |
| |
|
| |
| clustering |
| |
|
| |
| codes |
| |
| Coefficient sign variations |
| |
| collective communication |
| |
|
| |
| Collision response |
| |
|
| |
| Comb graphs |
| |
| Combinatorial Enumeration |
| |
| combinatorial game |
| |
|
| |
| Combinatorial Optimization |
| |
|
| |
| combinatorial reconstruction |
| |
| combinatorial surface reconstruction |
| |
| combinatorics |
| |
|
| |
| Compaction |
| |
|
| |
| complexity |
| |
|
| |
| complexity of incremental algorithms |
| |
|
| |
| computational and structural complexity |
| |
|
| |
| Computational Biology; |
| |
|
| |
| Computational complexity |
| |
| computational complexity idealized parallel computers |
| |
| Computational Geometry |
| |
|
| |
| Computational Molecular Biology |
| |
|
| |
| computer cartography |
| |
|
| |
| Computer Programming--Algorithms |
| |
| Computer Science and Game Theory |
| |
| Conics |
| |
|
| |
| Connected dominating set |
| |
| Connected Feedback Vertex Set |
| |
| Constant Factors |
| |
| constrained shortest path |
| |
| constrained shortest paths |
| |
| constraint based simulation |
| |
| Constraint Programming |
| |
|
| |
| convex hull |
| |
|
| |
| Core |
| |
|
| |
| cost trade-offs |
| |
| covariance matrix adaptation |
| |
| covering number |
| |
|
| |
| crossing minimization |
| |
|
| |
| cryptography |
| |
|
| |
| Curvature constraint |
| |
| curve in generic position |
| |
| Curved Objects |
| |
|
| |
| cycle basis |
| |
| cylindrical algebraic decomposition |
| |
| C++ |
| |
|
| |
| d-factors |
| |
|
| |
| Data gathering |
| |
|
| |
| Data Processing |
| |
| Data Processing--Data Structures |
| |
| data structure |
| |
|
| |
| Data Structures and Algorithms |
| |
|
| |
| Davenport-Mahler bound |
| |
|
| |
| decision tree |
| |
|
| |
| Deferred Data Structures |
| |
|
| |
| Degenerate graphs |
| |
|
| |
| Delaunay graphs |
| |
|
| |
| depth-3 |
| |
|
| |
| derandomization |
| |
|
| |
| Descartes-Jacobi Rule |
| |
|
| |
| Descartes rule of signs |
| |
|
| |
| Design of algorithms |
| |
|
| |
| Deterministic Algorithms |
| |
|
| |
| diamond operator |
| |
|
| |
| dictionary problem |
| |
|
| |
| Dijkstra's algorithm |
| |
|
| |
| dimension reduction |
| |
| Directed Feedback Arc Set |
| |
| directed Hamiltonian ring |
| |
|
| |
| Discrepancy Theory |
| |
| discrete algorithm enginieering |
| |
| discrete algorithms |
| |
|
| |
| Discrete Optimization |
| |
|
| |
| Distance Computation |
| |
|
| |
| distributed algorithms |
| |
|
| |
| Document Expansion |
| |
|
| |
| Dominator Coloring |
| |
| Double-Ended Priority Queues |
| |
| Double Ruling |
| |
|
| |
| Drift analysis |
| |
|
| |
| Dupin ring cyclide |
| |
|
| |
| Dynamic Computational Geometry |
| |
| dynamic deferred data structuring |
| |
| dynamic flow |
| |
|
| |
| Dynamical System |
| |
|
| |
| earliest start schedule |
| |
|
| |
| Economics |
| |
|
| |
| edge-disjoint paths |
| |
|
| |
| edges |
| |
|
| |
| efficient algor ithms |
| |
|
| |
| Effizienz |
| |
|
| |
| Embedding |
| |
|
| |
| Enumeration |
| |
|
| |
| Enumeration problems |
| |
|
| |
| error-tolerant search |
| |
|
| |
| Eulerian Cycle |
| |
|
| |
| Evolutionary Algorithms |
| |
|
| |
| evolutionary strategy |
| |
|
| |
| Exact Algorithms |
| |
|
| |
| exact geometric computation |
| |
| Exact Geometric Computing |
| |
| EXACUS |
| |
|
| |
| expectation |
| |
|
| |
| Experiments |
| |
|
| |
| external graph algorithm |
| |
|
| |
| external memory algorithm |
| |
| external memory algorithms |
| |
| external memoryJuly |
| |
|
| |
| Externspeicher |
| |
|
| |
| E. I [Data]:
Data Structures--arrays |
| |
|
| |
| Facility Location |
| |
|
| |
| fast matrix multiplication |
| |
|
| |
| Feasibility Test |
| |
|
| |
| Feedback Vertex Set problems |
| |
|
| |
| filter |
| |
|
| |
| Filter Algorithms |
| |
| Fixed-Parameter Tractability |
| |
| Fixed parameter tractability |
| |
| Floating point arithmetic |
| |
| flow over time |
| |
|
| |
| forest |
| |
| Forest ecosystem - Biodiversity - Ecological dispersal model - Forest simulation model - Approximation algorithms |
| |
| Fourier Analysis |
| |
|
| |
| fringe analysis |
| |
|
| |
| Full Steiner Trees |
| |
|
| |
| fixed parameter tractability |
| |
| F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems-routing and layout
General Terms: Design |
| |
| F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerieal Algorithms and Problems--computations on discrete structures |
| |
| F.2.3 [Analysis of Algolithms and Problem Complexity]: Trade-offs among Complexity Measures |
| |
| Galois rings |
| |
|
| |
| Games |
| |
|
| |
| General Matching |
| |
|
| |
| generic graphs |
| |
|
| |
| Geographic Information Systems |
| |
|
| |
| Geometric Computation |
| |
|
| |
| geometric configurations |
| |
| Geometric Data Structures |
| |
| geometric rounding |
| |
|
| |
| geometry |
| |
|
| |
| Girth |
| |
| Glivenko Kuroda Higher-order Logic classical intuitionistic intensional extensional |
| |
| Global Constraint |
| |
|
| |
| Global Multiprocessor Scheduling |
| |
|
| |
| graph |
| |
|
| |
| Graph Algorithms |
| |
|
| |
| Graph Drawing |
| |
|
| |
| Graph Layout |
| |
| Graph Modification Problems |
| |
| graph partitioning |
| |
|
| |
| Graphs with Constraints |
| |
|
| |
| Group Steiner Tree |
| |
|
| |
| G.2 2 [Discrete Mathematics]: Graph Theory General Terms: Algorithms |
| |
|
| |
| hashing |
| |
|
| |
| height |
| |
|
| |
| hidden line elimination problem |
| |
| High-Performance Parallel Computing |
| |
| history graph |
| |
|
| |
| Hitting Sets |
| |
|
| |
| Homotopy continuation |
| |
|
| |
| Human Factors |
| |
| hypercubic and mesh network |
| |
| Hypergraph |
| |
|
| |
| Hypergraphs |
| |
|
| |
| ideal theory |
| |
|
| |
| implementation |
| |
|
| |
| Incompressibility |
| |
|
| |
| incremental algorithms |
| |
| incremental generation algorithms |
| |
| Incremental polynomial time |
| |
| Independent Feedback Vertex Set |
| |
| independent set |
| |
|
| |
| induced subgraph |
| |
| Inefficiency of Equilibria |
| |
| Infinite games |
| |
|
| |
| information retrieval |
| |
|
| |
| integer division |
| |
| Integer Linear Programming |
| |
| Integer Linear Programs |
| |
|
| |
| Integer Optimization |
| |
|
| |
| Integer Programming Graph Drawing |
| |
|
| |
| Internet Routing |
| |
|
| |
| interval arithmetic |
| |
|
| |
| Irregular |
| |
|
| |
| I.3.5 [Computational
Geometry and Object Modeling]: Curve |
| |
|
| |
| job shop scheduling |
| |
|
| |
| k mismatches problem |
| |
|
| |
| Kernel lower bounds |
| |
|
| |
| Knapsack Problem |
| |
| Knapsack problem - Random instances - Experimental study - Pareto optimality |
| |
| Komplexitaetstheorie |
| |
|
| |
| Latent Semantic Indexing |
| |
|
| |
| lattices |
| |
|
| |
| Lectins |
| |
|
| |
| Levenshtein Distance |
| |
|
| |
| limiting distribution |
| |
|
| |
| Line simplification |
| |
| Linear complementarity problem (LCP) |
| |
| linear programming |
| |
|
| |
| List-Ranking |
| |
|
| |
| Load Balancing |
| |
| load balancing random loads |
| |
| Local algorithm |
| |
|
| |
| lock-free |
| |
|
| |
| Lov |
| |
| low-discrepancy point sets |
| |
| lower bound |
| |
|
| |
| LP relaxation |
| |
|
| |
| Map Labeling |
| |
|
| |
| Market Equilibria |
| |
|
| |
| massive data sets |
| |
|
| |
| matching |
| |
|
| |
| Mathematical economics |
| |
| Mathematical Techniques--Geometry |
| |
| Mathematical Techniques--Trees |
| |
|
| |
| matroid |
| |
|
| |
| max-min fairness |
| |
|
| |
| maximum flow |
| |
|
| |
| maximum weight matching |
| |
|
| |
| membership queries |
| |
| memory-restricted algorithms |
| |
| memory hierarchy |
| |
|
| |
| Meshes |
| |
|
| |
| Meticulous Analysis |
| |
|
| |
| MIMD |
| |
|
| |
| Minimum Cycle Basis |
| |
|
| |
| Minimum Fill-In |
| |
|
| |
| Möbius transformations |
| |
|
| |
| Modular Arithmetic |
| |
|
| |
| moments |
| |
| Monotone Boolean dualization |
| |
| Monotone Boolean function |
| |
| monotone discrete binary functions |
| |
| monotone inequalities |
| |
|
| |
| Motion Planning |
| |
|
| |
| Multi-Objective Optimization |
| |
|
| |
| multicommodity flow |
| |
|
| |
| multicores |
| |
| Multiobjective Optimization |
| |
| multiple robots |
| |
|
| |
| multiprocessors |
| |
| multithreaded computations |
| |
| multithreading |
| |
|
| |
| natural adaptive networks |
| |
|
| |
| nearest neighbor load balancing algorithm |
| |
|
| |
| network design |
| |
|
| |
| Network Flows |
| |
|
| |
| Networks |
| |
|
| |
| non-trivial cycles |
| |
| nonuniform deterministic simulation |
| |
| Normal polynomials |
| |
|
| |
| NP-hard |
| |
|
| |
| Object Modeling |
| |
| object oriented programming |
| |
| observer |
| |
|
| |
| on-line algorithms |
| |
| One-Sided Crossing Minimization |
| |
| online algorithm |
| |
|
| |
| online process |
| |
|
| |
| optimal networks |
| |
|
| |
| optimization heuristics |
| |
|
| |
| orthogonal |
| |
|
| |
| packet switching |
| |
|
| |
| Pairing Heaps |
| |
|
| |
| parallel algorithm analysis |
| |
|
| |
| parallel backtrack search |
| |
|
| |
| Parallel Computing |
| |
|
| |
| Parallel linear algebra. Tridiagonal systems. Alternating direction implicit method |
| |
|
| |
| Parallel Loops |
| |
|
| |
| parallel RAM |
| |
| parallel random permutation |
| |
| Parameterized Algorithms |
| |
|
| |
| Parametric Search |
| |
|
| |
| Parking Functions |
| |
|
| |
| Path planning |
| |
|
| |
| pattern matching |
| |
|
| |
| Periodic Task System |
| |
|
| |
| Persistence |
| |
| Persistent data structures |
| |
| Perturbation |
| |
|
| |
| Planar Augmentation |
| |
|
| |
| Planar Graphs |
| |
|
| |
| plotting |
| |
|
| |
| points |
| |
|
| |
| polygon partitioning |
| |
|
| |
| Polyhedral Combinatorics |
| |
|
| |
| Polymatroid |
| |
|
| |
| polymatroid functions |
| |
| Polynomial-time approximation algorithms |
| |
| polynomial average time algorithms |
| |
|
| |
| Polynomial gcd |
| |
|
| |
| Polynomial real root isolation |
| |
| polynomial time approximation scheme |
| |
| poset |
| |
|
| |
| positional game |
| |
|
| |
| power of choices |
| |
|
| |
| PRAM Simulation |
| |
|
| |
| precision |
| |
|
| |
| preemption |
| |
|
| |
| Prefetching |
| |
|
| |
| Preprocessing |
| |
|
| |
| price of anarchy |
| |
|
| |
| Primal-dual algorithms - Approximation algorithms - Min-sum scheduling problems |
| |
|
| |
| priority queues |
| |
|
| |
| probabilistic analysis. |
| |
|
| |
| Processor Speedup Factor |
| |
|
| |
| Propagation |
| |
|
| |
| Quadratic Interval Refinement |
| |
|
| |
| QUASAR |
| |
|
| |
| quasi-polynomial. |
| |
|
| |
| Quasirandomness |
| |
|
| |
| Ramsey property |
| |
|
| |
| random access machine |
| |
|
| |
| random graphs |
| |
| random insertions and deletions |
| |
| random permutation |
| |
| random planar graphs sampling enumeration |
| |
| Random Structures |
| |
|
| |
| Randomized |
| |
|
| |
| Randomized algorithms |
| |
| randomized load balancing algorithm |
| |
| Randomized Local Search |
| |
|
| |
| Randomized search heuristics |
| |
|
| |
| rank |
| |
|
| |
| Rapid Prototyping |
| |
| Rapid Software Prototyping |
| |
| Readability |
| |
|
| |
| real algebraic numbers |
| |
|
| |
| reals |
| |
|
| |
| Recursion tree analysis |
| |
|
| |
| regression analysis |
| |
| regular discrete functions |
| |
| regular discrete functions. |
| |
|
| |
| Resource augmentation |
| |
|
| |
| Rigid body simulations |
| |
|
| |
| robustness |
| |
|
| |
| Root Approximation |
| |
|
| |
| root separation |
| |
|
| |
| Root Solving |
| |
|
| |
| Routing |
| |
|
| |
| Rumor Spreading |
| |
|
| |
| Runtime Analysis |
| |
|
| |
| Satisfiability |
| |
|
| |
| Schedulability |
| |
|
| |
| Scheduling |
| |
|
| |
| search tree |
| |
|
| |
| searching |
| |
|
| |
| Selection |
| |
| Self-Adjusting Structures |
| |
| Semi-algebraic Sets |
| |
|
| |
| Semialgebraic geometry |
| |
|
| |
| sensor cover |
| |
|
| |
| separation bounds |
| |
|
| |
| set cover |
| |
|
| |
| shape recognition |
| |
|
| |
| shortest-path |
| |
|
| |
| Shortest-Paths Problems |
| |
|
| |
| Shortest Paths |
| |
|
| |
| simplex algorithm |
| |
|
| |
| Simulation |
| |
| single-source shortest-path problem |
| |
| Single Source Shortest Path |
| |
|
| |
| slime mold |
| |
|
| |
| small subgraph |
| |
|
| |
| smoothed analysis} |
| |
|
| |
| Snippet generation |
| |
|
| |
| Software Libraries |
| |
|
| |
| software reuse |
| |
|
| |
| Sortieren |
| |
|
| |
| space curves |
| |
|
| |
| Sparse graphs |
| |
|
| |
| spectral |
| |
|
| |
| Spelling variants |
| |
|
| |
| Sporadic task system |
| |
|
| |
| SPQR-trees |
| |
|
| |
| Stackelberg Routing |
| |
|
| |
| statistics |
| |
|
| |
| Steiner tree |
| |
|
| |
| Steiner Trees |
| |
| STL LEDA Graphiterators Iterator Design Pattern |
| |
| storage systems |
| |
|
| |
| streaming algorithms |
| |
|
| |
| string unification |
| |
|
| |
| Strong -nets |
| |
| Strongly Connected Component. |
| |
| Structural Alignment |
| |
|
| |
| subdivision simplification |
| |
| Subexponential-time Algorithms |
| |
| submodular function |
| |
|
| |
| Suchbaum |
| |
|
| |
| suffix array |
| |
| Suffix Array Construction |
| |
| Sum of square roots |
| |
|
| |
| surface |
| |
|
| |
| surface reconstruction |
| |
|
| |
| Sweep-line algorithm |
| |
|
| |
| synchronization |
| |
|
| |
| system of polymatroid inequalities |
| |
|
| |
| systems of inequalities |
| |
|
| |
| Text Indexing |
| |
|
| |
| Theory of Randomized Search Heuristics |
| |
|
| |
| threshold accepting |
| |
| time-varying access probabilities |
| |
| time bound |
| |
|
| |
| Topological Ordering |
| |
|
| |
| topology computation |
| |
|
| |
| Tori |
| |
|
| |
| torus |
| |
|
| |
| Total Edge Cover |
| |
|
| |
| Touching distances |
| |
|
| |
| Transveral hypergraphs |
| |
|
| |
| transversal hypergraph |
| |
|
| |
| trees |
| |
|
| |
| TRIES |
| |
|
| |
| two-dimensional bin packing |
| |
|
| |
| unequal letter costs |
| |
|
| |
| Unification Algorithms |
| |
|
| |
| Union of Cubes |
| |
|
| |
| universal cover |
| |
|
| |
| unsplittable flow |
| |
|
| |
| visibility |
| |
|
| |
| Visualization |
| |
|
| |
| VLSI computation |
| |
|
| |
| Voronoi Diagrams |
| |
|
| |
| Weierstrass function |
| |
| weighted bipartite matching problem |
| |
| Weighted Matching |
| |
|
| |
| wireless |
| |
|
| |
| Wireless LANs |
| |
|
| |
| Wireless Sensor Networks |
| |
|
| |
| work-stealing |
| |
| Worst-Case Execution Times |
| |
| worst case ratio |
| |
| Zigzag persistent homology |
| |
| zufällige Graphen |
| |
|
| |
| $k$-anonymous |
| |
|
| |
| >> Categories and Subject Descriptors
F.2.2 [Nonnumerical Algorithms and Problems]: Geometrical
problems and computations |
| |
|
| |
