The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Luis A. Goddyn: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Luis A. Goddyn
    Cones, lattices and Hilbert bases of circuits and perfect matchings. [Citation Graph (0, 0)][DBLP]
    Graph Structure Theory, 1991, pp:419-440 [Conf]
  2. Tsunehiko Kameda, Yi Sun, Luis A. Goddyn
    An Optimization Problem Related to VoD Broadcasting. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:116-125 [Conf]
  3. Mark N. Ellingham, Luis A. Goddyn
    List Edge Colourings of Some 1-Factorable Multigraphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1996, v:16, n:3, pp:343-352 [Journal]
  4. Anna Galluccio, Luis A. Goddyn
    The Circular Flow Number of a 6-Edge Connected Graph is Less Than Four. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2002, v:22, n:3, pp:455-459 [Journal]
  5. Luis A. Goddyn, Pavol Gvozdjak
    Binary Gray Codes with Long Bit Runs. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2003, v:10, n:, pp:- [Journal]
  6. Xudong Fu, Luis A. Goddyn
    Matroids with the Circuit Cover Property. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1999, v:20, n:1, pp:61-73 [Journal]
  7. Wojciech Bienia, Luis A. Goddyn, Pavol Gvozdjak, András Sebö, Michael Tarsi
    Flows, View Obstructions, and the Lonely Runner. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1998, v:72, n:1, pp:1-9 [Journal]
  8. Anna Galluccio, Luis A. Goddyn, Pavol Hell
    High-Girth Graphs Avoiding a Minor are Nearly Bipartite. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2001, v:83, n:1, pp:1-14 [Journal]
  9. Luis A. Goddyn
    Cycle double covers of graphs with Hamilton paths. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1989, v:46, n:2, pp:253-254 [Journal]
  10. Luis A. Goddyn
    Quantizers and the worst-case Euclidean traveling salesman problem. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1990, v:50, n:1, pp:65-81 [Journal]
  11. Luis A. Goddyn, Jan van den Heuvel, Sean McGuinness
    Removable Circuits in Multigraphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1997, v:71, n:2, pp:130-143 [Journal]
  12. Luis A. Goddyn, Ladislav Stacho
    Edge disjoint cycles through specified vertices. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:50, n:3, pp:246-260 [Journal]
  13. Maria Chudnovsky, Jim Geelen, Bert Gerards, Luis A. Goddyn, Michael Lohman, Paul D. Seymour
    Packing Non-Zero A-Paths In Group-Labelled Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2006, v:26, n:5, pp:521-532 [Journal]
  14. Luis A. Goddyn, R. Bruce Richter, Jozef Sirán
    Triangular embeddings of complete graphs from graceful labellings of paths. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2007, v:97, n:6, pp:964-970 [Journal]

  15. Balanced Signings and the Chromatic Number of Oriented Matroids. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
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