default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBernard Ries
Person information
- affiliation: Paris Dauphine University, Paris, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j70]Felicia Lucke
, Bernard Ries:
On blockers and transversals of maximum independent sets in co-comparability graphs. Discret. Appl. Math. 356: 307-321 (2024)- [j69]Narmina Baghirova, Clément Dallard, Bernard Ries, David Schindl:
Finding k-community structures in special graph classes. Discret. Appl. Math. 359: 159-175 (2024) - [j68]Felicia Lucke, Daniël Paulusma, Bernard Ries:
Dichotomies for Maximum Matching Cut: H-freeness, bounded diameter, bounded radius. Theor. Comput. Sci. 1017: 114795 (2024) - 2023
- [j67]Felicia Lucke, Daniël Paulusma, Bernard Ries:
Finding Matching Cuts in H-Free Graphs. Algorithmica 85(10): 3290-3322 (2023) - [j66]Esther Galby, Paloma T. Lima, Felix Mann, Bernard Ries:
Using edge contractions to reduce the semitotal domination number. Theor. Comput. Sci. 939: 140-160 (2023) - [c25]Carl Feghali, Felicia Lucke, Daniël Paulusma, Bernard Ries:
Matching Cuts in Graphs of High Girth and H-Free Graphs. ISAAC 2023: 31:1-31:16 - [c24]Felicia Lucke, Daniël Paulusma, Bernard Ries:
Dichotomies for Maximum Matching Cut: H-Freeness, Bounded Diameter, Bounded Radius. MFCS 2023: 64:1-64:15 - [e1]Daniël Paulusma, Bernard Ries:
Graph-Theoretic Concepts in Computer Science - 49th International Workshop, WG 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers. Lecture Notes in Computer Science 14093, Springer 2023, ISBN 978-3-031-43379-5 [contents] - [i30]Felicia Lucke, Daniël Paulusma, Bernard Ries:
Dichotomies for Maximum Matching Cut: H-Freeness, Bounded Diameter, Bounded Radius. CoRR abs/2304.01099 (2023) - [i29]Felicia Lucke, Bernard Ries:
On Blockers and Transversals of Maximum Independent Sets in Co-Comparability Graphs. CoRR abs/2311.07219 (2023) - [i28]Van Bang Le, Felicia Lucke, Daniël Paulusma, Bernard Ries:
Maximizing Matching Cuts. CoRR abs/2312.12960 (2023) - 2022
- [j65]Flavia Bonomo-Braberman, María Pía Mazzoleni, Mariano Leonardo Rean, Bernard Ries:
On some special classes of contact B0-VPG graphs. Discret. Appl. Math. 308: 111-129 (2022) - [j64]Felicia Lucke, Daniël Paulusma, Bernard Ries:
On the complexity of matching cut for graphs of bounded radius and H-free graphs. Theor. Comput. Sci. 936: 33-42 (2022) - [c23]Felicia Lucke, Daniël Paulusma, Bernard Ries:
Finding Matching Cuts in H-Free Graphs. ISAAC 2022: 22:1-22:16 - [c22]Narmina Baghirova, Carolina Lucía Gonzalez, Bernard Ries, David Schindl:
Locally Checkable Problems Parameterized by Clique-Width. ISAAC 2022: 31:1-31:20 - [i27]Felicia Lucke, Daniël Paulusma, Bernard Ries:
On The Complexity of Matching Cut for Graphs of Bounded Radius and H-Free Graphs. CoRR abs/2204.07129 (2022) - [i26]Narmina Baghirova, Clément Dallard, Bernard Ries, David Schindl:
Finding k-community structures in special graph classes. CoRR abs/2206.14738 (2022) - [i25]Felicia Lucke, Daniël Paulusma, Bernard Ries:
Finding Matching Cuts in H-Free Graphs. CoRR abs/2207.07095 (2022) - [i24]Carl Feghali, Felicia Lucke, Daniël Paulusma, Bernard Ries:
New Hardness Results for (Perfect) Matching Cut and Disconnected Perfect Matching. CoRR abs/2212.12317 (2022) - 2021
- [j63]Nicolas Champseix, Esther Galby, Andrea Munaro, Bernard Ries:
CPG graphs: Some structural and hardness results. Discret. Appl. Math. 290: 17-35 (2021) - [j62]Bo Chen, Silvano Martello, Bernard Ries:
New progress in combinatorial optimization. Discret. Appl. Math. 290: 68-70 (2021) - [j61]Esther Galby, Felix Mann, Bernard Ries:
Reducing the domination number of (P3+kP2)-free graphs via one edge contraction. Discret. Appl. Math. 305: 205-210 (2021) - [j60]Esther Galby, Paloma T. Lima, Bernard Ries:
Reducing the domination number of graphs via edge contractions and vertex deletions. Discret. Math. 344(1): 112169 (2021) - [j59]Esther Galby, Felix Mann, Bernard Ries:
Blocking total dominating sets via edge contractions. Theor. Comput. Sci. 877: 18-35 (2021) - [i23]Esther Galby, Paloma T. Lima, Felix Mann, Bernard Ries:
Using edge contractions to reduce the semitotal domination number. CoRR abs/2107.03755 (2021) - 2020
- [j58]Esther Galby, Andrea Munaro, Bernard Ries:
Semitotal Domination: New hardness results and a polynomial-time algorithm for graphs of bounded mim-width. Theor. Comput. Sci. 814: 28-48 (2020) - [c21]Zakir Deniz, Simon Nivelle, Bernard Ries, David Schindl:
On Some Subclasses of Split B1-EPG Graphs. LATIN 2020: 625-636 - [i22]Esther Galby, Felix Mann, Bernard Ries:
Blocking total dominating sets via edge contractions. CoRR abs/2009.08806 (2020) - [i21]Esther Galby, Felix Mann, Bernard Ries:
Reducing the domination number of P3+kP2-free graphs via one edge contraction. CoRR abs/2010.14155 (2020)
2010 – 2019
- 2019
- [j57]Daniël Paulusma, Christophe Picouleau, Bernard Ries:
Critical vertices and edges in H-free graphs. Discret. Appl. Math. 257: 361-367 (2019) - [j56]Yves Crama, Bernard Gendron, Bernard Ries:
Preface: Tenth International Colloquium on Graphs and Optimization (GO X), 2016. Discret. Appl. Math. 261: 1 (2019) - [j55]Esther Galby, María Pía Mazzoleni, Bernard Ries:
Proper circular arc graphs as intersection graphs of pathson a grid. Discret. Appl. Math. 262: 195-202 (2019) - [j54]Pierre Hauweele, Alain Hertz, Hadrien Mélot, Bernard Ries, Gauvain Devillez:
Maximum eccentric connectivity index for graphs with given diameter. Discret. Appl. Math. 268: 102-111 (2019) - [j53]Ademir Hujdurovic, Martin Milanic, Bernard Ries:
Detecting strong cliques. Discret. Math. 342(9): 2738-2750 (2019) - [j52]Esther Galby, Paloma T. Lima, Daniël Paulusma, Bernard Ries:
Classifying k-edge colouring for H-free graphs. Inf. Process. Lett. 146: 39-43 (2019) - [c20]Esther Galby, Paloma T. Lima, Bernard Ries:
Blocking Dominating Sets for H-Free Graphs via Edge Contractions. ISAAC 2019: 21:1-21:14 - [c19]Esther Galby, Paloma T. Lima, Bernard Ries:
Reducing the Domination Number of Graphs via Edge Contractions. MFCS 2019: 41:1-41:13 - [i20]Esther Galby, Paloma T. Lima, Daniël Paulusma, Bernard Ries:
On the Parameterized Complexity of k-Edge Colouring. CoRR abs/1901.01861 (2019) - [i19]Esther Galby, Paloma T. Lima, Bernard Ries:
Reducing the domination number of graphs via edge contractions. CoRR abs/1903.01800 (2019) - [i18]Esther Galby, Andrea Munaro, Bernard Ries:
CPG graphs: Some structural and hardness results. CoRR abs/1903.01805 (2019) - [i17]Esther Galby, Paloma T. Lima, Bernard Ries:
Blocking dominating sets for $H$-free graphs via edge contractions. CoRR abs/1906.12297 (2019) - 2018
- [j51]Hassan AbouEisha, Shahid Hussain, Vadim V. Lozin, Jérôme Monnot, Bernard Ries, Viktor Zamaraev:
Upper Domination: Towards a Dichotomy Through Boundary Properties. Algorithmica 80(10): 2799-2817 (2018) - [j50]Liliana Alcón, Flavia Bonomo, Guillermo Durán, Marisa Gutierrez, María Pía Mazzoleni, Bernard Ries, Mario Valencia-Pabon:
On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid. Discret. Appl. Math. 234: 12-21 (2018) - [j49]Ademir Hujdurovic, Martin Milanic, Bernard Ries:
Graphs vertex-partitionable into strong cliques. Discret. Math. 341(5): 1392-1405 (2018) - [j48]Alain Hertz, Vadim V. Lozin, Bernard Ries, Viktor Zamaraev, Dominique de Werra:
Dominating induced matchings in graphs containing no long claw. J. Graph Theory 88(1): 18-39 (2018) - [j47]Ademir Hujdurovic, Ursa Kacar, Martin Milanic, Bernard Ries, Alexandru I. Tomescu:
Complexity and Algorithms for Finding a Perfect Phylogeny from Mixed Tumor Samples. IEEE ACM Trans. Comput. Biol. Bioinform. 15(1): 96-108 (2018) - [j46]Öznur Yasar Diner, Daniël Paulusma, Christophe Picouleau, Bernard Ries:
Contraction and deletion blockers for perfect graphs and H-free graphs. Theor. Comput. Sci. 746: 49-72 (2018) - [c18]Zakir Deniz, Esther Galby, Andrea Munaro, Bernard Ries:
On Contact Graphs of Paths on a Grid. GD 2018: 317-330 - [c17]Flavia Bonomo, María Pía Mazzoleni, Mariano Leonardo Rean, Bernard Ries:
Characterising Chordal Contact B_0 -VPG Graphs. ISCO 2018: 89-100 - [c16]Zakir Deniz, Simon Nivelle, Bernard Ries, David Schindl:
On Split B_1 B 1 -EPG Graphs. LATIN 2018: 361-375 - [i16]Zakir Deniz, Esther Galby, Bernard Ries:
On contact graphs of paths on a grid. CoRR abs/1803.03468 (2018) - [i15]Flavia Bonomo, María Pía Mazzoleni, Mariano Leonardo Rean, Bernard Ries:
On some special classes of contact B0-VPG graphs. CoRR abs/1807.07372 (2018) - [i14]Ademir Hujdurovic, Martin Milanic, Bernard Ries:
Detecting strong cliques. CoRR abs/1808.08817 (2018) - [i13]Esther Galby, María Pía Mazzoleni, Bernard Ries:
Proper circular arc graphs as intersection graphs of paths on a grid. CoRR abs/1808.09344 (2018) - [i12]Pierre Hauweele, Alain Hertz, Hadrien Mélot, Bernard Ries, Gauvain Devillez:
Maximum Eccentric Connectivity Index for Graphs with Given Diameter. CoRR abs/1808.10203 (2018) - [i11]Esther Galby, Paloma T. Lima, Daniël Paulusma, Bernard Ries:
Classifying k-Edge Colouring for H-free Graphs. CoRR abs/1810.04379 (2018) - [i10]Esther Galby, Andrea Munaro, Bernard Ries:
Semitotal Domination: New hardness results and a polynomial-time algorithm for graphs of bounded mim-width. CoRR abs/1810.06872 (2018) - [i9]Nicolas Champseix, Esther Galby, Bernard Ries:
Planar CPG graphs. CoRR abs/1810.08008 (2018) - 2017
- [j45]Christophe Picouleau, Daniël Paulusma, Bernard Ries:
Reducing the Chromatic Number by Vertex or Edge Deletions. Electron. Notes Discret. Math. 62: 243-248 (2017) - [j44]Simone Dantas, Marina Groshaus, André Luiz Pires Guedes, Raphael C. S. Machado, Bernard Ries, Diana Sasaki:
On star and biclique edge-colorings. Int. Trans. Oper. Res. 24(1-2): 339-346 (2017) - [c15]Daniël Paulusma, Christophe Picouleau, Bernard Ries:
Blocking Independent Sets for H-Free Graphs via Edge Contractions and Vertex Deletions. TAMC 2017: 470-483 - [i8]Daniël Paulusma, Christophe Picouleau, Bernard Ries:
Critical Vertices and Edges in $H$-free Graphs. CoRR abs/1706.09043 (2017) - [i7]Öznur Yasar Diner, Daniël Paulusma, Christophe Picouleau, Bernard Ries:
Contraction and Deletion Blockers for Perfect Graphs and $H$-free Graphs. CoRR abs/1706.09052 (2017) - 2016
- [j43]Marc Demange, Tínaz Ekim, Bernard Ries:
On the minimum and maximum selective graph coloring problems in some graph classes. Discret. Appl. Math. 204: 77-89 (2016) - [j42]Guilherme Dias da Fonseca, Bernard Ries, Diana Sasaki:
On the ratio between maximum weight perfect matchings and maximum weight matchings in grids. Discret. Appl. Math. 207: 45-55 (2016) - [c14]Daniël Paulusma, Christophe Picouleau, Bernard Ries:
Reducing the Clique and Chromatic Number via Edge Contractions and Vertex Deletions. ISCO 2016: 38-49 - [c13]Hassan AbouEisha, Shahid Hussain, Vadim V. Lozin, Jérôme Monnot, Bernard Ries, Victor Zamaraev:
A Boundary Property for Upper Domination. IWOCA 2016: 229-240 - [i6]Hassan AbouEisha, Shahid Hussain, Vadim V. Lozin, Jérôme Monnot, Bernard Ries, Victor Zamaraev:
Upper Domination: towards a dichotomy through boundary properties. CoRR abs/1609.01510 (2016) - [i5]Ademir Hujdurovic, Martin Milanic, Bernard Ries:
On graphs vertex-partitionable into strong cliques. CoRR abs/1609.06961 (2016) - 2015
- [j41]Petr A. Golovach, Daniël Paulusma, Bernard Ries:
Coloring graphs characterized by a forbidden subgraph. Discret. Appl. Math. 180: 101-110 (2015) - [j40]Silvano Martello, Bernard Ries:
Advances in Combinatorial Optimization. Discret. Appl. Math. 196: 1-3 (2015) - [j39]Liliana Alcón, Flavia Bonomo, Guillermo Durán, Marisa Gutierrez, María Pía Mazzoleni, Bernard Ries, Mario Valencia-Pabon:
On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid. Electron. Notes Discret. Math. 50: 249-254 (2015) - [j38]Marc Demange, Tínaz Ekim, Bernard Ries, Cerasela Tanasescu:
On some applications of the selective graph coloring problem. Eur. J. Oper. Res. 240(2): 307-314 (2015) - [j37]Cristina Bazgan, Cédric Bentz, Christophe Picouleau, Bernard Ries:
Blockers for the Stability Number and the Chromatic Number. Graphs Comb. 31(1): 73-90 (2015) - [j36]Vadim V. Lozin, Jérôme Monnot, Bernard Ries:
On the maximum independent set problem in subclasses of subcubic graphs. J. Discrete Algorithms 31: 104-112 (2015) - [j35]Nathanaël Barrot, Jérôme Lang, Bernard Ries:
Vote par approbation pour les élections à vainqueurs multiples. Une famille générale de règles, leur complexité algorithmique et leur manipulabilité. Rev. d'Intelligence Artif. 29(3-4): 265-291 (2015) - [c12]Georgios Amanatidis, Nathanaël Barrot, Jérôme Lang, Evangelos Markakis, Bernard Ries:
Multiple Referenda and Multiwinner Elections Using Hamming Distances: Complexity and Manipulability. AAMAS 2015: 715-723 - [c11]Öznur Yasar Diner, Daniël Paulusma, Christophe Picouleau, Bernard Ries:
Contraction Blockers for Graphs with Forbidden Induced Paths. CIAC 2015: 194-207 - [c10]Bernard Ries:
Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory. ICORES 2015: IS-11 - [c9]Ademir Hujdurovic, Ursa Kacar, Martin Milanic, Bernard Ries, Alexandru I. Tomescu:
Finding a Perfect Phylogeny from Mixed Tumor Samples. WABI 2015: 80-92 - [i4]Marc Demange, Tínaz Ekim, Bernard Ries:
On the Minimum and Maximum Selective Graph Coloring Problems. CTW 2015: 189-192 - [i3]Alain Hertz, Vadim V. Lozin, Bernard Ries, Victor Zamaraev, Dominique de Werra:
Dominating induced matchings in graphs containing no long claw. CoRR abs/1505.02558 (2015) - [i2]Ademir Hujdurovic, Ursa Kacar, Martin Milanic, Bernard Ries, Alexandru I. Tomescu:
Finding a perfect phylogeny from mixed tumor samples. CoRR abs/1506.07675 (2015) - 2014
- [j34]Elad Cohen, Martin Charles Golumbic, Bernard Ries:
Characterizations of cographs as intersection graphs of paths on a grid. Discret. Appl. Math. 178: 46-57 (2014) - [j33]Marc Demange, Jérôme Monnot, Petrica C. Pop, Bernard Ries:
On the complexity of the selective graph coloring problem in some special classes of graphs. Theor. Comput. Sci. 540: 89-102 (2014) - [c8]Hassan AbouEisha, Shahid Hussain, Vadim V. Lozin, Jérôme Monnot, Bernard Ries:
A Dichotomy for Upper Domination in Monogenic Classes. COCOA 2014: 258-267 - 2013
- [j32]Marc Demange, Vadim V. Lozin, Christophe Picouleau, Bernard Ries:
GO VII Meeting, Ovronnaz (CH), June 13-17, 2010. Discret. Appl. Math. 161(4-5): 453 (2013) - [j31]Cristina Bazgan, Morgan Chopin, Bernard Ries:
The firefighter problem with more than one firefighter on trees. Discret. Appl. Math. 161(7-8): 899-908 (2013) - [j30]Flavia Bonomo, Denis Cornaz, Tínaz Ekim, Bernard Ries:
Perfectness of clustered graphs. Discret. Optim. 10(4): 296-303 (2013) - [j29]Cédric Bentz, Denis Cornaz, Bernard Ries:
Packing and covering with linear programming: A survey. Eur. J. Oper. Res. 227(3): 409-422 (2013) - [j28]Martin Charles Golumbic, Bernard Ries:
On the Intersection Graphs of Orthogonal Line Segments in the Plane: Characterizations of Some Subclasses of Chordal Graphs. Graphs Comb. 29(3): 499-517 (2013) - [j27]Dariusz Dereniowski, Wieslaw Kubiak, Bernard Ries, Yori Zwols:
Optimal edge-coloring with edge rate constraints. Networks 62(3): 165-182 (2013) - [c7]Nathanaël Barrot, Laurent Gourvès, Jérôme Lang, Jérôme Monnot, Bernard Ries:
Possible Winners in Approval Voting. ADT 2013: 57-70 - [c6]Vadim V. Lozin, Jérôme Monnot, Bernard Ries:
On the Maximum Independent Set Problem in Subclasses of Subcubic Graphs. IWOCA 2013: 314-326 - 2012
- [j26]Andrei Asinowski, Bernard Ries:
Some properties of edge intersection graphs of single-bend paths on a grid. Discret. Math. 312(2): 427-440 (2012) - [j25]Konrad K. Dabrowski, Vadim V. Lozin, Rajiv Raman, Bernard Ries:
Colouring vertices of triangle-free graphs without forests. Discret. Math. 312(7): 1372-1385 (2012) - [j24]Bernard Ries, Dominique de Werra, Rico Zenklusen:
A note on chromatic properties of threshold graphs. Discret. Math. 312(10): 1838-1843 (2012) - [j23]Cédric Bentz, Marie-Christine Costa, Christophe Picouleau, Bernard Ries, Dominique de Werra:
d-Transversals of stable sets and vertex covers in weighted bipartite graphs. J. Discrete Algorithms 17: 95-102 (2012) - [j22]Berk Birand, Maria Chudnovsky, Bernard Ries, Paul D. Seymour, Gil Zussman, Yori Zwols:
Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory. IEEE/ACM Trans. Netw. 20(1): 163-176 (2012) - [c5]Marc Demange, Jérôme Monnot, Petrica C. Pop, Bernard Ries:
Selective Graph Coloring in Some Special Classes of Graphs. ISCO 2012: 320-331 - [c4]Petr A. Golovach, Daniël Paulusma, Bernard Ries:
Coloring Graphs Characterized by a Forbidden Subgraph. MFCS 2012: 443-454 - 2011
- [j21]Maria Chudnovsky, Bernard Ries, Yori Zwols:
Claw-free graphs with strongly perfect complements. Fractional and integral version. Part I. Basic graphs. Discret. Appl. Math. 159(17): 1971-1995 (2011) - [j20]Maria Chudnovsky, Bernard Ries, Yori Zwols:
Claw-free graphs with strongly perfect complements. Fractional and integral version, Part II: Nontrivial strip-structures. Discret. Appl. Math. 159(17): 1996-2029 (2011) - [j19]Cédric Bentz, Marie-Christine Costa, Dominique de Werra, Christophe Picouleau, Bernard Ries:
Minimum d-Transversals of Maximum-Weight Stable Sets in Trees. Electron. Notes Discret. Math. 38: 129-134 (2011) - [j18]Bernard Ries, Rico Zenklusen:
A 2-approximation for the maximum satisfying bisection problem. Eur. J. Oper. Res. 210(2): 169-175 (2011) - [i1]Cristina Bazgan, Morgan Chopin, Bernard Ries:
The firefighter problem with more than one firefighter on trees. CoRR abs/1110.0341 (2011) - 2010
- [j17]Dominique de Werra, Marie-Christine Costa, Christophe Picouleau, Bernard Ries:
On the use of graphs in discrete tomography. Ann. Oper. Res. 175(1): 287-307 (2010) - [j16]François-Xavier Meuwly, Bernard Ries, Nicolas Zufferey:
Solution Methods for a Scheduling Problem with Incompatibility and Precedence Constraints. Algorithmic Oper. Res. 5(2): 75-85 (2010) - [j15]Bernard Ries:
Complexity of two coloring problems in cubic planar bipartite mixed graphs. Discret. Appl. Math. 158(5): 592-596 (2010) - [j14]Bernard Ries, Cédric Bentz, Christophe Picouleau, Dominique de Werra, Marie-Christine Costa, Rico Zenklusen:
Blockers and transversals in some subclasses of bipartite graphs: When caterpillars are dancing on a grid. Discret. Math. 310(1): 132-146 (2010) - [j13]Tínaz Ekim, Bernard Ries, Dominique de Werra:
Split-critical and uniquely split-colorable graphs. Discret. Math. Theor. Comput. Sci. 12(5): 1-24 (2010) - [c3]Berk Birand, Maria Chudnovsky, Bernard Ries, Paul D. Seymour, Gil Zussman, Yori Zwols:
Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory. INFOCOM 2010: 2213-2221 - [c2]Berk Birand, Maria Chudnovsky, Bernard Ries, Paul D. Seymour, Gil Zussman, Yori Zwols:
Analyzing the performance of greedy maximal scheduling via local pooling and graph theory. S3@MobiCom 2010: 17-20 - [c1]Konrad K. Dabrowski, Vadim V. Lozin, Rajiv Raman, Bernard Ries:
Colouring Vertices of Triangle-Free Graphs. WG 2010: 184-195
2000 – 2009
- 2009
- [j12]Marie-Christine Costa, Dominique de Werra, Christophe Picouleau, Bernard Ries:
Graph coloring with cardinality constraints on the neighborhoods. Discret. Optim. 6(4): 362-369 (2009) - [j11]Hanna Furmanczyk, Adrian Kosowski, Bernard Ries, Pawel Zylinski:
Mixed graph edge coloring. Discret. Math. 309(12): 4027-4036 (2009) - [j10]Rico Zenklusen, Bernard Ries, Christophe Picouleau, Dominique de Werra, Marie-Christine Costa, Cédric Bentz:
Blockers and transversals. Discret. Math. 309(13): 4306-4314 (2009) - [j9]Bernard Ries:
Some properties of edge intersection graphs of single bend paths on a grid. Electron. Notes Discret. Math. 34: 29-33 (2009) - [j8]Cédric Bentz, Marie-Christine Costa, Christophe Picouleau, Bernard Ries, Dominique de Werra:
Degree-constrained edge partitioning in graphs arising from discrete tomography. J. Graph Algorithms Appl. 13(2): 99-118 (2009) - 2008
- [j7]Dominique de Werra, Marie-Christine Costa, Christophe Picouleau, Bernard Ries:
On the use of graphs in discrete tomography. 4OR 6(2): 101-123 (2008) - [j6]Bernard Ries, Dominique de Werra:
On two coloring problems in mixed graphs. Eur. J. Comb. 29(3): 712-725 (2008) - [j5]Marie-Christine Costa, Dominique de Werra, Christophe Picouleau, Bernard Ries:
Addendum to "Bicolored Matchings in Some Classes of Graphs". Graphs Comb. 24(2): 127-128 (2008) - [j4]Cédric Bentz, Marie-Christine Costa, Dominique de Werra, Christophe Picouleau, Bernard Ries:
On a graph coloring problem arising from discrete tomography. Networks 51(4): 256-267 (2008) - 2007
- [j3]Bernard Ries:
Coloring some classes of mixed graphs. Discret. Appl. Math. 155(1): 1-6 (2007) - [j2]Marie-Christine Costa, Dominique de Werra, Christophe Picouleau, Bernard Ries:
Bicolored Matchings in Some Classes of Graphs. Graphs Comb. 23(1): 47-60 (2007) - 2005
- [j1]Marie-Christine Costa, Dominique de Werra, Christophe Picouleau, Bernard Ries:
Bicolored matchings in some classes of graphs. Electron. Notes Discret. Math. 22: 207-211 (2005)
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-10-07 21:14 CEST 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:
