Florian Sikora

Virginia Ardévol Martínez

Discret. Appl. Math., December, 2023

Grundy Coloring and Friends, Half-Graphs, Bicliques.

[BibT_eX]

[DOI]

Algorithmica, 2023

Parity Permutation Pattern Matching.

[BibT_eX]

[DOI]

Virginia Ardévol Martínez

Proceedings of the WALCOM: Algorithms and Computation, 2023

Hardness of Balanced Mobiles.

[BibT_eX]

[DOI]

Romeo Rizzi

Virginia Ardévol Martínez

Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023

Recognizing Unit Multiple Intervals Is Hard.

[BibT_eX]

[DOI]

Romeo Rizzi

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

2022

On the complexity of solution extension of optimization problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

2021

Token Sliding on Split Graphs.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2021

EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs.

[BibT_eX]

[DOI]

J. ACM, 2021

Scaling up graph homomorphism for classification via sampling.

[BibT_eX]

[DOI]

Paul Beaujean

Florian Yger

CoRR, 2021

On the Complexity of Broadcast Domination and Multipacking in Digraphs.

[BibT_eX]

[DOI]

Algorithmica, 2021

Neural Maximum Independent Set.

[BibT_eX]

[DOI]

Proceedings of the Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2021

Graph Homomorphism Features: Why Not Sample?

[BibT_eX]

[DOI]

Paul Beaujean

Florian Yger

Proceedings of the Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2021

The Longest Run Subsequence Problem: Further Complexity Results.

[BibT_eX]

[DOI]

Proceedings of the 32nd Annual Symposium on Combinatorial Pattern Matching, 2021

Abundant Extensions.

[BibT_eX]

Proceedings of the Algorithms and Complexity - 12th International Conference, 2021

2020

Weighted Upper Edge Cover: Complexity and Approximability.

[BibT_eX]

[DOI]

Kaveh Khoshkhah

J. Graph Algorithms Appl., 2020

Designing RNA Secondary Structures Is Hard.

[BibT_eX]

[DOI]

Pawel Rzazewski

J. Comput. Biol., 2020

Parameterized Orientable Deletion.

[BibT_eX]

[DOI]

Algorithmica, 2020

Grundy Coloring & Friends, Half-Graphs, Bicliques.

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020

2019

Parameterized and approximation complexity of Partial VC Dimension.

[BibT_eX]

[DOI]

Cristina Bazgan

Florent Foucaud

Theor. Comput. Sci., 2019

Covering a Graph with Clubs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2019

Correction to: Weighted Upper Edge Cover: Complexity and Approximability.

[BibT_eX]

[DOI]

Kaveh Khoshkhah

Proceedings of the WALCOM: Algorithms and Computation - 13th International Conference, 2019

Extension of Some Edge Graph Problems: Standard and Parameterized Complexity.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory - 22nd International Symposium, 2019

Extension of Vertex Cover and Independent Set in Some Classes of Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity - 11th International Conference, 2019

2018

Parameterized complexity and approximation issues for the colorful components problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Finding disjoint paths on edge-colored graphs: more tractability results.

[BibT_eX]

[DOI]

J. Comb. Optim., 2018

Complexity of Grundy coloring and its variants.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

Extension of vertex cover and independent set in some classes of graphs and generalizations.

[BibT_eX]

[DOI]

CoRR, 2018

The PACE 2018 Parameterized Algorithms and Computational Experiments Challenge: The Third Iteration.

[BibT_eX]

[DOI]

Proceedings of the 13th International Symposium on Parameterized and Exact Computation, 2018

Covering with Clubs: Complexity and Approximability.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs.

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Computational Geometry, 2018

2017

On the complexity of various parameterizations of common induced subgraph isomorphism.

[BibT_eX]

[DOI]

Faisal N. Abu-Khzam

Theor. Comput. Sci., 2017

The Graph Motif problem parameterized by the structure of the input graph.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

The shortest way to visit all metro lines in Paris.

[BibT_eX]

[DOI]

CoRR, 2017

2016

Parameterized exact and approximation algorithms for maximum <i>k</i>-set cover and related satisfiability problems.

[BibT_eX]

[DOI]

Vangelis Th. Paschos

RAIRO Theor. Informatics Appl., 2016

A Note on Edge Isoperimetric Numbers and Regular Graphs.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2016

Finding Disjoint Paths on Edge-Colored Graphs: A Multivariate Complexity Analysis.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2016

On the Approximability of Partial VC Dimension.

[BibT_eX]

[DOI]

Cristina Bazgan

Florent Foucaud

Proceedings of the Combinatorial Optimization and Applications, 2016

2015

Some Results on More Flexible Versions of Graph Motif.

[BibT_eX]

[DOI]

Romeo Rizzi

Theory Comput. Syst., 2015

The parameterized complexity of Graph Motif relatively to the structure of the input graph.

[BibT_eX]

[DOI]

Edouard Bonnet

CoRR, 2015

On the Complexity of QoS-Aware Service Selection Problem.

[BibT_eX]

[DOI]

Proceedings of the Service-Oriented Computing - 13th International Conference, 2015

2014

Complexity insights of the Minimum Duplication problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Parameterized approximability of maximizing the spread of influence in networks.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2014

Parameterized Inapproximability of Target Set Selection and Generalizations.

[BibT_eX]

[DOI]

Comput., 2014

2013

Minimum Mosaic Inference of a Set of Recombinants.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2013

Multiparameterizations for max $k$-set cover and related satisfiability problems.

[BibT_eX]

[DOI]

Edouard Bonnet

Vangelis Th. Paschos

CoRR, 2013

Finding and Counting Vertex-Colored Subtrees.

[BibT_eX]

[DOI]

Sylvain Guillemot

Algorithmica, 2013

2012

On the parameterized complexity of the repetition free longest common subsequence problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2012

An Algorithmic View on Multi-Related-Segments: A Unifying Model for Approximate Common Interval.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2012

2011

Aspects algorithmiques de la comparaison d'éléments biologiques. (Algorithmics aspects of biological entities comparison).

[BibT_eX]

[DOI]

PhD thesis, 2011

Algorithmic Aspects of Heterogeneous Biological Networks Comparison.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2011

2010

Querying Graphs in Protein-Protein Interactions Networks Using Feedback Vertex Set.

[BibT_eX]

[DOI]

Guillaume Blin

IEEE ACM Trans. Comput. Biol. Bioinform., 2010

GraMoFoNe: a Cytoscape Plugin for Querying Motifs without Topology in Protein-Protein Interactions Networks.

[BibT_eX]

Guillaume Blin

Proceedings of the ISCA 2nd International Conference on Bioinformatics and Computational Biology, 2010

2009

The ExemplarBreakpointDistancefor Non-trivial Genomes Cannot Be Approximated.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009

Querying Protein-Protein Interaction Networks.

[BibT_eX]

[DOI]

Guillaume Blin