Irena Rusu

Theor. Comput. Sci., 2024

2023

On the complexity of recognizing Stick, BipHook and Max Point-Tolerance graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., March, 2023

2022

Hamiltonian problems in directed graphs with simple row patterns.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Raney numbers, threshold sequences and Motzkin-like paths.

[BibT_eX]

[DOI]

Discret. Math., 2022

Forced pairs in A-Stick graphs.

[BibT_eX]

[DOI]

Discret. Math., 2022

On the complexity of recognizing Stick graphs.

[BibT_eX]

[DOI]

CoRR, 2022

2021

Decomposing subcubic graphs into claws, paths or triangles.

[BibT_eX]

[DOI]

J. Graph Theory, 2021

Admissible Pinnacle Orderings.

[BibT_eX]

[DOI]

Bridget Eileen Tenner

Graphs Comb., 2021

Forced pairs in A-Stick graphs.

[BibT_eX]

[DOI]

CoRR, 2021

2020

Stick graphs: examples and counter-examples.

[BibT_eX]

[DOI]

CoRR, 2020

Sorting Permutations with Fixed Pinnacle Set.

[BibT_eX]

[DOI]

Electron. J. Comb., 2020

2019

Min (a)cyclic feedback vertex sets and min ones monotone 3-SAT.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

2018

Common intervals and permutation reconstruction from MinMax-betweenness constraints.

[BibT_eX]

[DOI]

Léo Pelletier

J. Discrete Algorithms, 2018

Sorting signed permutations by reversals using link-cut trees.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2018

The S-labeling problem: An algorithmic tour.

[BibT_eX]

[DOI]

Stéphane Vialette

Discret. Appl. Math., 2018

2017

Graph matching problems and the NP-hardness of sortedness constraints.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

log-Lists and their applications to sorting by transpositions, reversals and block-interchanges.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

The Contig Assembly Problem and Its Algorithmic Solutions.

[BibT_eX]

[DOI]

Géraldine Jean

Andreea Radulescu

Proceedings of the Algorithms for Next-Generation Sequencing Data, Techniques, 2017

2016

Permutation reconstruction from MinMax-Betweenness constraints.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

Decomposing Cubic Graphs into Connected Subgraphs of Size Three.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

2015

Pancake Flipping is hard.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2015

Path-driven orientation of mixed graphs.

[BibT_eX]

[DOI]

Hafedh Mohamed-Babou

Discret. Appl. Math., 2015

NP-hardness of sortedness constraints.

[BibT_eX]

[DOI]

CoRR, 2015

Finding Supported Paths in Heterogeneous Networks.

[BibT_eX]

[DOI]

Christian Komusiewicz

Hafedh Mohamed-Babou

Algorithms, 2015

Algorithmic Aspects of the S-Labeling Problem.

[BibT_eX]

[DOI]

Stéphane Vialette

Proceedings of the Combinatorial Algorithms - 26th International Workshop, 2015

Obtaining a Triangular Matrix by Independent Row-Column Permutations.

[BibT_eX]

[DOI]

Stéphane Vialette

Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

2014

MinMax-profiles: A unifying view of common intervals, nested common intervals and conserved intervals of K permutations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Extending common intervals searching from permutations to sequences.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2014

Easy Identification of Generalized Common and Conserved Nested Intervals.

[BibT_eX]

[DOI]

Fabien de Montgolfier

Mathieu Raffinot

J. Comput. Biol., 2014

Permutation Reconstruction from MinMax-Betweenness Constraints.

[BibT_eX]

[DOI]

CoRR, 2014

DExTaR: Detection of exact tandem repeats based on the de Bruijn graph.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Conference on Bioinformatics and Biomedicine, 2014

2013

Revisiting the Minimum Breakpoint Linearization Problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Maximal strip recovery problem with gaps: Hardness and approximation algorithms.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2013

Easy identification of generalized common nested intervals

[BibT_eX]

[DOI]

Fabien de Montgolfier

Mathieu Raffinot

CoRR, 2013

A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications.

[BibT_eX]

[DOI]

Christian Komusiewicz

Proceedings of the Algorithms in Bioinformatics - 13th International Workshop, 2013

2012

Tractability and approximability of maximal strip recovery.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Sorting by Transpositions Is Difficult.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2012

New applications of interval generators to genome comparison.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

Algorithms for Subnetwork Mining in Heterogeneous Networks.

[BibT_eX]

[DOI]

Hafedh Mohamed-Babou

Proceedings of the Experimental Algorithms - 11th International Symposium, 2012

2011

Statistical properties of factor oracles.

[BibT_eX]

[DOI]

Jérémie Bourdon

J. Discrete Algorithms, 2011

SIPPER: A flexible method to integrate heterogeneous data into a metabolic network.

[BibT_eX]

[DOI]

Philippe Bordron

Damien Eveillard

Proceedings of the IEEE 1st International Conference on Computational Advances in Bio and Medical Sciences, 2011

Algorithmic Aspects of Heterogeneous Biological Networks Comparison.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2011

2010

Proper Alignment of MS/MS Spectra from Unsequenced Species.

[BibT_eX]

Proceedings of the International Conference on Bioinformatics & Computational Biology, 2010

2009

On the Approximability of Comparing Genomes with Duplicates.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2009

The Strong Perfect Graph Conjecture: 40 years of attempts, and its resolution.

[BibT_eX]

[DOI]

Henri Thuillier

Discret. Math., 2009

Homogeneous decomposition of protein interaction networks: refining the description of intra-modular interactions.

[BibT_eX]

[DOI]

Géraldine Del Mondo

Damien Eveillard

Bioinform., 2009

Comparison of Spectra in Unsequenced Species.

[BibT_eX]

[DOI]

Proceedings of the Advances in Bioinformatics and Computational Biology, 2009

Comparing Bacterial Genomes by Searching Their Common Intervals.

[BibT_eX]

[DOI]

Proceedings of the Bioinformatics and Computational Biology, 2009

Combinatorics of Genome Rearrangements.

[BibT_eX]

[DOI]

Computational molecular biology, MIT Press, ISBN: 978-0-262-06282-4, 2009

2008

Converting suffix trees into factor/suffix oracles.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2008

Efficient Tools for Computing the Number of Breakpoints and the Number of Adjacencies between Two Genomes with Duplicate Genes.

[BibT_eX]

[DOI]

J. Comput. Biol., 2008

Maximum weight edge-constrained matchings.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

On the Approximability of Comparing Genomes with Duplicates.

[BibT_eX]

[DOI]

Sébastien Angibaud

Proceedings of the WALCOM: Algorithms and Computation, Second International Workshop, 2008

2007

A Pseudo-Boolean Framework for Computing Rearrangement Distances between Genomes with Duplicates.

[BibT_eX]

[DOI]

J. Comput. Biol., 2007

A Pseudo-boolean Programming Approach for Computing the Breakpoint Distance Between Two Genomes with Duplicate Genes.

[BibT_eX]

[DOI]

Proceedings of the Comparative Genomics, RECOMB 2007 International Workshop, 2007

Extending the Hardness of RNA Secondary Structure Comparison.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics, 2007

2006

How Pseudo-boolean Programming Can Help Genome Rearrangement Distance Computation.

[BibT_eX]

[DOI]

Proceedings of the Comparative Genomics, 2006

2004

Preface.

[BibT_eX]

[DOI]

Jean-Luc Fouquet

Discret. Math., 2004

Hard problems in similarity searching.

[BibT_eX]

[DOI]

Christophe Moan

Discret. Appl. Math., 2004

2003

Pattern Discovery Allowing Wild-Cards, Substitution Matrices, and Multiple Score Functions.

[BibT_eX]

[DOI]

Alban Mancheron

Proceedings of the Algorithms in Bioinformatics, Third International Workshop, 2003

2002

Forbidden subgraph decomposition.

[BibT_eX]

[DOI]

Jeremy P. Spinrad

Discret. Math., 2002

Loose vertices in C4-free Berge graphs.

[BibT_eX]

[DOI]

Igor Parfenoff

Discret. Math., 2002

Dirac-type characterizations of graphs without long chordless cycles.

[BibT_eX]

[DOI]

Vasek Chvátal

R. Sritharan

Discret. Math., 2002

2001

An O(n2) algorithm to color Meyniel graphs.

[BibT_eX]

[DOI]

Discret. Math., 2001

Domination graphs: examples and counterexamples.

[BibT_eX]

[DOI]

Jeremy P. Spinrad

Discret. Appl. Math., 2001

2000

Recognizing i-triangulated graphs in O(mn) time.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2000

Preface: Volume 5.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2000

Even pairs in Artemis graphs.

[BibT_eX]

[DOI]

Discret. Math., 2000

1999

Perfectly contractile diamond-free graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1999

Berge graphs with chordless cycles of bounded length.

[BibT_eX]

[DOI]

J. Graph Theory, 1999

A Linear Algorithm to Color i-Triangulated Graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1999

On Graphs with Limited Number of P4-Partners.

[BibT_eX]

[DOI]

Henri Thuillier

Int. J. Found. Comput. Sci., 1999

Holes and Dominoes in Meyniel Graphs.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 1999

P4-domination in Minimal Imperfect Graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1999

Triangulated Neighbourhoods in C4-Free Berge Graphs.

[BibT_eX]

[DOI]

Igor Parfenoff

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1999

1997

Building counterexamples.

[BibT_eX]

[DOI]

Discret. Math., 1997

On transversals in minimal imperfect graphs.

[BibT_eX]

[DOI]

Discret. Math., 1997

Weighted Parameters in (P5, P5)-free Graphs.

[BibT_eX]

[DOI]

Vassilis Giakoumakis

Discret. Appl. Math., 1997

1996

Properly orderable graphs.

[BibT_eX]

[DOI]

Discret. Math., 1996

1995

Perfect and locally perfect colorings.

[BibT_eX]

[DOI]

J. Graph Theory, 1995

Quasi-Parity and Perfect Graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1995

A new class of perfect Hoàng graphs.

[BibT_eX]

[DOI]