| Publication | Date of Publication | Type |
|---|
Two new characterizations of path graphs
Discrete Mathematics | 2023-10-04 | Paper |
| Normal approximation of Random Gaussian Neural Networks | 2023-07-10 | Paper |
| Cantelli's bounds for generalized tail inequalities in Euclidean spaces | 2023-07-07 | Paper |
| Second-order moments of the size of randomly induced subgraphs of given order | 2023-04-22 | Paper |
A tight relation between series-parallel graphs and bipartite distance hereditary graphs
The Art of Discrete and Applied Mathematics | 2022-11-04 | Paper |
| Network homophily via tail inequalities | 2022-08-03 | Paper |
| A New Characterization of Path Graphs | 2019-11-20 | Paper |
On computing the Galois lattice of bipartite distance hereditary graphs
Discrete Applied Mathematics | 2017-06-14 | Paper |
Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths
SIAM Journal on Discrete Mathematics | 2015-10-21 | Paper |
On the Galois Lattice of Bipartite Distance Hereditary Graphs
Lecture Notes in Computer Science | 2015-09-15 | Paper |
On the Galois lattice of bipartite distance hereditary graphs
Discrete Applied Mathematics | 2015-07-06 | Paper |
Improved approximation of maximum vertex coverage problem on bipartite graphs
SIAM Journal on Discrete Mathematics | 2014-12-22 | Paper |
The maximum vertex coverage problem on bipartite graphs
Discrete Applied Mathematics | 2014-05-05 | Paper |
On a facility location problem with applications to tele-diagnostic
Optimization Letters | 2013-08-27 | Paper |
Mengerian quasi-graphical families and clutters
European Journal of Combinatorics | 2013-01-24 | Paper |
Recognizing Helly edge-path-tree graphs and their clique graphs
Discrete Applied Mathematics | 2011-08-10 | Paper |
Minconvex Factors of Prescribed Size in Graphs
SIAM Journal on Discrete Mathematics | 2010-08-27 | Paper |
Bicolored graph partitioning, or: gerrymandering at its worst
Discrete Applied Mathematics | 2010-04-28 | Paper |
On the complexity of recognizing directed path families
Discrete Applied Mathematics | 2010-04-28 | Paper |
On the maximum \(q\)-colourable induced subgraph problem in perfect graphs
International Journal of Mathematics in Operational Research | 2010-04-15 | Paper |
Integrality properties of certain special balanceable families
Lecture Notes in Computer Science | 2009-12-11 | Paper |
Integrality properties of edge path tree families
Discrete Mathematics | 2009-12-09 | Paper |
A superclass of edge-path-tree graphs with few cliques
Operations Research Letters | 2009-11-17 | Paper |
Polynomial algorithms for partitioning a tree into single‐center subtrees to minimize flat service costs
Networks | 2008-01-08 | Paper |
A characterization of partial directed line graphs
Discrete Mathematics | 2007-10-25 | Paper |
Integer Programming and Combinatorial Optimization
Lecture Notes in Computer Science | 2005-12-23 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2005-12-08 | Paper |
Cardinality constrained path covering problems in grid graphs
Networks | 2005-01-12 | Paper |
Functions that are uniquely maximized by sparse quasi-star graphs, and uniquely minimized by quasi-complete graphs
(available as arXiv preprint) | N/A | Paper |
