dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Serge Gaspers (Selection)

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo


57Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSerge Gaspers, Mikko Koivisto, Mathieu Liedloff, Sebastian Ordyniak, Stefan Szeider: On Finding Optimal Polytrees. AAAI 2012
52Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSerge Gaspers, Dieter Kratsch, Mathieu Liedloff: On Independent Sets and Bicliques in Graphs. Algorithmica 62(3-4): 637-658 (2012)
47Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSerge Gaspers, Mikko Koivisto, Mathieu Liedloff, Sebastian Ordyniak, Stefan Szeider: On Finding Optimal Polytrees CoRR abs/1208.1692: (2012)
46Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSerge Gaspers, Mathieu Liedloff: A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set. Discrete Mathematics & Theoretical Computer Science 14(1): 29-42 (2012)
41Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSerge Gaspers, Mathieu Liedloff, Maya Stein, Karol Suchan: Complexity of Splits Reconstruction for Low-Degree Trees. WG 2011: 167-178
31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSerge Gaspers, Mathieu Liedloff, Maya Stein, Karol Suchan: Complexity of Splits Reconstruction for Low-Degree Trees CoRR abs/1007.1733: (2010)
29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSerge Gaspers, Mathieu Liedloff: A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set CoRR abs/1009.1381: (2010)
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Binkele-Raible, Henning Fernau, Serge Gaspers, Mathieu Liedloff: Exact exponential-time algorithms for finding bicliques. Inf. Process. Lett. 111(2): 64-67 (2010)
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Saket Saurabh: Iterative compression and exact algorithms. Theor. Comput. Sci. 411(7-9): 1045-1053 (2010)
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHenning Fernau, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Daniel Raible: Exact Exponential-Time Algorithms for Finding Bicliques in a Graph. CTW 2009: 205-209
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSerge Gaspers, Dieter Kratsch, Mathieu Liedloff, Ioan Todinca: Exponential time algorithms for the minimum dominating set problem on some graph classes. ACM Transactions on Algorithms 6(1): (2009)
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Saket Saurabh: Iterative Compression and Exact Algorithms. MFCS 2008: 335-346
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSerge Gaspers, Dieter Kratsch, Mathieu Liedloff: On Independent Sets and Bicliques in Graphs. WG 2008: 171-182
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSerge Gaspers, Dieter Kratsch, Mathieu Liedloff: Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes. SWAT 2006: 148-159
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSerge Gaspers, Mathieu Liedloff: A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs. WG 2006: 78-89

Selection of 15 from 58 records - Serge Gaspers has 33 coauthors

Last update 2012-09-10 CET by the DBLP TeamThis material is Open Data Content released under the ODC-BY 1.0 license — See also our legal information page