The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Marc Noy: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Oswin Aichholzer, Ferran Hurtado, Marc Noy
    On the number of triangulations every planar point set must have. [Citation Graph (0, 0)][DBLP]
    CCCG, 2001, pp:13-16 [Conf]
  2. Hazel Everett, Chính T. Hoàng, Kyriakos Kilakos, Marc Noy
    Planar segment visibility graphs. [Citation Graph (0, 0)][DBLP]
    CCCG, 1997, pp:- [Conf]
  3. Hazel Everett, Ferran Hurtado, Marc Noy
    Stabbing Information of a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:74-79 [Conf]
  4. M. Carmen Hernando, Ferran Hurtado, Alberto Márquez, Mercè Mora, Marc Noy
    Geometric tree graphs of points in the plane. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  5. Ferran Hurtado, Marc Noy, Pedro A. Ramos, Carlos Seara
    Separating objects in the plane with wedges and strips. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  6. Ferran Hurtado, Marc Noy, Jorge Urrutia
    Parallel edge flipping. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  7. 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]
  8. Ferran Hurtado, Marc Noy
    The Graph of Triangulations of a Convex Polygon. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1996, pp:0-7 [Conf]
  9. Ferran Hurtado, Marc Noy, Jorge Urrutia
    Flipping Edges in Triangulations. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1996, pp:214-223 [Conf]
  10. Manuel Abellanas, Jesus Garcia-Lopez, Gregorio Hernández-Peñalver, Marc Noy, Pedro A. Ramos
    Bipartite Embeddings of Trees in the Plane. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1996, pp:1-10 [Conf]
  11. Natalia de Castro, Francisco Javier Cobos, Juan Carlos Dana, Alberto Márquez, Marc Noy
    Triangle-Free Planar Graphs as Segments Intersection Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1999, pp:341-358 [Conf]
  12. Alfredo García Olaverri, M. Carmen Hernando, Ferran Hurtado, Marc Noy, Javier Tejel
    Packing Trees into Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1997, pp:383-390 [Conf]
  13. Frank Bauernöppel, Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Marc Noy, Jörg-Rüdiger Sack, Jorge Urrutia
    Optimal Shooting: Characterizations and Applications. [Citation Graph (0, 0)][DBLP]
    ICALP, 1995, pp:220-231 [Conf]
  14. 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]
  15. Esther M. Arkin, Sándor P. Fekete, Ferran Hurtado, Joseph S. B. Mitchell, Marc Noy, Vera Sacristan, Saurabh Sethia
    On the Reflexivity of Point Sets. [Citation Graph (0, 0)][DBLP]
    WADS, 2001, pp:192-204 [Conf]
  16. Omer Giménez, Petr Hlinený, Marc Noy
    Computing the Tutte Polynomial on Graphs of Bounded Clique-Width. [Citation Graph (0, 0)][DBLP]
    WG, 2005, pp:59-68 [Conf]
  17. Ferran Hurtado, Marc Noy
    Counting triangulations of almost-convex polygons. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1997, v:45, n:, pp:- [Journal]
  18. Ferran Hurtado, Marc Noy, J.-M. Robert, Vera Sacristan, Steven Skiena
    Visualizing Objects with Mirrors. [Citation Graph (0, 0)][DBLP]
    Comput. Graph. Forum, 2004, v:23, n:2, pp:157-166 [Journal]
  19. Neil J. Calkin, Criel Merino, S. Noble, Marc Noy
    Improved Bounds for the Number of Forests and Acyclic Orientations in the Square Lattice. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2003, v:10, n:, pp:- [Journal]
  20. Oswin Aichholzer, Ferran Hurtado, Marc Noy
    A lower bound on the number of triangulations of planar point sets. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2004, v:29, n:2, pp:135-145 [Journal]
  21. 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]
  22. Gabriela Araujo, Adrian Dumitrescu, Ferran Hurtado, Marc Noy, Jorge Urrutia
    On the chromatic number of some geometric type Kneser graphs. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2005, v:32, n:1, pp:59-69 [Journal]
  23. Hazel Everett, Chính T. Hoàng, Kyriakos Kilakos, Marc Noy
    Planar segment visibility graphs. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2000, v:16, n:4, pp:235-243 [Journal]
  24. Alfredo García Olaverri, Marc Noy, Javier Tejel
    Lower bounds on the number of crossing-free subgraphs of KN. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2000, v:16, n:4, pp:211-221 [Journal]
  25. Ferran Hurtado, Marc Noy
    Triangulations, Visibility Graph and Reflex Vertices of a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1996, v:6, n:, pp:355-369 [Journal]
  26. Ferran Hurtado, Marc Noy
    Graph of triangulations of a convex polygon and tree of triangulations. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1999, v:13, n:3, pp:179-188 [Journal]
  27. Esther M. Arkin, Sándor P. Fekete, Ferran Hurtado, Joseph S. B. Mitchell, Marc Noy, Vera Sacristan, Saurabh Sethia
    On the Reflexivity of Point Sets [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  28. Manuel Abellanas, Jesus Garcia-Lopez, Gregorio Hernández-Peñalver, Marc Noy, Pedro A. Ramos
    Bipartite Embeddings of Trees in the Plane. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:93, n:2-3, pp:141-148 [Journal]
  29. Hazel Everett, Ferran Hurtado, Marc Noy
    Stabbing Information of a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:91, n:1-3, pp:67-82 [Journal]
  30. M. Carmen Hernando, Ferran Hurtado, Alberto Márquez, Mercè Mora, Marc Noy
    Geometric Tree Graphs of Points in Convex Position. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:93, n:1, pp:51-66 [Journal]
  31. Ferran Hurtado, Joseph S. B. Mitchell, Marc Noy
    Foreword. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:109, n:1-2, pp:1- [Journal]
  32. Ferran Hurtado, Marc Noy, Pedro A. Ramos, Carlos Seara
    Separating objects in the plane by wedges and strips. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:109, n:1-2, pp:109-138 [Journal]
  33. Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Marc Noy, Jörg-Rüdiger Sack, Jorge Urrutia
    Stage-graph Representations. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:75, n:1, pp:71-80 [Journal]
  34. 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]
  35. Luc Devroye, Philippe Flajolet, Ferran Hurtado, Marc Noy, William L. Steiger
    Properties of Random Triangulations and Trees. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1999, v:22, n:1, pp:105-117 [Journal]
  36. Ferran Hurtado, Marc Noy, Jorge Urrutia
    Flipping Edges in Triangulations. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1999, v:22, n:3, pp:333-346 [Journal]
  37. Robert Cori, Marc Noy
    Foreword. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:246, n:1-3, pp:1-0 [Journal]
  38. Emeric Deutsch, Svjetlan Feretic, Marc Noy
    Diagonally convex directed polyominoes and even trees: a bijection and related issues. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:3, pp:645-654 [Journal]
  39. Emeric Deutsch, Marc Noy
    Statistics on non-crossing trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:254, n:1-3, pp:75-87 [Journal]
  40. Vladimir Estivill-Castro, Marc Noy, Jorge Urrutia
    On the chromatic number of tree graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:223, n:1-3, pp:363-366 [Journal]
  41. Ferran Hurtado, Marc Noy
    On the number of visibility graphs of simple polygons. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:232, n:1-3, pp:139-143 [Journal]
  42. Alberto Márquez, Anna de Mier, Marc Noy, Maria Pastora Revuelta Marchena
    Locally grid graphs: classification and Tutte uniqueness. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:266, n:1-3, pp:327-352 [Journal]
  43. Anna de Mier, Marc Noy
    Tutte uniqueness of line graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:301, n:1, pp:57-65 [Journal]
  44. Anna de Mier, Marc Noy
    On matroids determined by their Tutte polynomials. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:302, n:1-3, pp:52-76 [Journal]
  45. Jaroslav Nesetril, Marc Noy, Oriol Serra
    Foreword. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:273, n:1-3, pp:1-6 [Journal]
  46. C. Hernando, Ferran Hurtado, Marc Noy
    Graphs of Non-Crossing Perfect Matchings. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2002, v:18, n:3, pp:517-532 [Journal]
  47. Michael E. Houle, Ferran Hurtado, Marc Noy, Eduardo Rivera-Campo
    Graphs of Triangulations and Perfect Matchings. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2005, v:21, n:3, pp:325-331 [Journal]
  48. Anna de Mier, Marc Noy
    On Graphs Determined by Their Tutte Polynomials. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2004, v:20, n:1, pp:105-119 [Journal]
  49. Jérôme Galtier, Ferran Hurtado, Marc Noy, Stephane Perennes, Jorge Urrutia
    Simultaneous Edge Flipping in Triangulations. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2003, v:13, n:2, pp:113-133 [Journal]
  50. Alfredo García Olaverri, Ferran Hurtado, Marc Noy, Javier Tejel
    On the minimum size of visibility graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:81, n:4, pp:223-230 [Journal]
  51. Joseph E. Bonin, Anna de Mier, Marc Noy
    Lattice path matroids: enumerative aspects and Tutte polynomials. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2003, v:104, n:1, pp:63-94 [Journal]
  52. Criel Merino, Anna de Mier, Marc Noy
    Irreducibility of the Tutte Polynomial of a Connected Matroid. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2001, v:83, n:2, pp:298-304 [Journal]
  53. Natalia de Castro, Francisco Javier Cobos, Juan Carlos Dana, Alberto Márquez, Marc Noy
    Triangle-Free Planar Graphs and Segment Intersection Graphs. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2002, v:6, n:1, pp:7-26 [Journal]
  54. Marc Noy
    Graphs determined by polynomial invariants. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:307, n:2, pp:365-384 [Journal]
  55. Anna de Mier, Marc Noy
    A solution to the tennis ball problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:346, n:2-3, pp:254-264 [Journal]
  56. Philippe Flajolet, Marc Noy
    Analytic combinatorics of non-crossing configurations. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:204, n:1-3, pp:203-229 [Journal]
  57. Marc Noy
    Enumeration of noncrossing trees on a circle. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:180, n:1-3, pp:301-313 [Journal]
  58. Ferran Hurtado, Marc Noy
    Ears of triangulations and Catalan numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:149, n:1-3, pp:319-324 [Journal]

  59. Augmenting the Connectivity of Outerplanar Graphs. [Citation Graph (, )][DBLP]


  60. On the Complexity of Computing the Tutte Polynomial of Bicircular Matroids. [Citation Graph (, )][DBLP]


  61. Gray codes for non-crossing partitions and dissections of a convex polygon. [Citation Graph (, )][DBLP]


  62. Identities for non-crossing graphs and multigraphs. [Citation Graph (, )][DBLP]


  63. Enumeration and limit laws for series-parallel graphs. [Citation Graph (, )][DBLP]


  64. Partitions of a finite Boolean lattice into intervals. [Citation Graph (, )][DBLP]


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