| Publication | Date of Publication | Type |
|---|
The Minimum Clique Routing Problem on Cycles
| 2023-11-16 | Paper |
Graphs with no induced house nor induced hole have the de Bruijn–Erdös property
Journal of Graph Theory | 2023-10-05 | Paper |
Lines in bipartite graphs and in 2‐metric spaces
Journal of Graph Theory | 2023-08-22 | Paper |
Lines in quasi-metric spaces with four points
| 2022-09-20 | Paper |
On NC-real complexity classes for additive circuits and their relations with NC
Mathematical Foundations of Computer Science 1994 | 2022-08-18 | Paper |
Cyclic automata networks on finite graphs
LATIN '95: Theoretical Informatics | 2022-08-16 | Paper |
Chen and Chvátal's conjecture in tournaments
European Journal of Combinatorics | 2021-08-05 | Paper |
Graphs admitting antimagic labeling for arbitrary sets of positive numbers
Discrete Applied Mathematics | 2020-05-29 | Paper |
Weighted antimagic labeling
Discrete Applied Mathematics | 2018-05-24 | Paper |
Graphs admitting antimagic labeling for arbitrary sets of positive integers
| 2018-04-09 | Paper |
Lines in metric spaces: universal lines counted with multiplicity
| 2018-03-19 | Paper |
A new class of graphs that satisfies the Chen-Chvátal conjecture
Journal of Graph Theory | 2018-02-23 | Paper |
Weighted antimagic labeling: an algorithmic approach
| 2016-10-17 | Paper |
Complexity and dimension
Information Processing Letters | 2016-05-26 | Paper |
Solving the \textsc{induced subgraph} problem in the randomized multiparty simultaneous messages model
Structural Information and Communication Complexity | 2016-01-08 | Paper |
Injective colorings with arithmetic constraints
Graphs and Combinatorics | 2015-12-17 | Paper |
Convex \(p\)-partitions of bipartite graphs
Theoretical Computer Science | 2015-12-08 | Paper |
Allowing each node to communicate only once in a distributed system: shared whiteboard models
Distributed Computing | 2015-07-22 | Paper |
Wide enough Latin rectangles are perfects
| 2015-04-24 | Paper |
A quantitative approach to perfect one-factorizations of complete bipartite graphs
The Electronic Journal of Combinatorics | 2015-04-22 | Paper |
Degree sequence of tight distance graphs
Electronic Notes in Discrete Mathematics | 2013-07-19 | Paper |
Nowhere-zero 5-flows and even (1,2)-factors
Graphs and Combinatorics | 2013-06-26 | Paper |
Reconstructing 3-colored grids from horizontal and vertical projections is NP-hard: A solution to the 2-atom problem in discrete tomography
SIAM Journal on Discrete Mathematics | 2012-08-22 | Paper |
Navigating in a graph by aid of its spanning tree metric
SIAM Journal on Discrete Mathematics | 2011-10-27 | Paper |
Realizing disjoint degree sequences of span at most two: a tractable discrete tomography problem
Discrete Applied Mathematics | 2011-01-14 | Paper |
Minimum Eulerian circuits and minimum de Bruijn sequences
Discrete Mathematics | 2009-12-15 | Paper |
The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method
European Journal of Operational Research | 2009-12-10 | Paper |
Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard
Lecture Notes in Computer Science | 2009-10-29 | Paper |
Cyclic evolution of neuronal automata with memory when all the weighting coefficients are strictly positive
| 2009-07-22 | Paper |
No polynomial bound for the period of neuronal automata with inhibitory memory
| 2009-07-22 | Paper |
Navigating in a Graph by Aid of Its Spanning Tree
Algorithms and Computation | 2009-01-29 | Paper |
Minimal Eulerian Circuit in a Labeled Digraph
LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
Small Alliances in Graphs
Mathematical Foundations of Computer Science 2007 | 2008-09-17 | Paper |
Nowhere-zero 5-flows and (1, 2)-factors
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
Some remarks about factors of graphs
Journal of Graph Theory | 2008-05-14 | Paper |
A new family of expansive graphs
Discrete Applied Mathematics | 2008-04-16 | Paper |
A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs
Approximation and Online Algorithms | 2008-02-20 | Paper |
Vertex partitions and maximum degenerate subgraphs
Journal of Graph Theory | 2007-07-30 | Paper |
scientific article; zbMATH DE number 5158524 (Why is no real title available?)
| 2007-05-29 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2005-12-08 | Paper |
Dynamic of cyclic automata over \(\mathbb Z^2\)
Theoretical Computer Science | 2004-11-12 | Paper |
scientific article; zbMATH DE number 2086231 (Why is no real title available?)
| 2004-08-11 | Paper |
Domino tilings and related models: Space of configurations of domains with holes
Theoretical Computer Science | 2004-08-10 | Paper |
AT-free graphs: Linear bounds for the oriented diameter
Discrete Applied Mathematics | 2004-08-06 | Paper |
Complexity of approximating the oriented diameter of chordal graphs
Journal of Graph Theory | 2004-03-29 | Paper |
scientific article; zbMATH DE number 2063252 (Why is no real title available?)
| 2004-03-29 | Paper |
scientific article; zbMATH DE number 1953095 (Why is no real title available?)
| 2003-07-25 | Paper |
Constructibility of speed one signal on cellular automata
Discrete Mathematics | 2003-04-28 | Paper |
On the computational structure of the connected components of a hard problem
Information Processing Letters | 2002-07-25 | Paper |
Some remarks on cycles in graphs and digraphs
Discrete Mathematics | 2002-02-27 | Paper |
Bilateral orientations and domination
| 2001-10-24 | Paper |
Alternation on cellular automata
Theoretical Computer Science | 1998-07-22 | Paper |
Dynamic behavior of cyclic automata networks
Discrete Applied Mathematics | 1997-09-04 | Paper |
On digital nondeterminism
Mathematical Systems Theory | 1997-08-17 | Paper |
On the height used by additives BSS machines
Foundations of Computational Mathematics | 1997-08-07 | Paper |
Reaction-diffusion automata: Three states implies universality
Theory of Computing Systems | 1997-04-22 | Paper |
Recursive construction of periodic steady state for neural networks
Theoretical Computer Science | 1997-02-28 | Paper |
Symmetric discrete universal neural networks
Theoretical Computer Science | 1997-02-27 | Paper |
Boundedness for proper conflict-free and odd colorings
| N/A | Paper |
