The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Michael J. Pelsmajer: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. André Kündgen, Michael J. Pelsmajer, Radhika Ramamurthi
    k-Robust Single-Message Transmission. [Citation Graph (0, 0)][DBLP]
    CAAN, 2004, pp:90-101 [Conf]
  2. Jamiru Luttamaguzi, Michael J. Pelsmajer, Zhizhang Shen, Boting Yang
    Integer Programming Methods for Several Optimization Problems in Graph Theory. [Citation Graph (0, 0)][DBLP]
    Computers and Their Applications, 2005, pp:50-55 [Conf]
  3. Gruia Calinescu, Michael J. Pelsmajer
    Fast Edge Colorings with Fixed Number of Colors to Minimize Imbalance. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2006, pp:117-128 [Conf]
  4. Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic
    Odd Crossing Number Is Not Crossing Number. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2005, pp:386-396 [Conf]
  5. Iyad A. Kanj, Michael J. Pelsmajer, Marcus Schaefer
    Parameterized Algorithms for Feedback Vertex Set. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2004, pp:235-247 [Conf]
  6. Seog-Jin Kim, Kittikorn Nakprasit, Michael J. Pelsmajer, Jozef Skokan
    Transversal numbers of translates of a convex body. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:18, pp:2166-2173 [Journal]
  7. Weiting Cao, Michael J. Pelsmajer
    The Toughness of a Toroidal Graph with Connectivity 3 and Girth 6 is Exactly 1. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2004, v:20, n:2, pp:181-183 [Journal]
  8. Michael J. Pelsmajer
    Maximum Induced Linear Forests in Outerplanar Graphs. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2004, v:20, n:1, pp:121-129 [Journal]
  9. Faith Ellen Fich, André Kündgen, Michael J. Pelsmajer, Radhika Ramamurthi
    Graph Minors and Reliable Single Message Transmission. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2005, v:19, n:4, pp:815-847 [Journal]
  10. Michael J. Pelsmajer
    Equitable list-coloring for graphs of maximum degree 3. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2004, v:47, n:1, pp:1-8 [Journal]
  11. Peter Hui, Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic
    Train Tracks and Confluent Drawings. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2007, v:47, n:4, pp:465-479 [Journal]
  12. Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic
    Removing even crossings. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2007, v:97, n:4, pp:489-500 [Journal]

  13. Removing Independently Even Crossings. [Citation Graph (, )][DBLP]


  14. Crossing Number of Graphs with Rotation Systems. [Citation Graph (, )][DBLP]


  15. Crossing Numbers and Parameterized Complexity. [Citation Graph (, )][DBLP]


  16. On the Induced Matching Problem. [Citation Graph (, )][DBLP]


  17. Odd Crossing Number and Crossing Number Are Not the Same. [Citation Graph (, )][DBLP]


  18. Nonrepetitive colorings of graphs of bounded tree-width. [Citation Graph (, )][DBLP]


  19. Dominating sets in plane triangulations. [Citation Graph (, )][DBLP]


  20. Removing even crossings on surfaces. [Citation Graph (, )][DBLP]


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