|
Search the dblp DataBase
Michael J. Pelsmajer:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- André Kündgen, Michael J. Pelsmajer, Radhika Ramamurthi
k-Robust Single-Message Transmission. [Citation Graph (0, 0)][DBLP] CAAN, 2004, pp:90-101 [Conf]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
Removing Independently Even Crossings. [Citation Graph (, )][DBLP]
Crossing Number of Graphs with Rotation Systems. [Citation Graph (, )][DBLP]
Crossing Numbers and Parameterized Complexity. [Citation Graph (, )][DBLP]
On the Induced Matching Problem. [Citation Graph (, )][DBLP]
Odd Crossing Number and Crossing Number Are Not the Same. [Citation Graph (, )][DBLP]
Nonrepetitive colorings of graphs of bounded tree-width. [Citation Graph (, )][DBLP]
Dominating sets in plane triangulations. [Citation Graph (, )][DBLP]
Removing even crossings on surfaces. [Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.004secs
|