Bernard Ries
Bernard Ries
Verifisert e-postadresse på unifr.ch - Startside
Tittel
Sitert av
Sitert av
År
Blockers and transversals
R Zenklusen, B Ries, C Picouleau, D De Werra, MC Costa, C Bentz
Discrete Mathematics 309 (13), 4306-4314, 2009
622009
Analyzing the performance of greedy maximal scheduling via local pooling and graph theory
B Birand, M Chudnovsky, B Ries, P Seymour, G Zussman, Y Zwols
IEEE/ACM Transactions on Networking 20 (1), 163-176, 2011
542011
On some applications of the selective graph coloring problem
M Demange, T Ekim, B Ries, C Tanasescu
European Journal of Operational Research 240 (2), 307-314, 2015
472015
Colouring vertices of triangle-free graphs without forests
KK Dabrowski, V Lozin, R Raman, B Ries
Discrete Mathematics 312 (7), 1372-1385, 2012
472012
Colouring vertices of triangle-free graphs without forests
KK Dabrowski, V Lozin, R Raman, B Ries
Discrete Mathematics 312 (7), 1372-1385, 2012
472012
Blockers and transversals in some subclasses of bipartite graphs: When caterpillars are dancing on a grid
B Ries, C Bentz, C Picouleau, D de Werra, MC Costa, R Zenklusen
Discrete Mathematics 310 (1), 132-146, 2010
372010
The firefighter problem with more than one firefighter on trees
C Bazgan, M Chopin, B Ries
Discrete Applied Mathematics 161 (7-8), 899-908, 2013
312013
Some properties of edge intersection graphs of single-bend paths on a grid
A Asinowski, B Ries
Discrete Mathematics 312 (2), 427-440, 2012
302012
Coloring some classes of mixed graphs
B Ries
Discrete Applied Mathematics 155 (1), 1-6, 2007
302007
On the complexity of the selective graph coloring problem in some special classes of graphs
M Demange, J Monnot, P Pop, B Ries
Theoretical Computer Science 540, 89-102, 2014
282014
On the complexity of the selective graph coloring problem in some special classes of graphs
M Demange, J Monnot, P Pop, B Ries
Theoretical Computer Science 540, 89-102, 2014
282014
Multiple Referenda and Multiwinner Elections Using Hamming Distances: Complexity and Manipulability.
G Amanatidis, N Barrot, J Lang, E Markakis, B Ries
AAMAS 15, 715-723, 2015
262015
On the maximum independent set problem in subclasses of subcubic graphs
V Lozin, J Monnot, B Ries
Journal of Discrete Algorithms 31, 104-112, 2015
252015
Characterizations of cographs as intersection graphs of paths on a grid
E Cohen, MC Golumbic, B Ries
Discrete Applied Mathematics 178, 46-57, 2014
252014
On two coloring problems in mixed graphs
B Ries, D de Werra
European Journal of Combinatorics 29 (3), 712-725, 2008
232008
On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid
L Alcón, F Bonomo, G Durán, M Gutierrez, MP Mazzoleni, B Ries, ...
Discrete Applied Mathematics 234, 12-21, 2018
172018
On the intersection graphs of orthogonal line segments in the plane: characterizations of some subclasses of chordal graphs
MC Golumbic, B Ries
Graphs and Combinatorics 29 (3), 499-517, 2013
152013
On a graph coloring problem arising from discrete tomography
C Bentz, MC Costa, D De Werra, C Picouleau, B Ries
Networks: An International Journal 51 (4), 256-267, 2008
152008
Semitotal Domination: New hardness results and a polynomial-time algorithm for graphs of bounded mim-width
E Galby, A Munaro, B Ries
Theoretical Computer Science 814, 28-48, 2020
142020
Dominating induced matchings in graphs containing no long claw
A Hertz, V Lozin, B Ries, V Zamaraev, D de Werra
Journal of Graph Theory 88 (1), 18-39, 2018
142018
Systemet kan ikke utføre handlingen. Prøv igjen senere.
Artikler 1–20