Bernard Ries

Citat de

	Toate	Din 2018
Referințe bibliografice	1153	711
h-index	18	15
i10-index	42	31

160

120

200720082009201020112012201320142015201620172018201920202021202220238 13 13 27 34 33 44 37 61 78 80 109 102 136 106 111 147

Acces public

Afișați-le pe toate

21 de articole

0 articole

disponibile

indisponibile

Pe baza cerințelor privind finanțarea

Coautori

Vadim LozinUniversity of WarwickAdresă de e-mail confirmată pe warwick.ac.uk
jerome monnotdirecteur de recherche, Lamsade, université Paris-DauphineAdresă de e-mail confirmată pe lamsade.dauphine.fr
Rico ZenklusenETH ZurichAdresă de e-mail confirmată pe math.ethz.ch
Tınaz EkimEndüstri Mühendisliği, Boğaziçi ÜniversitesiAdresă de e-mail confirmată pe boun.edu.tr
Alain Hertzprofesseur, Polytechnique MontréalAdresă de e-mail confirmată pe gerad.ca
Jerome Langsenior researcher at CNRSAdresă de e-mail confirmată pe lamsade.dauphine.fr
Flavia Bonomo-BrabermanAssociate Professor of Computer Science Department, School of Sciences, University of Buenos AiresAdresă de e-mail confirmată pe dc.uba.ar
Berk BirandPh.D. Candidate, Columbia UniversityAdresă de e-mail confirmată pe ee.columbia.edu
Gil ZussmanColumbia UniversityAdresă de e-mail confirmată pe ee.columbia.edu
Martin GolumbicProfessor of Computer Science, University of HaifaAdresă de e-mail confirmată pe cs.haifa.ac.il
Petrica PopTechnical University Cluj Napoca, CUNBMAdresă de e-mail confirmată pe ubm.ro
Morgan ChopinResearcher, OrangeAdresă de e-mail confirmată pe orange.com
Nicolas ZuffereyProfessor in Operations Management, University of GenevaAdresă de e-mail confirmată pe unige.ch
Adrian KosowskiHead of Product at PathwayAdresă de e-mail confirmată pe pathway.com
Dariusz DereniowskiGdańsk University of TechnologyAdresă de e-mail confirmată pe eti.pg.edu.pl

Urmăriți

Bernard Ries

Professor, University of Fribourg

Adresă de e-mail confirmată pe unifr.ch - Pagina de pornire

Discrete Mathematics Theoretical Computer Science Graph Theory


Titlu Sortați după descrierea bibliografică Sortați după an Sortați după titlu	Citat de Citat de	Anul
Blockers and transversals R Zenklusen, B Ries, C Picouleau, D De Werra, MC Costa, C Bentz Discrete Mathematics 309 (13), 4306-4314, 2009	74	2009
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	63	2015
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 Proceedings of the 2010 ACM workshop on Wireless of the students, by the …, 2010	52	2010
Colouring vertices of triangle-free graphs without forests KK Dabrowski, V Lozin, R Raman, B Ries Discrete Mathematics 312 (7), 1372-1385, 2012	50	2012
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	44	2010
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	37	2014
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	35	2013
Some properties of edge intersection graphs of single-bend paths on a grid A Asinowski, B Ries Discrete Mathematics 312 (2), 427-440, 2012	32	2012
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	31	2015
Coloring some classes of mixed graphs B Ries Discrete Applied Mathematics 155 (1), 1-6, 2007	31	2007
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	30	2015
Characterizations of cographs as intersection graphs of paths on a grid E Cohen, MC Golumbic, B Ries Discrete Applied Mathematics 178, 46-57, 2014	28	2014
On two coloring problems in mixed graphs B Ries, D de Werra European Journal of Combinatorics 29 (3), 712-725, 2008	25	2008
Reducing the clique and chromatic number via edge contractions and vertex deletions D Paulusma, C Picouleau, B Ries Combinatorial Optimization: 4th International Symposium, ISCO 2016, Vietri …, 2016	22	2016
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, 499-517, 2013	21	2013
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	20	2020
Blockers for the stability number and the chromatic number C Bazgan, C Bentz, C Picouleau, B Ries Graphs and Combinatorics 31, 73-90, 2015	20	2015
Coloring graphs characterized by a forbidden subgraph PA Golovach, D Paulusma, B Ries Discrete Applied Mathematics 180, 101-110, 2015	19	2015
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	18	2018
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	17	2018

Sistemul nu poate realiza operația în acest moment. Încercați din nou mai târziu.

Articole 1–20

Referințe bibliografice pe an

Citate duplicat

Citate fuzionate

Adăugați coautoriCoautori

Urmăriți

Citat de

Coautori