The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ioan Todinca: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Vincent Bouchitté, Ioan Todinca
    Minimal Triangulations for Graphs with "Few" Minimal Separators. [Citation Graph (0, 0)][DBLP]
    ESA, 1998, pp:344-355 [Conf]
  2. Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve Villanger
    Minimal Interval Completions. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:403-414 [Conf]
  3. Fedor V. Fomin, Dieter Kratsch, Ioan Todinca
    Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:568-580 [Conf]
  4. Karol Suchan, Ioan Todinca
    Minimal Interval Completion Through Graph Exploration. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2006, pp:517-526 [Conf]
  5. Vincent Bouchitté, Ioan Todinca
    Treewidth and Minimum Fill-in of Weakly Triangulated Graphs. [Citation Graph (0, 0)][DBLP]
    STACS, 1999, pp:197-206 [Conf]
  6. Vincent Bouchitté, Ioan Todinca
    Listing All Potential Maximal Cliques of a Graph. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:503-515 [Conf]
  7. Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve Villanger
    Characterizing Minimal Interval Completions. [Citation Graph (0, 0)][DBLP]
    STACS, 2007, pp:236-247 [Conf]
  8. Vincent Bouchitté, Ioan Todinca
    Approximating the Treewidth of AT-Free Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2000, pp:59-70 [Conf]
  9. Fedor V. Fomin, Frédéric Mazoit, Ioan Todinca
    Computing Branchwidth Via Efficient Triangulations and Blocks. [Citation Graph (0, 0)][DBLP]
    WG, 2005, pp:374-384 [Conf]
  10. Dieter Kratsch, Haiko Müller, Ioan Todinca
    Feedback Vertex Set and Longest Induced Path on AT-Free Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:309-321 [Conf]
  11. Ivan Rapaport, Karol Suchan, Ioan Todinca
    Minimal Proper Interval Completions. [Citation Graph (0, 0)][DBLP]
    WG, 2006, pp:217-228 [Conf]
  12. Ioan Todinca
    Coloring Powers of Graphs of Bounded Clique-Width. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:370-382 [Conf]
  13. Vincent Bouchitté, Dieter Kratsch, Haiko Müller, Ioan Todinca
    On treewidth approximations. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:136, n:2-3, pp:183-196 [Journal]
  14. Vincent Bouchitté, Ioan Todinca
    Approximating the treewidth of AT-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:131, n:1, pp:11-37 [Journal]
  15. Vincent Bouchitté, Frédéric Mazoit, Ioan Todinca
    Chordal embeddings of planar graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:273, n:1-3, pp:85-102 [Journal]
  16. Vincent Bouchitté, Ioan Todinca
    Treewidth and Minimum Fill-in: Grouping the Minimal Separators. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:1, pp:212-232 [Journal]
  17. Vincent Bouchitté, Ioan Todinca
    Listing all potential maximal cliques of a graph. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:276, n:1-2, pp:17-32 [Journal]
  18. Karol Suchan, Ioan Todinca
    On powers of graphs of bounded NLC-width (clique-width). [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:14, pp:1885-1893 [Journal]

  19. On Dissemination Thresholds in Regular and Irregular Graph Classes. [Citation Graph (, )][DBLP]


  20. Constructing Brambles. [Citation Graph (, )][DBLP]


  21. An O(n2){\mathcal{O}}(n^2)-time Algorithm for the Minimal Interval Completion Problem. [Citation Graph (, )][DBLP]


  22. Pathwidth of Circular-Arc Graphs. [Citation Graph (, )][DBLP]


  23. Pathwidth is NP-Hard for Weighted Trees. [Citation Graph (, )][DBLP]


  24. Feedback vertex set on AT-free graphs. [Citation Graph (, )][DBLP]


  25. Computing branchwidth via efficient triangulations and blocks. [Citation Graph (, )][DBLP]


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