CV Accueil - Archive ouverte HAL

	Complexity and inapproximability results for balanced connected subgraph problem Timothée Martinod , Valentin Pollet , Benoit Darties , Rodolphe Giroudeau , Jean-Claude König Theoretical Computer Science, 2021, 886, pp.69-83. ⟨10.1016/j.tcs.2021.07.010⟩ Article dans une revue lirmm-03475313v1
	On Residual Approximation in Solution Extension Problems Mathias Weller , Annie Chateau , Rodolphe Giroudeau , Jean-Claude König , Valentin Pollet Journal of Combinatorial Optimization, 2018, 36 (4), pp.1195-1220. ⟨10.1007/s10878-017-0202-5⟩ Article dans une revue lirmm-01889394v1

	The Balanced Connected Subgraph Problem: Complexity Results in Bounded-Degree and Bounded-Diameter Graphs Benoit Darties , Rodolphe Giroudeau , Jean-Claude König , Valentin Pollet COCOA 2019 - 13th International Conference on Combinatorial Optimization and Applications, Dec 2019, Xiamen, China. pp.449-460, ⟨10.1007/978-3-030-36412-0_36⟩ Communication dans un congrès lirmm-02454914v1
	On Residual Approximation in Solution Extension Problems Mathias Weller , Annie Chateau , Rodolphe Giroudeau , Jean-Claude König , Valentin Pollet COCOA: Conference on Combinatorial Optimization and Applications, Dec 2016, Hong Kong, China. pp.463-476, ⟨10.1007/978-3-319-48749-6_34⟩ Communication dans un congrès lirmm-01378581v1

Jean-Claude Konig