 | 2012 |
|---|
| 4 |       | Kristóf Bérczi,
Yusuke Kobayashi:
An algorithm for (n-3)-connectivity augmentation problem: Jump system approach.
J. Comb. Theory, Ser. B 102(3): 565-587 (2012) |
| 2011 |
|---|
| 3 | | Zs. Lakatos,
L. Bajzik,
T. Karasz,
Kristóf Bérczi,
Erika R. Kovács,
László A. Végh:
ILP based diverse path routing with node inclusion.
ICUMT 2011: 1-8 |
| 2010 |
|---|
| 2 | | Kristóf Bérczi,
László A. Végh:
Restricted b-Matchings in Degree-Bounded Graphs.
IPCO 2010: 43-56 |
| 2009 |
|---|
| 1 | | Kristóf Bérczi,
Satoru Fujishige,
Naoyuki Kamiyama:
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. 109(23-24): 1227-1231 (2009) |
Data released under the ODC-BY 1.0 license — See also our legal information page