The SCEAS System
Navigation Menu

Journals in DBLP

J. Discrete Algorithms
2006, volume: 4, number: 4

  1. Fedor V. Fomin, Dimitrios M. Thilikos
    A 3-approximation for the pathwidth of Halin graphs. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2006, v:4, n:4, pp:499-510 [Journal]
  2. William Kennedy, Guohui Lin, Guiying Yan
    Strictly chordal graphs are leaf powers. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2006, v:4, n:4, pp:511-525 [Journal]
  3. Dieter Rautenbach, Christian Szegedy, Jürgen Werber
    Delay optimization of linear depth boolean circuits with prescribed input arrival times. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2006, v:4, n:4, pp:526-537 [Journal]
  4. Issam Dagher
    Art networks with geometrical distances. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2006, v:4, n:4, pp:538-553 [Journal]
  5. Prosenjit Bose, Sergio Cabello, Otfried Cheong, Joachim Gudmundsson, Marc J. van Kreveld, Bettina Speckmann
    Area-preserving approximations of polygonal paths. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2006, v:4, n:4, pp:554-566 [Journal]
  6. Petra Berenbrink, Leslie Ann Goldberg, Paul W. Goldberg, Russell A. Martin
    Utilitarian resource assignment. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2006, v:4, n:4, pp:567-587 [Journal]
  7. Andrzej Czygrinow, Michal Hanckowiak
    Distributed algorithms for weighted problems in sparse graphs. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2006, v:4, n:4, pp:588-607 [Journal]
  8. Jiong Guo, Rolf Niedermeier
    Exact algorithms and applications for Tree-like Weighted Set Cover. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2006, v:4, n:4, pp:608-622 [Journal]
  9. Markus Bläser, Bodo Manthey, Jiri Sgall
    An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2006, v:4, n:4, pp:623-632 [Journal]
  10. Vincent Vajnovszki, Timothy Walsh
    A loop-free two-close Gray-code algorithm for listing k-ary Dyck words. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2006, v:4, n:4, pp:633-648 [Journal]
  11. Johann Blieberger
    Average case analysis of DJ graphs. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2006, v:4, n:4, pp:649-675 [Journal]
  12. Victor Boyarshinov, Malik Magdon-Ismail
    Linear time isotonic and unimodal regression in the L1 and Linfinity norms. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2006, v:4, n:4, pp:676-691 [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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002