default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKonrad Engel
Person information
- affiliation: University of Rostock, Germany
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j44]Konrad Engel
:
An Identity Theorem for the Fourier-Laplace Transform of Polytopes on Nonzero Complex Multiples of Rationally Parameterizable Hypersurfaces. Discret. Comput. Geom. 69(1): 209-231 (2023)
2010 – 2019
- 2018
- [j43]Konrad Engel, Sebastian Hanisch:
Bandwidth of Graphs Resulting from the Edge Clique Covering Problem. Electron. J. Comb. 25(4): 4 (2018) - [j42]Konrad Engel, Tran Dan Thu:
Boundary optimization for rough sets. Discret. Math. 341(9): 2465-2477 (2018) - 2017
- [j41]Konrad Engel, Thomas Kalinowski, Martin W. P. Savelsbergh:
Incremental Network Design with Minimum Spanning Trees. J. Graph Algorithms Appl. 21(4): 417-432 (2017) - 2015
- [j40]Anne Berry, Andreas Brandstädt, Konrad Engel:
The Dilworth Number of Auto-Chordal Bipartite Graphs. Graphs Comb. 31(5): 1463-1471 (2015) - 2014
- [j39]Andreas Brandstädt, Konrad Engel, Hans-Dietrich O. F. Gronau, Roger Labahn, Van Bang Le, Florian Pfender:
Preface. Discret. Appl. Math. 163: 101 (2014) - [j38]Harald Birkholz, Konrad Engel:
Partition into almost straight trails. Discret. Appl. Math. 163: 127-135 (2014) - [j37]Konrad Engel, Tadeusz Radzik, Jan-Christoph Schlage-Puchta:
Optimal integer partitions. Eur. J. Comb. 36: 425-436 (2014) - [j36]Konrad Engel, Sebastian Hanisch:
Reconstruction of cell-electrode-adjacencies on multielectrode arrays. J. Comput. Neurosci. 37(3): 583-591 (2014) - 2013
- [p1]Sergei L. Bezrukov, Konrad Engel:
Properties of Graded Posets Preserved by Some Operations. The Mathematics of Paul Erdős II 2013: 39-46 - [i2]Konrad Engel, Thomas Kalinowski, Martin W. P. Savelsbergh:
Incremental Network Design with Minimum Spanning Trees. CoRR abs/1306.1926 (2013) - [i1]Anne Berry, Andreas Brandstädt, Konrad Engel:
The Dilworth Number of Auto-Chordal-Bipartite Graphs. CoRR abs/1309.5787 (2013) - 2012
- [j35]Konrad Engel, Caterina Nardi:
Solution of a problem on non-negative subset sums. Eur. J. Comb. 33(6): 1253-1256 (2012) - 2011
- [j34]Danny Z. Chen, Konrad Engel, Chao Wang:
A New Algorithm for a Field Splitting Problem in Intensity-Modulated Radiation Therapy. Algorithmica 61(3): 656-673 (2011) - [j33]Konrad Engel, Antje Kiesel:
Approximated matrix decomposition for IMRT planning with multileaf collimators. OR Spectr. 33(1): 149-172 (2011) - 2010
- [j32]Harout K. Aydinian, Éva Czabarka, Konrad Engel, Péter L. Erdös, László A. Székely:
A note on full transversals and mixed orthogonal arrays. Australas. J Comb. 48: 133-142 (2010)
2000 – 2009
- 2009
- [j31]Andreas Brandstädt, Konrad Engel, Hans-Dietrich O. F. Gronau, Van Bang Le:
Preface. Discret. Appl. Math. 157(9): 1979 (2009) - [j30]Konrad Engel:
Optimal matrix-segmentation by rectangles. Discret. Appl. Math. 157(9): 2015-2030 (2009) - [j29]Jianguo Qian, Konrad Engel, Wei Xu:
A generalization of Sperner's theorem and an application to graph orientations. Discret. Appl. Math. 157(9): 2170-2176 (2009) - 2006
- [j28]Konrad Engel:
Optimal matrix-segmentation by rectangles. Electron. Notes Discret. Math. 27: 23-24 (2006) - [c2]Konrad Engel, Thomas Kalinowski, Roger Labahn, Frank Sill, Dirk Timmermann:
Algorithms for Leakage Reduction with Dual Threshold Design Techniques. SoC 2006: 1-4 - 2005
- [j27]Konrad Engel:
A new algorithm for optimal multileaf collimator field segmentation. Discret. Appl. Math. 152(1-3): 35-51 (2005) - 2004
- [j26]Andreas Brandstädt, Konrad Engel, Hans-Dietrich O. F. Gronau, Roger Labahn:
Preface: ODSA. Discret. Appl. Math. 138(1-2): 1 (2004) - 2003
- [j25]Konrad Engel, Sven Guttmann:
Testing Bandwidth k for k-Connected Graphs. SIAM J. Discret. Math. 16(2): 301-312 (2003) - 2002
- [j24]Christian Bey, Konrad Engel, Gyula O. H. Katona, Uwe Leck:
On the average size of sets in intersecting Sperner families. Discret. Math. 257(2-3): 259-266 (2002) - [j23]Rudolf Ahlswede, Christian Bey, Konrad Engel, Levon H. Khachatrian:
The t-intersection Problem in the Truncated Boolean Lattice. Eur. J. Comb. 23(5): 471-487 (2002) - [c1]Konrad Engel, Sven Hartmann:
Minimal Sample Databases for Global Cardinality Constraints. FoIKS 2002: 268-288
1990 – 1999
- 1999
- [j22]E. Rodney Canfield, Konrad Engel:
An Upper Bound for the Size of the Largest Antichain in the Poset of Partitions of an Integer. Discret. Appl. Math. 95(1-3): 169-180 (1999) - [j21]Christian Bey, Konrad Engel:
An Asymptotic Complete Intersection Theorem for Chain Products. Eur. J. Comb. 20(5): 321-327 (1999) - 1997
- [j20]Isma Bouchemakh, Konrad Engel:
The order-interval hypergraph of a finite poset and the König property. Discret. Math. 170(1-3): 51-61 (1997) - 1996
- [j19]Konrad Engel:
Interval Packing and Covering in the Boolean Lattice. Comb. Probab. Comput. 5: 373-384 (1996) - 1995
- [j18]Konrad Engel:
An Algorithm for the Determination of the Variance of a Partially Ordered Set. J. Algorithms 19(3): 441-448 (1995) - 1994
- [j17]Konrad Engel:
On the Average Rank of an Element in a Filter of the Partition Lattice. J. Comb. Theory A 65(1): 67-78 (1994) - 1992
- [j16]Mostafa Blidia, Konrad Engel:
Perfectly orderable graphs and almost all perfect graphs are kernelM-solvable. Graphs Comb. 8(2): 103-108 (1992) - 1990
- [j15]Konrad Engel, Péter L. Erdös:
Polytopes determined by complementfree Sperner families. Discret. Math. 81(2): 165-169 (1990)
1980 – 1989
- 1989
- [j14]Konrad Engel:
About k-optimal Representations of Posets. J. Inf. Process. Cybern. 25(1/2): 3-10 (1989) - [j13]Konrad Engel, Péter L. Erdös:
Sperner families satisfying additional conditions and their convex hulls. Graphs Comb. 5(1): 47-56 (1989) - 1986
- [j12]Konrad Engel, Hans-Dietrich O. F. Gronau:
An Erdős-Ko-Rado Type Theorem II. Acta Cybern. 7(4): 405-411 (1986) - [j11]Konrad Engel:
A Continuous Version of a Sperner-type Theorem. J. Inf. Process. Cybern. 22(1): 45-50 (1986) - [j10]Konrad Engel, Peter Frankl:
An Erdös-Ko-Rado Theorem for Integer Sequences of Given Rank. Eur. J. Comb. 7(3): 215-220 (1986) - [j9]Konrad Engel:
Optimal Representations of Partially Ordered Sets and a Limit Sperner Theorem. Eur. J. Comb. 7(4): 287-302 (1986) - 1985
- [j8]Konrad Engel, Nikolai N. Kuzjurin:
About the ratio of the size of a maximum antichain to the size of a maximum level in finite partially ordered sets. Comb. 5(4): 301-309 (1985) - [j7]Konrad Engel, Hans-Dietrich O. F. Gronau:
An intersection-union theorem for integer sequences. Discret. Math. 54(2): 153-159 (1985) - [j6]Konrad Engel:
A New Proof of a Theorem of Harper on the Sperner-Erdös Problem. J. Comb. Theory A 39(1): 19-24 (1985) - 1984
- [j5]Konrad Engel:
An Erdös - Ko- Rado theorem for the subcubes of a cube. Comb. 4(2): 133-140 (1984) - [j4]Konrad Engel:
Strong properties in partially ordered sets II. Discret. Math. 48(2-3): 187-196 (1984) - [j3]Konrad Engel, Nikolai N. Kuzjurin:
An Asymptotic Formula for the Maximum Size of an h-Family in Products of Partially Ordered Sets. J. Comb. Theory A 37(3): 337-347 (1984) - 1983
- [j2]Konrad Engel:
About the number of pairs of elements of Enk whose distances have given values. Discret. Math. 45(2-3): 209-216 (1983) - [j1]Konrad Engel:
Strong properties in partially ordered sets I. Discret. Math. 47: 229-234 (1983)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
