Cristina Bazgan

	2012
54		Cristina Bazgan, Sonia Toubaline, Daniel Vanderpooten: Efficient determination of the k most vital edges for the minimum spanning tree problem. Computers & OR 39(11): 2888-2898 (2012)
	2011
53		Cristina Bazgan, Sonia Toubaline, Daniel Vanderpooten: Efficient Algorithms for Finding the k Most Vital Edges for the Minimum Spanning Tree Problem. COCOA 2011: 126-140
52		Cristina Bazgan, Morgan Chopin, Michael R. Fellows: Parameterized Complexity of the Firefighter Problem. ISAAC 2011: 643-652
51		Cristina Bazgan, Laurent Gourvès, Jérôme Monnot: Approximation with a Fixed Number of Solutions of Some Biobjective Maximization Problems. WAOA 2011: 233-246
50		Cristina Bazgan, Laurent Gourvès, Jérôme Monnot, Fanny Pascual: Single Approximation for Biobjective Max TSP. WAOA 2011: 49-62
49		Cristina Bazgan, Morgan Chopin, Bernard Ries: The firefighter problem with more than one firefighter on trees CoRR abs/1110.0341: (2011)
48		Cristina Bazgan, Sonia Toubaline, Zsolt Tuza: The most vital nodes with respect to independent set and vertex cover. Discrete Applied Mathematics 159(17): 1933-1946 (2011)
47		Cristina Bazgan, Basile Couëtoux, Zsolt Tuza: Complexity and approximation of the Constrained Forest problem. Theor. Comput. Sci. 412(32): 4081-4091 (2011)
	2010
46		Cristina Bazgan, Sonia Toubaline, Daniel Vanderpooten: Complexity of Determining the Most Vital Elements for the 1-median and 1-center Location Problems. COCOA (1) 2010: 237-251
45		Cristina Bazgan, Sonia Toubaline, Zsolt Tuza: Complexity of Most Vital Nodes for Independent Set in Graphs Related to Tree Structures. IWOCA 2010: 154-166
44		Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten: General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems. Discrete Optimization 7(3): 136-148 (2010)
43		Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten: Satisfactory graph partition, variants, and generalizations. European Journal of Operational Research 206(2): 271-280 (2010)
	2009
42		Cristina Bazgan, Basile Couëtoux, Zsolt Tuza: Covering a Graph with a Constrained Forest (Extended Abstract). ISAAC 2009: 892-901
41		Cristina Bazgan, Hadrien Hugot, Daniel Vanderpooten: Solving efficiently the 0-1 multi-objective knapsack problem. Computers & OR 36(1): 260-279 (2009)
40		Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten: Min-max and min-max regret versions of combinatorial optimization problems: A survey. European Journal of Operational Research 197(2): 427-438 (2009)
39		Cristina Bazgan, Hadrien Hugot, Daniel Vanderpooten: Implementing an efficient fptas for the 0-1 multi-objective knapsack problem. European Journal of Operational Research 198(1): 47-56 (2009)
	2008
38		Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten: Complexity of the min-max (regret) versions of min cut problems. Discrete Optimization 5(1): 66-73 (2008)
37		Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten: Approximation of satisfactory bisection problems. J. Comput. Syst. Sci. 74(5): 875-883 (2008)
36		Cristina Bazgan, Zsolt Tuza: Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3. J. Discrete Algorithms 6(3): 510-519 (2008)
	2007
35		Cristina Bazgan, Hadrien Hugot, Daniel Vanderpooten: A Practical Efficient Fptas for the 0-1 Multi-objective Knapsack Problem. ESA 2007: 717-728
34		Cristina Bazgan, Hadrien Hugot, Daniel Vanderpooten: An Efficient Implementation for the 0-1 Multi-objective Knapsack Problem. WEA 2007: 406-419
33		Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten: Efficient algorithms for decomposing graphs under degree constraints. Discrete Applied Mathematics 155(8): 979-988 (2007)
32		Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten: Approximation of min-max and min-max regret versions of some combinatorial optimization problems. European Journal of Operational Research 179(2): 281-290 (2007)
	2006
31		Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten: Approximating Min-Max (Regret) Versions of Some Polynomial Problems. COCOON 2006: 428-438
30		Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten: The satisfactory partition problem. Discrete Applied Mathematics 154(8): 1236-1245 (2006)
29		Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten: Degree-constrained decompositions of graphs: Bounded treewidth and planarity. Theor. Comput. Sci. 355(3): 389-395 (2006)
	2005
28		Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten: Complexity and Approximation of Satisfactory Partition Problems. COCOON 2005: 829-838
27		Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten: Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack. ESA 2005: 862-873
26		Cristina Bazgan, Marek Karpinski: On the Complexity of Global Constraint Satisfaction. ISAAC 2005: 624-633
25		Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten: Complexity of the Min-Max (Regret) Versions of Cut Problems. ISAAC 2005: 789-798
24		Cristina Bazgan, Jérôme Monnot, Vangelis Th. Paschos, Fabrice Serrière: Greedy Differential Approximations for Min Set Cover. SOFSEM 2005: 62-71
23		Cristina Bazgan, Refael Hassin, Jérôme Monnot: Approximation algorithms for some vehicle routing problems. Discrete Applied Mathematics 146(1): 27-42 (2005)
22		Giorgio Ausiello, Cristina Bazgan, Marc Demange, Vangelis Th. Paschos: Completeness in differential approximation classes. Int. J. Found. Comput. Sci. 16(6): 1267-1295 (2005)
21		Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten: Complexity of the min-max and min-max regret assignment problems. Oper. Res. Lett. 33(6): 634-640 (2005)
20		Cristina Bazgan, Jérôme Monnot, Vangelis Th. Paschos, Fabrice Serrière: On the differential approximation of MIN SET COVER. Theor. Comput. Sci. 332(1-3): 497-513 (2005)
19		Cristina Bazgan, Bruno Escoffier, Vangelis Th. Paschos: Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness. Theor. Comput. Sci. 339(2-3): 272-292 (2005)
	2004
18		Cristina Bazgan, Bruno Escoffier, Vangelis Th. Paschos: Poly-APX- and PTAS-Completeness in Standard and Differential Approximation. ISAAC 2004: 124-136
17		Cristina Bazgan: A note on the approximability of the toughness of graphs. Discrete Mathematics 280(1-3): 215-218 (2004)
	2003
16		Cristina Bazgan, Refael Hassin, Jérôme Monnot: Differential Approximation for Some Routing Problems. CIAC 2003: 277-288
15		Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten: On the Existence and Determination of Satisfactory Partitions in a Graph. ISAAC 2003: 444-453
14		Giorgio Ausiello, Cristina Bazgan, Marc Demange, Vangelis Th. Paschos: Completeness in Differential Approximation Classes. MFCS 2003: 179-188
13		Cristina Bazgan, Vangelis Th. Paschos: Differential approximation for optimal satisfiability and related problems. European Journal of Operational Research 147(2): 397-404 (2003)
12		Cristina Bazgan, Wenceslas Fernandez de la Vega, Marek Karpinski: Polynomial time approximation schemes for dense instances of minimum constraint satisfaction. Random Struct. Algorithms 23(1): 73-91 (2003)
	2002
11		Cristina Bazgan, Wenceslas Fernandez de la Vega, Marek Karpinski: Approximability of Dense Instances of NEAREST CODEWORD Problem. SWAT 2002: 298-307
10		Cristina Bazgan, Miklos Santha, Zsolt Tuza: Efficient Approximation Algorithms for the SUBSET-SUMS EQUALITY Problem. J. Comput. Syst. Sci. 64(2): 160-170 (2002)
	2001
9		Cristina Bazgan, Amel Harkat-Benhamdine, Hao Li, Mariusz Wozniak: A note on the vertex-distinguishing proper coloring of graphs with large minimum degree. Discrete Mathematics 236(1-3): 37-42 (2001)
8		Cristina Bazgan, Wenceslas Fernandez de la Vega, Marek Karpinski: Polynomial Time Approximation Schemes for Dense Instances of Minimum Constraint Satisfaction Electronic Colloquium on Computational Complexity (ECCC) 8(34): (2001)
7		Cristina Bazgan, Amel Harkat-Benhamdine, Hao Li, Mariusz Wozniak: Partitioning vertices of 1-tough graphs into paths. Theor. Comput. Sci. 263(1-2): 255-261 (2001)
	2000
6		Cristina Bazgan, Wenceslas Fernandez de la Vega, Marek Karpinski: Approximability of Dense Instances of NEAREST CODEWORD Problem Electronic Colloquium on Computational Complexity (ECCC) 7(91): (2000)
	1999
5		Cristina Bazgan, Wenceslas Fernandez de la Vega: A Polynomial Time Approximation Scheme for Dense MIN 2SAT. FCT 1999: 91-99
4		Cristina Bazgan, Miklos Santha, Zsolt Tuza: On the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs. J. Algorithms 31(1): 249-268 (1999)
3		Cristina Bazgan, Amel Harkat-Benhamdine, Hao Li, Mariusz Wozniak: On the Vertex-Distinguishing Proper Edge-Colorings of Graphs. J. Comb. Theory, Ser. B 75(2): 288-301 (1999)
	1998
2		Cristina Bazgan, Miklos Santha, Zsolt Tuza: Efficient Approximation Algorithms for the Subset-Sums Equality Problem. ICALP 1998: 387-396
1		Cristina Bazgan, Miklos Santha, Zsolt Tuza: On the Approximation of Finding A(nother) Hamilton Cycle in Cubic Hamilton Graphs (Extended Abstract). STACS 1998: 276-286

Coauthor Index

1	Hassene Aissi	[21] [25] [27] [31] [32] [38] [40] [44]
2	Giorgio Ausiello	[14] [22]
3	Morgan Chopin	[49] [52]
4	Basile Couëtoux	[42] [47]
5	Marc Demange	[14] [22]
6	Bruno Escoffier	[18] [19]
7	Michael R. Fellows (Mike Fellows)	[52]
8	Laurent Gourvès	[50] [51]
9	Amel Harkat-Benhamdine	[3] [7] [9]
10	Refael Hassin	[16] [23]
11	Hadrien Hugot	[34] [35] [39] [41]
12	Marek Karpinski	[6] [8] [11] [12] [26]
13	Hao Li	[3] [7] [9]
14	Jérôme Monnot	[16] [20] [23] [24] [50] [51]
15	Vangelis Th. Paschos	[13] [14] [18] [19] [20] [22] [24]
16	Fanny Pascual	[50]
17	Bernard Ries	[49]
18	Miklos Santha	[1] [2] [4] [10]
19	Fabrice Serrière	[20] [24]
20	Sonia Toubaline	[45] [46] [48] [53] [54]
21	Zsolt Tuza	[1] [2] [4] [10] [15] [28] [29] [30] [33] [36] [37] [42] [43] [45] [47] [48]
22	Daniel Vanderpooten	[15] [21] [25] [27] [28] [29] [30] [31] [32] [33] [34] [35] [37] [38] [39] [40] [41] [43] [44] [46] [53] [54]
23	Wenceslas Fernandez de la Vega	[5] [6] [8] [11] [12]
24	Mariusz Wozniak	[3] [7] [9]

Colors in the list of coauthors

Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page