default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBruno Escoffier
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j49]Bruno Escoffier, Olivier Spanjaard, Magdaléna Tydrichová:
Recognizing single-peaked preferences on an arbitrary graph: Complexity and algorithms. Discret. Appl. Math. 348: 301-319 (2024)- [j48]Pascale Bendotti
, Luca Brunod-Indrigo, Philippe Chrétienne, Bruno Escoffier:
Anchored rescheduling problem with non-availability periods. Oper. Res. Lett. 57: 107201 (2024) - [j47]Pascale Bendotti, Luca Brunod-Indrigo, Philippe Chrétienne, Bruno Escoffier:
Resource leveling: complexity of a unit execution time two-processor scheduling variant and related problems. J. Sched. 27(6): 587-606 (2024) - [j46]Bruno Escoffier, Olivier Spanjaard, Magdaléna Tydrichová:
Euclidean preferences in the plane under $\varvec{\ell _1},$$\varvec{\ell _2}$ and $\varvec{\ell _\infty }$ norms. Soc. Choice Welf. 63(1): 125-169 (2024) - [c47]Evripidis Bampis, Bruno Escoffier, Michalis Xefteris:
Parsimonious Learning-Augmented Approximations for Dense Instances of NP-hard Problems. ICML 2024 - [i23]Evripidis Bampis, Bruno Escoffier, Michalis Xefteris:
Parsimonious Learning-Augmented Approximations for Dense Instances of NP-hard Problems. CoRR abs/2402.02062 (2024) - [i22]Pascale Bendotti, Luca Brunod-Indrigo, Philippe Chrétienne, Bruno Escoffier:
Resource Leveling: Complexity of a UET two-processor scheduling variant and related problems. CoRR abs/2406.08104 (2024) - [i21]Evripidis Bampis, Bruno Escoffier, Michalis Xefteris:
Improved FPT Approximation for Non-metric TSP. CoRR abs/2407.08392 (2024) - [i20]Thomas Bellitto, Johanne Cohen, Bruno Escoffier, Minh-Hang Nguyen, Mikaël Rabie:
Canadian Traveller Problems in Temporal Graphs. CoRR abs/2407.16491 (2024) - 2023
- [j45]Evripidis Bampis, Bruno Escoffier, Paul Youssef:
Online 2-stage stable matching. Discret. Appl. Math. 341: 394-405 (2023) - [j44]Evripidis Bampis, Carmine-Emanuele Cella, Bruno Escoffier, Mila Rocco, Alexandre Teiller:
Target-based computer-assisted orchestration: Complexity and approximation algorithms. Eur. J. Oper. Res. 304(3): 926-938 (2023) - [c46]Evripidis Bampis, Bruno Escoffier, Paul Youssef:
Online 2-stage Stable Matching. AAMAS 2023: 2475-2477 - [c45]Bruno Escoffier, Olivier Spanjaard, Magdaléna Tydrichová:
Algorithmic Recognition of 2-Euclidean Preferences. ECAI 2023: 637-644 - [c44]Evripidis Bampis, Bruno Escoffier, Themis Gouleakis, Niklas Hahn, Kostas Lakis, Golnoosh Shahkarami, Michalis Xefteris:
Learning-Augmented Online TSP on Rings, Trees, Flowers and (Almost) Everywhere Else. ESA 2023: 12:1-12:17 - [c43]Thomas Bellitto, Cyril Conchon-Kerjan, Bruno Escoffier:
Restless Exploration of Periodic Temporal Graphs. SAND 2023: 13:1-13:15 - [c42]Evripidis Bampis, Bruno Escoffier, Niklas Hahn, Michalis Xefteris:
Online TSP with Known Locations. WADS 2023: 65-78 - [i19]Evripidis Bampis, Bruno Escoffier, Themis Gouleakis, Niklas Hahn, Kostas Lakis, Golnoosh Shahkarami, Michalis Xefteris:
Learning-Augmented Online TSP on Rings, Trees, Flowers and (almost) Everywhere Else. CoRR abs/2305.02169 (2023) - 2022
- [j43]Bruno Escoffier, Olivier Spanjaard, Magdaléna Tydrichová:
Weighted majority tournaments and Kemeny ranking with 2-dimensional Euclidean preferences. Discret. Appl. Math. 318: 6-12 (2022) - [j42]Evripidis Bampis, Bruno Escoffier, Alexandre Teiller:
Multistage knapsack. J. Comput. Syst. Sci. 126: 106-118 (2022) - [j41]Evripidis Bampis, Dimitris Christou, Bruno Escoffier, Alexander V. Kononov, Kim Thang Nguyen:
A simple rounding scheme for multistage optimization. Theor. Comput. Sci. 907: 1-10 (2022) - [j40]Bruno Escoffier, Laurent Gourvès, Vangelis Th. Paschos:
In memory of Jérôme Monnot. Theor. Comput. Sci. 921: 1-3 (2022) - [j39]Evripidis Bampis, Dimitris Christou, Bruno Escoffier, Kim Thang Nguyen:
Online learning for min-max discrete problems. Theor. Comput. Sci. 930: 209-217 (2022) - [c41]Evripidis Bampis, Bruno Escoffier, Michalis Xefteris:
Canadian Traveller Problem with Predictions. WAOA 2022: 116-133 - [i18]Evripidis Bampis, Bruno Escoffier, Paul Youssef:
Online 2-stage Stable Matching. CoRR abs/2207.02057 (2022) - [i17]Evripidis Bampis, Bruno Escoffier, Michalis Xefteris:
Canadian Traveller Problem with Predictions. CoRR abs/2209.11100 (2022) - [i16]Evripidis Bampis, Bruno Escoffier, Niklas Hahn, Michalis Xefteris:
Online TSP with Known Locations. CoRR abs/2210.14722 (2022) - 2021
- [j38]Evripidis Bampis, Bruno Escoffier, Kevin Schewior, Alexandre Teiller:
Online Multistage Subset Maximization Problems. Algorithmica 83(8): 2374-2399 (2021) - [c40]Bruno Escoffier, Olivier Spanjaard, Magdaléna Tydrichová:
Measuring Nearly Single-Peakedness of an Electorate: Some New Insights. ADT 2021: 19-34 - [i15]Bruno Escoffier, Olivier Spanjaard, Magdaléna Tydrichová:
Kemeny ranking is NP-hard for 2-dimensional Euclidean preferences. CoRR abs/2106.13054 (2021) - 2020
- [c39]Bruno Escoffier, Hugo Gilbert, Adèle Pass-Lanneau:
Iterative Delegations in Liquid Democracy with Restricted Preferences. AAAI 2020: 1926-1933 - [c38]Tahar Allouche, Bruno Escoffier, Stefano Moretti, Meltem Öztürk:
Social Ranking Manipulability for the CP-Majority, Banzhaf and Lexicographic Excellence Solutions. IJCAI 2020: 17-23 - [c37]Bruno Escoffier, Olivier Spanjaard, Magdaléna Tydrichová:
Recognizing Single-Peaked Preferences on an Arbitrary Graph: Complexity and Algorithms. SAGT 2020: 291-306 - [c36]Evripidis Bampis, Bruno Escoffier, Alexander V. Kononov:
LP-Based Algorithms for Multistage Minimization Problems. WAOA 2020: 1-15 - [i14]Bruno Escoffier, Olivier Spanjaard, Magdaléna Tydrichová:
Recognizing Single-Peaked Preferences on an Arbitrary Graph: Complexity and Algorithms. CoRR abs/2004.13602 (2020)
2010 – 2019
- 2019
- [j37]Bruno Escoffier:
Saving colors and Max Coloring: Some fixed-parameter tractability results. Theor. Comput. Sci. 758: 30-41 (2019) - [c35]Evripidis Bampis, Bruno Escoffier, Kevin Schewior, Alexandre Teiller:
Online Multistage Subset Maximization Problems. ESA 2019: 11:1-11:14 - [c34]Evripidis Bampis, Bruno Escoffier, Alexandre Teiller:
Multistage Knapsack. MFCS 2019: 22:1-22:14 - [c33]Bruno Escoffier, Hugo Gilbert, Adèle Pass-Lanneau:
The Convergence of Iterative Delegations in Liquid Democracy in a Social Network. SAGT 2019: 284-297 - [i13]Evripidis Bampis, Bruno Escoffier, Alexandre Teiller:
Multistage Knapsack. CoRR abs/1901.11260 (2019) - [i12]Bruno Escoffier, Hugo Gilbert, Adèle Pass-Lanneau:
The Convergence of Iterative Delegations in Liquid Democracy in a Social Network. CoRR abs/1904.05775 (2019) - [i11]Evripidis Bampis, Bruno Escoffier, Kevin Schewior, Alexandre Teiller:
Online Multistage Subset Maximization Problems. CoRR abs/1905.04162 (2019) - [i10]Evripidis Bampis, Dimitris Christou, Bruno Escoffier, Kim Thang Nguyen:
Online-Learning for min-max discrete problems. CoRR abs/1907.05944 (2019) - [i9]Evripidis Bampis, Bruno Escoffier, Alexander V. Kononov:
LP-based algorithms for multistage minimization problems. CoRR abs/1909.10354 (2019) - 2018
- [j36]Édouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Georgios Stamoulis:
Purely combinatorial approximation algorithms for maximum k-vertex cover in bipartite graphs. Discret. Optim. 27: 26-56 (2018) - [j35]Eric Angel, Evripidis Bampis, Bruno Escoffier, Michael Lampis:
Parameterized Power Vertex Cover. Discret. Math. Theor. Comput. Sci. 20(2) (2018) - [c32]Evripidis Bampis, Bruno Escoffier, Sasa Mladenovic:
Fair Resource Allocation Over Time. AAMAS 2018: 766-773 - [c31]Evripidis Bampis, Bruno Escoffier, Michael Lampis, Vangelis Th. Paschos:
Multistage Matchings. SWAT 2018: 7:1-7:13 - [i8]Eric Angel, Evripidis Bampis, Bruno Escoffier, Michael Lampis:
Parameterized Power Vertex Cover. CoRR abs/1801.10476 (2018) - [i7]Bruno Escoffier, Hugo Gilbert, Adèle Pass-Lanneau:
The Convergence of Iterative Delegations in Liquid Democracy. CoRR abs/1809.04362 (2018) - 2017
- [j34]Bruno Escoffier, Laurent Gourvès, Jérôme Monnot:
The Price of Optimum: Complexity and Approximation for a Matching Game. Algorithmica 77(3): 836-866 (2017) - 2016
- [j33]Bruno Escoffier, Vangelis Th. Paschos, Emeric Tourniaire:
Super-polynomial approximation branching algorithms. RAIRO Oper. Res. 50(4-5): 979-994 (2016) - [c30]Édouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Georgios Stamoulis:
A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-vertex Cover in Bipartite Graphs. LATIN 2016: 235-248 - [c29]Bruno Escoffier:
Saving Colors and Max Coloring: Some Fixed-Parameter Tractability Results. WG 2016: 50-61 - [c28]Eric Angel, Evripidis Bampis, Bruno Escoffier, Michael Lampis:
Parameterized Power Vertex Cover. WG 2016: 97-108 - 2015
- [j32]Edouard Bonnet, Bruno Escoffier, Eun Jung Kim, Vangelis Th. Paschos:
On Subexponential and FPT-Time Inapproximability. Algorithmica 71(3): 541-565 (2015) - [j31]Edouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Emeric Tourniaire:
Multi-parameter Analysis for Local Graph Partitioning Problems: Using Greediness for Parameterization. Algorithmica 71(3): 566-580 (2015) - [j30]Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos, Mingyu Xiao:
New Results on Polynomial Inapproximabilityand Fixed Parameter Approximability of Edge Dominating Set. Theory Comput. Syst. 56(2): 330-346 (2015) - 2014
- [j29]Bruno Escoffier, Vangelis Th. Paschos, Emeric Tourniaire:
Approximating MAX SAT by moderately exponential and parameterized algorithms. Theor. Comput. Sci. 560: 147-157 (2014) - [i6]Edouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Georgios Stamoulis:
On the approximation of maximum $k$-vertex cover in bipartite graphs. CoRR abs/1409.6952 (2014) - 2013
- [j28]Bruno Escoffier, Laurent Gourvès, Jérôme Monnot:
Fair solutions for some multiagent optimization problems. Auton. Agents Multi Agent Syst. 26(2): 184-201 (2013) - [j27]Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos:
Fast algorithms for min independent dominating set. Discret. Appl. Math. 161(4-5): 558-572 (2013) - [j26]Nicolas Boria, Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos:
Exponential approximation schemata for some network design problems. J. Discrete Algorithms 22: 43-52 (2013) - [c27]Bruno Escoffier, Jérôme Monnot, Fanny Pascual, Olivier Spanjaard:
Truthful Many-to-Many Assignment with Private Weights. CIAC 2013: 209-220 - [c26]Edouard Bonnet, Bruno Escoffier, Eun Jung Kim, Vangelis Th. Paschos:
On Subexponential and FPT-Time Inapproximability. IPEC 2013: 54-65 - [c25]Edouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Emeric Tourniaire:
Multi-parameter Complexity Analysis for Constrained Size Graph Problems: Using Greediness for Parameterization. IPEC 2013: 66-77 - [c24]Bruno Escoffier, Diodato Ferraioli, Laurent Gourvès, Stefano Moretti:
Designing Budget-Balanced Best-Response Mechanisms for Network Coordination Games. SAGT 2013: 207-218 - [i5]Edouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Emeric Tourniaire:
Multi-parameter complexity analysis for constrained size graph problems: using greediness for parameterization. CoRR abs/1306.2217 (2013) - 2012
- [j25]Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij:
Fast Algorithms for max independent set. Algorithmica 62(1-2): 382-415 (2012) - [j24]Bruno Escoffier, Laurent Gourvès, Jérôme Monnot:
Strategic Coloring of a Graph. Internet Math. 8(4): 424-455 (2012) - [j23]Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos:
Algorithms for dominating clique problems. Theor. Comput. Sci. 459: 77-88 (2012) - [c23]Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos, Mingyu Xiao:
New Results on Polynomial Inapproximability and Fixed Parameter Approximability of edge dominating set. IPEC 2012: 25-36 - [c22]Bruno Escoffier, Vangelis Th. Paschos, Emeric Tourniaire:
Approximating MAX SAT by Moderately Exponential and Parameterized Algorithms. TAMC 2012: 202-213 - [c21]Bruno Escoffier, Laurent Gourvès, Jérôme Monnot, Stefano Moretti:
Cost allocation protocols for network formation on connection situations. VALUETOOLS 2012: 228-234 - [i4]Bruno Escoffier, Eun Jung Kim, Vangelis Th. Paschos:
Subexponential and FPT-time Inapproximability of Independent Set and Related Problems. CoRR abs/1211.6656 (2012) - 2011
- [j22]Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos:
Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms. Discret. Appl. Math. 159(17): 1954-1970 (2011) - [c20]Bruno Escoffier, Laurent Gourvès, Kim Thang Nguyen, Fanny Pascual, Olivier Spanjaard:
Strategy-Proof Mechanisms for Facility Location Games with Many Facilities. ADT 2011: 67-81 - [c19]Bruno Escoffier, Laurent Gourvès, Jérôme Monnot:
The Price of Optimum in a Matching Game. SAGT 2011: 81-92 - 2010
- [j21]Bruno Escoffier, Vangelis Th. Paschos:
A survey on the structure of approximation classes. Comput. Sci. Rev. 4(1): 19-40 (2010) - [j20]Bruno Escoffier, Laurent Gourvès, Jérôme Monnot, Olivier Spanjaard:
Two-stage stochastic matching and spanning tree problems: Polynomial instances and approximation. Eur. J. Oper. Res. 205(1): 19-30 (2010) - [j19]Bruno Escoffier, Laurent Gourvès, Jérôme Monnot:
Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs. J. Discrete Algorithms 8(1): 36-49 (2010) - [j18]Camil Demetrescu, Bruno Escoffier, Gabriel Moruz, Andrea Ribichini:
Adapting parallel algorithms to the W-Stream model, with applications to graph problems. Theor. Comput. Sci. 411(44-46): 3994-4004 (2010) - [c18]Bruno Escoffier, Laurent Gourvès, Jérôme Monnot:
Strategic Coloring of a Graph. CIAC 2010: 155-166 - [c17]Bruno Escoffier, Laurent Gourvès, Jérôme Monnot:
On the Impact of Local Taxes in a Set Cover Game. SIROCCO 2010: 2-13 - [c16]Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos:
Fast Algorithms for min independent dominating set. SIROCCO 2010: 247-261 - [c15]Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij:
A Bottom-Up Method and Fast Algorithms for max independent set. SWAT 2010: 62-73 - [c14]Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij:
Maximum Independent Set in Graphs of Average Degree at Most Three in O(1.08537n){\mathcal O}(1.08537^n). TAMC 2010: 373-384 - [i3]Bruno Escoffier, Laurent Gourvès, Jérôme Monnot:
Minimum regulation of uncoordinated matchings. CoRR abs/1012.3889 (2010)
2000 – 2009
- 2009
- [j17]Bruno Escoffier, Martin Milanic, Vangelis Th. Paschos:
Simple and Fast Reoptimizations for the Steiner Tree Problem. Algorithmic Oper. Res. 4(2): 86-94 (2009) - [j16]Dominique de Werra, Marc Demange, Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos:
Weighted coloring on planar, bipartite and split graphs: Complexity and approximation. Discret. Appl. Math. 157(4): 819-832 (2009) - [j15]Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos:
Approximation of min coloring by moderately exponential algorithms. Inf. Process. Lett. 109(16): 950-954 (2009) - [j14]Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Cécile Murat, Vangelis Th. Paschos:
Probabilistic graph-coloring in bipartite and split graphs. J. Comb. Optim. 17(3): 274-311 (2009) - [j13]Giorgio Ausiello, Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos:
Reoptimization of minimum and maximum traveling salesman's tours. J. Discrete Algorithms 7(4): 453-463 (2009) - [j12]Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos:
Efficient approximation of min set cover by moderately exponential algorithms. Theor. Comput. Sci. 410(21-23): 2184-2195 (2009) - [c13]Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos:
Exact Algorithms for Dominating Clique Problems. ISAAC 2009: 4-13 - [c12]Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos:
Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms. WADS 2009: 507-518 - [i2]Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij:
Fast Algorithms for Max Independent Set in Graphs of Small Average Degree. CoRR abs/0901.1563 (2009) - [i1]Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos:
Fast algorithms for min independent dominating set. CoRR abs/0905.1993 (2009) - 2008
- [j11]Bruno Escoffier, Jérôme Monnot, Olivier Spanjaard:
Some tractable instances of interval data minmax regret problems. Oper. Res. Lett. 36(4): 424-429 (2008) - [j10]Bruno Escoffier, Jérôme Monnot:
A better differential approximation ratio for symmetric TSP. Theor. Comput. Sci. 396(1-3): 63-70 (2008) - [c11]Bruno Escoffier, Jérôme Lang, Meltem Öztürk:
Single-peaked consistency and its complexity. ECAI 2008: 366-370 - [c10]Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos:
An O*(1.0977n) Exact Algorithm for max independent set in Sparse Graphs. IWPEC 2008: 55-65 - [c9]Bruno Escoffier, Jérôme Monnot, Olivier Spanjaard:
Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality. SOFSEM 2008: 280-291 - 2007
- [j9]Bruno Escoffier:
Polynomial approximation: a structural and operational study. 4OR 5(2): 161-164 (2007) - [j8]Bruno Escoffier, Peter L. Hammer:
Approximation of the Quadratic Set Covering problem. Discret. Optim. 4(3-4): 378-386 (2007) - [j7]Bruno Escoffier, Vangelis Th. Paschos:
Differential approximation of min sat. Eur. J. Oper. Res. 181(2): 620-633 (2007) - [j6]Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos:
Improved worst-case complexity for the MIN 3-SET COVERING problem. Oper. Res. Lett. 35(2): 205-210 (2007) - [c8]Camil Demetrescu, Bruno Escoffier, Gabriel Moruz, Andrea Ribichini:
Adapting Parallel Algorithms to the W-Stream Model, with Applications to Graph Problems. MFCS 2007: 194-205 - [c7]Bruno Escoffier, Laurent Gourvès, Jérôme Monnot:
Complexity and Approximation Results for the Connected Vertex Cover Problem. WG 2007: 202-213 - 2006
- [j5]Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos:
Weighted Coloring: further complexity and approximability results. Inf. Process. Lett. 97(3): 98-103 (2006) - [j4]Bruno Escoffier, Vangelis Th. Paschos:
On-line models and algorithms for max independent set. RAIRO Oper. Res. 40(2): 129-142 (2006) - [j3]Bruno Escoffier, Vangelis Th. Paschos:
Completeness in approximation classes beyond APX. Theor. Comput. Sci. 359(1-3): 369-377 (2006) - [c6]Giorgio Ausiello, Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos:
Reoptimization of Minimum and Maximum Traveling Salesman's Tours. SWAT 2006: 196-207 - 2005
- [j2]Bruno Escoffier, Vangelis Th. Paschos:
Proving completeness by logic. Int. J. Comput. Math. 82(2): 151-161 (2005) - [j1]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) - [c5]Bruno Escoffier, Vangelis Th. Paschos:
Differential Approximation of min sat, max sat and Related Problems. ICCSA (4) 2005: 192-201 - [c4]Federico Della Croce, Bruno Escoffier, Cécile Murat, Vangelis Th. Paschos:
Probabilistic Coloring of Bipartite and Split Graphs. ICCSA (4) 2005: 202-211 - [c3]Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos:
Weighted Coloring: Further Complexity and Approximability Results. ICTCS 2005: 205-214 - 2004
- [c2]Cristina Bazgan, Bruno Escoffier, Vangelis Th. Paschos:
Poly-APX- and PTAS-Completeness in Standard and Differential Approximation. ISAAC 2004: 124-136 - [c1]Jérôme Monnot, Vangelis Th. Paschos, Dominique de Werra, Marc Demange, Bruno Escoffier:
Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation. ISAAC 2004: 896-907
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-05 20:45 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
