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
Laced Boolean functions and subset sum problems in finite fields2011
Nested hierarchies in planar graphs2011
On the construction of prefix-free and fix-free codes with specified codeword compositions2011
On the dynamic coloring of graphs2011
Properties of optimal schedules in preemptive shop scheduling2011
A cops and robber game in multidimensional grids2010
Acute triangulations of trapezoids2010
Crossing minimization in extended level drawings of graphs2010
Generalized knight's tour on 3D chessboards2010
Modified algorithms for the minimum volume enclosing axis-aligned ellipsoid problem2010
On a disparity between relative cliquewidth and relative NLC-width2010
On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width2010
Repetition-free longest common subsequence2010
The hardness of approximating the boxicity, cubicity and threshold dimension of a graph2010
Analyzing quadratic unconstrained binary optimization problems via multicommodity flows2009
A topological sampling theorem for Robust boundary reconstruction and image segmentation2009
Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs2009
Comparing the Zagreb indices for graphs with small difference between the maximum and minimum degrees2009
Conjugated trees with minimum general Randic index2009
Distance-two labellings of Hamming graphs2009
Eulerian detachments with local edge-connectivity2009
Generic iterative subset algorithms for discrete tomography2009
Labeling the r-path with a condition at distance two2009
Layouts for mobility management in wireless ATM networks2009
List-coloring graphs without K4, k-minors2009
Modeling and simulation of metabolic networks for estimation of biomass accumulation parameters2009
Note on non-separating and removable cycles in highly connected graphs2009
On explicit formulas for bandwidth and antibandwidth of hypercubes2009
On minimizing the number of ADMs in a general topology optical network2009
On the monotone likelihood ratio property for the convolution of independent binomial random variables2009
Order statistics and estimating cardinalities of massive data sets2009
Parameterized graph cleaning problems2009
Pattern analysis for the prediction of fungal pro-peptide cleavage sites2009
Analysis of Low Hamming Weight Products2008
An ant-based algorithm for coloring graphs2008
A simple criterion on degree sequences of graphs2008
Closest 4-leaf power is fixed-parameter tractable2008
Computational aspects of monotone dualization: A brief survey2008
Convex drawings of graphs with non-convex boundary constraints2008
Efficient algorithms for finding critical subgraphs2008
Minimization of circuit registers: Retiming revisited2008
On polyhedra induced by point sets in space2008
On the computational complexity of partial covers of Theta graphs2008
Rotation symmetric Boolean functions - Count and cryptographic properties2008
Symmetry in complex networks2008
A competitive algorithm in searching for many edges in a hypergraph2007
An extremal problem on non-full colorable graphs2007
A note on the precedence-constrained class sequencing problem2007
Editorial2007
Extremal problems on consecutive L(2, 1)-labelling2007

« prev Page 8/11 next »