yusuke1997/dblp-id-title huggingface dataset:
A Riemann hypothesis analogue for self-dual codes
A Case Study in Algorithm Animation: Maximum Flow Algorithms
A Stubborn Attack on State Explosion
Dedekind sums: a combinatorial-geometric viewpoint
A scalable TWDM lightwave network based on generalized de Bruijn digraph
Algebraic Methods for Bounding Network Reliability
Cayley Graphs and Direct-Product Graphs
Algorithms and reformulations for lot sizing problems
Fault-tolerant design of wavelength-routed optical networks
Acquiring stress systems
On Residual Connectedness Network Reliability
Distribution of values of real quadratic zeta functions
Graph partitioning for scalable distributed graph computations
Asymptotic Results for Permutation Groups
Massively parallel DNA computation: Expansion of symbolic determinants
Some Problems of Visual Shape Recognition to Which the Application of Clustering Mathematics Might Yield Some Potential Benefits
A Data Parallel Space Dilation Algorithm for the Concentrator Location Problem
An Efficient Implementation of a Network Interior Point Method
Speeding up computations via molecular biology
Constructing cliques using restricted backtracking
Discrete and Computational Geometry: Papers from the DIMACS Special Year
Linear algebra and addictive theory
Implicitization Exploiting Sparseness
Some dynamics on the irrationals
An Experimental Implementation of the Dual Cancel and Tighten Algorithm for Minimum-Cost Network Flow
On combinatorial DNA word design
Subgraph chromatic number
Forbidding and enforcing
A New Construction of Trellis-Coded Quantizers
Fitting models of intron evolution to aldehyde dehydrogenase data
A sticker based model for DNA computation
Nurse rostering as constraint satisfaction with fuzzy constraints and inferred control strategies
Regular Triangulations of Convex Polvtopes
Covering Properties of Binary Convolutional Codes and Lattice Quantization of Uniform Sources
Actor Languages for Specification of Parallel Computations
Some remarks on the optimal level of randomization in global optimization
Diversity Embedding in Multiple Antenna Communications
A Generalisation of MacLane's Theorem to 3-graphs
Test Case Construction for the Vertex Cover Problem
Comparison of annotating duplication, tree mapping, and copying as methods to compare gene trees with species trees
The Structure of Least-Favorable Noise in Gaussian Vector Broadcast Channels
Harmonic weight enumerators of nonbinary codes and MacWilliams identities
Edge projection and the maximum cardinality stable set problem
Analytic Hausdorff gaps
Partitioning Data Sets, Proceedings of a DIMACS Workshop, Princeton, New Jersey, USA, April 19-21, 1993
Modeling Parallel Branch-and-Bound for Asynchronous Implementations
A propositional proof system for R i 2
Combinatorial Approaches to Geometric Constraint Solving: Problems, Progress, and Directions
Some applications of superrigidity to Borel equivalence relations
Linear DNA self-assembly with hairpins generates linear context-free grammars
Concurrent data structures and load balancing strategies for parallel branch-and-bound/A* algorithms
Linear and nonlinear systems: A survey
BioMath in the Schools, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, April 29-30, 2005
Localized reflection and fragments of PFA
Finite Quotients of Infinite Universal Polytopes
Preventing conflicts in input buffering baseline-based ATM switches
Introduction to Optimal Control for Discrete Time Models with an Application to Disease Modeling
Microsurveys in Discrete Probability, Proceedings of a DIMACS Workshop, Princeton, New Jersey, USA, 1997
Constructing nonblocking multicast switching networks with fanout reduction
Classification of nilpotent orbits in symmetric spaces
Designing and selecting components for nucleic acid computers
Volumes of a Random Polytope in a Convex Set
A bibliography of algorithm experimentation
Expander graphs and codes
Highly Expanding Graphs Obtained from Dihedral Groups
Using self-stabilization to design adaptive multicast protocols for mobile ad hoc networks
Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Implementation Challenges, Proceedings of a DIMACS Workshop, USA, 1999
METANET: A System for Network Analysis
A complete axiomatization of a first-order temporal logic over trace systems
Editor's Introduction
Structure and density of sparse crossbar concentrators
Noiseless Data Compression with Low-Density Parity-Check Codes
Ancestor-descendant relations and incompatible data: Motivation for research in discrete mathematics
Computations in Associative Algebras
A Discipline of Multiprogramming
Constructive recognition of a black box group isomorphic to GL(n,2)
Some History of the Development of Graffiti
The Diameter of Graphs of Convex Polytopes and f-Vector Theory
Error-resistant implementation of DNA computations
Worst-case analysis, 3-SAT decision and lower bounds: Approaches for improved SAT algorithms
A Quadratic Partial Assignment and Packing Model and Algorithm for the Airline Gate Assignment Problem
Performance of photonic slot routing networks
Graph Homomorphisms and Long Range Action
Groups And Computation, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 7-10, 1991
On the Second Eigenvalue and Linear Expansion of Regular Graphs
Operational Implication of Conditional Unity Properties
Geometric and Algorithmic Aspects of Computer-Aided Design and Manufacturing, Proceedings of a DIMACS Workshop, Piscataway, New Jersey, USA, October 7-9, 2003
A generalized ring spiral algorithm for coding fullerenes and other cubic polyhedra
Vectorized Model Checking for Computation Tree Logic
DNA-based cryptography
Regression depth and support vector machine
How to solve a Turán type extremal graph problem? (Linear decomposition)
Implementing a recognition algorithm for classical groups
Validation of Epidemiological Models: Chicken Epidemiology in the UK
Robust, Almost Constant Time Shortest-Path Queries in Road Networks
Depth-based classification for functional data
Integral zeroes of Krawtchouk polynomials
On the Competitiveness of Splay Trees: Relations to the Union-Find Problem
Use of a horizontal chain reaction for DNA-based addition
Partitioning a Rectangle into Many Sub-rectangles so that a Line can Meet only a Few
African Americans in Mathematics, Proceedings of a DIMACS Workshop, Piscataway, New Jersey, USA, June 26-28, 1996
Containment does not imply Borel reducibility
Prefix function view of states and events
Multiantenna Channels: Capacity, Coding and Signal Processing, Proceedings of a DIMACS Workshop, Piscataway, USA, October 7-9, 2002
Finding elliptic curves defined over Q of high rank
Complexity of hierarchically and 1-dimensional periodically specified problems I: Hardness results
Efficient algorithms for disjoint paths in planar graphs
Exact Edge-Colorings of Graphs without Prescribed Minors
On showing lower bounds for external-memory computational geometry problems
Real-World Applications of Shortest Path Algorithms
Unusual Applications of Number Theory, Proceedings of a DIMACS Workshop, Piscataway, New Jersey, USA, January 10-14, 2000
A polycyclic quotient algorithm
On the central role of scale invariant Poisson processes on (0, ∞)
Fast algorithms for frames and point depth
On molecular approximation algorithms for NP optimization problem
A study on the hybridization process in DNA computing
Disease Evolution: Models, Concepts, and Data Analyses, Proceedings of a DIMACS Workshop
Competitive Paging with Locality of Reference (Brief Summary)
Centers and Invariant Points of Convex Bodies
Greedy randomized adaptive search procedures for the Steiner problem in graphs
Improved results on service-constrained network design problems
Characterizing properties of some graph invariants related to electron charges in the Hückel molecular orbital theory
Order distances in tree reconstruction
Graphs, Morphisms and Statistical Physics, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, March 19-21, 2001
A DNA associative memory potentially larger than the brain
A user's guide to the mapping class group: Once punctured surfaces
Every Tree is Graceful (But Some are More Graceful than Others)
The Scope of a Logic of Authentication
A restricted genetic alphabet for DNA computing
Modeling the blocking behavior of Clos networks
On additive GF (4) codes
How good can a consensus get? Assessing the reliability of consensus trees in phylogenetic studies
Sphere packing using morphological analysis
Dissimilarity maps and substitution models: Some new results
Space-time-wavelength network with group communication locality
PERM: A Program Computing Strong Generating Sets
Efficient Computation of Isotypic Projections for the Symmetric Group 87
BSP Programming
Computing the Fitting subgroup and solvable radical for small-base permutation groups in nearly linear time
The complexity of McKay's canonical labeling algorithm
Combinatorial Roadmaps in Configuration Spaces of Simple Planar Polygons
Protocol verification with reactive Promela/Rspin
Advances in Information Recording, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, March 22-24, 2004
Towards a discipline of experimental algorithmics
Star, grid, ring topologies in facility location & network design
Practical Perfect Cryptographic Security
A cophylogenetic perspective on host-pathogen evolution
The Awakening of a High School Biology Teacher to the BioMath Connection
Superatomic Boolean algebras: Maximal rigidity
On the structure of large homothetic subsets
Fibonacci Reflections: It's Elementary!
GAP/MPI: Facilitating parallelism
Robust interprocessor connections for very-high performance
Recommended Resources for Teaching Discrete Mathematics
Variable Neighborhood Search for Extremal Graphs. 9. Bounding the Irregularity of a Graph
Drug resistance in acute viral infections: Rhinovirus as a case study
Frequent sets in the presence of clones: An example from medical surveillance
Constrained Generation of Molecular Graphs
Finiteness Conditions and Structural Construction of Automata for All Process Algebras
On achieving channels in a bipolar game
Remarks on 5-Neighbor Packings and Coverings with Circles
Parallel Algorithms for the Assignment Problem - An Experimental Evaluation of Three Distributed Algorithms
Partitioning Multiple Data Sets: Multidimensional Assignments and Lagrangian Relaxation
A minimal principle in the phase problem of X-ray crystallography
Metrical consistency
Trust Regions and Relaxations for the Quadratic Assignment Problem
Ranking algorithms for Hamiltonian paths in hypercubic networks
Computing Blocks of Imprimitivity for Small-Base Groups in Nearly Linear Time 17
A consistent example of a hereditarily c-Lindelof first countable space of size > c
Agreement metrics for trees revisited
Simple randomized Mergesort on parallel disks
New trends in the theory of graph colorings: Choosability and list coloring
Modelling and analysis of a collision avoidance protocol using Spin and Uppaal
A Graph-Theoretic Game and its Application to the k-Server Problem (Extended Abstract)
A survey of out-of-core algorithms in numerical linear algebra
A Generalization of Lovasz's 0_ Function
Verifying Liveness Properties by Verifying Safety Properties
List of Workshop Presentations
GDR: A Visualization Tool for Graph Algorithms
A new DNA separation technique with a low error rate
Perceptual Models of Small Dot Clusters
Verification of Multiprocessor Cache Protocol Using Simulation Relations and Higher-Order Logic
The Assignment Problem on Parallel Architectures
Monadic second order probabilities in algebra. Directly representable varieties and groups
Spectra, graphs, and proteins. Towards understanding of protein folding
Low density parity check lattices based on construction D' and cycle-free Tanner graphs
Stationary sets, Chang's conjecture and partition theory
A case study of de-randomization methods for combinatorial approximation algorithms
Nonblocking and almost nonblocking multicast switching networks
Algorithms in Real Algebraic Geometry and Applications to Computational Geometry
Workshop on Parallel Processing of Discrete Optimization Problems, Proceedings of a DIMACS Workshop, Princeton, New Jersey, USA, April 28-29, 1994
UNITE-An architecture for lightweight signaling in ATM networks
Statistical data depth and the graphics hardware
On Implementing Scaling Push-Relabel Algorithms for the Minimum-Cost Flow Problem
Monitoring an Algorithm's Execution
Smoothness laws for random ordered graphs
Source Coding and Parallel Routing
Geometric measures of data depth
The M-Algorithm, the Failure of Reduced-State Sequence Detection with Good Convolutional Codes, and Some Implications for Trellis Coding
Matrix Cones, Projection Representations, and Stable Set Polyhedra
Surrogate constraint analysis-new heuristics and learning schemes for satisfiability problems
Hypermetrics in geometry of numbers
A Discrete Mathematics Experience with General Mathematics Students
Connected facility location problems
An improved algorithm for exact graph coloring
A view of supertree methods
Shortest networks on spheres
Approximate solution of weighted MAX-SAT problems using GRASP
A New Method for Recognition of Structural and Functional Motifs in Protein Sequences Based on the Principal Component Analysis of Profiles of Physico-Chemical Properties
Comparative studies of constraint satisfaction and Davis-Putnam algorithms for maximum satisfiability problems
Lines in Space-A Collection of Results
Scalable group membership services for novel applications
Geometric and Computational Perspectives on Infinite Groups, Proceedings of a DIMACS Workshop, USA, 1994
Atomic Transactions for Multiprocessor Programming: A Formal Approach
Soft molecular computing
How to Show a Set is not Algebraic
A Data Path Verifier for Register Transfer Level Using Temporal Logic Language Tokio
Partial Order Methods in Verification, Proceedings of a DIMACS Workshop, Princeton, New Jersey, USA, July 24-26, 1996
Frequency assignment in mobile and radio networks
Interleaved progress, concurrent progress, and local progress
An exact quadratic 0-1 algorithm for the stable set problem
Rank tests for multivariate scale difference based on data depth
Graph coarsening and clustering on the GPU
Bandwidth allocation algorithms for tree and ring networks
The application of Promela and Spin in the BOS project
Cayley digraphs of finite cyclic groups with minimal average distance
Recognizing Properties of Periodic Graphs
Uniform Sampling Modulo a Group of Symmetries Using Markov Chain Simulation
Coupling from the past: A user's guide
On the limit values of probabilities for the first order properties of graphs
A Dynamic Programming Approach for Timing and Designing Clique Algorithms
Mixture Models for Optical Flow Computation
Multiplexed serial wireless connectivity for palmtop computers
On-line Graph Coloring
Arithmetic and logic operations with DNA
The topologically driven strand separation transition in DNA - methods of analysis and biological significance
Enumerative Real Algebraic Geometry
The asymptotic behavior of L k ∞,ω on sparse random graphs
A deterministic global optimization approach for the protein folding problem
A general stochastic approach to solving problems with hard and soft constraints
Complexity of morpheme acquisition
Logic and Discrete Mathematics in the Schools
A non-constructive recognition algorithm for the special linear and other classical groups
Sequence alignment and phylogeny construction
Graceful matchings in finite fields, the factor-difference sets of integers, and integers of the form a 2 + kb 2
Branching Time Regular Temporal Logic for Model Checking with Linear Time Complexity
DNA computations can have global memory
Workshop Program
Descriptive Epidemiology: A Brief Introduction
Estimates of the distance distribution of nonbinary codes, with applications
The Impact of Discrete Mathematics in My Classroom
Partial order reduction: Linear and branching temporal logics and process algebras
Acyclic improper colourings of graphs with bounded degree
Relative size of certain polynomial time solvable subclasses of satisfiability
A GRASP clustering technique for circuit partitioning
Random Remarks on Permutation Group Algorithms
Proof Complexity and Feasible Arithmetics, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, April 21-24, 1996
Language acquisition in the MDL framework
Object-oriented implementation of heuristic search methods for Graph Coloring, Maximum Clique, and Satisfiability
Fault-tolerant Kautz networks
The *Socrates massively parallel chess program
On mobility and agents
Generalized Contingency Tables and Concept Lattices
Implementation of a Combinatorial Multicommodity Flow Algorithm
A Genetic Algorithm for a Special Class of the Quadratic Assignment Problem
Research at ASMSA Based on the DIMACS BioMath Program
Ramanujan Graphs and Diagrams Function Field Approach
Algebraic Propositional Proof Systems
A bird's-eye view of uniform spanning trees and forests
Dirty paper coding: Perturbing off the infinite dimensional lattice limit
Geometric Partitioning and its Applications
Physical chemistry of nucleic acid hybridization
Descriptive Complexity and Finite Models, Proceedings of a DIMACS Workshop 1996, Princeton, New Jersey, USA, January 14-17, 1996
Minimization of the number of breaks in sports scheduling problems using constraint programming
The Use of Binomial Monments for Bounding Network Reliability
Protein folding, spin glass and computational complexity
On Irregular Data Structures and Asynchronous Parallel Brand and Bound Algorithms
Liposome mediated biomolecular computation
On the mixing rate of the triangulation walk
Application of Computational Tools for Finitely Presented Groups
Using Hadwiger numbers in network design
On the capacity of two-dimensional weight-constrained memories
How to Choose K Entities Among N
Capacity bounds for Gaussian vector broadcast channels
Implementations of the Goldberg-Tarjan Maximum Flow Algorithm
Towards parallel evaluation and learning of Boolean μ-formulas with molecules
The Viro Method Applied with Quadratic Transforms
Vertex Degrees in Planar Graphs
Refinement with global equivalence proofs in temporal logic
Reliability Of Computer And Communication Networks, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, December 2-4, 1989
Satisfiability Problem: Theory and Applications, Proceedings of a DIMACS Workshop, Piscataway, New Jersey, USA, March 11-13, 1996
Algebraic Languages: A Bridge between Combinatorics and Computer Science
DNA implementation of nondeterminism
C/D model: A computational model of phonetic implementation
On New Didactics of Mathematics: Learning Graph Theory via Graffiti
On the distribution of sums of vectors in general position
Sparse dynamic programming for maximum agreement subtree problem
Dr. J. Ernest Wilkins, Jr.: The man and his works
Reducible properties and uniquely partitionable graphs
Error correction in DNA computing: Misclassification and strand loss
A Multistage Approach for Scheduling Task Graphs on Parallel Machines
Mining Online Media for Global Disease Outbreak Monitoring
Discrete mathematics in medical imaging: A personal view
Parallel Algorithms, Proceedings of a DIMACS Workshop, Brunswick, New Jersey, USA, October 17-18, 1994
An approximation scheme for scheduling of malleable parallel tasks
Breadth First Search on Massive Graphs
Extending a Graph Browser for Topological Graph Theory
A New Lower Bound Theorem for Read-Only-Once Branching Programs and its Applications
Locally Random Reductions in Interactive Complexity Theory
A simple toolkit for DNA fragment assembly
Highly adaptive wormhole routing algorithms for N-dimensional torus
Graph Searching, Path-Width, Tree-Width and Related Problems (A Survey)
Implementing Finite State Machines
Towards a theory of holistic clustering
Supporting transaction service handoff in mobile environments
On scale curves for nonparametric description of dispersion
A Zonotope Associated with Graphical Degree Sequences
High quality graph partitioning
Insights from Price's equation into evolutionary epidemiology
Discrete Mathematics: A Fresh Start for Secondary Students
An Algebra for Delay-Insensitive Circuits
A Markovian Method Common to Both Quantization and Decoding Using Convolutional Codes
Bounded arithmetic: Comparison of Buss' witnessing method and Sieg's Herbrand analysis
Memory efficient state storage in Spin
Numbers of Faces and Boundary Encodings of Patches
Ranking arithmetic proofs by implicit ramification
A Game-theoretic Look at the Gaussian Multiaccess Channel
Supporting adaptive-QOS over multiple time scales in wireless networks
Topological minors in graphs of minimum degree n
Multilevel expander codes
Maximum cuts and largest bipartite subgraphs
A Labeling Algorithm for Minimum Sum of Diameters Partitioning of Graphs
Challenges in UWB signaling for adhoc networking
Generalized FFT's- A survey of some recent results
Global optimization methods for protein folding problems
History dependent verification for partial order systems
On an algebraic method for bounding the covering radius
The Exact Rational Univariate Representation for Detecting Degeneracies
Constructing optical networks using combinatorial designs
Discrete Mathematics and Public Perceptions of Mathematics
The Arrovian program from weak orders to hierarchical and tree-like relations
DNA Physical Mapping, Flows in Networks and Minimum Cycles Mean in Graphs
Partial order verification with PEP
Specifying Parallel Programs in a Functional Language: The EPL Experience
Computer Software for the Teaching of Discrete Mathematics in the Schools
Krohn-Rhodes theory, hierarchies & evolution
Spanning Trees of Different Weights
The Clar and Fries problems for benzenoid hydrocarbons are linear programs
Using Partial-Order Semantics to Avoid the State Explosion Problem in Asynchronous Systems
Practical problem solving with cutting plane algorithms in combinatorialoptimization
A better upper bound for the unsatisfiability threshold
More icosahedral fulleroids
A new approach to the design of digital communication systems
Teaching Bioinformatics and Genomics: An Interdisciplinary Approach
Building Categorical Data Type Programs
Large plateaus and plateau search in Boolean Satisfiability problems: When to give up searching and start again
Fast Algorithm for Optimal Aligning of Symbol Sequences
On-Line Algorithms, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, February 11-13, 1991
Average-case bounds for the complexity of path-search
A Beginning Experience: Linking High School Biology and Mathematics
Finite Models, Automata, and Circuit Complexity
Constructive Approaches to Representation Theorems in Finitely Generated Real Algebras
Coding Theorems for the Sensor Reachback Problem with Partially Cooperating Nodes
Decoding on a Finite State Transition Diagram While Avoiding a Sub-Diagram
An Implementation of a Shortest Augmenting Path Algorithm for the Assignment Problem
Algebraic Coding Theory and Information Theory, Proceedings of a DIMACS Workshop, Piscataway, New Jersey, USA, December 15-18, 2003
A Survey on Double Loop Networks
Communication aspects of fat-tree-based interconnection networks for multicomputers
On 3-rate rearrangeability of Clos networks
Results on the Interface between Formal Verification and ATPG
On the Duality of Coding and Quantizing
Navigating in Unfamiliar Geometric Terrain (Extended Summary)
Visual Computations and Dot Cluster
Near model completeness and 0-1 laws
Computation of half-space depth using simulated annealing
Flipping: A supertree construction method
Combinatorial Optimization, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, 1992/93
Verifying Temporal Properties of Sequential Machines without Building Their State Diagrams
Intersection graphs of Jordan arcs
Visibility Computations: From Discrete Algorithms to Real Algebraic Geometry
A continuous based heuristic for the maximum clique problem
A Practical Parallel Programming Model
DNA based molecular computation: Template-template interactions in PCR
Why is Modal Logic So Robustly Decidable?
Points Sets with Small Integral Distances
What We've Got Here is a Failure to Cooperate
Meaningless statements