Erich Prisner - RankMe

34 papers A 1B 2C 1Journal 30

Year	Rank	Type	Title / Venue / Authors
2006	J	`jnl`	Generalizing the Wolf-Goat-Cabbage Problem. Electron. Notes Discret. Math. Erich Prisner
2004	J	`jnl`	AT-free graphs: linear bounds for the oriented diameter. Discret. Appl. Math. Fedor V. Fomin, Martín Matamala, Erich Prisner, Ivan Rapaport
2004	J	`jnl`	Preface. Discret. Appl. Math. Roger Labahn, Arthur L. Liestman, Erich Prisner
2004	C	`conf`	k-Pseudosnakes in n-dimensional Hypercubes. CTW Erich Prisner
2004	J	`jnl`	k-Pseudosnakes in n-dimensional Hypercubes. Electron. Notes Discret. Math. Erich Prisner
2003	J	`jnl`	The recognition problem for line bigraphs. Discret. Math. Erich Prisner
2002	B	`conf`	k-pseudosnakes in Large Grids. LATIN Martín Matamala, Erich Prisner, Ivan Rapaport
2001	J	`jnl`	Bilateral Orientations and Domination. Electron. Notes Discret. Math. Fedor V. Fomin, Martín Matamala, Erich Prisner, Ivan Rapaport
2001	J	`jnl`	Eulerian iterated line graphs and digraphs. Discret. Math. Erich Prisner
2000	J	`jnl`	A Note of k-Rotation Graphs. Ars Comb. Erich Prisner
2000	J	`jnl`	Bicliques in Graphs I: Bounds on Their Number. Comb. Erich Prisner
2000	J	`jnl`	Eccentricity-approximating trees in chordal graphs. Discret. Math. Erich Prisner
2000	J	`jnl`	Recognizing k-path Graphs. Discret. Appl. Math. Erich Prisner
2000	J	`jnl`	Recognizing random intersection graphs. Discret. Math. Erich Prisner
2000	J	`jnl`	Source reversal and chip firing on graphs. Theor. Comput. Sci. Eric Goles Ch., Erich Prisner
1999	J	`jnl`	Generalized octahedra and cliques in intersection graphs of uniform hypergraphs. Discret. Math. Erich Prisner
1999	J	`jnl`	Recognizing Clique Graphs of Directed and Rooted Path Graphs. Discret. Appl. Math. Erich Prisner, Jayme Luiz Szwarcfiter
1998	J	`jnl`	Intersection Multigraphs of Uniform Hypergraphs. Graphs Comb. Erich Prisner
1997	B	`conf`	Bicliques in Graphs II: Recognizing k-Path Graphs and Underlying Graphs of Line Digraphs. WG Erich Prisner
1997	A	`conf`	Distance Approximating Spanning Trees. STACS Erich Prisner
1997	J	`jnl`	Radius versus diameter in cocomparability and intersection graphs. Discret. Math. Erich Prisner
1996	J	`jnl`	Well covered simplicial, chordal, and circular arc graphs. J. Graph Theory Erich Prisner, Jerzy Topp, Preben D. Vestergaard
1995	J	`jnl`	Clique Covering and Clique Partition in Generalizations of Line Graphs. Discret. Appl. Math. Erich Prisner
1994	J	`jnl`	A common generalization of line graphs and clique graphs. J. Graph Theory Erich Prisner
1994	J	`jnl`	Algorithms for Interval Catch Digraphs. Discret. Appl. Math. Erich Prisner
1994	J	`jnl`	Iterated Graphs Comb. Van Bang Le, Erich Prisner
1994	J	`jnl`	Parallel Chip Firing on Digraphs. Complex Syst. Erich Prisner
1993	J	`jnl`	In-Tournament Digraphs. J. Comb. Theory B Jørgen Bang-Jensen, Jing Huang, Erich Prisner
1993	J	`jnl`	The dynamics of the line and path graph operators. Graphs Comb. Erich Prisner
1992	J	`jnl`	Convergence of iterated clique graphs. Discret. Math. Erich Prisner
1992	J	`jnl`	On inverse problems for the cycle graph operator. Graphs Comb. Van Bang Le, Erich Prisner
1992	J	`jnl`	Two algorithms for the subset interconnection design problem. Networks Erich Prisner
1991	J	`jnl`	Clique graphs and Helly graphs. J. Comb. Theory B Hans-Jürgen Bandelt, Erich Prisner
1989	J	`jnl`	A characterization of interval catch digraphs. Discret. Math. Erich Prisner