| Publication | Date of Publication | Type |
|---|
Diameter, eccentricities and distance oracle computations on \(H\)-minor free graphs and graphs of bounded (distance) Vapnik-Chervonenkis dimension
SIAM Journal on Computing | 2022-11-15 | Paper |
A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs
Theoretical Computer Science | 2022-06-13 | Paper |
The generalized kudryashov method for new closed form traveling wave solutions to some NLEEs
AIMS Mathematics | 2022-04-21 | Paper |
Fast diameter computation within split graphs
Discrete Mathematics & Theoretical Computer Science | 2022-01-27 | Paper |
Corrigendum to: ``LDFS-based certifying algorithm for the minimum path cover problem on cocomparability graphs
SIAM Journal on Computing | 2021-06-29 | Paper |
Graph classes and forbidden patterns on three vertices
SIAM Journal on Discrete Mathematics | 2021-03-18 | Paper |
Diameter computation on H-minor free graphs and graphs of bounded (distance) VC-dimension
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Maximum induced matching algorithms via vertex ordering characterizations
| 2020-11-25 | Paper |
Approximating modular decomposition is hard
| 2020-07-21 | Paper |
Fast diameter computation within split graphs
| 2020-05-13 | Paper |
Maximum induced matching algorithms via vertex ordering characterizations
Algorithmica | 2020-04-09 | Paper |
A general algorithmic scheme for modular decompositions of hypergraphs and applications
| 2020-02-25 | Paper |
Fast approximation of centrality and distances in hyperbolic graphs
| 2019-10-11 | Paper |
Fast approximation of eccentricities and distances in hyperbolic graphs
Journal of Graph Algorithms and Applications | 2019-07-12 | Paper |
When an optimal dominating set with given constraints exists
Theoretical Computer Science | 2019-06-06 | Paper |
Representation of lattices via set-colored posets
Discrete Applied Mathematics | 2018-10-23 | Paper |
Into the square: on the complexity of some quadratic-time solvable problems
| 2016-08-05 | Paper |
Algorithmic aspects of switch cographs
Discrete Applied Mathematics | 2016-01-21 | Paper |
A tie-break model for graph search
Discrete Applied Mathematics | 2015-12-10 | Paper |
Colored Modular and Split Decompositions of Graphs with Applications to Trigraphs
Graph-Theoretic Concepts in Computer Science | 2015-09-09 | Paper |
Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs
Theoretical Computer Science | 2015-05-26 | Paper |
Partition refinement techniques: an interesting algorithmic tool kit
International Journal of Foundations of Computer Science | 2015-04-29 | Paper |
Characterizing clique graphs of chordal comparability graphs
| 2015-04-09 | Paper |
Computing \(H\)-joins with application to 2-modular decomposition
Algorithmica | 2015-01-19 | Paper |
Reinsurance or securitization: the case of natural catastrophe risk
Journal of Mathematical Economics | 2014-09-08 | Paper |
Fast computation of empirically tight bounds for the diameter of massive graphs
ACM Journal of Experimental Algorithmics | 2014-04-01 | Paper |
Notes on diameters, centers, and approximating trees of \(\delta\)-hyperbolic geodesic spaces and graphs
Electronic Notes in Discrete Mathematics | 2013-06-28 | Paper |
Detecting 2-joins faster
Journal of Discrete Algorithms | 2013-06-24 | Paper |
scientific article; zbMATH DE number 6157242 (Why is no real title available?)
| 2013-04-24 | Paper |
Unique perfect phylogeny is intractable
Theoretical Computer Science | 2013-04-17 | Paper |
The arboreal jump number of an order
Order | 2013-03-20 | Paper |
Skills, core capabilities, and the choice between merging, allying, and trading assets
Journal of Mathematical Economics | 2013-03-06 | Paper |
Modeling of fluid flow in a tube with a moving indentation
Computers and Fluids | 2012-07-11 | Paper |
Additive spanners and distance and routing labeling schemes for hyperbolic graphs
Algorithmica | 2012-04-26 | Paper |
Unique perfect phylogeny is NP-hard
Combinatorial Pattern Matching | 2011-06-29 | Paper |
Complexity issues for the sandwich homogeneous set problem
Discrete Applied Mathematics | 2011-04-19 | Paper |
A note on computing set overlap classes
Information Processing Letters | 2010-06-09 | Paper |
On transitive orientations with restricted covering graphs
Information Processing Letters | 2010-01-29 | Paper |
A simple linear time LexBFS cograph recognition algorithm.
Lecture Notes in Computer Science | 2010-01-12 | Paper |
A Simple Linear Time LexBFS Cograph Recognition Algorithm
SIAM Journal on Discrete Mathematics | 2009-11-27 | Paper |
Polynomial-Time Algorithm for the Leafage of Chordal Graphs
Lecture Notes in Computer Science | 2009-10-29 | Paper |
Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time
Combinatorial Pattern Matching | 2009-07-07 | Paper |
A note on finding all homogeneous set sandwiches
Information Processing Letters | 2009-04-28 | Paper |
Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs
Proceedings of the twenty-fourth annual symposium on Computational geometry | 2009-02-12 | Paper |
Homogeneity vs. Adjacency: Generalising Some Graph Decomposition Algorithms
Graph-Theoretic Concepts in Computer Science | 2008-09-04 | Paper |
Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
Automata, Languages and Programming | 2008-08-28 | Paper |
Unifying Two Graph Decompositions with Modular Decomposition
Algorithms and Computation | 2008-05-27 | Paper |
Competitive graph searches
Theoretical Computer Science | 2008-04-15 | Paper |
On Modular Decomposition Concepts: the case for Homogeneous Relations
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2005-12-08 | Paper |
Algorithm Theory - SWAT 2004
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Combinatorial Pattern Matching
Lecture Notes in Computer Science | 2005-09-07 | Paper |
The number of Moore families on \(n=6\)
Discrete Mathematics | 2005-06-10 | Paper |
A simple linear time algorithm for cograph recognition
Discrete Applied Mathematics | 2005-02-22 | Paper |
Computational aspects of the 2-dimension of partially ordered sets
Theoretical Computer Science | 2004-10-27 | Paper |
Heat transfer to pulsating turbulent flow in an abrupt pipe expansion
International Journal of Numerical Methods for Heat & Fluid Flow | 2004-03-07 | Paper |
Monitoring, Implicit Contracting, and the Lack of Permanence of Leveraged Buyouts
Review of Finance | 2003-03-12 | Paper |
scientific article; zbMATH DE number 1741000 (Why is no real title available?)
| 2002-09-26 | Paper |
scientific article; zbMATH DE number 1512682 (Why is no real title available?)
| 2001-05-13 | Paper |
scientific article; zbMATH DE number 1554928 (Why is no real title available?)
| 2001-01-21 | Paper |
scientific article; zbMATH DE number 1456953 (Why is no real title available?)
| 2000-06-07 | Paper |
scientific article; zbMATH DE number 1322790 (Why is no real title available?)
| 1999-12-14 | Paper |
scientific article; zbMATH DE number 512932 (Why is no real title available?)
| 1999-06-09 | Paper |
scientific article; zbMATH DE number 1262798 (Why is no real title available?)
| 1999-04-26 | Paper |
Calculation of turblent flow and heat transfer in periodically converging-diverging channels
Computers and Fluids | 1999-02-16 | Paper |
Underpricing and IPO proceeds: a note
Economics Letters | 1999-01-12 | Paper |
Gray Codes for the Ideals of Interval Orders
Journal of Algorithms | 1998-01-07 | Paper |
Tree structure for distributive lattices and its applications
Theoretical Computer Science | 1997-09-18 | Paper |
Fluid flow and heat transfer characteristics in axisymmetric annular diffusers
Computers and Fluids | 1997-05-14 | Paper |
Models of information aggregation in financial markets: a review
Applied Mathematical Finance | 1996-01-01 | Paper |
Treewidth of cocomparability graphs and a new order-theoretic parameter
Order | 1994-11-10 | Paper |
On the Interplay Between Interval Dimension and Dimension
SIAM Journal on Discrete Mathematics | 1994-10-25 | Paper |
Interval dimension and MacNeille completion
Order | 1994-03-27 | Paper |
On the calculation of transitive reduction-closure of orders
Discrete Mathematics | 1994-03-13 | Paper |
scientific article; zbMATH DE number 139793 (Why is no real title available?)
| 1993-03-28 | Paper |
scientific article; zbMATH DE number 4214076 (Why is no real title available?)
| 1991-01-01 | Paper |
scientific article; zbMATH DE number 4098742 (Why is no real title available?)
| 1989-01-01 | Paper |
Computing the bump number is easy
Order | 1988-01-01 | Paper |
NP-completeness properties about linear extensions
Order | 1987-01-01 | Paper |
On some complexity properties of N-free posets and posets with bounded decomposition diameter
Discrete Mathematics | 1987-01-01 | Paper |
On the greedy dimension of a partial order
Order | 1985-01-01 | Paper |
N-free posets as generalizations of series-parallel posets
Discrete Applied Mathematics | 1985-01-01 | Paper |
1-intersecting families
Discrete Mathematics | 1985-01-01 | Paper |
On linear k-arboricity
Discrete Mathematics | 1984-01-01 | Paper |
Jump number of dags having Dilworth number 2
Discrete Applied Mathematics | 1984-01-01 | Paper |
scientific article; zbMATH DE number 3893249 (Why is no real title available?)
| 1984-01-01 | Paper |
La k-Arboricité Linéaire Des Arbres
Combinatorial Mathematics, Proceedings of the International Colloquium on Graph Theory and Combinatorics | 1983-01-01 | Paper |
Some problems about linear arboricity
Discrete Mathematics | 1982-01-01 | Paper |
Partitive hypergraphs
Discrete Mathematics | 1981-01-01 | Paper |
A Construction Method For Minimally K-Edge-Connected Graphs
Combinatorics 79 | 1980-01-01 | Paper |
The Jump Number of Dags and Posets: An Introduction
Combinatorics 79 | 1980-01-01 | Paper |
On the X-join decomposition for undirected graphs
Discrete Applied Mathematics | 1979-01-01 | Paper |
scientific article; zbMATH DE number 3661358 (Why is no real title available?)
| 1978-01-01 | Paper |
scientific article; zbMATH DE number 3609715 (Why is no real title available?)
| 1978-01-01 | Paper |
scientific article; zbMATH DE number 3522010 (Why is no real title available?)
| 1975-01-01 | Paper |
scientific article; zbMATH DE number 3531423 (Why is no real title available?)
| 1975-01-01 | Paper |
