|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 28 occurrences of 18 keywords
|
|
|
|
|
Results
Found 54 publication records. Showing 54 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Cristina Bazgan, Sonia Toubaline, Daniel Vanderpooten |
Efficient determination of the k most vital edges for the minimum spanning tree problem.  |
Computers & OR  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristina Bazgan, Basile Couëtoux, Zsolt Tuza |
Complexity and approximation of the Constrained Forest problem. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristina Bazgan, Morgan Chopin, Bernard Ries |
The firefighter problem with more than one firefighter on trees |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Cristina Bazgan, Sonia Toubaline, Zsolt Tuza |
The most vital nodes with respect to independent set and vertex cover. |
Discrete Applied Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristina Bazgan, Sonia Toubaline, Daniel Vanderpooten |
Efficient Algorithms for Finding the k Most Vital Edges for the Minimum Spanning Tree Problem. |
COCOA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristina Bazgan, Laurent Gourvès, Jérôme Monnot |
Approximation with a Fixed Number of Solutions of Some Biobjective Maximization Problems. |
WAOA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristina Bazgan, Laurent Gourvès, Jérôme Monnot, Fanny Pascual |
Single Approximation for Biobjective Max TSP. |
WAOA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristina Bazgan, Morgan Chopin, Michael R. Fellows |
Parameterized Complexity of the Firefighter Problem. |
ISAAC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten |
General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems. |
Discrete Optimization |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten |
Satisfactory graph partition, variants, and generalizations. |
European Journal of Operational Research |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristina Bazgan, Sonia Toubaline, Daniel Vanderpooten |
Complexity of Determining the Most Vital Elements for the 1-median and 1-center Location Problems. |
COCOA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristina Bazgan, Sonia Toubaline, Zsolt Tuza |
Complexity of Most Vital Nodes for Independent Set in Graphs Related to Tree Structures. |
IWOCA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristina Bazgan, Hadrien Hugot, Daniel Vanderpooten |
Implementing an efficient fptas for the 0-1 multi-objective knapsack problem. |
European Journal of Operational Research |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten |
Min-max and min-max regret versions of combinatorial optimization problems: A survey. |
European Journal of Operational Research |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristina Bazgan, Hadrien Hugot, Daniel Vanderpooten |
Solving efficiently the 0-1 multi-objective knapsack problem. |
Computers & OR |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristina Bazgan, Basile Couëtoux, Zsolt Tuza |
Covering a Graph with a Constrained Forest (Extended Abstract). |
ISAAC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten |
Complexity of the min-max (regret) versions of min cut problems. |
Discrete Optimization |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten |
Approximation of satisfactory bisection problems. |
J. Comput. Syst. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristina Bazgan, Zsolt Tuza |
Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3. |
J. Discrete Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten |
Efficient algorithms for decomposing graphs under degree constraints. |
Discrete Applied Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristina Bazgan, Hadrien Hugot, Daniel Vanderpooten |
A Practical Efficient Fptas for the 0-1 Multi-objective Knapsack Problem. |
ESA |
2007 |
DBLP DOI BibTeX RDF |
Multi-objective knapsack problem, dynamic programming, combinatorial optimization, approximation, dominance relations |
| 1 | Cristina Bazgan, Hadrien Hugot, Daniel Vanderpooten |
An Efficient Implementation for the 0-1 Multi-objective Knapsack Problem. |
WEA |
2007 |
DBLP DOI BibTeX RDF |
multi-objective knapsack problem, dynamic programming, combinatorial optimization, efficient solutions, dominance relations |
| 1 | Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten |
Degree-constrained decompositions of graphs: Bounded treewidth and planarity. |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten |
The satisfactory partition problem. |
Discrete Applied Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten |
Approximating Min-Max (Regret) Versions of Some Polynomial Problems. |
COCOON |
2006 |
DBLP DOI BibTeX RDF |
min-max regret, approximation, shortest path, minimum spanning tree, min-max, fptas |
| 1 | Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten |
Complexity of the min-max and min-max regret assignment problems. |
Oper. Res. Lett. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristina Bazgan, Bruno Escoffier, Vangelis Th. Paschos |
Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristina Bazgan, Jérôme Monnot, Vangelis Th. Paschos, Fabrice Serrière |
On the differential approximation of MIN SET COVER. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Giorgio Ausiello, Cristina Bazgan, Marc Demange, Vangelis Th. Paschos |
Completeness in differential approximation classes. |
Int. J. Found. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristina Bazgan, Refael Hassin, Jérôme Monnot |
Approximation algorithms for some vehicle routing problems. |
Discrete Applied Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten |
Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack. |
ESA |
2005 |
DBLP DOI BibTeX RDF |
min-max regret, mi-nimum spanning tree, approximation, shortest path, knapsack, min-max, fptas |
| 1 | Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten |
Complexity and Approximation of Satisfactory Partition Problems. |
COCOON |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristina Bazgan, Jérôme Monnot, Vangelis Th. Paschos, Fabrice Serrière |
Greedy Differential Approximations for Min Set Cover. |
SOFSEM |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristina Bazgan, Marek Karpinski |
On the Complexity of Global Constraint Satisfaction. |
ISAAC |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten |
Complexity of the Min-Max (Regret) Versions of Cut Problems. |
ISAAC |
2005 |
DBLP DOI BibTeX RDF |
min-max regret, s–t min cut, complexity, min cut, min-max |
| 1 | Cristina Bazgan |
A note on the approximability of the toughness of graphs. |
Discrete Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristina Bazgan, Bruno Escoffier, Vangelis Th. Paschos |
Poly-APX- and PTAS-Completeness in Standard and Differential Approximation. |
ISAAC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristina Bazgan, Vangelis Th. Paschos |
Differential approximation for optimal satisfiability and related problems. |
European Journal of Operational Research |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristina Bazgan, Wenceslas Fernandez de la Vega, Marek Karpinski |
Polynomial time approximation schemes for dense instances of minimum constraint satisfaction. |
Random Struct. Algorithms |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Giorgio Ausiello, Cristina Bazgan, Marc Demange, Vangelis Th. Paschos |
Completeness in Differential Approximation Classes. |
MFCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten |
On the Existence and Determination of Satisfactory Partitions in a Graph. |
ISAAC |
2003 |
DBLP DOI BibTeX RDF |
Satisfactory partition, degree constraints, complexity, graph, NP-complete, polynomial algorithm |
| 1 | Cristina Bazgan, Refael Hassin, Jérôme Monnot |
Differential Approximation for Some Routing Problems. |
CIAC |
2003 |
DBLP DOI BibTeX RDF |
differential ratio, approximation algorithm, TSP, VRP |
| 1 | Cristina Bazgan, Miklos Santha, Zsolt Tuza |
Efficient Approximation Algorithms for the SUBSET-SUMS EQUALITY Problem. |
J. Comput. Syst. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristina Bazgan, Wenceslas Fernandez de la Vega, Marek Karpinski |
Approximability of Dense Instances of NEAREST CODEWORD Problem. |
SWAT |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | 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) |
2001 |
DBLP BibTeX RDF |
|
| 1 | Cristina Bazgan, Amel Harkat-Benhamdine, Hao Li, Mariusz Wozniak |
Partitioning vertices of 1-tough graphs into paths. |
Theor. Comput. Sci. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristina Bazgan, Wenceslas Fernandez de la Vega, Marek Karpinski |
Approximability of Dense Instances of NEAREST CODEWORD Problem |
Electronic Colloquium on Computational Complexity (ECCC) |
2000 |
DBLP BibTeX RDF |
|
| 1 | Cristina Bazgan, Amel Harkat-Benhamdine, Hao Li, Mariusz Wozniak |
On the Vertex-Distinguishing Proper Edge-Colorings of Graphs. |
J. Comb. Theory, Ser. B |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristina Bazgan, Miklos Santha, Zsolt Tuza |
On the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs. |
J. Algorithms |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristina Bazgan, Wenceslas Fernandez de la Vega |
A Polynomial Time Approximation Scheme for Dense MIN 2SAT. |
FCT |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristina Bazgan, Miklos Santha, Zsolt Tuza |
Efficient Approximation Algorithms for the Subset-Sums Equality Problem. |
ICALP |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristina Bazgan, Miklos Santha, Zsolt Tuza |
On the Approximation of Finding A(nother) Hamilton Cycle in Cubic Hamilton Graphs (Extended Abstract). |
STACS |
1998 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #54 of 54 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")