2023
On Gupta's Codensity Conjecture.
SIAM J. Discret. Math., September, 2023
Unavoidable Induced Subgraphs of Large 2-Connected Graphs.
SIAM J. Discret. Math., June, 2023
Strengthened chain theorems for different versions of 4-connectivity.
Discret. Math., 2023
2022
Distributed Matrix Tiling Using A Hypergraph Labeling Formulation.
Proceedings of the ICDCN '22: 23rd International Conference on Distributed Computing and Networking, Delhi, AA, India, January 4, 2022
2020
Ranking tournaments with no errors II: Minimax relation.
J. Comb. Theory, Ser. B, 2020
Ranking tournaments with no errors I: Structural description.
J. Comb. Theory, Ser. B, 2020
Online Mincut: Advice, Randomization and More.
CoRR, 2020
2019
A chain theorem for 4-connected graphs.
J. Comb. Theory, Ser. B, 2019
2018
When Is the Matching Polytope Box-Totally Dual Integral?
Math. Oper. Res., 2018
J. Comb. Theory, Ser. B, 2018
Excluding a large theta graph.
J. Comb. Theory, Ser. B, 2018
Minimal k-Connected Non-Hamiltonian Graphs.
Graphs Comb., 2018
2016
Unavoidable Connected Matroids Retaining a Specified Minor.
SIAM J. Discret. Math., 2016
Hall-Type Results for 3-Connected Projective Graphs.
J. Graph Theory, 2016
Large Wk- or K3, t-Minors in 3-Connected Graphs.
J. Graph Theory, 2016
Excluded-Minor Characterization of Apex-Outerplanar Graphs.
Graphs Comb., 2016
Graphs with no $\bar P_7$-Minor.
Electron. J. Comb., 2016
2015
Characterizing binary matroids with no P9-minor.
Adv. Appl. Math., 2015
2014
Internally 4-connected projective-planar graphs.
J. Comb. Theory, Ser. B, 2014
2013
On 3-Connected Graphs of Path-Width at Most Three.
SIAM J. Discret. Math., 2013
A Characterization of Graphs with No Octahedron Minor.
J. Graph Theory, 2013
Discret. Appl. Math., 2013
2012
A Chain Theorem for 3<sup>+</sup>-Connected Graphs.
SIAM J. Discret. Math., 2012
The Maximum-Weight Stable Matching Problem: Duality and Efficiency.
SIAM J. Discret. Math., 2012
Bonds with parity constraints.
J. Comb. Theory, Ser. B, 2012
Bandwidth of trees of diameter at most 4.
Discret. Math., 2012
2011
Large non-planar graphs and an application to crossing-critical graphs.
J. Comb. Theory, Ser. B, 2011
2010
Splitter Theorems for 4-Regular Graphs.
Graphs Comb., 2010
Unavoidable topological minors of infinite graphs.
Discret. Math., 2010
Transforms of pseudo-Boolean random variables.
Discret. Appl. Math., 2010
Vertex-Bipartition Method for Colouring Minor-Closed Classes of Graphs.
Comb. Probab. Comput., 2010
2009
Packing circuits in matroids.
Math. Program., 2009
Generating 5-regular planar graphs.
J. Graph Theory, 2009
Unavoidable parallel minors of 4-connected graphs.
J. Graph Theory, 2009
The edge version of Hadwiger's conjecture.
Discret. Math., 2009
The box-TDI system associated with 2-edge connected spanning subgraphs.
Discret. Appl. Math., 2009
Learning Terrorist Profiles by Optimization with Two Objectives.
Proceedings of the 2009 International Conference on Information & Knowledge Engineering, 2009
2008
The complexity of recognizing linear systems with certain integrality properties.
Math. Program., 2008
A Characterization of Box-Mengerian Matroid Ports.
Math. Oper. Res., 2008
Formulas for approximating pseudo-Boolean random variables.
Discret. Appl. Math., 2008
Local Soft Belief Updating for Relational Classification.
Proceedings of the Foundations of Intelligent Systems, 17th International Symposium, 2008
Empirical Comparison of Greedy Strategies for Learning Markov Networks of Treewidth k.
Proceedings of the Seventh International Conference on Machine Learning and Applications, 2008
Fuzzy Clustering and Iterative Relational Classification for Terrorist Profiling.
Proceedings of the 2008 IEEE International Conference on Granular Computing, 2008
2007
Asymptotic Behavior of Linear Approximations of Pseudo-Boolean Functions.
J. Adv. Comput. Intell. Intell. Informatics, 2007
Graph-theoretic method for merging security system specifications.
Inf. Sci., 2007
Comparison of Greedy Strategies for Learning Markov Networks of Treewidth k.
Proceedings of the 2007 International Conference on Machine Learning; Models, 2007
A Low Bound for Broadcast in Optical Networks of Bounded Treewidth Using Fewest Converters.
Proceedings of the 26th IEEE International Performance Computing and Communications Conference, 2007
2006
A Min-Max Relation on Packing Feedback Vertex Sets.
Math. Oper. Res., 2006
Splitter Theorems for Cubic Graphs.
Comb. Probab. Comput., 2006
2005
New bounds for randomized busing.
Theor. Comput. Sci., 2005
Efficient Learning of Pseudo-Boolean Functions from Limited Training Data.
Proceedings of the Foundations of Intelligent Systems, 15th International Symposium, 2005
Approximating Pseudo-Boolean Functions on Non-Uniform Domains.
Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005
2004
The best expert versus the smartest algorithm.
Theor. Comput. Sci., 2004
Excluding any graph as a minor allows a low tree-width 2-coloring.
J. Comb. Theory, Ser. B, 2004
Unavoidable doubly connected large graphs.
Discret. Math., 2004
2003
Packing cycles in graphs, II.
J. Comb. Theory, Ser. B, 2003
Partitioning into graphs with only small components.
J. Comb. Theory, Ser. B, 2003
Generating r-regular graphs.
Discret. Appl. Math., 2003
2002
Packing Cycles in Graphs.
J. Comb. Theory, Ser. B, 2002
2001
Spanning trees with many leaves.
J. Graph Theory, 2001
2000
Surfaces, Tree-Width, Clique-Minors, and Partitions.
J. Comb. Theory, Ser. B, 2000
1998
Chordal graphs, interval graphs, and wqo.
J. Graph Theory, 1998
Partitioning Graphs of Bounded Tree-Width.
Comb., 1998
1997
Unavoidable Minors of Large 3-Connected Matroids.
J. Comb. Theory, Ser. B, 1997
Matroids arisen from matrogenic graphs.
Discret. Math., 1997
1996
Unavoidable Minors of Large 3-Connected Binary Matroids.
J. Comb. Theory, Ser. B, 1996
Excluding a Long Double Path Minor.
J. Comb. Theory, Ser. B, 1996
On tree-partitions of graphs.
Discret. Math., 1996
Bounding the Number of Circuits of a Graph.
Comb., 1996
1995
Graphs with not too many spanning trees.
Networks, 1995
Some results on tree decomposition of graphs.
J. Graph Theory, 1995
On Infinite Antichains of Matroids.
J. Comb. Theory, Ser. B, 1995
Bounding the Number of Bases of a Matroid.
Comb., 1995
1994
Recognizing the P<sub>4</sub>-structure of a tree.
Graphs Comb., 1994
Bounding the Vertex Cover Number of a Hypergraph.
Comb., 1994
1993
Disjoint Cycles in Directed Graphs on the Torus and the Klein Bottle.
J. Comb. Theory, Ser. B, 1993
Stable sets versus independent sets.
Discret. Math., 1993
Clutters with tau<sub>2</sub>=2tau.
Discret. Math., 1993
Disjoint circuits on a Klein bottle and a theorem on posets.
Discret. Math., 1993
1992
Disjoint Paths in a Planar Graph - A General Theorem.
SIAM J. Discret. Math., 1992
Subgraphs and well-quasi-ordering.
J. Graph Theory, 1992
1991
Covering the edges with consecutive sets.
J. Graph Theory, 1991
The immersion relation on webs.
Proceedings of the Graph Structure Theory, 1991
