| Publication | Date of Publication | Type |
|---|
Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming
Mathematical Programming. Series A. Series B | 2024-11-07 | Paper |
Forcing generalised quasirandom graphs efficiently
Combinatorics, Probability and Computing | 2024-11-05 | Paper |
Cycles of length three and four in tournaments
Acta Mathematica Universitatis Comenianae. New Series | 2024-10-18 | Paper |
More non-bipartite forcing pairs
Acta Mathematica Universitatis Comenianae. New Series | 2024-10-18 | Paper |
Planar graph with twin-width seven
European Journal of Combinatorics | 2024-10-07 | Paper |
Hypergraphs with minimum positive uniform Turán density
| 2024-09-13 | Paper |
Characterization of matrices with bounded graver bases and depth parameters and applications to integer programming
| 2024-06-24 | Paper |
Three-coloring triangle-free graphs on surfaces. VI: 3-colorability of quadrangulations
Journal of Combinatorial Theory. Series B | 2024-01-29 | Paper |
Quasirandom-Forcing Orientations of Cycles
SIAM Journal on Discrete Mathematics | 2023-11-29 | Paper |
Closure property of contraction-depth of matroids
| 2023-11-03 | Paper |
The dimension of the region of feasible tournament profiles
| 2023-10-30 | Paper |
Quasirandom Latin squares
Random Structures \& Algorithms | 2023-10-17 | Paper |
Toward characterizing locally common graphs
Random Structures \& Algorithms | 2023-10-17 | Paper |
Uniform Turán density of cycles
Transactions of the American Mathematical Society | 2023-07-10 | Paper |
Forcing Generalized Quasirandom Graphs Efficiently
| 2023-03-07 | Paper |
No additional tournaments are quasirandom-forcing
European Journal of Combinatorics | 2022-12-01 | Paper |
Cycles of a given length in tournaments
Journal of Combinatorial Theory. Series B | 2022-11-23 | Paper |
Inducibility and universality for trees
Combinatorial Theory | 2022-11-23 | Paper |
Density maximizers of layered permutations
The Electronic Journal of Combinatorics | 2022-10-06 | Paper |
Planar graph with twin-width seven
| 2022-09-23 | Paper |
Non-bipartite \(k\)-common graphs
Combinatorica | 2022-06-30 | Paper |
Matrices of optimal tree-depth and a row-invariant parameterized algorithm for integer programming
SIAM Journal on Computing | 2022-06-08 | Paper |
Packing and covering directed triangles asymptotically
European Journal of Combinatorics | 2022-01-13 | Paper |
Three-coloring triangle-free graphs on surfaces. VII. A linear-time algorithm
Journal of Combinatorial Theory. Series B | 2021-11-17 | Paper |
Recovering sparse graphs
| 2021-08-04 | Paper |
Three-coloring triangle-free graphs on surfaces. IV: Bounding face sizes of 4-critical graphs
Journal of Combinatorial Theory. Series B | 2021-07-06 | Paper |
Three-coloring triangle-free graphs on surfaces. V: Coloring planar graphs with distant anomalies
Journal of Combinatorial Theory. Series B | 2021-07-06 | Paper |
Coloring graphs by translates in the circle
European Journal of Combinatorics | 2021-06-18 | Paper |
Elusive extremal graphs
Proceedings of the London Mathematical Society | 2021-05-10 | Paper |
Cyclic coloring of plane graphs with maximum face size 16 and 17
European Journal of Combinatorics | 2021-04-14 | Paper |
Analytic representations of large graphs
Surveys in Combinatorics 2019 | 2021-02-06 | Paper |
Characterization of quasirandom permutations by a pattern sum
Random Structures \& Algorithms | 2021-01-05 | Paper |
Finitely forcible graphons with an almost arbitrary structure
Discrete Analysis | 2020-10-20 | Paper |
Three-coloring triangle-free graphs on surfaces. III. Graphs of girth five
Journal of Combinatorial Theory. Series B | 2020-09-24 | Paper |
Cycles of length three and four in tournaments
Journal of Combinatorial Theory. Series A | 2020-07-03 | Paper |
Permutations with fixed pattern densities
Random Structures \& Algorithms | 2020-06-19 | Paper |
Non-bipartite k-common graphs
| 2020-06-16 | Paper |
Hadwiger meets Cayley
| 2020-05-12 | Paper |
Decomposing graphs into edges and triangles
Combinatorics, Probability and Computing | 2020-04-06 | Paper |
Compactness and finite forcibility of graphons
Journal of the European Mathematical Society (JEMS) | 2019-10-15 | Paper |
Hereditary properties of permutations are strongly testable
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
More non-bipartite forcing pairs
| 2019-06-10 | Paper |
Infinite-dimensional finitely forcible graphon
Proceedings of the London Mathematical Society | 2019-05-15 | Paper |
Packing directed cycles through a specified vertex set
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
Coloring triangle-free graphs on surfaces
| 2019-05-06 | Paper |
Optimal‐size clique transversals in chordal graphs
Journal of Graph Theory | 2019-01-03 | Paper |
The step Sidorenko property and non-norming edge-transitive graphs
Journal of Combinatorial Theory. Series A | 2018-12-19 | Paper |
Finitely forcible graph limits are universal
Advances in Mathematics | 2018-11-08 | Paper |
A bound on the inducibility of cycles
Journal of Combinatorial Theory. Series A | 2018-11-08 | Paper |
Three-coloring triangle-free graphs on surfaces. II: 4-critical graphs in a disk
Journal of Combinatorial Theory. Series B | 2018-07-24 | Paper |
Graphic TSP in cubic graphs
| 2018-04-19 | Paper |
Walk entropy and walk-regularity
Linear Algebra and its Applications | 2018-04-12 | Paper |
Weak regularity and finitely forcible graph limits
Transactions of the American Mathematical Society | 2018-03-28 | Paper |
Counting flags in triangle-free digraphs
Combinatorica | 2018-03-16 | Paper |
Extremal graph theory and finite forcibility
| 2018-01-18 | Paper |
First-Order Convergence and Roots
Combinatorics, Probability and Computing | 2017-10-10 | Paper |
Recovering sparse graphs
| 2017-09-28 | Paper |
First order limits of sparse graphs: plane trees and path-width
Random Structures \& Algorithms | 2017-08-10 | Paper |
Steinberg's conjecture is false
Journal of Combinatorial Theory. Series B | 2016-11-25 | Paper |
Densities in large permutations and parameter testing
European Journal of Combinatorics | 2016-11-07 | Paper |
Third case of the cyclic coloring conjecture
| 2016-10-14 | Paper |
Weak regularity and finitely forcible graph limits
| 2016-10-14 | Paper |
First order convergence of matroids
European Journal of Combinatorics | 2016-10-12 | Paper |
Densities of 3-vertex graphs
| 2016-10-07 | Paper |
Three-coloring triangle-free graphs on surfaces. I: Extending a coloring to a disk with one triangle.
Journal of Combinatorial Theory. Series B | 2016-06-03 | Paper |
A problem of Erdős and Sós on 3-graphs
Israel Journal of Mathematics | 2016-04-21 | Paper |
Third case of the cyclic coloring conjecture
SIAM Journal on Discrete Mathematics | 2016-04-04 | Paper |
FO model checking of interval graphs
Logical Methods in Computer Science | 2016-01-07 | Paper |
Packing six \(T\)-joins in plane graphs
Journal of Combinatorial Theory. Series B | 2015-12-11 | Paper |
Locally satisfiable formulas
| 2015-08-03 | Paper |
Rank of divisors on tropical curves
Journal of Combinatorial Theory. Series A | 2015-06-19 | Paper |
Finitely forcible graphons and permutons
Journal of Combinatorial Theory. Series B | 2014-11-21 | Paper |
Extensions of fractional precolorings show discontinuous behavior
Journal of Graph Theory | 2014-11-17 | Paper |
Extensions of fractional precolorings show discontinuous behavior
Journal of Graph Theory | 2014-11-17 | Paper |
Monochromatic triangles in three-coloured graphs
Journal of Combinatorial Theory. Series B | 2014-10-16 | Paper |
Two algorithms for general list matrix partitions
| 2014-10-13 | Paper |
The fractional chromatic number of triangle-free subcubic graphs
European Journal of Combinatorics | 2014-07-29 | Paper |
A problem of Erdős and Sós on 3-graphs
The Seventh European Conference on Combinatorics, Graph Theory and Applications | 2014-06-11 | Paper |
Three-coloring triangle-free graphs on surfaces IV. Bounding face sizes of 4-critical graphs
| 2014-04-25 | Paper |
Testing first-order properties for subclasses of sparse graphs
Journal of the ACM | 2014-02-17 | Paper |
Cubic bridgeless graphs have more than a linear number of perfect matchings
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
Counting flags in triangle-free digraphs
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
Circular edge-colorings of cubic graphs with girth six
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
FO model checking of interval graphs
Automata, Languages, and Programming | 2013-08-07 | Paper |
Six-Critical Graphs on the Klein Bottle
Electronic Notes in Discrete Mathematics | 2013-06-28 | Paper |
Quasirandom permutations are characterized by 4-point densities
Geometric and Functional Analysis. GAFA | 2013-06-25 | Paper |
A new bound for the 2/3 conjecture
Combinatorics, Probability and Computing | 2013-05-13 | Paper |
On the number of pentagons in triangle-free graphs
Journal of Combinatorial Theory. Series A | 2013-03-06 | Paper |
Min-max relations for odd cycles in planar graphs
SIAM Journal on Discrete Mathematics | 2013-01-04 | Paper |
Coloring Eulerian triangulations of the Klein bottle
Graphs and Combinatorics | 2012-12-27 | Paper |
Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs
Random Structures \& Algorithms | 2012-12-14 | Paper |
On the removal lemma for linear systems over abelian groups
European Journal of Combinatorics | 2012-12-03 | Paper |
A removal lemma for systems of linear equations over finite fields
Israel Journal of Mathematics | 2012-11-19 | Paper |
Deciding first order properties of matroids
Automata, Languages, and Programming | 2012-11-01 | Paper |
A new lower bound based on Gromov's method of selecting heavily covered points
Discrete \& Computational Geometry | 2012-09-19 | Paper |
Non-three-colourable common graphs exist
Combinatorics, Probability and Computing | 2012-09-12 | Paper |
Extending fractional precolorings
SIAM Journal on Discrete Mathematics | 2012-09-12 | Paper |
Decomposition width of matroids
Discrete Applied Mathematics | 2012-05-11 | Paper |
Classes of graphs with small rank decompositions are \(\chi \)-bounded
European Journal of Combinatorics | 2012-05-04 | Paper |
A superlinear bound on the number of perfect matchings in cubic bridgeless graphs
European Journal of Combinatorics | 2012-05-04 | Paper |
Fractional colorings of cubic graphs with large girth
SIAM Journal on Discrete Mathematics | 2012-03-15 | Paper |
Cyclic colorings of plane graphs with independent faces
European Journal of Combinatorics | 2012-02-11 | Paper |
Domination number of cubic graphs with large girth
Journal of Graph Theory | 2012-02-08 | Paper |
Fractional total colourings of graphs of high girth
Journal of Combinatorial Theory. Series B | 2011-12-08 | Paper |
Limit Behavior of Locally Consistent Constraint Satisfaction Problems
SIAM Journal on Discrete Mathematics | 2011-10-27 | Paper |
Exponentially many perfect matchings in cubic graphs
Advances in Mathematics | 2011-07-25 | Paper |
The last fraction of a fractional conjecture
SIAM Journal on Discrete Mathematics | 2011-04-15 | Paper |
Triangles in arrangements of points and lines in the plane
Journal of Combinatorial Theory. Series A | 2011-04-11 | Paper |
Short cycle covers of graphs with minimum degree three
SIAM Journal on Discrete Mathematics | 2011-03-15 | Paper |
Equipartite polytopes
Israel Journal of Mathematics | 2010-12-06 | Paper |
Coloring plane graphs with independent crossings
Journal of Graph Theory | 2010-11-10 | Paper |
Graphs with bounded tree-width and large odd-girth are almost bipartite
Journal of Combinatorial Theory. Series B | 2010-11-05 | Paper |
Brooks' theorem via the Alon-Tarsi theorem
Discrete Mathematics | 2010-10-28 | Paper |
Decomposition width of matroids
Automata, Languages and Programming | 2010-09-07 | Paper |
A new lower bound on the number of perfect matchings in cubic graphs
SIAM Journal on Discrete Mathematics | 2010-08-27 | Paper |
Optimal Real Number Graph Labellings of a Subfamily of Kneser Graphs
SIAM Journal on Discrete Mathematics | 2010-08-27 | Paper |
Markov bases of binary graph models of \(K_{4}\)-minor free graphs
Journal of Combinatorial Theory. Series A | 2010-08-11 | Paper |
scientific article; zbMATH DE number 5763155 (Why is no real title available?)
| 2010-07-30 | Paper |
An improved linear bound on the number of perfect matchings in cubic graphs
European Journal of Combinatorics | 2010-06-17 | Paper |
Circular edge-colorings of cubic graphs with girth six
Journal of Combinatorial Theory. Series B | 2010-06-03 | Paper |
Graph labellings with variable weights, a survey
Discrete Applied Mathematics | 2010-04-28 | Paper |
Distance constrained labelings of planar graphs with no short cycles
Discrete Applied Mathematics | 2010-04-28 | Paper |
Facial colorings using Hall's theorem
European Journal of Combinatorics | 2010-04-27 | Paper |
Non-rainbow colorings of 3-, 4- and 5-connected plane graphs
Journal of Graph Theory | 2010-04-22 | Paper |
Characterisation results for Steiner triple systems and their application to edge-colourings of cubic graphs
Canadian Journal of Mathematics | 2010-03-31 | Paper |
Toughness threshold for the existence of 2-walks in \(K_{4}\)-minor-free graphs
Discrete Mathematics | 2010-03-29 | Paper |
Pattern hypergraphs
The Electronic Journal of Combinatorics | 2010-03-26 | Paper |
A note on edge-colourings avoiding rainbow \(K_{4}\) and monochromatic \(K_{m}\)
The Electronic Journal of Combinatorics | 2010-03-26 | Paper |
Chromatic number for a generalization of Cartesian product graphs
The Electronic Journal of Combinatorics | 2010-03-26 | Paper |
6-Critical Graphs on the Klein Bottle
SIAM Journal on Discrete Mathematics | 2010-03-17 | Paper |
Matchings and nonrainbow colorings
SIAM Journal on Discrete Mathematics | 2010-03-17 | Paper |
Algorithms for classes of graphs with bounded expansion
Graph-Theoretic Concepts in Computer Science | 2010-01-21 | Paper |
Distance constrained labelings of \(K_{4}\)-minor free graphs
Discrete Mathematics | 2009-12-15 | Paper |
A note on antisymmetric flows in graphs
European Journal of Combinatorics | 2009-12-01 | Paper |
Bounds for the Real Number Graph Labellings and Application to Labellings of the Triangular Lattice
SIAM Journal on Discrete Mathematics | 2009-11-27 | Paper |
Polynomial-size binary decision diagrams for the exactly half-\(d\)-hyperclique problem reading each input bit twice
Theory of Computing Systems | 2009-09-18 | Paper |
Fullerene graphs have exponentially many perfect matchings
Journal of Mathematical Chemistry | 2009-09-02 | Paper |
Long cycles in fullerene graphs
Journal of Mathematical Chemistry | 2009-09-02 | Paper |
A combinatorial proof of the removal lemma for groups
Journal of Combinatorial Theory. Series A | 2009-06-17 | Paper |
Hamiltonian threshold for strong products of graphs
Journal of Graph Theory | 2009-06-04 | Paper |
Coloring of Triangle-Free Graphs on the Double Torus
SIAM Journal on Discrete Mathematics | 2009-05-27 | Paper |
Randomized strategies for the plurality problem
Discrete Applied Mathematics | 2009-03-04 | Paper |
List colorings with measurable sets
Journal of Graph Theory | 2009-02-20 | Paper |
Equipartite graphs
Israel Journal of Mathematics | 2009-02-17 | Paper |
Projective, affine, and abelian colorings of cubic graphs
European Journal of Combinatorics | 2009-01-27 | Paper |
Coloring even-faced graphs in the torus and the Klein bottle
Combinatorica | 2008-10-21 | Paper |
Labelings of Graphs with Fixed and Variable Edge-Weights
SIAM Journal on Discrete Mathematics | 2008-08-13 | Paper |
Characterization of affine Steiner triple systems and Hall triple systems
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
Edge-colorings of cubic graphs with elements of point-transitive Steiner triple systems
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
Coloring Triangle-Free Graphs on Surfaces
Algorithms and Computation | 2008-05-27 | Paper |
Coloring squares of planar graphs with girth six
European Journal of Combinatorics | 2008-05-13 | Paper |
Hamilton cycles in prisms
Journal of Graph Theory | 2008-01-04 | Paper |
Tough spiders
Journal of Graph Theory | 2008-01-04 | Paper |
Labeling planar graphs with a condition at distance two
European Journal of Combinatorics | 2007-11-21 | Paper |
The Channel Assignment Problem with Variable Weights
SIAM Journal on Discrete Mathematics | 2007-09-06 | Paper |
Computing Representations of Matroids of Bounded Branch-Width
STACS 2007 | 2007-09-03 | Paper |
Cyclic, diagonal and facial colorings -- a missing case
European Journal of Combinatorics | 2007-07-27 | Paper |
Unions of perfect matchings in cubic graphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Distance Constrained Labelings of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mi>K</mml:mi><mml:mn>4</mml:mn></mml:msub></mml:math>-minor Free Graphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Construction of Large Graphs with No Optimal Surjective L(2,1)-Labelings
SIAM Journal on Discrete Mathematics | 2007-05-22 | Paper |
Closure for the property of having a hamiltonian prism
Journal of Graph Theory | 2007-03-20 | Paper |
The circular chromatic index of flower snarks
The Electronic Journal of Combinatorics | 2007-03-12 | Paper |
scientific article; zbMATH DE number 5130820 (Why is no real title available?)
| 2007-03-05 | Paper |
Mixed hypergraphs and other coloring problems
Discrete Mathematics | 2007-03-02 | Paper |
Probabilistic strategies for the partition and plurality problems
Random Structures \& Algorithms | 2007-02-07 | Paper |
The circular chromatic index of graphs of high girth
Journal of Combinatorial Theory. Series B | 2007-01-11 | Paper |
Colorings of planar graphs with no rainbow faces
Combinatorica | 2007-01-08 | Paper |
Eulerian colorings and the bipartizing matchings conjecture of Fleischner
European Journal of Combinatorics | 2006-11-15 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Free binary decision diagrams for the computation of \(\text{EAR}_{ n }\)
Computational Complexity | 2006-09-28 | Paper |
List coloring of Cartesian products of graphs
Discrete Mathematics | 2006-09-14 | Paper |
On the number of intersections of two polygons.
| 2006-09-13 | Paper |
Upper Hamiltonian numbers and Hamiltonian spectra of graphs
| 2006-08-03 | Paper |
A Brooks-Type Theorem for the Generalized List T-Coloring
SIAM Journal on Discrete Mathematics | 2006-06-01 | Paper |
The last excluded case of Dirac's map‐color theorem for choosability
Journal of Graph Theory | 2006-05-16 | Paper |
Coloring mixed hypertrees
Discrete Applied Mathematics | 2006-04-28 | Paper |
Group coloring is \(\Pi_2^{\text{P}}\)-complete
Theoretical Computer Science | 2006-03-20 | Paper |
Extending partial 5-colorings and 6-colorings in planar graphs
Journal of Combinatorial Theory. Series B | 2006-01-10 | Paper |
Locally consistent constraint satisfaction problems
Theoretical Computer Science | 2006-01-09 | Paper |
STACS 2005
Lecture Notes in Computer Science | 2005-12-02 | Paper |
A note on group colorings
Journal of Graph Theory | 2005-11-07 | Paper |
Coloring Powers of Chordal Graphs
SIAM Journal on Discrete Mathematics | 2005-09-16 | Paper |
Algorithm Theory - SWAT 2004
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
scientific article; zbMATH DE number 2197942 (Why is no real title available?)
| 2005-08-23 | Paper |
Mathematical Foundations of Computer Science 2004
Lecture Notes in Computer Science | 2005-08-22 | Paper |
Coloring graphs from lists with bounded size of their union
Journal of Graph Theory | 2005-08-01 | Paper |
Hamilton cycles in strong products of graphs
Journal of Graph Theory | 2005-05-04 | Paper |
Cyclic, diagonal and facial colorings
European Journal of Combinatorics | 2005-03-08 | Paper |
An exact algorithm for the channel assignment problem
Discrete Applied Mathematics | 2005-02-22 | Paper |
Coloring face hypergraphs on surfaces
European Journal of Combinatorics | 2005-01-11 | Paper |
Pancyclicity of strong products of graphs
Graphs and Combinatorics | 2004-12-13 | Paper |
Hajós' theorem for list coloring
Discrete Mathematics | 2004-11-18 | Paper |
It is tough to be a plumber
Theoretical Computer Science | 2004-10-27 | Paper |
On feasible sets of mixed hypergraphs
The Electronic Journal of Combinatorics | 2004-10-13 | Paper |
Borodin's conjecture on diagonal coloring is false
European Journal of Combinatorics | 2004-10-04 | Paper |
Mixed hypercacti
Discrete Mathematics | 2004-10-01 | Paper |
A revival of the girth conjecture
Journal of Combinatorial Theory. Series B | 2004-10-01 | Paper |
scientific article; zbMATH DE number 2084282 (Why is no real title available?)
| 2004-08-06 | Paper |
Edge-disjoint odd cycles in planar graphs.
Journal of Combinatorial Theory. Series B | 2004-03-15 | Paper |
On maximum face-constrained coloring of plane graphs with no short face cycles.
Discrete Mathematics | 2004-03-14 | Paper |
scientific article; zbMATH DE number 2044943 (Why is no real title available?)
| 2004-02-18 | Paper |
A Theorem about the Channel Assignment Problem
SIAM Journal on Discrete Mathematics | 2004-01-08 | Paper |
scientific article; zbMATH DE number 1933066 (Why is no real title available?)
| 2003-09-05 | Paper |
Mixed hypergraphs with bounded degree: Edge-coloring of mixed multigraphs.
Theoretical Computer Science | 2003-08-17 | Paper |
scientific article; zbMATH DE number 1953091 (Why is no real title available?)
| 2003-07-25 | Paper |
scientific article; zbMATH DE number 1929956 (Why is no real title available?)
| 2003-06-18 | Paper |
scientific article; zbMATH DE number 1839477 (Why is no real title available?)
| 2002-12-02 | Paper |
scientific article; zbMATH DE number 1834670 (Why is no real title available?)
| 2002-11-25 | Paper |
scientific article; zbMATH DE number 1759434 (Why is no real title available?)
| 2002-11-04 | Paper |
scientific article; zbMATH DE number 1696541 (Why is no real title available?)
| 2002-07-09 | Paper |
On planar mixed hypergraphs
The Electronic Journal of Combinatorics | 2001-12-11 | Paper |
Strong modeling limits of graphs with bounded tree-width
| N/A | Paper |
Common graphs with arbitrary chromatic number
| N/A | Paper |
Twin-width of graphs on surfaces
| N/A | Paper |
The dimension of the feasible region of pattern densities
| N/A | Paper |
Branch-depth is minor closure of contraction-deletion-depth
| N/A | Paper |
Ramsey multiplicity of apices of trees
| N/A | Paper |
