default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 57
Volume 57, Number 1, 1995
- Noga Alon, Joel Spencer, Prasad Tetali:
Covering with Latin Transversals. 1-10 - Omer Berkman, Uzi Vishkin:
Almost Fully-parallel Parentheses Matching. 11-28 - Elias Dahlhaus:
Efficient Parallel Recognition Algorithms of Cographs and Distance Hereditary Graphs. 29-44 - Yakov S. Smetanich, Yakov B. Kazanovich, Vyacheslav V. Kornilov:
A Combinatorial Approach to the Problem of Self-assembly. 45-65 - Kirk Pruhs:
Using Local Adaptations to Reconfigure a Spanning Tree of a Network. 67-74 - Frank Ruskey
, Ming Jiang, Andrew Weston:
The Hamiltonicity of Directed sigma - tao Cayley Graphs (or: A Tale of Backtracking). 75-83 - Andreas S. Schulz:
The Permutahedron of Series-parallel Posets. 85-90
Volume 57, Number 2-3, 1995
- J. D. Annan:
The Complexities of the Coefficients of the Tutte Polynomial. 93-103 - John R. Birge, Michael A. H. Dempster:
Optimal Match-up Strategies in Stochastic Scheduling. 105-120 - Peter Butkovic:
Regularity of Matrices in Min-algebra and Its Time- Complexity. 121-132 - Keith Edwards, Colin McDiarmid:
The Complexity of Harmonious Colouring for Trees. 133-144 - Kevin D. Glazebrook:
Stochastic Scheduling and Forwards Induction. 145-165 - Claire Hanen, Alix Munier:
A Study of the Cyclic Scheduling Problem on Parallel Processors. 167-192 - Ludek Kucera:
Expected Complexity of Graph Partitioning Problems. 193-212 - Bruce A. Reed:
Rooted Routing in the Plane. 213-227 - Eric Sanlaville:
Nearly on Line Scheduling of Preemptive Independent Tasks. 229-241 - Nei Yoshihiro Soma, Alan Solon Ivor Zinober, Horacio Hideki Yanasse, Peter John Harley:
A Polynomial Approximation Scheme for the Subset Sum Problem. 243-253 - Anand Srivastav, Peter Stangier:
Weighted Fractional and Integral K-matching in Hypergraphs. 255-269
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-03-08 00:38 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
