| Publication | Date of Publication | Type |
|---|
Monotonic decompositions of submodular set functions
SIAM Journal on Discrete Mathematics | 2026-04-01 | Paper |
Manipulating the outcome of stable marriage and roommates problems
Games and Economic Behavior | 2024-11-06 | Paper |
Note on the existence of EFX allocations for negative additive valuations
Annales Universitatis Scientiarum Budapestinensis de Rolando Eötvös Nominatae. Sectio Mathematica | 2024-09-11 | Paper |
Envy-free relaxations for goods, chores, and mixed items
Theoretical Computer Science | 2024-06-03 | Paper |
Scheduling with non-renewable resources: minimizing the sum of completion times
Journal of Scheduling | 2024-05-30 | Paper |
Hypergraph Horn functions
SIAM Journal on Discrete Mathematics | 2024-05-08 | Paper |
Weighted exchange distance of basis pairs
Discrete Applied Mathematics | 2024-04-02 | Paper |
Partitioning into common independent sets via relaxing strongly base orderability
Journal of Combinatorial Theory. Series A | 2024-01-29 | Paper |
Matroid Horn functions
Journal of Combinatorial Theory. Series A | 2024-01-15 | Paper |
Exchange Distance of Basis Pairs in Split Matroids
SIAM Journal on Discrete Mathematics | 2024-01-10 | Paper |
| scientific article; zbMATH DE number 7765397 (Why is no real title available?) | 2023-11-14 | Paper |
| Reconfiguration of basis pairs in regular matroids | 2023-11-13 | Paper |
A Dual Approach for Dynamic Pricing in Multidemand Markets
SIAM Journal on Discrete Mathematics | 2023-08-11 | Paper |
Matroid Intersection under Restricted Oracles
SIAM Journal on Discrete Mathematics | 2023-06-27 | Paper |
On approximating the rank of graph divisors
Discrete Mathematics | 2023-06-12 | Paper |
| Newton-type algorithms for inverse optimization II: weighted span objective | 2023-02-26 | Paper |
On the complexity of packing rainbow spanning trees
Discrete Mathematics | 2023-02-21 | Paper |
Analyzing Residual Random Greedy for monotone submodular maximization
Information Processing Letters | 2023-01-30 | Paper |
Inverse optimization problems with multiple weight functions
Discrete Applied Mathematics | 2023-01-11 | Paper |
A 3/2-Approximation for the Metric Many-Visits Path TSP
SIAM Journal on Discrete Mathematics | 2022-12-09 | Paper |
Hypergraph characterization of split matroids
Journal of Combinatorial Theory. Series A | 2022-11-29 | Paper |
On the complexity of packing rainbow spanning trees
(available as arXiv preprint) | 2022-06-23 | Paper |
Unique key Horn functions
Theoretical Computer Science | 2022-06-13 | Paper |
Rainbow and monochromatic circuits and cocircuits in binary matroids
Discrete Mathematics | 2022-04-11 | Paper |
Approximation by lexicographically maximal solutions in matching and matroid intersection problems
Theoretical Computer Science | 2022-03-23 | Paper |
Approximating minimum representations of key Horn functions
SIAM Journal on Computing | 2022-03-11 | Paper |
Inverse optimization problems with multiple weight functions
(available as arXiv preprint) | 2022-01-09 | Paper |
Market pricing for matroid rank valuations
SIAM Journal on Discrete Mathematics | 2021-12-01 | Paper |
List coloring of two matroids through reduction to partition matroids
SIAM Journal on Discrete Mathematics | 2021-10-18 | Paper |
Global and fixed-terminal cuts in digraphs
(available as arXiv preprint) | 2021-07-28 | Paper |
Approximation by Lexicographically Maximal Solutions in Matching and Matroid Intersection Problems
(available as arXiv preprint) | 2021-07-21 | Paper |
Complexity of packing common bases in matroids
Mathematical Programming. Series A. Series B | 2021-07-02 | Paper |
Scheduling with non-renewable resources: minimizing the sum of completion times
(available as arXiv preprint) | 2021-02-04 | Paper |
Generating clause sequences of a CNF formula
Theoretical Computer Science | 2021-01-19 | Paper |
A tight \(\sqrt{2} \)-approximation for linear 3-cut
Mathematical Programming. Series A. Series B | 2020-10-21 | Paper |
Improving the integrality gap for multiway cut
Mathematical Programming. Series A. Series B | 2020-08-28 | Paper |
| The Directed Disjoint Shortest Paths Problem | 2020-05-27 | Paper |
Supermodularity in unweighted graph optimization. I: Branchings and matchings
Mathematics of Operations Research | 2020-03-12 | Paper |
Supermodularity in unweighted graph optimization. II: Matroidal term rank augmentation
Mathematics of Operations Research | 2020-03-12 | Paper |
Supermodularity in unweighted graph optimization. III: Highly connected digraphs
Mathematics of Operations Research | 2020-03-12 | Paper |
Improving the integrality gap for multiway cut
Integer Programming and Combinatorial Optimization | 2020-02-06 | Paper |
Improving the integrality gap for multiway cut
Integer Programming and Combinatorial Optimization | 2020-02-06 | Paper |
Beating the 2-approximation factor for global bicut
Mathematical Programming. Series A. Series B | 2019-08-06 | Paper |
Arrival time dependent routing policies in public transport
Discrete Applied Mathematics | 2018-12-03 | Paper |
Blocking optimal structures
Discrete Mathematics | 2018-05-24 | Paper |
| scientific article; zbMATH DE number 6850401 (Why is no real title available?) | 2018-03-15 | Paper |
Making bipartite graphs DM-irreducible
SIAM Journal on Discrete Mathematics | 2018-03-05 | Paper |
Directed hypergraphs and Horn minimization
Information Processing Letters | 2017-09-19 | Paper |
An algorithm for identifying cycle-plus-triangles graphs
Discrete Applied Mathematics | 2017-06-14 | Paper |
| Packing tree degree sequences | 2017-04-24 | Paper |
King-serf duo by monochromatic paths in \(k\)-edge-coloured tournaments
The Electronic Journal of Combinatorics | 2017-04-10 | Paper |
King-serf duo by monochromatic paths in \(k\)-edge-coloured tournaments
The Electronic Journal of Combinatorics | 2017-04-10 | Paper |
A note on \({\mathtt V}\)-free 2-matchings
The Electronic Journal of Combinatorics | 2016-12-06 | Paper |
A note on \({\mathtt V}\)-free 2-matchings
The Electronic Journal of Combinatorics | 2016-12-06 | Paper |
Covering intersecting bi-set families under matroid constraints
SIAM Journal on Discrete Mathematics | 2016-09-09 | Paper |
Regular graphs are antimagic
The Electronic Journal of Combinatorics | 2015-11-02 | Paper |
Regular graphs are antimagic
The Electronic Journal of Combinatorics | 2015-11-02 | Paper |
An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach
Journal of Combinatorial Theory. Series B | 2012-05-11 | Paper |
| Packing arborescences | 2011-05-16 | Paper |
A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph
Information Processing Letters | 2010-09-02 | Paper |
Restricted \(b\)-matchings in degree-bounded graphs
Integer Programming and Combinatorial Optimization | 2010-06-22 | Paper |
Variations for Lovász’ Submodular Ideas
Bolyai Society Mathematical Studies | 2009-02-12 | Paper |
Approximating maximum-size properly colored forests
(available as arXiv preprint) | N/A | Paper |
