Konrad Engel

Discret. Comput. Geom., 2023

2018

Boundary optimization for rough sets.

[BibT_eX]

[DOI]

Tran Dan Thu

Discret. Math., 2018

Bandwidth of Graphs Resulting from the Edge Clique Covering Problem.

[BibT_eX]

[DOI]

Sebastian Hanisch

Electron. J. Comb., 2018

2017

Incremental Network Design with Minimum Spanning Trees.

[BibT_eX]

[DOI]

Thomas Kalinowski

Martin W. P. Savelsbergh

J. Graph Algorithms Appl., 2017

2015

The Dilworth Number of Auto-Chordal Bipartite Graphs.

[BibT_eX]

[DOI]

Anne Berry

Graphs Comb., 2015

2014

Reconstruction of cell-electrode-adjacencies on multielectrode arrays.

[BibT_eX]

[DOI]

Sebastian Hanisch

J. Comput. Neurosci., 2014

Optimal integer partitions.

[BibT_eX]

[DOI]

Jan-Christoph Schlage-Puchta

Tadeusz Radzik

Eur. J. Comb., 2014

Preface.

[BibT_eX]

[DOI]

Roger Labahn

Van Bang Le

Florian Pfender

Discret. Appl. Math., 2014

Partition into almost straight trails.

[BibT_eX]

[DOI]

Harald Birkholz

Discret. Appl. Math., 2014

2013

Properties of Graded Posets Preserved by Some Operations.

[BibT_eX]

[DOI]

Sergei L. Bezrukov

Proceedings of the Mathematics of Paul Erdős II, 2013

2012

Solution of a problem on non-negative subset sums.

[BibT_eX]

[DOI]

Caterina Nardi

Eur. J. Comb., 2012

2011

Approximated matrix decomposition for IMRT planning with multileaf collimators.

[BibT_eX]

[DOI]

Antje Kiesel

OR Spectr., 2011

A New Algorithm for a Field Splitting Problem in Intensity-Modulated Radiation Therapy.

[BibT_eX]

[DOI]

Danny Z. Chen

Chao Wang

Algorithmica, 2011

2010

A note on full transversals and mixed orthogonal arrays.

[BibT_eX]

[DOI]

Australas. J Comb., 2010

2009

A generalization of Sperner's theorem and an application to graph orientations.

[BibT_eX]

[DOI]

Jianguo Qian

Wei Xu

Discret. Appl. Math., 2009

Optimal matrix-segmentation by rectangles.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

Preface.

[BibT_eX]

[DOI]

Van Bang Le

Discret. Appl. Math., 2009

2006

Algorithms for Leakage Reduction with Dual Threshold Design Techniques.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on System-on-Chip, 2006

2005

A new algorithm for optimal multileaf collimator field segmentation.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2005

2004

Preface: ODSA.

[BibT_eX]

[DOI]

Roger Labahn

Discret. Appl. Math., 2004

2003

Testing Bandwidth k for k-Connected Graphs.

[BibT_eX]

[DOI]

Sven Guttmann

SIAM J. Discret. Math., 2003

2002

The t-intersection Problem in the Truncated Boolean Lattice.

[BibT_eX]

[DOI]

Eur. J. Comb., 2002

On the average size of sets in intersecting Sperner families.

[BibT_eX]

[DOI]

Discret. Math., 2002

Minimal Sample Databases for Global Cardinality Constraints.

[BibT_eX]

[DOI]

Sven Hartmann

Proceedings of the Foundations of Information and Knowledge Systems, 2002

1999

An Asymptotic Complete Intersection Theorem for Chain Products.

[BibT_eX]

[DOI]

Christian Bey

Eur. J. Comb., 1999

An Upper Bound for the Size of the Largest Antichain in the Poset of Partitions of an Integer.

[BibT_eX]

[DOI]

E. Rodney Canfield

Discret. Appl. Math., 1999

1997

The order-interval hypergraph of a finite poset and the König property.

[BibT_eX]

[DOI]

Isma Bouchemakh

Discret. Math., 1997

1996

Interval Packing and Covering in the Boolean Lattice.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1996

1995

An Algorithm for the Determination of the Variance of a Partially Ordered Set.

[BibT_eX]

[DOI]

J. Algorithms, 1995

1994

On the Average Rank of an Element in a Filter of the Partition Lattice.

[BibT_eX]

J. Comb. Theory A, 1994

1992

Perfectly orderable graphs and almost all perfect graphs are kernelM-solvable.

[BibT_eX]

[DOI]

Mostafa Blidia

Graphs Comb., 1992

1990

Polytopes determined by complementfree Sperner families.

[BibT_eX]

[DOI]

Péter L. Erdös

Discret. Math., 1990

1989

Sperner families satisfying additional conditions and their convex hulls.

[BibT_eX]

[DOI]

Péter L. Erdös

Graphs Comb., 1989

About k-optimal Representations of Posets.

[BibT_eX]

J. Inf. Process. Cybern., 1989

1986

An Erdös-Ko-Rado Theorem for Integer Sequences of Given Rank.

[BibT_eX]

[DOI]

Peter Frankl

Eur. J. Comb., 1986

Optimal Representations of Partially Ordered Sets and a Limit Sperner Theorem.

[BibT_eX]

[DOI]

Eur. J. Comb., 1986

A Continuous Version of a Sperner-type Theorem.

[BibT_eX]

J. Inf. Process. Cybern., 1986

An Erdős-Ko-Rado Type Theorem II.

[BibT_eX]

[DOI]

Acta Cybern., 1986

1985

A New Proof of a Theorem of Harper on the Sperner-Erdös Problem.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1985

An intersection-union theorem for integer sequences.

[BibT_eX]

[DOI]

Discret. Math., 1985

About the ratio of the size of a maximum antichain to the size of a maximum level in finite partially ordered sets.

[BibT_eX]

[DOI]

Nikolai N. Kuzjurin

Comb., 1985

1984

An Asymptotic Formula for the Maximum Size of an h-Family in Products of Partially Ordered Sets.

[BibT_eX]

[DOI]

Nikolai N. Kuzjurin

J. Comb. Theory A, 1984

Strong properties in partially ordered sets II.

[BibT_eX]

[DOI]

Discret. Math., 1984

An Erdös - Ko- Rado theorem for the subcubes of a cube.

[BibT_eX]

[DOI]

Comb., 1984

1983

About the number of pairs of elements of Enk whose distances have given values.

[BibT_eX]

[DOI]

Discret. Math., 1983

Strong properties in partially ordered sets I.

[BibT_eX]

[DOI]