The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Serge Gaspers: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Fedor V. Fomin, Serge Gaspers, Saket Saurabh
    Branching and Treewidth Based Exact Algorithms. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2006, pp:16-25 [Conf]
  2. Fedor V. Fomin, Serge Gaspers, Artem V. Pyatkin
    Finding a Minimum Feedback Vertex Set in Time O (1.7548n). [Citation Graph (0, 0)][DBLP]
    IWPEC, 2006, pp:184-191 [Conf]
  3. Serge Gaspers, Dieter Kratsch, Mathieu Liedloff
    Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:148-159 [Conf]
  4. Serge Gaspers, Mathieu Liedloff
    A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2006, pp:78-89 [Conf]
  5. Fedor V. Fomin, Serge Gaspers, Saket Saurabh
    Improved Exact Algorithms for Counting 3- and 4-Colorings. [Citation Graph (0, 0)][DBLP]
    COCOON, 2007, pp:65-74 [Conf]

  6. Feedback Vertex Sets in Tournaments. [Citation Graph (, )][DBLP]


  7. Kernels for Feedback Arc Set In Tournaments. [Citation Graph (, )][DBLP]


  8. A Linear Vertex Kernel for Maximum Internal Spanning Tree. [Citation Graph (, )][DBLP]


  9. An Exponential Time 2-Approximation Algorithm for Bandwidth. [Citation Graph (, )][DBLP]


  10. Iterative Compression and Exact Algorithms. [Citation Graph (, )][DBLP]


  11. A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between. [Citation Graph (, )][DBLP]


  12. A Moderately Exponential Time Algorithm for Full Degree Spanning Tree. [Citation Graph (, )][DBLP]


  13. Exact and Parameterized Algorithms for Max Internal Spanning Tree. [Citation Graph (, )][DBLP]


  14. On Independent Sets and Bicliques in Graphs. [Citation Graph (, )][DBLP]


  15. Exact Exponential-Time Algorithms for Finding Bicliques in a Graph. [Citation Graph (, )][DBLP]


  16. On Two Techniques of Combining Branching and Treewidth. [Citation Graph (, )][DBLP]


  17. On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms. [Citation Graph (, )][DBLP]


  18. Exact Exponential Time Algorithms for Max Internal Spanning Tree [Citation Graph (, )][DBLP]


  19. On Feedback Vertex Sets in Tournaments [Citation Graph (, )][DBLP]


  20. An Exponential Time 2-Approximation Algorithm for Bandwidth [Citation Graph (, )][DBLP]


  21. A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between [Citation Graph (, )][DBLP]


  22. Kernels for Feedback Arc Set In Tournaments [Citation Graph (, )][DBLP]


  23. A Linear Vertex Kernel for Maximum Internal Spanning Tree [Citation Graph (, )][DBLP]


  24. Complexity of Splits Reconstruction for Low-Degree Trees [Citation Graph (, )][DBLP]


  25. Parameterizing by the Number of Numbers [Citation Graph (, )][DBLP]


  26. Parallel cleaning of a network with brushes. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.004secs
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