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
Annealed replication: a new heuristic for the maximum clique problem2002
On-line scheduling with precedence constraints2002
On the upper chromatic number of (v3, b2)-configurations2002
A multi-scale algorithm for drawing graphs nicely2001
Fixed-parameter complexity of lambda-labelings2001
k-p-Infix codes and semaphore codes2001
Lower bounds for computing geometric spanners and approximate shortest paths2001
Minimum convex partition of a constrained point set2001
On mixing of certain random walks, cutoff phenomenon and sharp threshold of random matroid processes2001
On the structure of Skipjack2001
Recursive bounds for perfect hashing2001
Upgrading bottleneck constrained forests2001
A polyhedral approach to sequence alignment problems2000
Asymptotically optimal erasure-resilient codes for large disk arrays2000
General lower bounds on the query complexity within the exact learning model2000
How to Survive While Visiting a Graph2000
Independent Sets with Domination Constraints2000
Local rule mechanism for selecting icosahedral shell geometry2000
On (d, 2)-dominating numbers of binary undirected de Bruijn graphs2000
On the computational complexity of edge concentration2000
An 0.828-approximation Algorithm for the Uncapacitated Facility Location Problem1999
Bidual Horn Functions and Extensions1999
How to Count Efficiently all Affine Roots of a Polynomial System1999
Optimal Point-to-point Broadcast Algorithms Via Lopsided Trees1999
Precedence Constrained Scheduling to Minimize Sum of Weighted Completion Times on a Single Machine1999
Separable Partitions1999
Transistor Chaining in Static CMOS Functional Cells of Arbitrary Planar Topology1999
A 2 2/3 Superstring Approximation Algorithm1998
A Graph-theoretic Generalization of the Sauer-Shelah Lemma1998
Approximation Algorithms for Multiple Sequence Alignment Under a Fixed Evolutionary Tree1998
Combinatorial Variability of Vapnik-chervonenkis Classes with Applications to Sample Compression Schemes1998
On the Approximability of the Steiner Tree Problem in Phylogeny1998
On the Average Hamming Distance for Binary Codes1998
On the Complexity and Approximation of Syntenic Distance1998
Special Issue of DAM on the Vapnik-chervonenkis Dimension1998
T-choosability in Graphs1998
A Sufficient Condition for Polynomial Distribution-dependent Learnability1997
Reliability Evaluation of Large Telecommunication Networks1997
Some Models for Scheduling Parallel Programs with Communication Delays1997
Transversal Partitioning in Balanced Hypergraphs1997
Efficient Approximation Algorithms for Domatic Partition and on-line Coloring of Circular Arc Graphs1996
Nonoverlapping Local Alignments (weighted Independent Sets of Axis-parallel Rectangles)1996
On Edge-colored Interior Planar Graphs on a Circle and the Expected Number of RNA Secondary Structures1996
On the Computational Power of DNA1996
Representation Theory and Invariant Neural Networks1996
Shuffling Biological Sequences1996
Sorting with Fixed-length Reversals1996
Covering with Latin Transversals1995
Enumeration of Difference Graphs1995
On Specifying Boolean Functions by Labelled Examples1995

« prev Page 10/11 next »