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
Algorithmic aspects of switch cographs2016
A polyhedral investigation of star colorings2016
Approximation of the parallel machine scheduling problem with additional unit resources2016
Chosen IV cryptanalysis on reduced round ChaCha and Salsa2016
Clustering on k-edge-colored graphs2016
Deterministic parameterized algorithms for the Graph Motif problem2016
Directed elimination games2016
Efficient implementation of Carathéodory's theorem for the single machine scheduling polytope2016
Existentially closed graphs via permutation polynomials over finite fields2016
Hamiltonian cycles in spanning subgraphs of line graphs2016
Locating-dominating sets in twin-free graphs2016
Maximum atom-bond connectivity index with given graph parameters2016
On algorithms for enumerating BC-subtrees of unicyclic and edge-disjoint bicyclic graphs2016
On the readability of overlap digraphs2016
Polyhedral combinatorics of the K-partitioning problem with representative variables2016
Polynomial-time approximation algorithms for weighted LCS problem2016
Preface: LAGOS'13: Seventh Latin-American Algorithms, Graphs, and Optimization Symposium, Playa del Carmen, México - 20132016
Reconstructing Markov processes from independent and anonymous experiments2016
Refining the complexity of the sports elimination problem2016
Scheduling jobs with equal processing times and a single server on parallel identical machines2016
Strengthened bounds for the probability of k-out-of-n events2016
Vertex-distinguishing proper arc colorings of digraphs2016
Adjacent vertex distinguishing edge-colorings and total-colorings of the lexicographic product of graphs2015
An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems2015
A study of scheduling problems with preemptions on multi-core computers with GPU accelerators2015
Computing maximum non-crossing matching in convex bipartite graphs2015
Decycling bubble sort graphs2015
Discretization vertex orders in distance geometry2015
From preemptive to non-preemptive speed-scaling scheduling2015
Graph metric with no proper inclusion between lines2015
Internet routing between autonomous systems: Fast algorithms for path trading2015
Lifting for mixed integer programs with variable upper bounds2015
Lot sizing with minimum order quantity2015
Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks2015
On a relation between the atom-bond connectivity and the first geometric-arithmetic indices2015
On structural parameterizations for the 2-club problem2015
On the transportation problem with market choice2015
Quality bounds for binary tomography with arbitrary projection matrices2015
Scheduling under dynamic speed-scaling for minimizing weighted completion time and energy consumption2015
The decycling number of generalized Petersen graphs2015
The Pfaffian property of circulant graphs2015
A constant factor approximation algorithm for boxicity of circular arc graphs2014
Automated generation of conjectures on forbidden subgraph characterization2014
Chasing robbers on random geometric graphs - An alternative approach2014
Digraph width measures in parameterized algorithmics2014
Earliest arrival flows in networks with multiple sinks2014
Feasibility Pump-like heuristics for mixed integer problems2014
Guest editors' foreword2014
Locally injective k-colourings of planar graphs2014
Low complexity scheduling algorithms minimizing the energy for tasks with agreeable deadlines2014

« prev Page 6/11 next »