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
Geometric automorphism groups of graphs2007
On the b-continuity property of graphs2007
Polynomial time approximation schemes and parameterized complexity2007
Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs2007
Regular-SAT: A many-valued approach to solving combinatorial problems2007
The delay of circuits whose inputs have specified arrival times2007
A competitive and cooperative approach to propositional satisfiability2006
A greedy approximation algorithm for the group Steiner problem2006
A Maiorana-McFarland type construction for resilient Boolean functions on n variables (n even) with nonlinearity >2n-1-2n/2+2n/2-22006
A new family of proximity graphs: Class cover catch digraphs2006
Approximation algorithms for the bi-criteria weighted MAX-CUT problem2006
Coloring mixed hypertrees2006
Competitive algorithms for the bicriteria k-server problem2006
Efficient automatic simulation of parallel computation on networks of workstations2006
Hybrid rounding techniques for knapsack problems2006
Introduction2006
Non-independent randomized rounding and coloring2006
The infection time of graphs2006
An evolutionary algorithm for discrete tomography2005
Balanced vertex-orderings of graphs2005
Computing the branchwidth of interval graphs2005
Discrete tomography by convex-concave regularization and D.C. programming2005
Hamiltonian completions of sparse random graphs2005
On a bidirected relaxation for the MULTIWAY CUT problem2005
Preference modeling on totally ordered sets by the Sugeno integral2005
Structural decompositions, width parameters, and graph labelings2005
Systems of distant representatives2005
The complexity of base station positioning in cellular networks2005
Watersheds, mosaics, and the emergence paradigm2005
(2+f(n))-SAT and its properties2004
A modular approach to Sprouts2004
An algorithm for solving partial differential parametric systems2004
Approximate constrained bipartite edge coloring2004
Completeness of temporal logics over infinite intervals2004
Coordination without communication: the case of the flocking problem2004
Improved exact algorithms for MAX-SAT2004
On the average similarity degree between solutions of random k-SAT and random CSPs2004
On the distance function approach to color image enhancement2004
On the hardness of the minimum height decision tree problem2004
Trivial two-stage group testing for complexes using almost disjunct matrices2004
Approximating minimum size {1, 2}-connected network2003
Competitive Video on Demand Schedulers for Popular Movies2003
Deadlock Prevention by Acyclic Orientations2003
Dynamic maintenance and visualization of molecular surfaces2003
Edge colorings of the complete graph K149 and the lower bounds of three Ramsey numbers2003
Finding paths in graphs avoiding forbidden transitions2003
Homomorphisms of conjunctive normal forms2003
On Cutting a Few Vertices from a Graph2003
The algorithmics of folding proteins on lattices2003
Total Balancedness Condition for Steiner Tree Games2003

« prev Page 9/11 next »