| Publication | Date of Publication | Type |
|---|
Characterizations of graph classes via convex geometries: a survey
Discrete Applied Mathematics | 2024-12-04 | Paper |
Weakly toll convexity and proper interval graphs
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2024-09-17 | Paper |
Induced tree covering and the generalized Yutsis property
| 2024-05-31 | Paper |
Computing the hull and interval numbers in the weakly toll convexity
Theoretical Computer Science | 2024-04-04 | Paper |
An introduction to convexity in graphs. Paper from the 34th Brazilian mathematics colloquium -- 34\degree Colóquio Brasileiro de Matemática, IMPA, Rio de Janeiro, Brazil
Publicações Matemáticas do IMPA | 2024-03-25 | Paper |
A general framework for path convexities
Lecture Notes in Computer Science | 2024-02-23 | Paper |
New algorithms for the minimum coloring cut problem
International Transactions in Operational Research | 2023-11-16 | Paper |
The iteration time and the general position number in graph convexities
| 2023-04-30 | Paper |
Geodetic convexity and Kneser graphs
Applied Mathematics and Computation | 2023-04-21 | Paper |
All-path convexity: Combinatorial and complexity aspects
| 2023-03-31 | Paper |
Width Parameterizations for Knot-Free Vertex Deletion on Digraphs.
| 2023-02-03 | Paper |
Convex geometries over induced paths with bounded length
Discrete Mathematics | 2022-11-02 | Paper |
\(P_3\)-convexity on graphs with diameter two: computing hull and interval numbers
Discrete Applied Mathematics | 2022-09-15 | Paper |
A general framework for path convexities
Journal of Combinatorial Optimization | 2022-07-18 | Paper |
\(P_3\)-hull number of graphs with diameter two
| 2022-04-27 | Paper |
On clique-inverse graphs of graphs with bounded clique number
Journal of Graph Theory | 2022-03-31 | Paper |
Characterizations of graph classes via convex geometries: A survey
| 2022-03-29 | Paper |
Geodetic convexity and Kneser graphs
| 2022-03-07 | Paper |
On knot-free vertex deletion: fine-grained parameterized complexity analysis of a deadlock resolution graph problem
Theoretical Computer Science | 2022-03-01 | Paper |
Edge clique partition in \((k,\ell)\)-graphs
Discrete Applied Mathematics | 2021-11-11 | Paper |
All-path convexity: combinatorial and complexity aspects.
| 2021-09-20 | Paper |
Declawing a graph: polyhedra and branch-and-cut algorithms
Journal of Combinatorial Optimization | 2021-08-11 | Paper |
The biclique partitioning polytope
Discrete Applied Mathematics | 2021-06-14 | Paper |
Vector domination in split-indifference graphs
Information Processing Letters | 2019-12-19 | Paper |
On the complete set packing and set partitioning polytopes: properties and rank 1 facets
Operations Research Letters | 2019-06-11 | Paper |
Deadlock resolution in wait-for graphs by vertex/arc deletion
Journal of Combinatorial Optimization | 2019-06-06 | Paper |
Decycling a graph by the removal of a matching: new algorithmic and structural aspects in some classes of graphs
| 2018-12-10 | Paper |
Fine-grained parameterized complexity analysis of knot-free vertex deletion -- a deadlock resolution graph problem
| 2018-10-04 | Paper |
And/or-convexity: a graph convexity based on processes and deadlock models
Annals of Operations Research | 2018-06-12 | Paper |
Algorithms, kernels and lower bounds for the flood-it game parameterized by the vertex cover number
Discrete Applied Mathematics | 2018-05-24 | Paper |
A computational study of \(f\)-reversible processes on graphs
Discrete Applied Mathematics | 2018-05-24 | Paper |
Robust recoverable perfect matchings
Networks | 2018-05-23 | Paper |
A matheuristic for the cell formation problem
Optimization Letters | 2018-04-19 | Paper |
On the hardness of finding the geodetic number of a subcubic graph
Information Processing Letters | 2018-04-05 | Paper |
Cograph generation with linear delay
Theoretical Computer Science | 2018-02-06 | Paper |
New heuristics for the bicluster editing problem
Annals of Operations Research | 2017-12-15 | Paper |
Corrigendum to ``Complexity analysis of \(P_{3}\)-convexity problems on bounded-degree and planar graphs
Theoretical Computer Science | 2017-11-16 | Paper |
Deletion graph problems based on deadlock resolution
| 2017-10-23 | Paper |
Tractability, hardness, and kernelization lower bound for and/or graph solution
Discrete Applied Mathematics | 2017-10-17 | Paper |
The Flood-It game parameterized by the vertex cover number
| 2016-10-17 | Paper |
On solving manufacturing cell formation via bicluster editing
European Journal of Operational Research | 2016-10-07 | Paper |
Clique cycle-transversals in distance-hereditary graphs
Discrete Applied Mathematics | 2016-06-22 | Paper |
A parallel hybrid metaheuristic for bicluster editing
International Transactions in Operational Research | 2016-06-09 | Paper |
Efficient algorithms for cluster editing
Journal of Combinatorial Optimization | 2016-02-23 | Paper |
Complexity analysis of \(P_3\)-convexity problems on bounded-degree and planar graphs
Theoretical Computer Science | 2015-12-08 | Paper |
On the geodetic iteration number of distance-hereditary graphs
Discrete Mathematics | 2015-12-08 | Paper |
Cycles in complementary prisms
Discrete Applied Mathematics | 2015-07-24 | Paper |
On \(P_{3}\)-convexity of graphs with bounded degree
Algorithmic Aspects in Information and Management | 2015-05-20 | Paper |
Tractability and hardness of flood-filling games on trees
Theoretical Computer Science | 2015-05-18 | Paper |
On Helly hypergraphs with variable intersection sizes.
| 2015-04-13 | Paper |
scientific article; zbMATH DE number 6423755 (Why is no real title available?)
| 2015-04-09 | Paper |
scientific article; zbMATH DE number 6423757 (Why is no real title available?)
| 2015-04-09 | Paper |
Algorithmic aspects of Steiner convexity and enumeration of Steiner trees
Annals of Operations Research | 2015-02-27 | Paper |
scientific article; zbMATH DE number 6399334 (Why is no real title available?)
| 2015-02-09 | Paper |
Matching preclusion number in Cartesian product of graphs and its application to interconnection networks.
| 2015-01-06 | Paper |
The predecessor-existence problem for \(k\)-reversible processes
Theoretical Computer Science | 2014-12-02 | Paper |
On \((k,\ell )\)-graph sandwich problems
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2014-04-03 | Paper |
Cycle transversals in bounded degree graphs
| 2014-03-25 | Paper |
Clique cycle transversals in graphs with few \(P_{4}\)'s
| 2014-02-14 | Paper |
Revisiting the complexity of and/or graph solution
Journal of Computer and System Sciences | 2014-01-27 | Paper |
Corrigendum to ``Cycle transversals in perfect graphs and cographs
Theoretical Computer Science | 2013-12-11 | Paper |
New branch-and-bound algorithms for \(k\)-cardinality tree problems
Electronic Notes in Discrete Mathematics | 2013-07-23 | Paper |
Hybrid metaheuristic for bicluster editing problem
Electronic Notes in Discrete Mathematics | 2013-07-23 | Paper |
Generating all the Steiner trees and computing Steiner intervals for a fixed number of terminals
Electronic Notes in Discrete Mathematics | 2013-07-19 | Paper |
Cycle transversals in bounded degree graphs
Electronic Notes in Discrete Mathematics | 2013-07-19 | Paper |
On \(s\)--\(t\) paths and trails in edge-colored graphs
Electronic Notes in Discrete Mathematics | 2013-07-19 | Paper |
Parameterized complexity of flood-filling games on trees
Lecture Notes in Computer Science | 2013-06-11 | Paper |
Cycle transversals in perfect graphs and cographs
Theoretical Computer Science | 2013-02-19 | Paper |
On the convexity number of graphs
Graphs and Combinatorics | 2012-12-27 | Paper |
Mixed unit interval graphs
Discrete Mathematics | 2012-10-26 | Paper |
Partitioning extended \(P_4\)-laden graphs into cliques and stable sets
Information Processing Letters | 2012-10-23 | Paper |
Exact and approximation algorithms for error-detecting even codes
Theoretical Computer Science | 2012-08-08 | Paper |
A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation
RAIRO - Theoretical Informatics and Applications | 2011-10-28 | Paper |
An improved derandomized approximation algorithm for the max-controlled set problem
RAIRO - Theoretical Informatics and Applications | 2011-08-10 | Paper |
Partitioning chordal graphs into independent sets and cliques
TEMA - Tendências em Matemática Aplicada e Computacional | 2011-04-04 | Paper |
Characterization and recognition of \(P_{4}\)-sparse graphs partitionable into \(k\) independent sets and \(\ell \) cliques
Discrete Applied Mathematics | 2011-03-09 | Paper |
On the hull number of triangle-free graphs
SIAM Journal on Discrete Mathematics | 2010-12-03 | Paper |
SUTIL - network selection based on utility function and integer linear programming
Computer Networks | 2010-11-25 | Paper |
Complexity aspects of the Helly property: graphs and hypergraphs
The Electronic Journal of Combinatorics | 2010-10-13 | Paper |
Complexity results related to monophonic convexity
Discrete Applied Mathematics | 2010-08-13 | Paper |
Improved algorithms for recognizing \(p\)-Helly and hereditary \(p\)-Helly hypergraphs
Information Processing Letters | 2010-06-09 | Paper |
Extending the geometric build-up algorithm for the molecular distance geometry problem
Information Processing Letters | 2010-06-09 | Paper |
Some remarks on the geodetic number of a graph
Discrete Mathematics | 2010-04-27 | Paper |
Complexity aspects of generalized Helly hypergraphs
Information Processing Letters | 2010-01-29 | Paper |
On the computation of the hull number of a graph
Discrete Mathematics | 2009-12-15 | Paper |
The Helly property on subfamilies of limited size
Information Processing Letters | 2009-08-27 | Paper |
Applying modular decomposition to parameterized cluster editing problems
Theory of Computing Systems | 2009-08-06 | Paper |
Structured construction and simulation of nondeterministic stochastic activity networks
European Journal of Operational Research | 2009-06-30 | Paper |
Exact and Experimental Algorithms for a Huffman-Based Error Detecting Code
Lecture Notes in Computer Science | 2009-06-03 | Paper |
LATIN 2004: Theoretical Informatics
Lecture Notes in Computer Science | 2009-05-07 | Paper |
scientific article; zbMATH DE number 5531985 (Why is no real title available?)
| 2009-03-24 | Paper |
Partition into cliques for cubic graphs: Planar case, complexity and approximation
Discrete Applied Mathematics | 2008-09-29 | Paper |
Algorithmic Aspects of Monophonic Convexity
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
Applying Modular Decomposition to Parameterized Bicluster Editing
Parameterized and Exact Computation | 2008-06-03 | Paper |
On the strong \(p\)-Helly property
Discrete Applied Mathematics | 2008-04-16 | Paper |
Characterization and recognition of generalized clique-Helly graphs
Discrete Applied Mathematics | 2007-11-30 | Paper |
scientific article; zbMATH DE number 5158487 (Why is no real title available?)
| 2007-05-29 | Paper |
An efficient heuristic for selecting active nodes in wireless sensor networks
Computer Networks | 2006-11-15 | Paper |
List matrix partitions of chordal graphs
Theoretical Computer Science | 2006-03-20 | Paper |
Packing \(r\)-cliques in weighted chordal graphs
Annals of Operations Research | 2006-03-07 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2005-12-08 | Paper |
scientific article; zbMATH DE number 2230206 (Why is no real title available?)
| 2005-11-18 | Paper |
scientific article; zbMATH DE number 2230199 (Why is no real title available?)
| 2005-11-18 | Paper |
scientific article; zbMATH DE number 2230216 (Why is no real title available?)
| 2005-11-18 | Paper |
Parity codes
RAIRO - Theoretical Informatics and Applications | 2005-06-07 | Paper |
Optimal grid representations
Networks | 2005-02-23 | Paper |
scientific article; zbMATH DE number 2096437 (Why is no real title available?)
| 2004-09-06 | Paper |
Partitioning chordal graphs into independent sets and cliques
Discrete Applied Mathematics | 2004-08-06 | Paper |
scientific article; zbMATH DE number 1750103 (Why is no real title available?)
| 2002-06-05 | Paper |
On clique graphs with linear size
Congressus Numerantium | 2001-10-30 | Paper |
On generalized split graphs
| 2001-10-24 | Paper |
ILP formulations for scheduling ordered tasks on a bounded number of processors
| 2001-10-24 | Paper |
Clique-inverse graphs ofK3-free andK4-free graphs
| 2001-08-16 | Paper |
Weakly toll convexity and proper interval graphs
| N/A | Paper |
