Irena Penev

Statistics

Publications

Citations

H-Index

Active since

2012

Affiliations

Laboratoire de l'Informatique du Parallélisme(Current)

École Normale Supérieure de Lyon

Irena Penev is an author at Laboratoire de l'Informatique du Parallélisme specializing in discrete mathematics, combinatorial optimization, and graph theory.

ORCID

Top concepts

Graph TheoryDiscrete MathematicsCombinatorial OptimizationEngineeringComputational ComplexityEducationPath ProblemsComputer ScienceGraph AlgorithmsNetwork Analysis

Publications per year

2012–2019

Publications

Substitution and χ -boundedness

Maria Chudnovsky, Irena Penev, Alex Scott et al. · Journal of Combinatorial Theory Series B · 2013 · 25 citations · Full text

χ -Boundedness, Generalized Function

Perfect graphs of arbitrarily large clique-chromatic number

Pierre Charbit, Irena Penev, Stéphan Thomassé et al. · Journal of Combinatorial Theory Series B · 2015 · 22 citations · Full text

Graph Theory, Algebraic Graph Theory, Structural Graph Theory +4

The class of (P7,C4,C5)‐free graphs: Decomposition, algorithms, and χ‐boundedness

Kathie Cameron, Shenwei Huang, Irena Penev et al. · Journal of Graph Theory · 2019 · 14 citations

Induced Subgraph, Engineering, Graph Theory +14

Coloring Bull-Free Perfect Graphs

Irena Penev · SIAM Journal on Discrete Mathematics · 2012 · 10 citations

Minimum Weighted Coloring, Engineering, Graph Theory +13

1–4 of 4