yusuke1997/dblp-id-title huggingface dataset:
Plethysm, Partitions with an Even Number of Blocks and Euler Numbers
Energy directed conformational search of protein loops and segments
Model Checking and the Mu-calculus
On PHP st -connectivity, and odd charged graphs
Multithreaded constraint programming: A hybrid approach
The Concurrency Factory - Practical Tools for Specification, Stimulation, Verification, and Implementation of Concurrent Systems
On topological hierarchies of temporal properties
Universal DNA computing models based on the splicing operation
On hypercycles and hypercircuits in hypergraphs
DNA Based Computers, Proceedings of a DIMACS Workshop, Princeton, New Jersey, USA, April 4, 1995
Standardizing nonstandard methods for upper Banach density problems
Optimal node assignment in reconfigurable WDM lightwave networks with regular virtual topologies
Network clustering via clique relaxations: A community based approach
Single-Source Shortest Paths with the Parallel Boost Graph Library
Cryptographic authentication for real-time network protocols
On the Perimeter of a Point Set in the Plane
Computational Support for Discrete Mathematics, Proceedings of a DIMACS Workshop, Piscataway, New Jersey, USA, March 12-14, 1992
Foldedness in linear polymers: A difference between graphical and Euclidean distances
A Survey of Research in Automated Mathematical Conjecture-Making
Discrete Mathematics: A Vehicle for Problem Solving and Excitement
Towards a simple construction method for Hamiltonian decomposition of the hypercube
On perfect constant weight codes
Prediction of Protein-Coding Regions in DNA of Higher Eukaryotes
The Status of Discrete Mathematics in the High Schools
Feeback in Discrete Communication
The construction of globally optimal ordered partitions
Partitioning by Maximum Adjacency Search of Graphs
Primal-dual algorithms for data depth
The complexity of an inverse shortest paths problem
Rational-function-valued Valuations on Polyhedra
Flattening a Rooted Tree
On Some Implementation of Optimal Simulations
The Role of Applications in Teaching Discrete Mathematics
On the Chromatic Index of Multigraphs and a Conjecture of Seymour, (II)
Factoring Integers and Computing Discrete Logarithms via Diophantine Approximation
Randomized initialization protocols for packet radio networks
A simulation and validation tool for self-stabilizing protocols
Conflict-free access to constant-perimeter, rectangular, subarrays
A constraint programming pre-processor for a bus driver scheduling system
Universal computation via self-assembly of DNA: Some theory and experiments
Generalized Theta Functions for Lattice Vector Quantization
The Paths-Selection
Multiple trees: Fitting two or more tree structures to proximity data
Block-Constrained Quantization: Asymptotic Analysis
Using helpful sets to improve graph bisections
An efficient algorithm for determining fixed bonds and normal components in a bipartite graph
How Far Is, Should and Could Be Conjecture-Making in Graph Theory an Automated Process?
Performance Evaluation of the MINET Minimum Cost Netflow Solver
A molecular computation of the road coloring problem
Complexity of restricted and unrestricted models of molecular computation
The Optimality of the Natural Binary Code
Stubborn set methods for process algebras
The Optimal Multiterminal Cut Problem
Multirate broadcast switching networks nonblocking in a wide sense
Extension of the Karp and Miller Procedure to LOTOS Specifications
Tools for Mathematical Epidemiology
On the Complexity of Branch and Cut Methods for the Traveling Salesman Problem
The perils of polynucleotides: The experimental gap between the design and assembly of unusual DNA structures
Greedy Algorithms in Economic Epidemiology
Rapide: A language and toolset for simulation of distributed systems by partial orderings of events
Global optimization approaches in protein folding and peptide docking
Achieving consensus of long genomic sequences with the W -curve
Bodies of Constant Width in Riemannian Manifolds and Spaces of Constant Curvature
Geometry of Spaces of Homogeneous Polynomials on Banach Lattices
Verifying privacy enhanced mail functions with higher order logic
External memory techniques for isosurface extraction in scientific visualization
The Algebraic Feedback Product of Automata. A State Machine Based Model of Concurrent Systems
What Forms Do Interesting Conjectures Have in Graph Theory?
Specification and Development of Parallel Algorithms with the Proteus System
The polynomial time decidability of simulation relations for finite processes: A HORNSAT based approach
Visual Searching and Mapping
Broadband MIMO channel model for realistic capacity and system performance evaluations
Network Assistant to Construct, Test, and Analyze Graph Network Algorithms
Tool Support for the Refinement Calculus
Computing on data streams
A universal molecular computer
Connected components on distributed memory machines
Quadratic Assignment and Related Problems, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, May 20-21, 1993
Subjective Contours in Early Vision and Beyond
Presheaves as transition systems
Distribution of MIMO capacity in the presence of correlated signals and interferers: A (not so) large N analysis
Security against Replay Chosen-Ciphertext Attack
Wu-Ritt Characteristic Sets and Their Complexity
k -universal finite graphs
Two-stage group testing for complexes in the presence of errors
The efficiency of sequence-specific separation of DNA mixtures for biological computing
A model for learning human vascular anatomy
On homogeneous linear recurrence relations and approximation of zeros of complex polynomials
A Program Building Tool for Parallel Applications
Experimenting and computing with infinite groups
Watson-Crick finite automata
Numerical solutions of the Laplace equation in chemical spaces
Towards a Theory of Cryptographic Systems: A Critique of Crypto-Complexity
On maximum clique problems in very large graphs
Local search strategies for satisfiability testing
Patterns of Dependence Among Powers of Polynomials
Uniquely Remotal Hulls
Algorithms for the satisfiability (SAT) problem: A survey
Breaking DES using a molecular computer
Lattice-Structured Codebooks-Construction and Implementation for Memoryless Sources
Appendix A: Electronically Available Materials
The design and performance of mobile TCP for wireless networks
Compositional Minimization of Finite State Systems
State space compression with graph encoded sets
Dense bus networks of diameter 2
Distributed Computing And Cryptography, Proceedings of a DIMACS Workshop, Princeton, New Jersey, USA, October 4-6, 1989
Genetic Hybrids for the Quadratic Assignment Problem
On the maximum lengths of Davenport-Schinzel sequences
Computing Composition Series in Primitive Groups
On Sign-Nonsingular Matrices and the Conversion of the Permanent into the Determinant
Consensus list colorings of graphs and physical mapping of DNA
A frequency assignment problem in cellular phone networks
Experiments with polynomial-time CLIQUE approximation algorithms on very large graphs
Counting List Homomorphisms and Graphs with Bounded Degrees
Formal power series arising from multiplication of quantum integers
DNA hybridization catalysts and molecular tweezers
Structure of Social Contact Networks and Their Impact on Epidemics
On Weighted Graph Homomorphisms
Some applications of generalized FFT's
On the costs and benefits of using partial-order methods for the verification of concurrent systems
The isomorphism problem for circulant graphs via Schur ring theory
A Survey of Subdivision-Based Tools for Surface Modeling
Flexible, extensible Java security using digital signatures
Discrete Mathematical Problems with Medical Applications, Proceedings of a DIMACS Workshop, December 8-10, 1999
E -optimal solutions to distance geometry problems via global continuation
Polyhedral Combinatorics, Proceedings of a DIMACS Workshop, Morristown, New Jersey, USA, June 12-16, 1989
The Quadratic Assignment Problem: A Survey and Recent Developments
Backtracking and probing
Finite Unions of Closed Subgroups of the n-Dimensional Torus
Discrete Mathematics Activities for Middle School
Spectral Geometry and the Cheeger Constant
Creating 3-dimensional graph structures with DNA
Virtual-credit: Efficient end-to-end credit based flow control
Bandwidth-power tradeoff of multi-antenna systems in the low-power regime
Contents (in alphabetical order by author)
Survey: Information Flow on Trees
Mass Properties of the Union of Millions of Identical Cubes
On Existence Proofs for Asymptotically Good 15 Euclidean-Space Group Codes
Sclability of Massively Parallel Depth-First Search
The Geometry Center Workshop
Elements of Computational Metrology
On the number of wavelengths required to embed multicast assignments in WDM networks
Partially persistent dynamic sets for history-sensitive heuristics
New Anticipatory Load Balancing Strategies for Parallel A* Algorithms
Outline for an operational semantics of Promela
Solution to 3-SAT by breadth first search
Syndrome-Based VQ Codebooks
Large scale combinatorial optimization: A methodological viewpoint
Thermodynamics and kinetics of protein folding
On the Sampling Problem for H-Colorings on the Hypercubic Lattice
The median function on weak hierarchies
Making a Difference with Difference Equations
Self-reflection principles and NP-hardness
On Necessary Conditions for Secure Distributed Computation
Formal languages and number theory
Nearest neighbor search for data compression
Proving Correctness for Balancing Networks
Randomized and deterministic local search for SAT and scheduling problems
A Fast Implementation of a Path-Following Algorithm for Maximizing a Linear Function over a Network Polytope
Sweeping Arrangements of Curves
Discrete Methods in Epidemiology, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, March 18-19, 2004
I/O-optimal computation of segment intersections
TLA in Pictures
Do Projections Go to Infinity?
When and how n choose k
Improved Linear Programming-based Lower Bounds for the Quadratic Assignment Proglem
Satisfiability testing with more reasoning and less guessing
The K-Server Dual and Loose Competitiveness for Paging
Fast Fourier Transforms for Symmetric Groups
Using QAP Bounds for the Circulant TSP to Design Reconfigurable
On nearly linear time algorithms for Sylow subgroups of small basepermutation groups
A Parallel Algorithm for Computing all Homomorphisms of Deterministic Finite Automata
The Server Problem and On-Line Games
Foreword xiIntroduction to the Second DIMACS Challenge: Cliques, coloring, and satisfiability
A Comprehensive View of Discrete Mathematics: Chapter 14 of the New Jersey Mathematics Curriculum Framework
Notes on Geometric Graph Theory
A solution of an interleaving decision problem by a partial order technique
The Role of Computer Science and Discrete Mathematics in the High School Curriculum
Local parallel biomolecular computation
Characterizing bit permutation networks
Implementing on O(/NM) Cardinality Matching Algorithm
Numerical Investigation of the Spectrum for Certain Families of Cayley Graphs
Application of Group Theory to Combinatorial Searches
Parallel strategies for DNA manipulation and analysis
Solving MAX-SAT with non-oblivious functions and history-based heuristics
Global minimization on rugged energy landscapes
Reach for A*: Shortest Path Algorithms with Preprocessing
2D DNA self-assembly for satisfiability
Synopsis data structures for massive data sets
Can We Explain the Faithful Communication of Genetic Information?
Gossiping in WDM all-optical square mesh networks
Makespan Minimization of task graphs with random task running times
On networks of two-way channels
A Discrete Non-Pfaffian Approach to the Ising Problem
Codes and Association Schemes, Proceedings of a DIMACS Workshop, Piscataway, New Jersey, USA, November 9-12, 1999
The Combinatorics of Bivariate Splines
Developing Molecular Dynamics Simulation Codes Using Mixed Language Programming
Data Storage and Processing in Cells: An Information Theoretic Approach
Exact Upper Bounds for the Number of Faces in d-Dimensional Voronoi Diagrams
Computational Topology and Swept Volumes
Representation of stereochemistry using combinatorial maps
On Lehman's Width-Length Characterization
In vitro selection for a OneMax DNA evolutionary computation
Chromatic Numbers of Products of Tournaments: FractionalAspects of Hedetniemi's Conjecture
A Graphics System for Displaying Finite Quotients of Finitely Presented Groups 113
A surface-based DNA algorithm for minimal set cover
A survey of the role of multicommodity flow and randomization in network design and routing
Algorithms for group actions applied to graph generation
Efficient multihop broadcast for wideband systems
Perfect Graphs for Generalized Colouring-Circular Perfect Graphs
Nonpure Shellability, f-Vectors, Subspace Arrangements and Complexity
Gradient-constrained minimal Steiner trees
Multicolored graphs on countable ordinals of finite exponent
Indexes of spherical codes
Goldberg's Algorithm for Maximum Flow in Perspective: A Computational Study
The Warwick automatic groups software
Formal Verification of Digital Circuits Using Symbolic Ternary System Models
Constrained spanning tree problems: Approximate methods and parallel computation
Unbounded Loss in Writing on Dirty Paper is Possible
Efficient wavelength routing in trees with low-degree converters
Random Walks and Graph Homomorphisms
Difficulties of Exact Methods for Solving the Quadratic Assignment Problem
Boolean Decomposition Schemes and the Complexity of Reliability Computations
Biography of Victor Klee
An Experimental Comparison of Two Maximum Cardinality Matching Programs
The influence of anti-viral drug therapy on the evolution of HIV-1 pathogens
Formal Definitions for Secure Distributed Protocols
The Boundary of Young Lattice and Random Young Tableaux
Exponential lower bounds for semantic resolution
Trellis Codes, Symbolic Dynamics, and Isometries
The generalized matching problem on partial $k$-trees
A Constructive Method to Improve Lower Bounds for the Quadratic Assignment Problem
Secure Policy Enforcement in Internetworks
Depth functions in nonparametric multivariate inference
Information leakage in encrypted key exchange
Network Design: Connectivity and Facilities Location, Proceedings of a DIMACS Workshop, Princetin, New Jersey, USA, April 28-30, 1997
Polyhedral Approaches to Network Survivability
Program Verification by Symbolic Execution of Hyperfinite Ideal Machines
Transition systems with independence and multi-arcs
RNA based computing: Some examples from RNA catalysis and RNA editing
Discovering Optimization Algorithms Through Automated Learning
Graph Partitions and Concept Lattices
Geometric Vector Quantization for Subband-Based Video Coding
Mathematical Support for Molecular Biology, Proceedings from the DIMACS Special Year, 1998
Reducing the graphical Steiner problem with a sensitivity test
Channels: Avoiding unwanted electronic mail
Timing-based connection management
A top-down method for building genome classification trees with linear binary hierarchies
Special presentations for finite soluble groups and computing(pre-) Frattini subgroups
Parallel implementation of algorithms for finding connected components in graphs
Combinatorial Characterizations of Algebraic Sets
The Median Procedure for Partitions
Parallel operations in DNA-based computation
Formal languages and infinite groups
Mathematical Biology: Tools for Inquiry on the Internet
Strategies for DNA computing
Local search for channel assignment in cellular mobile networks
Within-host pathogen dynamics: Some ecological and evolutionary consequences of transients, dispersal mode, and within-host spatial heterogeneity
On the Distribution of the Maximum Similarity Score for Fragments of Two Random Sequences
Program Result Checking against Adaptive Programs and in Cryptographic Settings
Rotationally Invariant Multilevel Codes
Concrete software libraries
Non-blocking multistage interconnection networks with limited depth
Interactive Conjecturing with Vega
On limited wavelength conversion in optical ring networks
Codes over Z p n and association schemes
Lower Bounds for On-line Graph Coloring
Graph Theoretical Results Obtained by the Support of the Expert System "Graph" - An Extended Survey
MRP supertree construction in the consensus setting
Lower bounds on Nullstellensatz proofs via designs
Existentially Polytime Theorems
Induced monochromatic subconfigurations
Mathematical Methods Of Analysis Of Biopolymer Sequences, Proceedings of a DIMACS Workshop
Data Compression and the Use of Vector Operations for the Fast Search Problems in Analysis of Biological Sequences
Advances In Computational Complexity Theory, Proceedings of a DIMACS Workshop, New Jersey, USA, December 3-7, 1990
On Automatically Distinguishing Inequivalent Processes
Chordal Completions of Grids and Planar Graphs
Transparent en-route cache location for regular networks
Machinability: Geometric Reasoning for Cutting
Exploring the k-colorable landscape with Iterated Greedy
Tree-valued Markov chains and Poisson-Galton-Watson distributions
Writing on dirty tape with LDPC codes
The Visual Perception of Surfaces, their Properties and Relationships
Experimental progress in computation by self-assembly of DNA tilings
Carbon networks on cubic infinite periodic minimal surfaces
Complete hierarchical cut-clustering: A case study on expansion and modularity
A Bound on the Zero-Error List Coding Capacity
Fair Games against an All-Powerful Adversary
Finding hard instances of the satisfiability problem: A survey
Basic methods for modeling the invasion and spread of contagious diseases
Connected components algorithms for mesh-connected parallel computers
Propositional search efficiency and first-order theorem proving
Finding minimum weighted generators of a path system
On Generic Global Rigidity
Influences on Breast Cancer Survival via SVM Classification in the SEER Database
Liveness Analysis and the Automatic Generation of Concurrent Programs
On the Satisfiability of Random k-Horn Formulae
A new look at tree models for multiple sequence alignment
On the Number of Connected Components of the Relative Closure of a Semi-Pfaffian Family
Restricted routing and wide diameter of the cycle prefix network
Not checking for closure under stuttering
Algorithmic and Quantitative Aspects of Real Algebraic Geometry in Mathematics and Computer Science, Proceedings of a DIMACS Workshop, Piscataway, NJ, USA, March 12-16, 2001
Computing the Center of Planar Point Sets
Quantitative Reliability Analysis of Redundant Multistage Interconnection Networks
The Design of Fininte-State Machines for Quantization Using Simulated Anealing
Extended Euler-Poincare Relations for Cell Complexes
Recent Results on Parameterized H-Colorings
The Steiner tree problem for terminals on the boundary of a rectilinear polygon
Design of broadband virtual private networks: Model and heuristics for the B-WiN
The Shortest Path Problem, Proceedings of a DIMACS Workshop, Piscataway, New Jersey, USA, November 13-14, 2006
Distance and Trees in High School Biology and Mathematics Classrooms
Stack and Queue Layouts of Directed Planar Graphs
Constructing permutation representations for matrix groups in parallel environments
Dynamical percolation: Early results and open problems
Non-blocking routing properties of Clos networks
On Disjoint Homotopic Paths in the Plane
An application of seriation to agent development consensus: A genetic algorithm approach
Characterization and Description of Basic Semialgebraic Sets
On Geometric Permutations and the Katchalski-Lewis Conjecture on Partial Transversals for Translates
Memory Efficient Algorithms for the Verification of Temporal Properties
Language Computations, Proceedings of a DIMACS Workshop, Princeton, New Jersey, USA , March 20-22, 1992
An ensemble learning strategy for graph clustering
Applications of isometric embeddings to chemical graphs
Extended generalized shuffle networks: Sufficient conditions for strictly nonblocking operation
Unusual applications of quadratic Gaussian sums
Evolutionary and dynamic models of infection with internal host structure
Couplings for normal approximations with Stein's method
An approximation algorithm for minimum-cost network design
Parallel algorithms for geometric dominance problems
A representation of protocol attacks for risk assessment
From Hyperbolic Reflections to Finite Groups
A survey on combinatorial group testing algorithms with applications to DNA Library Screening
Survey of binary Krawtchouk polynomials
Stochastic Quadratic Assignment Problems
Multiple Description Scalar Quantizer Design: Good Index Assignments
Discrete Mathematics is Already in the Classroom - But It's Hiding
Beyond Computable Functions or Escape from the Turing Tarpit
Algebraic and Analytic Approaches for the Genus Series for 2-Cell Embeddings on Orientable and Nonorientable Surfaces
Some numerical methods for a maximum entropy problem
Using Discrete Mathematics to Give Remedial Students a Second Chance
Parallel Matching Complexity of Ramsey's Theorem
The Geometric Complementarity Problem and Transcending Stationarity in Global Optimization
Graph entropy: A survey
An O(N 1.695 ) permutation routing algorithm on augmented data manipulators
Breast cancer survival and chemotherapy: A support vector machine analysis
Modulation Coding for a Two-Dimensional Optical Storage Channel
Nonlinear and mixed-integer optimization in chemical process network systems
Table-Driven Decoding of Convolutional Codes with Soft Decision
A theoretician's guide to the experimental analysis of algorithms
Learning algorithms generating multigranular hierarchies
Web security: A high level view
The Laplacian of a Hypergraph
Parallel Shortest Path Algorithms for Solving Large-Scale Instances
Medical applications of discrete tomography
Fountain codes for lossless data compression
Constraint Programming and Large Scale Discrete Optimization, Proceedings of a DIMACS Workshop, Princeton, New Jersey, USA, September 14-17, 1998
Trust and security: A new look at the Byzantine generals problem
A quantifier-free theory based on a string algebra for NC 1
Measures of F -Stars in Finitely Starlike Sets
Coloring by tabu branch and bound
A Survey of Combinatorial Problems in Lie Algebra Homolgy
Maximum-likelihood decoding and integer least-squares: The expected complexity
Enumeration of Degree Restricted Rooted Maps on the Sphere
A study of 3D imaging approaches in medicine
Counting RNA Patterns in the Classroom: A Link Between Molecular Biology and Enumerative Combinatorics
Inferring evolutionary trees from polymorphic characters, and an analysis of the Indo-European family of languages
An Information-Theoretic Approach to Bit-Stuffing for Network Protocols
A personal history of the origins of the National Association of Mathematicians' "Presentations by Recipients of Recent Ph.D.'s"
A Statistical Adversary for On-line Algorithms
General properties of stress and metrical structure
Test Sets for Integer Programs, 0_ Sentences
On the distribution of the power generator modulo a prime power
Applications of Polyhedral Combinatorics to Multicommodity Flowsand Compact Surfaces
Arrangements in Topology
Cycles, Cocycles and Diagonals: A Characterization of Planar Graphs
Easier Ways to Win Logical Games
A constraint-based approach to satellite scheduling
Implementing the Standards: Let's Focus on the First Four
On the Number of Antipodal or Strictly Antipodal Pairs of Points in Finite Subsets Of Rd
Approximating the structures accepted by a constant depth circuit or satisfying a sentence-a nonstandard approach
Weakly biased arrays, almost independent arrays and error-correcting codes
Job Scheduling and Multiple Access
Implications of Parallel Architectures for Permutation Group Computations 293
Biostatistical Challenges in Molecular Data Analysis
Use of graph invariants in QMSA and predictive toxicology
Graph Tool - A Tool for Interactive Design and Manipulation of Graphs and Graph Algorithms
At the crossroads of DNA computing and formal languages: Characterizing recursively enumerable languages using insertion-deletion systems
Recursively Indexed Differential Pulse Code Modulation
Lower Bounds and Real Algebraic Geometry
High-Performance Multi-Level Routing
The Densest Double-Lattice Packing of a Convex Polygon