The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Stefan Felsner: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Helmut Alt, Stefan Felsner, Ferran Hurtado, Marc Noy
    Point-Sets with few k-Sets. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:200-205 [Conf]
  2. Stefan Felsner
    On the Number of Arrangements of Pseudolines. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1996, pp:30-37 [Conf]
  3. Nicolas Bonichon, Stefan Felsner, Mohamed Mosbah
    Convex Drawings of 3-Connected Plane Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2004, pp:60-70 [Conf]
  4. Stefan Felsner, Giuseppe Liotta, Stephen K. Wismath
    Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2001, pp:328-342 [Conf]
  5. Cornelia Dangelmayr, Stefan Felsner
    Chordal Graphs as Intersection Graphs of Pseudosegments. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2006, pp:208-219 [Conf]
  6. Stefan Felsner, Mareike Massow
    Thickness of Bar 1-Visibility Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2006, pp:330-342 [Conf]
  7. Stefan Felsner, Florian Zickfeld
    Schnyder Woods and Orthogonal Surfaces. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2006, pp:417-429 [Conf]
  8. Stefan Felsner, Ferran Hurtado, Marc Noy, Ileana Streinu
    Hamiltonicity and colorings of arrangement graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:155-164 [Conf]
  9. Stefan Felsner, Lorenz Wernisch
    Markov Chains for Linear Extensions, the Two-Dimensional Case. [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:239-247 [Conf]
  10. Stefan Felsner, Lorenz Wernisch
    Maximum k-chains in planar point sets: combinatorial structure and algorithms. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:146-153 [Conf]
  11. Stefan Felsner, Rudolf Müller, Lorenz Wernisch
    Trapezoid Graphs and Generalizations, Geometry and Algorithms. [Citation Graph (0, 0)][DBLP]
    SWAT, 1994, pp:143-154 [Conf]
  12. Stefan Felsner
    Tolerance Graphs and Orders. [Citation Graph (0, 0)][DBLP]
    WG, 1992, pp:17-26 [Conf]
  13. Stefan Felsner, Klaus Kriegel
    Triangles in Euclidean Arrangements. [Citation Graph (0, 0)][DBLP]
    WG, 1998, pp:137-148 [Conf]
  14. Stefan Felsner, Dorothea Wagner
    On the Complexity of Partial Order Properties. [Citation Graph (0, 0)][DBLP]
    WG, 1992, pp:225-235 [Conf]
  15. Stefan Felsner
    The Skeleton of a Reduced Word and a Correspondence of Edelman and Greene. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  16. Stefan Felsner
    Lattice Structures from Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2004, v:11, n:1, pp:- [Journal]
  17. Helmut Alt, Stefan Felsner, Ferran Hurtado, Marc Noy, Emo Welzl
    A class of point-sets with few k-sets. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2000, v:16, n:2, pp:95-101 [Journal]
  18. Stefan Felsner, Jens Gustedt, Michel Morvan, Jean-Xavier Rampon
    Constructing Colorings for Diagrams. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:51, n:1-2, pp:85-93 [Journal]
  19. Stefan Felsner, Rudolf Müller, Lorenz Wernisch
    Trapezoid Graphs and Generalizations, Geometry and Algorithms. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:74, n:1, pp:13-32 [Journal]
  20. Stefan Felsner, Helmut Weil
    Sweeps, arrangements and signotopes. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:109, n:1-2, pp:67-94 [Journal]
  21. Stefan Felsner, Ferran Hurtado, Marc Noy, Ileana Streinu
    Hamiltonicity and colorings of arrangement graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:17, pp:2470-2483 [Journal]
  22. Stefan Felsner
    On the Number of Arrangements of Pseudolines. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1997, v:18, n:3, pp:257-267 [Journal]
  23. Stefan Felsner
    Triangles in Euclidean Arrangements. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1999, v:22, n:3, pp:429-438 [Journal]
  24. Stefan Felsner, Bernd Gärtner, Falk Tschirschnitz
    Grid Orientations, (d, d+2)-Polytopes, and Arrangements of Pseudolines. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2005, v:34, n:3, pp:411-437 [Journal]
  25. Stefan Felsner, Helmut Weil
    A Theorem on Higher Bruhat Orders. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2000, v:23, n:1, pp:121-127 [Journal]
  26. Stefan Felsner, Günter M. Ziegler
    Zonotopes associated with higher Bruhat orders. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:241, n:1-3, pp:301-312 [Journal]
  27. Stefan Felsner
    Orthogonal Structures in Directed Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1993, v:57, n:2, pp:309-321 [Journal]
  28. Stefan Felsner, Giuseppe Liotta, Stephen K. Wismath
    Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2003, v:7, n:4, pp:363-398 [Journal]
  29. Stefan Felsner
    Convex Drawings of Planar Graphs and the Order Dimension of 3-Polytopes. [Citation Graph (0, 0)][DBLP]
    Order, 2001, v:18, n:1, pp:19-37 [Journal]
  30. Stefan Felsner
    Geodesic Embeddings and Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Order, 2003, v:20, n:2, pp:135-150 [Journal]
  31. Stefan Felsner, Ravi Kant, C. Pandu Rangan, Dorothea Wagner
    On the Complexity of Partial Order Properties. [Citation Graph (0, 0)][DBLP]
    Order, 2000, v:17, n:2, pp:179-193 [Journal]
  32. Stefan Felsner, Vijay Raghavan, Jeremy Spinrad
    Recognition Algorithms for Orders of Small Width and Graphs of Small Dilworth Number. [Citation Graph (0, 0)][DBLP]
    Order, 2003, v:20, n:4, pp:351-364 [Journal]
  33. Stefan Felsner, William T. Trotter
    Dimension, Graph and Hypergraph Coloring. [Citation Graph (0, 0)][DBLP]
    Order, 2000, v:17, n:2, pp:167-177 [Journal]
  34. Stefan Felsner, Lorenz Wernisch
    Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:1, pp:192-209 [Journal]
  35. Stefan Felsner, Michel Habib, Rolf H. Möhring
    On the Interplay Between Interval Dimension and Dimension. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1994, v:7, n:1, pp:32-40 [Journal]
  36. Stefan Felsner, Klaus Reuter
    The Linear Extension Diameter of a Poset. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1999, v:12, n:3, pp:360-373 [Journal]
  37. Stefan Felsner
    On-Line Chain Partitions of Orders. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:175, n:2, pp:283-292 [Journal]
  38. Stefan Felsner, William T. Trotter
    Posets and planar graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:49, n:4, pp:273-284 [Journal]
  39. Melanie Badent, Carla Binucci, Emilio Di Giacomo, Walter Didimo, Stefan Felsner, Francesco Giordano, Jan Kratochvíl, Pietro Palladino, Maurizio Patrignani, Francesco Trotta
    Homothetic Triangle Contact Representations of Planar Graphs. [Citation Graph (0, 0)][DBLP]
    CCCG, 2007, pp:233-236 [Conf]
  40. Nicolas Bonichon, Stefan Felsner, Mohamed Mosbah
    Convex Drawings of 3-Connected Plane Graphs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2007, v:47, n:4, pp:399-420 [Journal]
  41. Stefan Felsner, Kamil Kloch, Grzegorz Matecki, Piotr Micek
    On-line chain partitioning of up-growing orders: The case of 2-dimensional orders and semi-orders [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  42. Geir Agnarsson, Stefan Felsner, William T. Trotter
    The maximum number of edges in a graph of bounded dimension, with applications to ring theory. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:201, n:1-3, pp:5-19 [Journal]
  43. Stefan Felsner, Peter C. Fishburn, William T. Trotter
    Finite three dimensional partial orders which are not sphere orders. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:201, n:1-3, pp:101-132 [Journal]
  44. Stefan Felsner, William T. Trotter
    Colorings of diagrams of interval orders and alpha-sequences of sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:144, n:1-3, pp:23-31 [Journal]
  45. Stefan Felsner, William T. Trotter
    On the fractional dimension of partially ordered sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:136, n:1-3, pp:101-117 [Journal]

  46. Points with large quadrant-depth. [Citation Graph (, )][DBLP]


  47. The Complexity of Sorting with Networks of Stacks and Queues. [Citation Graph (, )][DBLP]


  48. On the Number of alpha -Orientations. [Citation Graph (, )][DBLP]


  49. ULD-Lattices and Delta-Bonds. [Citation Graph (, )][DBLP]


  50. Schnyder Woods and Orthogonal Surfaces. [Citation Graph (, )][DBLP]


  51. Preface. [Citation Graph (, )][DBLP]


  52. Adjacency posets of planar graphs. [Citation Graph (, )][DBLP]


  53. Editorial. [Citation Graph (, )][DBLP]


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