The following pages link to Kristóf Bérczi (Q414632):
Displaying 50 items.
- An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach (Q414633) (← links)
- King-serf duo by monochromatic paths in \(k\)-edge-coloured tournaments (Q521361) (← links)
- A note on \({\mathtt V}\)-free 2-matchings (Q727204) (← links)
- Regular graphs are antimagic (Q888592) (← links)
- A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph (Q990080) (← links)
- Arrival time dependent routing policies in public transport (Q1627847) (← links)
- Blocking optimal structures (Q1752656) (← links)
- Complexity of packing common bases in matroids (Q2039228) (← links)
- Hypergraph characterization of split matroids (Q2102692) (← links)
- Inverse optimization problems with multiple weight functions (Q2112661) (← links)
- Approximation by lexicographically maximal solutions in matching and matroid intersection problems (Q2118859) (← links)
- Rainbow and monochromatic circuits and cocircuits in binary matroids (Q2124622) (← links)
- A tight \(\sqrt{2} \)-approximation for linear 3-cut (Q2205984) (← links)
- Generating clause sequences of a CNF formula (Q2219060) (← links)
- Scheduling with non-renewable resources: minimizing the sum of completion times (Q2225062) (← links)
- Beating the 2-approximation factor for global bicut (Q2316621) (← links)
- An algorithm for identifying cycle-plus-triangles graphs (Q2357769) (← links)
- Directed hypergraphs and Horn minimization (Q2404615) (← links)
- Unique key Horn functions (Q2672584) (← links)
- Analyzing Residual Random Greedy for monotone submodular maximization (Q2680237) (← links)
- On the complexity of packing rainbow spanning trees (Q2685331) (← links)
- Covering intersecting bi-set families under matroid constraints (Q2820858) (← links)
- (Q2999648) (← links)
- Restricted b-Matchings in Degree-Bounded Graphs (Q3569807) (← links)
- Variations for Lovász’ Submodular Ideas (Q3601919) (← links)
- Making Bipartite Graphs DM-Irreducible (Q4604647) (← links)
- (Q4607980) (← links)
- Global and fixed-terminal cuts in digraphs (Q5002602) (← links)
- Market Pricing for Matroid Rank Valuations (Q5013570) (← links)
- A 3/2-Approximation for the Metric Many-Visits Path TSP (Q5055644) (← links)
- The Directed Disjoint Shortest Paths Problem (Q5111698) (← links)
- List Coloring of Two Matroids through Reduction to Partition Matroids (Q5157385) (← links)
- Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings (Q5219667) (← links)
- Supermodularity in Unweighted Graph Optimization II: Matroidal Term Rank Augmentation (Q5219668) (← links)
- Supermodularity in Unweighted Graph Optimization III: Highly Connected Digraphs (Q5219669) (← links)
- Approximating Minimum Representations of Key Horn Functions (Q5863327) (← links)
- Improving the integrality gap for multiway cut (Q5918912) (← links)
- Improving the integrality gap for multiway cut (Q5919382) (← links)
- (Q6087211) (← links)
- On approximating the rank of graph divisors (Q6098103) (← links)
- A Dual Approach for Dynamic Pricing in Multidemand Markets (Q6116232) (← links)
- Weighted exchange distance of basis pairs (Q6130221) (← links)
- Partitioning into common independent sets via relaxing strongly base orderability (Q6144384) (← links)
- Matroid Intersection under Restricted Oracles (Q6161263) (← links)
- Exchange Distance of Basis Pairs in Split Matroids (Q6187077) (← links)
- Matroid Horn functions (Q6187338) (← links)
- Approximation by Lexicographically Maximal Solutions in Matching and Matroid Intersection Problems (Q6373379) (← links)
- Inverse optimization problems with multiple weight functions (Q6387824) (← links)
- On the complexity of packing rainbow spanning trees (Q6402998) (← links)
- Hypergraph Horn functions (Q6499011) (← links)
