default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 143
Volume 143, Number 1-3, September 2004
- Meena Mahajan, P. R. Subramanya, V. Vinay:
The combinatorial approach yields an NC algorithm for computing Pfaffians. 1-16 - Simone Dantas, Celina M. H. de Figueiredo
, Sulamita Klein, Sylvain Gravier, Bruce A. Reed:
Stable skew partition problem. 17-22 - Elisabetta Alvoni:
On k nearest points of a finite set in a normed linear space. 23-30 - Bang Ye Wu:
Approximation algorithms for the optimal p-source communication spanning tree. 31-42 - R. Julian R. Abel, Stephanie Costa, Norman J. Finizio:
Directed-ordered whist tournaments and (v, 5, 1) difference families: existence results and some new classes of Z-cyclic solutions. 43-53 - Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stephane Perennes, Pino Persiano, Hervé Rivano:
Approximate constrained bipartite edge coloring. 54-61 - Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska:
Distributed algorithm for approximating the maximum matching. 62-71 - Eric S. Egge, Toufik Mansour:
132-avoiding two-stack sortable permutations, Fibonacci numbers, and Pell numbers. 72-83 - Shannon L. Fitzpatrick, Jeannette C. M. Janssen, Richard J. Nowakowski:
Distributive online channel assignment for hexagonal cellular networks with constraints. 84-91 - Gwénaël Richomme, Francis Wlazinski:
Overlap-free morphisms and finite test-sets. 92-109 - Nirit Sandman:
A type-B Tamari poset. 110-122 - Heiko Schröder, Ondrej Sýkora, Imrich Vrto:
Cyclic cutwidths of the two-dimensional ordinary and cylindrical meshes. 123-129 - Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki:
On generalized greedy splitting algorithms for multiway partition problems. 130-143 - Martin Klazar:
Extremal problems for ordered hypergraphs: small patterns and some enumeration. 144-154 - Simone Dantas, Celina M. H. de Figueiredo, Luérbio Faria:
On decision and optimization (k, l)-graph sandwich problems. 155-165 - André Barbé, Fritz von Haeseler, Guentcho Skordev:
Scaling properties of generalized Carlitz sequences of polynomials. 166-181 - R. Chandrasekaran, Kunhiraman Nair, Yash P. Aneja, Santosh N. Kabadi:
Multi-terminal multipath flows: synthesis. 182-193 - Katharina T. Huber, Vincent Moulton, Charles Semple:
Replacing cliques by stars in quasi-median graphs. 194-203 - Peter Dankelmann, Ortrud Oellermann, Jian-Liang Wu:
Minimum average distance of strong orientations of graphs. 204-212 - Carles Padró, Ignacio Gracia, Sebastià Martín Molleví:
Improving the trade-off between storage and communication in broadcast encryption schemes. 213-220 - Martin Charles Golumbic, Marina Lipshteyn:
Chordal probe graphs. 221-237 - Luitpold Babel, Bo Chen, Hans Kellerer, Vladimir Kotov:
Algorithms for on-line bin-packing problems with cardinality constraints. 238-251 - Jean-Philippe Hamiez, Jin-Kao Hao:
A linear-time algorithm to solve the Sports League Scheduling Problem (prob026 of SPLib). 252-265 - Andrea Vietri:
The complexity of arc-colorings for directed hypergraphs. 266-271 - Derek E. Armstrong, Sheldon H. Jacobson:
Polynomial transformations and data-independent neighborhood functions. 272-284 - Mohammad R. Salavatipour:
A polynomial time algorithm for strong edge coloring of partial k-trees. 285-291 - Meinard Müller, Masakazu Jimbo:
Erasure-resilient codes from affine spaces. 292-297 - Bas van Velzen, Herbert Hamers, Henk Norde:
Characterizing convexity of games using marginal vectors. 298-306 - Ryan B. Hayward, Ron Shamir:
A note on tolerance graph recognition. 307-311 - Woong Kook:
Recurrence relations for the spectrum polynomial of a matroid. 312-317 - Sung Kwon Kim:
Order-preserving, upward drawing of binary trees using fewer bends. 318-323 - Martin Sonntag, Hanns-Martin Teichert:
Competition hypergraphs. 324-329 - Jaeun Lee, Young-hee Shin:
The achromatic number of the union of cycles. 330-335 - Dániel Marx:
Eulerian disjoint paths problem in grid graphs is NP-complete. 336-341 - Bang Ye Wu:
An improved algorithm for the k-source maximum eccentricity spanning trees. 342-350 - Gerard J. Chang:
The weighted independent domination problem is NP-complete for chordal graphs. 351-352 - Adrian Dumitrescu:
The cost of cutting out convex n-gons. 353-358 - Nicolas Lichiardopol:
Broadcast time and connectivity. 359-363 - Wei-Fan Wang:
Vertex-pancyclicity of edge-face-total graphs. 364-367 - Alexander V. Karzanov:
Hard cases of the multifacility location problem. 368-373 - Venkat Venkateswaran:
Minimizing maximum indegree. 374-378
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 2024-11-15 19:40 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:
