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
Many-to-many matching with max-min preferences2014
Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods2014
On the complexity of container stowage planning problems2014
On the immunity of rotation symmetric Boolean functions against fast algebraic attacks2014
On the structure of arbitrarily partitionable graphs with given connectivity2014
On the sum of all distances in bipartite graphs2014
Quasi-optimal degree distribution for a quadratic programming problem arising from the p-version finite element method for a one-dimensional obstacle problem2014
Robust location transportation problems under uncertain demands2014
Skeletal configurations of ribbon trees.2014
The number of spanning trees in Apollonian networks2014
22-clique-bond of stable set polyhedra2013
Acyclic edge coloring of planar graphs with girth at least 52013
Bounds on the quality of reconstructed images in binary tomography2013
Determining the L(2, 1)L(2, 1)-span in polynomial space2013
Diffuse reflection diameter and radius for convex-quadrilateralizable polygons2013
Finding lower bounds on the complexity of secret sharing schemes by linear programming2013
On 4-γtγt-critical graphs of diameter two2013
Path covering number and(2, 1)L(2, 1)-labeling number of graphs2013
Path covering number and L(2, 1)L(2, 1)-labeling number of graphs2013
Patience of matrix games2013
Strong robustness of randomized rumor spreading protocols2013
Super restricted edge-connectivity of graphs with diameter 22013
Super-simple balanced incomplete block designs with block size 5 and index 32013
A (3, 1)*-choosable theorem on toroidal graphs2012
Arboricity: An acyclic hypergraph decomposition problem motivated by database theory2012
Bandwidth and distortion revisited2012
Bounds on the crossing resolution of complete geometric graphs2012
Cluster editing with locally bounded modifications2012
Distance edge-colourings and matchings2012
Distance three labelings of trees2012
Dynamic chromatic number of regular graphs2012
Generalized roof duality2012
Good edge-labelling of graphs2012
Kernelization hardness of connectivity problems in d-degenerate graphs2012
Lower bounds for Ramsey numbers of Kn with a small subgraph removed2012
Models for fare planning in public transport2012
On graph contractions and induced minors2012
On r-acyclic edge colorings of planar graphs2012
On real number labelings and graph invertibility2012
On the (h, k)-domination numbers of iterated line digraphs2012
On the relative distances of nine or ten points in the boundary of a plane convex body2012
On the size of identifying codes in triangle-free graphs2012
Parameterized complexity of generalized domination problems2012
The interval ordering problem2012
A revised algorithm for searching for all defective edges in a graph2011
Competitive Boolean function evaluation: Beyond monotonicity, and the symmetric case2011
Congestion games with failures2011
Distributed computation of virtual coordinates for greedy routing in sensor networks2011
Foreword2011
Identifying codes and locating-dominating sets on paths and cycles2011

« prev Page 7/11 next »