Kristóf Bérczi

From MaRDI portal
Person:414632

Available identifiers

zbMath Open berczi.kristofMaRDI QIDQ414632

List of research outcomes

PublicationDate of PublicationType
Weighted exchange distance of basis pairs2024-04-02Paper
Partitioning into common independent sets via relaxing strongly base orderability2024-01-29Paper
Matroid Horn functions2024-01-15Paper
Exchange Distance of Basis Pairs in Split Matroids2024-01-10Paper
https://portal.mardi4nfdi.de/entity/Q60872112023-11-14Paper
Reconfiguration of basis pairs in regular matroids2023-11-13Paper
A Dual Approach for Dynamic Pricing in Multidemand Markets2023-08-11Paper
Matroid Intersection under Restricted Oracles2023-06-27Paper
On approximating the rank of graph divisors2023-06-12Paper
Newton-type algorithms for inverse optimization II: weighted span objective2023-02-26Paper
On the complexity of packing rainbow spanning trees2023-02-21Paper
Analyzing Residual Random Greedy for monotone submodular maximization2023-01-30Paper
Inverse optimization problems with multiple weight functions2023-01-11Paper
A 3/2-Approximation for the Metric Many-Visits Path TSP2022-12-09Paper
Hypergraph characterization of split matroids2022-11-29Paper
On the complexity of packing rainbow spanning trees2022-06-23Paper
Unique key Horn functions2022-06-13Paper
Rainbow and monochromatic circuits and cocircuits in binary matroids2022-04-11Paper
Approximation by lexicographically maximal solutions in matching and matroid intersection problems2022-03-23Paper
Approximating Minimum Representations of Key Horn Functions2022-03-11Paper
Inverse optimization problems with multiple weight functions2022-01-09Paper
Market Pricing for Matroid Rank Valuations2021-12-01Paper
List Coloring of Two Matroids through Reduction to Partition Matroids2021-10-18Paper
Global and fixed-terminal cuts in digraphs2021-07-28Paper
Approximation by Lexicographically Maximal Solutions in Matching and Matroid Intersection Problems2021-07-21Paper
Complexity of packing common bases in matroids2021-07-02Paper
Scheduling with non-renewable resources: minimizing the sum of completion times2021-02-04Paper
Generating clause sequences of a CNF formula2021-01-19Paper
A tight \(\sqrt{2} \)-approximation for linear 3-cut2020-10-21Paper
Improving the integrality gap for multiway cut2020-08-28Paper
The Directed Disjoint Shortest Paths Problem2020-05-27Paper
Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings2020-03-12Paper
Supermodularity in Unweighted Graph Optimization II: Matroidal Term Rank Augmentation2020-03-12Paper
Supermodularity in Unweighted Graph Optimization III: Highly Connected Digraphs2020-03-12Paper
Improving the integrality gap for multiway cut2020-02-06Paper
Beating the 2-approximation factor for global bicut2019-08-06Paper
Arrival time dependent routing policies in public transport2018-12-03Paper
Blocking optimal structures2018-05-24Paper
https://portal.mardi4nfdi.de/entity/Q46079802018-03-15Paper
Making Bipartite Graphs DM-Irreducible2018-03-05Paper
Directed hypergraphs and Horn minimization2017-09-19Paper
An algorithm for identifying cycle-plus-triangles graphs2017-06-14Paper
Packing tree degree sequences2017-04-24Paper
King-serf duo by monochromatic paths in \(k\)-edge-coloured tournaments2017-04-10Paper
A note on \({\mathtt V}\)-free 2-matchings2016-12-06Paper
Covering Intersecting Bi-set Families under Matroid Constraints2016-09-09Paper
Regular graphs are antimagic2015-11-02Paper
An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach2012-05-11Paper
https://portal.mardi4nfdi.de/entity/Q29996482011-05-16Paper
A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph2010-09-02Paper
Restricted b-Matchings in Degree-Bounded Graphs2010-06-22Paper
Variations for Lovász’ Submodular Ideas2009-02-12Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Kristóf Bérczi