According to our database
1,
Kristóf Bérczi
authored at least 68 papers
between 2009 and 2024.
Collaborative distances:
2024
Scheduling with non-renewable resources: minimizing the sum of completion times.
J. Sched., April, 2024
J. Comb. Theory A, April, 2024
Exchange Distance of Basis Pairs in Split Matroids.
SIAM J. Discret. Math., March, 2024
Partitioning into common independent sets via relaxing strongly base orderability.
J. Comb. Theory A, February, 2024
Envy-free relaxations for goods, chores, and mixed items.
Theor. Comput. Sci., 2024
Hypergraph Horn Functions.
SIAM J. Discret. Math., 2024
Manipulating the outcome of stable marriage and roommates problems.
Games Econ. Behav., 2024
Weighted exchange distance of basis pairs.
Discret. Appl. Math., 2024
Matroid Intersection under Minimum Rank Oracle.
CoRR, 2024
Finding Spanning Trees with Perfect Matchings.
CoRR, 2024
Reconfiguration of Basis Pairs in Regular Matroids.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024
Multiway Cuts with a Choice of Representatives.
Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024
Newton-Type Algorithms for Inverse Optimization: Weighted Span Objective.
Proceedings of the LATIN 2024: Theoretical Informatics, 2024
Splitting-Off in Hypergraphs.
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024
Hypergraph Connectivity Augmentation in Strongly Polynomial Time.
Proceedings of the 32nd Annual European Symposium on Algorithms, 2024
Approximating Maximum-Size Properly Colored Forests.
Proceedings of the 32nd Annual European Symposium on Algorithms, 2024
2023
A Dual Approach for Dynamic Pricing in Multidemand Markets.
SIAM J. Discret. Math., September, 2023
On approximating the rank of graph divisors.
Discret. Math., September, 2023
Matroid Intersection under Restricted Oracles.
SIAM J. Discret. Math., June, 2023
On the complexity of packing rainbow spanning trees.
Discret. Math., April, 2023
Hypergraph characterization of split matroids.
J. Comb. Theory A, 2023
Analyzing Residual Random Greedy for monotone submodular maximization.
Inf. Process. Lett., 2023
Inverse optimization problems with multiple weight functions.
Discret. Appl. Math., 2023
Hypergraph Splitting-off and Covering Skew-Supermodular Functions in Strongly Polynomial Time.
CoRR, 2023
Newton-type algorithms for inverse optimization II: weighted span objective.
CoRR, 2023
Newton-type algorithms for inverse optimization I: weighted bottleneck Hamming distance and 𝓁<sub>∞</sub>-norm objectives.
CoRR, 2023
Envy-free dynamic pricing schemes.
CoRR, 2023
2022
A 3/2-Approximation for the Metric Many-Visits Path TSP.
SIAM J. Discret. Math., December, 2022
Approximation by lexicographically maximal solutions in matching and matroid intersection problems.
Theor. Comput. Sci., 2022
Unique key Horn functions.
Theor. Comput. Sci., 2022
Approximating Minimum Representations of Key Horn Functions.
SIAM J. Comput., 2022
Rainbow and monochromatic circuits and cocircuits in binary matroids.
Discret. Math., 2022
Resolving Infeasibility of Linear Systems: A Parameterized Approach.
CoRR, 2022
Manipulating the outcome of stable matching and roommates problems.
CoRR, 2022
Efficient Approximations for Many-Visits Multiple Traveling Salesman Problems.
CoRR, 2022
2021
Generating clause sequences of a CNF formula.
Theor. Comput. Sci., 2021
List Coloring of Two Matroids through Reduction to Partition Matroids.
SIAM J. Discret. Math., 2021
Market Pricing for Matroid Rank Valuations.
SIAM J. Discret. Math., 2021
Complexity of packing common bases in matroids.
Math. Program., 2021
A dual approach for dynamic pricing in multi-demand markets.
CoRR, 2021
2020
A tight $\sqrt{2}$-approximation for linear 3-cut.
Math. Program., 2020
Improving the integrality gap for multiway cut.
Math. Program., 2020
Rainbow and monochromatic circuits and cuts in binary matroids.
CoRR, 2020
2019
Beating the 2-approximation factor for global bicut.
Math. Program., 2019
Packing tree degree sequences.
Informatica (Slovenia), 2019
List colouring of two matroids through reduction to partition matroids.
CoRR, 2019
Degree-Bounded Generalized Polymatroids and Approximating the Metric Many-Visits TSP.
CoRR, 2019
2018
Making Bipartite Graphs DM-Irreducible.
SIAM J. Discret. Math., 2018
Supermodularity in Unweighted Graph Optimization III: Highly Connected Digraphs.
Math. Oper. Res., 2018
Supermodularity in Unweighted Graph Optimization II: Matroidal Term Rank Augmentation.
Math. Oper. Res., 2018
Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings.
Math. Oper. Res., 2018
Blocking optimal structures.
Discret. Math., 2018
Arrival time dependent routing policies in public transport.
Discret. Appl. Math., 2018
A tight -approximation for Linear 3-Cut.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018
2017
Directed hypergraphs and Horn minimization.
Inf. Process. Lett., 2017
An algorithm for identifying cycle-plus-triangles graphs.
Discret. Appl. Math., 2017
King-Serf Duo by Monochromatic Paths in k-Edge-Coloured Tournaments.
Electron. J. Comb., 2017
Packing strictly-shortest paths in a tree for QoS-aware routing.
Proceedings of the 2017 IFIP Networking Conference, 2017
The Directed Disjoint Shortest Paths Problem.
Proceedings of the 25th Annual European Symposium on Algorithms, 2017
Global and Fixed-Terminal Cuts in Digraphs.
Proceedings of the Approximation, 2017
2016
Covering Intersecting Bi-set Families under Matroid Constraints.
SIAM J. Discret. Math., 2016
Supermodularity in Unweighted Graph Opitimization III: Highly-connected Digraphs.
CoRR, 2016
A Note on $\mathtt{V}$-free 2-matchings.
Electron. J. Comb., 2016
2015
Regular Graphs are Antimagic.
Electron. J. Comb., 2015
2012
An algorithm for (n-3)-connectivity augmentation problem: Jump system approach.
J. Comb. Theory B, 2012
2011
ILP based diverse path routing with node inclusion.
Proceedings of the 3rd International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, 2011
2010
Restricted <i>b</i>-Matchings in Degree-Bounded Graphs.
Proceedings of the Integer Programming and Combinatorial Optimization, 2010
2009
A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph.
Inf. Process. Lett., 2009
