The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Journals in DBLP

Discrete Applied Mathematics
2004, volume: 143, number: 1-3

  1. Meena Mahajan, P. R. Subramanya, V. Vinay
    The combinatorial approach yields an NC algorithm for computing Pfaffians. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:1-16 [Journal]
  2. Simone Dantas, Celina M. Herrera de Figueiredo, Sulamita Klein, Sylvain Gravier, Bruce A. Reed
    Stable skew partition problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:17-22 [Journal]
  3. Elisabetta Alvoni
    On k nearest points of a finite set in a normed linear space. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:23-30 [Journal]
  4. Bang Ye Wu
    Approximation algorithms for the optimal p-source communication spanning tree. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:31-42 [Journal]
  5. 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. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:43-53 [Journal]
  6. Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stephane Perennes, Pino Persiano, Hervé Rivano
    Approximate constrained bipartite edge coloring. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:54-61 [Journal]
  7. Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska
    Distributed algorithm for approximating the maximum matching. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:62-71 [Journal]
  8. Eric S. Egge, Toufik Mansour
    132-avoiding two-stack sortable permutations, Fibonacci numbers, and Pell numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:72-83 [Journal]
  9. Shannon L. Fitzpatrick, Jeannette Janssen, Richard J. Nowakowski
    Distributive online channel assignment for hexagonal cellular networks with constraints. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:84-91 [Journal]
  10. Gwénaël Richomme, Francis Wlazinski
    Overlap-free morphisms and finite test-sets. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:92-109 [Journal]
  11. Nirit Sandman
    A type-B Tamari poset. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:110-122 [Journal]
  12. Heiko Schröder, Ondrej Sýkora, Imrich Vrto
    Cyclic cutwidths of the two-dimensional ordinary and cylindrical meshes. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:123-129 [Journal]
  13. Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki
    On generalized greedy splitting algorithms for multiway partition problems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:130-143 [Journal]
  14. Martin Klazar
    Extremal problems for ordered hypergraphs: small patterns and some enumeration. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:144-154 [Journal]
  15. Simone Dantas, Celina M. Herrera de Figueiredo, Luerbio Faria
    On decision and optimization (k, l)-graph sandwich problems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:155-165 [Journal]
  16. André Barbé, Fritz von Haeseler, Guentcho Skordev
    Scaling properties of generalized Carlitz sequences of polynomials. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:166-181 [Journal]
  17. R. Chandrasekaran, Kunhiraman Nair, Yash P. Aneja, Santosh N. Kabadi
    Multi-terminal multipath flows: synthesis. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:182-193 [Journal]
  18. Katharina T. Huber, Vincent Moulton, Charles Semple
    Replacing cliques by stars in quasi-median graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:194-203 [Journal]
  19. Peter Dankelmann, Ortrud Oellermann, Jian-Liang Wu
    Minimum average distance of strong orientations of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:204-212 [Journal]
  20. Carles Padró, Ignacio Gracia, Sebastià Martín Molleví
    Improving the trade-off between storage and communication in broadcast encryption schemes. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:213-220 [Journal]
  21. Martin Charles Golumbic, Marina Lipshteyn
    Chordal probe graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:221-237 [Journal]
  22. Luitpold Babel, Bo Chen, Hans Kellerer, Vladimir Kotov
    Algorithms for on-line bin-packing problems with cardinality constraints. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:238-251 [Journal]
  23. Jean-Philippe Hamiez, Jin-Kao Hao
    A linear-time algorithm to solve the Sports League Scheduling Problem (prob026 of SPLib). [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:252-265 [Journal]
  24. Andrea Vietri
    The complexity of arc-colorings for directed hypergraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:266-271 [Journal]
  25. Derek E. Armstrong, Sheldon H. Jacobson
    Polynomial transformations and data-independent neighborhood functions. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:272-284 [Journal]
  26. Mohammad R. Salavatipour
    A polynomial time algorithm for strong edge coloring of partial k-trees. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:285-291 [Journal]
  27. Meinard Müller, Masakazu Jimbo
    Erasure-resilient codes from affine spaces. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:292-297 [Journal]
  28. Bas van Velzen, Herbert Hamers, Henk Norde
    Characterizing convexity of games using marginal vectors. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:298-306 [Journal]
  29. Ryan B. Hayward, Ron Shamir
    A note on tolerance graph recognition. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:307-311 [Journal]
  30. W. Kook
    Recurrence relations for the spectrum polynomial of a matroid. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:312-317 [Journal]
  31. Sung Kwon Kim
    Order-preserving, upward drawing of binary trees using fewer bends. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:318-323 [Journal]
  32. Martin Sonntag, Hanns-Martin Teichert
    Competition hypergraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:324-329 [Journal]
  33. Jaeun Lee, Young-hee Shin
    The achromatic number of the union of cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:330-335 [Journal]
  34. Dániel Marx
    Eulerian disjoint paths problem in grid graphs is NP-complete. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:336-341 [Journal]
  35. Bang Ye Wu
    An improved algorithm for the k-source maximum eccentricity spanning trees. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:342-350 [Journal]
  36. Gerard J. Chang
    The weighted independent domination problem is NP-complete for chordal graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:351-352 [Journal]
  37. Adrian Dumitrescu
    The cost of cutting out convex n-gons. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:353-358 [Journal]
  38. Nicolas Lichiardopol
    Broadcast time and connectivity. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:359-363 [Journal]
  39. Wei-Fan Wang
    Vertex-pancyclicity of edge-face-total graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:364-367 [Journal]
  40. Alexander V. Karzanov
    Hard cases of the multifacility location problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:368-373 [Journal]
  41. Venkat Venkateswaran
    Minimizing maximum indegree. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:374-378 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002