Items where Subject is "68-XX Computer science > 68Qxx Theory of computing > 68Q25 Analysis of algorithms and problem complexity"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Authors | Item Type
Jump to: A | B | D | E | F | G | H | K | L | M | P | R | S | W | Z
Number of items at this level: 64.

A

Arkin, Esther M. and Fekete, Sandor P. and Mitchell, Joseph S. B. (2000) Approximation algorithms for lawn mowing and milling.
Published in: Computational geometry : theory and applications Vol. 17 (1-2). pp. 25-50.

Arnim, Annelie von and Higuera, C. de la (1994) Computing the jump number on semi-orders is polynomial.
Published in: Discrete applied mathematics Vol. 51 (1-2). pp. 219-232.

B

Bachem, Achim and Euler, Reinhardt (1984) Recent Trends in Combinatorial Optimization.
Published in: OR-Spektrum : quantitative approaches in management Vol. 6 (1). pp. 1-21.

Baur, Christoph and Fekete, Sandor P. (2001) Approximation of Geometric Dispersion Problems.
Published in: Algorithmica Vol. 30 (3). pp. 451-470.

Baur, Christoph and Fekete, Sandor P. (1998) Approximation of Geometric Dispersion Problems.
Published In: Approximation algorithms for combinatorial optimization : proceedings / International Workshop APPROX '98, Aalborg, Denmark, July 18 - 19, 1998, Lecture notes in computer science. 1444 Springer 1998, pp. 63-75.

Blasum, Ulrich and Bussieck, M. and Hochstättler, Winfried and Moll, Christoph and Scheel, Hans-Helmut and Winter, Thomas (1999) Scheduling Trams in the Morning.
Published in: Mathematical Methods of Operations Research Vol. 49 (1). pp. 137-148.

Böhm, Max and Speckenmeyer, Ewald (1997) Precomputation-based Load Balancing.
Published In: Proceedings of the 4th Workshop on Parallel Systems & Algorithms, PASA '96 : Research Center Jülich, Germany, 10 - 12 April 1996 World Scientific 1997, pp. 177-194.

D

Dahlhaus, Elias (1999) An Improved Linear Time Algorithm for Minimal Elimination Ordering in Planar Graphs that is Parallelizable.
Technical Report , 10 p.

Dahlhaus, Elias (1998) Linear Time Algorithm to Recognize Clustered Planar Graphs and its Parallelization (Extended Abstract).
Published In: Theoretical informatics : proceedings / LATIN '98, Third Latin American Symposium, Campinas, Brazil, April 20 - 24, 1998, Lecture notes in computer science. 1380 Springer 1998, pp. 239-248.

Dahlhaus, Elias (1998) A Linear Time Algorithm to Recognize Clustered Planar Graphs and its Parallelization.
Technical Report , 18 p.

Dahlhaus, Elias (1997) Minimal Elimination Ordering Inside a Given Chordal Graph.
Published In: Graph-theoretic concepts in computer science : 23th international workshop, WG '97, Berlin, Germany, June 18 - 20, 1997 ; proceedings, Lecture notes in computer science. 1335 Springer 1997, pp. 132-143.

Dahlhaus, Elias (1999) Minimum Fill-in and Treewidth for Graphs Modularly Decomposable into Chordal Graphs.
Technical Report , 13 p.

Dahlhaus, Elias (1998) Minimum Fill-in and Treewidth for Graphs Modularly Decomposable into Chordal Graphs.
Published In: Graph-theoretic concepts in computer science : 24th international workshop, WG '98, Smolenice Castle, Slovak Republic, June 18 - 20, 1998 ; proceedings, Lecture notes in computer science. 1517 Springer 1998, pp. 713-724.

Dahlhaus, Elias (2000) Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition.
Published in: Journal of Algorithms Vol. 36 (2). pp. 205-240.

Damm, Frank and Heider, Franz-Peter (1996) Amplifying the Security of One-Way Functions -- A Proof of Yao's XOR-Lemma.
Technical Report , 13 p.

E

Engels, Birgit (2010) The Transitive Minimum Manhattan Subnetwork Problem in 3 Dimensions.
Published in: Discrete Applied Mathematics Vol. 158 (4). pp. 298-307.

F

Faigle, Ulrich and Gierz, Gerhard and Schrader, Rainer (1985) Algorithmic approaches to setup minimization.
Published in: SIAM Journal on Computing Vol. 14 (4). pp. 954-965. ISSN 0097-5397

Faigle, Ulrich and Kern, Walter (1991) Some Order Dimension Bounds for Communication Complexity Problems.
Published in: Acta Informatica Vol. 28 (6). pp. 593-601.

Faigle, Ulrich and Kern, Walter and Turán, Gyorgy (1989) On the performance of on-line algorithms for partition problems.
Published in: Acta Cybernetica : forum centrale publicationum cyberneticarum Hungaricum Vol. 9 (2). pp. 107-119.

Faigle, Ulrich and Schrader, Rainer (1986) On the computational complexity of the order polynomial.
Published in: Discrete Applied Mathematics Vol. 15 (2-3). pp. 261-269.

Fekete, Sandor P. (1997) Area optimization of simple polygons.
Technical Report , 45 p.

Fekete, Sandor P. (2000) On Simple Polygonalizations with Optimal Area.
Published in: Discrete & computational geometry : an international journal of mathematics and computer science. Vol. 23 (1). pp. 73-110.

Fekete, Sandor P. and Hochstättler, Winfried and Kromberg, Stephan and Moll, Christoph (1999) The Complexity of an Inverse Shortest Path Problem.
Published In: Contemporary trends in discrete mathematics : from DIMACS and DIMATIA to the future ; DIMATIA-DIMACS conference, May 19 - 25, 1997, Štiřín Castle, Czech Republic ; [contains papers from a DIMATIA/DIMACS Conference on the Future of Discrete Mathematics], DIMACS series in discrete mathematics and theoretical computer science. 49 American Mathematical Society (AMS) 1999, pp. 113-127.

Fekete, Sandor P. and Mitchell, Joseph S. B. (1997) Histogram decomposition and stereolithography.
Technical Report , 13 p.

Fuchs, Bernhard and Hochstättler, Winfried and Kern, Walter (2005) Online matching on a line.
Published in: Theoretical Computer Science Vol. 332 (1-3). pp. 251-264.

G

Groß, Martin and Kappmeier, Jan-Philipp W. and Schmidt, Daniel R. and Schmidt, Melanie (2012) Approximating Earliest Arrival Flows in Arbitrary Networks.
Published In: Algorithms – ESA 2012, Lecture Notes in Computer Science. 7501 Springer 2012, pp. 551-562.

H

Hamacher, Anja (1997) Baumzerlegungen unter Nebenbedingungen -- Ein Clusterverfahren zur Lösung praktischer Vehicle-Routing-Probleme. PhD thesis.

Hamacher, Anja and Hochstättler, Winfried and Moll, Christoph (2000) Tree Partitioning under Constraints -- Clustering for Vehicle Routing Problems.
Published in: Discrete Applied Mathematics Vol. 99 (1-3). pp. 55-69.

K

Kappmeier, Jan-Philipp W. and Schmidt, Daniel R. and Schmidt, Melanie (2015) Solving k-means on High-Dimensional Big Data.
Published In: 14th International Symposium, SEA 2015, Paris, France, June 29 – July 1, 2015, Proceedings, Lecture Notes in Computer Science. 9125 Springer 2015, pp. 259-270.

Kern, Walter (1993) On the Depth of Combinatorial Optimization Problems.
Published in: Discrete applied mathematics Vol. 43 (2). pp. 115-129.

Kern, Walter (1989) On the Rate of Convergence of some Stochastic Processes.
Published in: Mathematics of Operations Research Vol. 14 (2). pp. 275-280.

Kern, Walter (1989) A Probabilistic Analysis of the Switching Algorithm for the Euclidean TSP.
Published in: Mathematical programming : Series A Vol. 44 (1-3). pp. 213-219.

Korte, Bernhard and Schrader, Rainer (1984) Can the ellipsoid method be efficient?
Published in: Operations Research and Economic Theory : Essays in Honor of Martin J. Beckmann. Springer 1984.

Korte, Bernhard and Schrader, Rainer (1981) On the existence of fast approximation schemes.
Published In: Nonlinear Programming 4 Academic Press 1981, pp. 415-437.

Korte, Bernhard and Schrader, Rainer (1981) A survey on oracle techniques.
Published In: Mathematical Foundations of Computer Science ; Proceedings, 10th Symposium Štrbské Pleso, Czechoslovakia August 31 – September 4, 1981, Lecture Notes in Computer Science. 118 Springer 1981, pp. 61-77.

L

Leclerc, Matthias (1989) Optimizing over a slice of the bipartite matching polytope.
Published in: Discrete mathematics Vol. 73 (1-2). pp. 159-162.

M

Middendorf, Matthias and Pfeiffer, Frank (1993) On the Complexity of the Disjoint Path Problem.
Published in: Combinatorica Vol. 13 (1). pp. 97-107.

P

Porschen, Stefan (2007) On variable-weighted exact satisfiability problems.
Published in: Annals of mathematics and artificial intelligence Vol. 51 (1). pp. 27-54.

Porschen, Stefan (2005) A new parameterization of the shadow problem.
Technical Report , 16 p.

Porschen, Stefan and Schmidt, Tatjana and Speckenmeyer, Ewald and Wotzlaw, Andreas (2011) XSAT and NAE-SAT of linear CNF classes.
Published in: Discrete Applied Mathematics Vol. 167. pp. 1-14. ISSN 0166-218X

Porschen, Stefan and Speckenmeyer, Ewald (2007) Algorithms for Variable-Weighted 2-SAT and Dual Problems.
Technical Report , 14 p.

Porschen, Stefan and Speckenmeyer, Ewald (2007) Clause Set Structures and Polynomial-Time SAT-Decidable Classes.
Technical Report , 12 p.

Porschen, Stefan and Speckenmeyer, Ewald (2007) Clause set structures and satisfiability.
Technical Report , 23 p.

Porschen, Stefan and Speckenmeyer, Ewald (2007) Satisfiability of Mixed Horn Formulas.
Published in: Discrete applied mathematics Vol. 155 (11). 1408 -1419.

Porschen, Stefan and Speckenmeyer, Ewald and Randerath, Bert and Gärtner, Mattias (2004) Tabu-Sat and Walksat for Level Graph Formulas.
Technical Report , 20 p.

Porschen, Stefan and Speckenmeyer, Ewald and Zhao, Xishun (2006) Linear CNF formulas and satisfiability.
Technical Report , 37 p.

R

Randerath, Bert and Schiermeyer, Ingo (2004) Exact algorithms for MINIMUM DOMINATING SET.
Technical Report , 8 p.

S

Schrader, Rainer (1983) Approximations to partitioning and subgraph problems on trees.
Published in: Discrete Applied Mathematics Vol. 6 (3). pp. 301-309.

Schrader, Rainer (1982) Ellipsoid methods.
Published In: Modern applied mathematics : optimization and operations research ; collection of state-of-the-art surveys based on lectures presented at the Summer School "Optimization and Operations Research", held at the Univ. of Bonn, September 14 - 22, 1979 North Holland 1982, pp. 265-311.

Schwikowski, B. and Speckenmeyer, Ewald (1997) On computing all minimal solutions for feedback problems.
Technical Report , 10 p.

Speckenmeyer, Ewald and Böhm, Max and Heusch, Peter (1997) On the Imbalance of Distributions of Solutions of CNF-Formulas and its Impact on Satisfiability Solvers.
Published In: Satisfiability problem : theory and applications ; DIMACS workshop March 11 - 13, 1996, DIMACS series in discrete mathematics and theoretical computer science. 35 American Math. Soc. 1997, pp. 669-676.

Speckenmeyer, Ewald and Wotzlaw, Andreas and Porschen, Stefan (2011) A Satisfiability-based Approach for Embedding Generalized Tanglegrams on Level Graphs.
Published In: Theory and Applications of Satisfiability Testing - SAT 2011 : 14th International Conference, SAT 2011, Ann Arbor, MI, USA, June 19-22, 2011. Proceedings, Lecture notes in computer science. 6695 Springer February 2011, pp. 134-144.

Srivastav, Anand and Stangier, Peter (1996) Algorithmic Chernoff-Hoeffding Inequalities in Integer Programming.
Published In: Algorithms and Computation : 5th International Symposium, ISAAC '94 Beijing, P. R. China, August 2527, 1994 Proceedings, Lecture notes in computer science. 834 Springer 1996, pp. 226-233.

Srivastav, Anand and Stangier, Peter (1996) Algorithmic Chernoff-Hoeffding Inequalities in Integer Programming.
Published in: Random structures & algorithms Vol. 8 (1). pp. 27-58.

Srivastav, Anand and Stangier, Peter (1993) Integer Multicommodity Flows with Reduced Demands.
Published In: AlgorithmsESA '93 : First Annual European Symposium Bad Honnef, Germany September 30 - October 2, 1993 Proceedings, Lecture notes in computer science. 726 Springer 1993, pp. 360-371.

Srivastav, Anand and Stangier, Peter (1992) On Derandomized Approximation Algorithms.
Technical Report , 32 p.

Srivastav, Anand and Stangier, Peter (1997) Tight Approximation for Resource Constrained Scheduling and Bin Packing.
Published in: Discrete Applied Mathematics Vol. 79 (1-3). pp. 223-245.

Srivastav, Anand and Stangier, Peter (1994) Tight Approximation for Resource Constrained Scheduling and Bin Packing.
Published In: Algorithms ESA '94 : Second Annual European Symposium Utrecht, The Netherlands, September 26 - 28, 1994 Proceedings, Lecture notes in computer science. 855 Springer 1994, pp. 307-318.

Srivastav, Anand and Stangier, Peter (1995) Weighted Fractional and Integral k-Matching in Hypergraphs.
Published in: Discrete Applied Mathematics Vol. 57 (2-3). pp. 255-269.

Srivastav, Anand and Wolf, Katja (1998) Finding Dense Subgraphs with Semidefinite Programming.
Published In: Approximation algorithms for combinatorial optimization : proceedings / International Workshop APPROX '98, Aalborg, Denmark, July 18 - 19, 1998, Lecture notes in computer science. 1444 Springer 1998, pp. 181-191.

W

Wotzlaw, Andreas and Speckenmeyer, Ewald and Porschen, Stefan (2012) Generalized k-ary tanglegrams on level graphs: a satisfiability-based approach and its evaluation.
Published in: Discrete Applied Mathematics Vol. 160 (16-17). pp. 2349-2363.

Wotzlaw, Andreas and Speckenmeyer, Ewald and Porschen, Stefan (2012) A Satisfiability-based Approach for Generalized Tanglegrams on Level Graphs. , Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH. (Unpublished)

Z

Zimmermann, Uwe (1986) Duality for balanced submodular flows.
Published in: Discrete applied mathematics Vol. 15 (2-3). pp. 365-376.

Zimmermann, Uwe (1986) Linear and Combinatorial Sharing Problems.
Published in: Discrete applied mathematics Vol. 15 (1). pp. 85-104.

This list was generated on Tue Dec 12 03:37:45 2017 CET.