Discret. Appl. Math

528 papers151 directions

Papers by Year

2026 41
2025 29
2024 22
2023 21
2022 24
2021 30
2020 25
2019 27
2018 29
2017 19
2016 23
2015 20
2014 19
2013 14
2012 22
2011 11
2010 10
2009 21
2008 12
2007 11
2006 12
2005 11
2004 11
2003 10
2002 3
2001 9
2000 9
1999 7
1998 9
1997 4
1996 8
1995 4
1994 5
1993 6
1992 6
1991 1
1990 4
1989 2
1988 1
1986 1
1983 1
1979 1

Top Research Directions

Research directions most represented by papers from this venue.

Constructing Extremal Graphs to Verify Bound Sharpness 6
Proving Computational Intractability Through Hardness Reductions 6
Dynamic Programming on Tree Decompositions 5
Limits of Approximating Graph Parameters 5
Monitoring Graph Edges Using Shortest Path Distances 4
Decomposing Complex Graphs into Canonical Components 3
Generalizing Network Algorithms to Arbitrary Topologies 3
Parameterized Complexity Analysis 3
Tightening Theoretical Bounds by Optimizing Constant Factors 3
The Empirical Validation Gap 3
Exploiting One Dimensional Contiguity and Order Preservation 2
Proving Algebraic Identities Through Combinatorial Bijections 2
Unique Vertex Identification in Graphs 2
Upper Bounds for Identifying Codes and Locating Domination 2
Preserving Planarity in Graph Reductions 2

Top Authors

AuthorPapers
Jan Kratochvíl21
Florent Foucaud16
Changhong Lu10
Xiaodan Chen9
Subhamoy Maitra8
Robert Ganian6
Christian Komusiewicz5
Marc Pfetsch5
Seok-Hee Hong5
Fionn Mc Inerney4
Frédéric Giroire4
Joost Batenburg4
Madhav Marathe4
Mathieu Lacroix4
Meysam Alishahi4
S. S. Ravi4
Stefan Szeider4
Yidong Zhou4
Benjamin Doerr3
Chandra Chekuri3

Impactful Papers

Papers from this venue that shaped research clusters.

Foundational

Influential

Related Venues

Venues with the most similar research cluster distributions.

Papers

TitleYear
Recognizing Renamable Generalized Propositional Horn Formulas Is NP-complete1995
Algorithmic complexity of list colorings1994
A Result of Vapnik with Applications1994
A Special Planar Satisfiability Problem and a Consequence of Its NP-completeness1994
The Nonexistence of Reduction Rules Giving an Embedding into a K-tree1994
Total Matchings and Total Coverings of Threshold Graphs1994
Algorithms for Weak and Wide Separation of Sets1993
Bounding Sample Size with the Vapnik-Chervonenkis Dimension1993
Computing the Throughput of a Network with Dedicated Lines1993
On the Maximum Capacity Augmentation Algorithm for the Maximum Flow Problem1993
Orthogonal Weighted Linear L1 and L∞ Approximation and Applications1993
Compatible 2-factors1992
Generalized Vertex Covering in Interval Graphs1992
Integer Programming in VLSI Design1992
Perfect Latin Squares1992
Stirling Networks: A Versatile Combinatorial Topology for Multiprocessor Systems1992
Transmitting in the n-Dimensional Cube1992
Computing external farthest neighbors for a simple polygon1991
Parallel selection1990
Subtree isomorphism is in random NC1990
Succinct representation of general unlabeled graphs1990
Universal sequences for complete graphs1990
On the orderability problem for PLA folding1989
On the variance of the external path length in a symmetric digital trie1989
On some counting polynomials in chemistry1988
On BF-orderable graphs1986
Parallel sorting1983
Worst case behavior of the steepest edge simplex method1979

« prev Page 11/11