yusuke1997/dblp-id-title huggingface dataset:
Solvable Classes of Generalized Traveling Salesman Polytope
Finding large cliques in arbitrary graphs by bipartite matching
Lower bounds on sizes of cutting plane proofs for modular coloring principles
Open Questions, Talk Abstracts, and Summary of Discussions
Sequence alignment in molecular biology
Online Weighted Matching
Three for the Money: An Hour in the Classroom
Parallel community detection for massive graphs
Analysis of magnetic resonance angiography images using skeletonization and distance transforms
Symmetric Solutions to Isoperimetric Problems for Polytopes
On the Classification of Monotone-Equivariant Cluster Methods
On The Representation and Characterization of Fullerene C60
Repackable networks-The concept and applications
A Survey of Noncommutative Rational Series
On the Massively Parallel Solution of Linear Network Flow Problems
Geometrical and combinatorial questions about fullerenes
Domination & Separation Applied to the Quadratic Assignment Proglem
Adaptive cycle time for real-time TWDM: Tool and performance analysis
Tabu search and a quadratic relaxation for the Satisfiability problem
Competitive Group Testing
Permutation Groups and Polynomial-Time Computation
Recognizing the Hidden Structure of Cayley Graphs
Query Optimization and Processing in Parallel Databases
Efficient schemes for distributing data on parallel memory systems
A spacetime architectural superstructure enabling efficient multiple antenna communication
What is Discrete Mathematics? The Many Answers
Routing in Optical networks: The problem of contention
Wet splicing systems
Specification of Parallel Algorithms, Proceedings of a DIMACS Workshop, Princeton, New Jersey, USA, May 9-11, 1994
Advanced Search Techniques for Circuit Partitioning
Some approaches to the multiple-minima problem in protein folding
Temporal Logic Model Checking: Two Techniques for Avoiding the State Explosion Problem
New 1-generator quasi-twisted codes over GF (5)
Workshop on Interconnection Networks and Mapping and Scheduling Parallel Computations, Proceedings of a DIMACS Workshop, Piscataway, New Jersey, USA, February 7-9, 1994
Multidimensional Assignments and Multitarget Tracking
Advances in Switching Networks, Proceedings of a DIMACS Workshop,Princeton, New Jersey, USA, July 7-9, 1997
Ultrafast Shortest-Path Queries via Transit Nodes
The challenge of diversity
Metric Geometry: Connections with Combinatorics
PAPETRI: Environment for the Analysis of PETRI Nets
Computation with DNA: Matrix multiplication
Combinatorial Tools for Computational Group Theory
Organization and Storage of Information in Molecular Genetics Data Banks
Communications in optically interconnected parallel computer systems
On Algorithms for Simple Stochastic Games
Image Segmentation Based on Optimal Layering for Precision Tracking
Blocking behaviors of broadcast switching networks in random traffics
Teams can see pomsets
Immobilization: Analysis, Existence, and Output- Sensitive Synthesis
Contiguity-Constrained Hierarchical Clustering
Submanifolds of the Cube
On conflict-free channel set assignments for optical cluster-based hypercube networks
When the Knight falls: On constructing an RNA computer
Formal Calculus and Enumerative Combinatorics
Communication complexity and orthogonal polynomials
Implementing an eventually-serializable data service as a distributed system building block
Performance of a new decomposition algorithm for rearrangeable fault-tolerant Clos interconnection networks under sub-maximal and no-fault conditions
Shape optimizing load balancing for MPI-parallel adaptive numerical simulations
How to combine a column and row generation method with a column or row elimination procedure-Application to a channel assignment problem
An Introduction to Optimal Control with an Application in Disease Modeling
Some Algebraic Constructions of Dense Graphs of Large Girth and of Large Size
Qualitative Analysis of Schur Complements
Approximating dense cases of covering problems
Lattice paths and RNA secondary structures
Beyond the method of bounded differences
Discrete mathematics for combinatorial chemistry
A multispace search algorithm for molecular energy minimization
(3-6)-cages, hexagonal toroidal cages, and their spectra
Agreement Subtrees, Metric and Consensus for Labeled Binary Trees
Number theoretical error estimates in a quantization scheme for bandlimited signals
Flow in Planar Graphs: A Survey of Results
DNA sequences useful for computation
The basis problem for CCC posets
The Random Projection Method
Parallel Computation of Sylow Subgroups in Solvable Groups
Shuffled tree based fault-tolerant hierarchical interconnection networks
Geometric symmetry and chemical equivalence
On computing the nearest neighbor interchange distance
Pilot assisted estimation of MIMO fading channel response and achievable data rates
Fragment assembly system for DNA sequencing projects
On Source-Channel Communication in Networks
Optimization of gamma knife radiosurgery
Improved on-line scheduling algorithms for optical WDM networks
Relating phonetic and phonological categories
An algorithm detecting hyperbolicity
The implications of spatial structure within populations to the evolution of parasites
Survivable Fiber Network Design
Approximation results for the optimum cost chromatic partition problem
Topological methods of molecular shape analysis: Continuum models and discretization
Space-time coding with iterative receiver interfaces
On the Optimality of the Dayhoff Matrix for Computing the Similarity Score Between Fragments of Biological Sequences
Implementing a Maximum Flow Algorithm: Experiments with Dynamic Trees
A new model of generalized Steiner trees and 3-coordinate systems
A Speculative Contraction Method for Minimum Cost Flows: Toward a Practical Algorithm
Knowledge based structure prediction of the light-harvesting complex II of Rhodospirillum molishianum
Groups of deficiency zero
Bioconsensus, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, 2001
A new exact algorithm for rectilinear Steiner trees
Multispace search for satisfiability and NP-hard problems
Experimental evaluation of disk-based data structures for nearest neighbor searching
Parallel partitioning with Zoltan: Is hypergraph partitioning worth it?
Concerning the NJ algorithm and its unweighted version, UNJ
Experiences with a Synchronous Parallel Branch and Bound Algorithm
Rhythm and Pattern: Discrete Mathematics with an Artistic Connection for Elementary School Teachers
A numerical algorithm for the computation of invariant circles
Using Mathematical Models to Monitor and Evaluate the Impact of Public Health Interventions on Epidemics: The Case of the TB/HIV Co-pandemic in Africa
On some parametric, nonparametric and semiparametric discrimination rules
Comparative Analysis of Biopolymer Sequences: Reflections on the Validity of the Methodology and the Underlying General Principles
Using graph partitioning for efficient network modularity optimization
The Wulff-shape of large periodic sphere packings
List of Papers (by subjects)
Formal Power Series and Algebraic Combinatorics, Proceedings of a DIMACS Workshop, USA, May 23-27, 1994
An agent-based architecture for securing mobile IP
Bounding Network Parameters by Approximating Graphs
On broadcasting schemes in restricted optical passive star systems
On the Implementation of Set-based Parallel Algorithms
Modeling the Epidemiological and Economic Impact of HIV/AIDS with Particular Reference to Zimbabwe
Chiral Polytopes
Trellis-Based Scalar-Vector Quantizer for Memoryless Sources
Solid phase DNA solution to the Hamiltonian path problem
Contributing Authors
Discrete Mathematical Modeling in the Secondary Curriculum: Rationale and Examples from the Core-Plus Mathematics Project
Robust Communication Networks: Interconnection and Survivability, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, November 18-20, 1998
An Approximate Dual Projective Algorithm for Solving Assignment Problems
Some fundamental properties of Boolean ring normal forms
Simplicial depth: An improved definition, analysis, and efficiency for the finite sample case
Secret Bit Transmission Using a Random Deal of Cards
Disjoint Essential Circuits in Toroidal Maps
Slowing the time-fluctuating MIMO channel
Reconciled trees and incongruent gene and species trees
Manipulating statistical difference
Abusing a hypergraph partitioner for unweighted graph partitioning
A column-generation based branch-and-bound algorithm for sorting by reversals
On constructing a molecular computer
Integrating Biology and Mathematics in High School Classrooms
Unimodality and the independent set numbers of matroids
Cliques, Coloring, and Satisfiability, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 11-13, 1993
Approximate nearest neighbor search using the extended general space-filling curves heuristic
Computational evaluation of hot queues
Minimizing Polynomial Functions
An Empirical Study of Min Cost Flow Algorithms for the Minimum-Cost Flow Problem
Data Depth: Robust Multivariate Analysis, Computational Geometry and Applications, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, May 14-16, 2003
On applying molecular computation to the data encryption standard
Some remarks on one-relator free products with amalgamation
Multichannel Optical Networks: Theory and Practice, Proceedings of a DIMACS Workshop, March 16-19, 1998
Numerical results on the asymptotic rate of binary codes
Cramer-Rao Bound for Timing Recovery on Channels with Inter-symbol Interference
Parsing morphology: "Factoring" words
Impartial trimmed means for functional data
Relating the provable collapse of P to NC 1 and the power of logical theories
Animated Algorithms Computer Science Education with Algorithm Animation
Groups and Computation, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, June 7-10, 1995
Efficient Local Search Near Phase Transitions in CombinatorialOptimization
A partitioning-based divisive clustering technique for maximizing the modularity
Locally lifting the curse of dimensionality for nearest neighbor search
Efficient cross-trees for external memory
A GRASP for satisfiability
Randomized algorithms in combinatorial optimization
On maximal energy ordering of acyclic conjugated molecules
External memory algorithms and data structures
Discrete Mathematics in the Schools, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 2-4, 1992
Cooperative Communication in Wireless Systems
An introduction to molecular biology for mathematicians and computer programmers
Causal Tree of Disease Transmission and The Spreading of Infectious Diseases
Minimal Model Generation
Groups and Expanders
Winding Numbers and the Generalized Lower-Bound Conjecture
Applied Geometry And Discrete Mathematics, Proceedings of a DIMACS Workshop, Providence, Rhode Island, USA, September 18, 1990
The Minimal Projective Plane Polyhedral Maps
Model Checking and Graph Theory in Sequential ATPG
R-tree retrieval of unstructured volume data for visualization
Increasing phylogenetic accuracy with global congruence
Finding friends-of-friends clusters quickly
Use of path matrices for a characterization of molecular structures
Generalized reduced hypercube interconnection networks for massively parallel computers
On the Expression of Graph Properties in some Fragments of Monadic Second-Order Logic
Branching rules for propositional satisfiability test
An abstract representation for molecular graphs
The Exchange Interaction, Spin Hamiltonians, and the SymmetricGroup
Thermodynamic simulation of deoxyoligonucleotide hybridization for DNA computation
A mixed variable optimization approach to non-rigid image registration
Applying the INN model to the Maximum Clique problem
Scheduling Of Structured and Unstructured computation
Randomized greedy algorithms for the hypergraph partitioning problem
A Note on Parallel Randomized Algorithms for Searching Problems
UMPa: A multi-objective, multi-level partitioner for communication minimization
Horizon Theorems for Lines and Polygons
Distinguishing and reconstructing sceneries from observations along random walk paths
A DNA and restriction enzyme implementation of Turing machines
From Data to Knowledge: Probabilist Objects for a Symbolic Data Analysis
Characterization of Heat-Assisted Magnetic Recording Channels
Modeling Paradigms and Analysis of Disease Trasmission Models, Proceedings of a DIMACS Workshop, South Africa, June, 2007
Protection interoperability for WDM optical networks
Networks and Reliability in Maple
Comparison of Selberg's trace formula with its discrete analogues
Tracking of multi-level modulation formats for DS/CDMA systems in a slowly fading channel
Implementing the Push-Relabel Method for the Maximum Flow Problem on a Connection Machine
On the use of second order derivatives for the satisfiability problem
Calculating robust depth measures for large data sets
Selected Data Mining Concepts
Lattices, cryptography, and the NTRU public key cryptosystem
Reduced consensus
Mixing times
Randomized Algorithms for Multiprocessor Page Migration
Discrete Mathematics in the Schools: An Opportunity to Revitalize School Mathematics
Annotated bibliography of perfectly random sampling with Markov chains
Algorithms for polycyclic-by-finite matrix groups
New uses for uniform lifted alignments
A group theoretic approach to public-key cryptography
A GRASP algorithm for the single source uncapacitated minimum concave-cost network flow problem
Computing nilpotent quotients of finitely presented groups
Unimodular Fans, Linear Codes, and Toric Manifolds
Scheduling Acyclic Task Graphs on Distributed Memory Parallel Architectures
Debate '90: An electronic discussion on true concurrency
The role of experiment in the theory of algorithms
On the capacity of the multiple antenna broadcast channel
Why BioMath? Why Now?
Optimality of beamforming in multiple transmitter multiple receiver communication systems with partial channel knowledge
Polyhedral methods for the maximum clique problem
ABCL/f: A Future-Based Polymorphic Typed Concurrent Object-Oriented Language- Its Design and Implementation
Coding And Quantization, Proceedings of a DIMACS Workshop, Princeton, New Jersey, USA, October 19-21, 1992
Hybrid ARQ with Random Transmission Assignments
Discrete approximation of invariant measures for multidimensional maps
More on the relative strength of counting principles
Modelling and verification of the MCS layer with Spin
Graffiti.pc: A Variant of Graffiti
Insights from Math-Science Collaboration at the High School Level
Visualizing measures of genetic distance
Formal language theory and biological macromolecules
A practical comparison of N-body algorithms
Splicing on tree-like structures
New Directions In Testing
Design systems: Combinatorial characterizations of Delsarte $\mathcal T$-designs via partially ordered sets
Putting Chaos into Calculus Courses
Multiply Perspective Simplices, Desmic Triads and the Edelstein Theorems
An Application of Game-Theoretic Techniques to Cryptography
On the finite subgroups of a context-free group
Differential greedy for the 0-1 equicut problem
Higher-Order Multiset Programming
Inductive reasoning
Compressing a Representation of Events in a Concurrent System
Axiomatics in group choice and bioconsensus
Enumerations of trees and forests related to branching processes and random walks
Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, Proceedings of a DIMACS Workshop, Stirín Castle, Czech Republic, May 19-25, 1997
Guided local search joins the elite in discrete optimisation
Polymorphic control for cost-effective design of optical networks
Hajnal's contributions to combinatorial set theory and the partition calculus
An optimal greedy algorithm for wavelength allocation in directed tree networks
Tabu search algorithms for the maximum clique problem
Nesticity
The Structure of Fullerene Signatures
Some algebra related to P - and Q -polynomial association schemes
Networks in Distributed Computing, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 27-29, 1997
Writing Discrete(ly)
On nested depth first search
Computer-Aided Verification, Proceedings of a DIMACS Workshop 1990, New Brunswick, New Jersey, USA, June 18-21, 1990
Chain decomposition theorems for ordered sets and other musings
Detecting quasiconvexity: Algorithmic aspects
Singularities of Minimal Surfaces and Networks and Related Extremal Problems in Minkowski Space
Energy-conserving software design for mobile computers
Analyzing Integer Sequences
Strictly nonblocking conferencing meshes
Minimizing the cost of an optical network
Cryptanalysis of RSA-type cryptosystems: A visit
Group Membership for Groups with Primitive Orbits Namita Sarawagi, Gene Cooperman, and 253
Interpolation multiplicity assignment algorithms for algebraic soft-decision decoding of Reed-Solomon codes
Integrating Interdisciplinary Science into High School Science Modules Through a Preproinsulin Example
ASP: Adaptive online parallel disk scheduling
Decoding Under Integer Metric Constraints
Robust Desing of Dynamic Routing Networks
The Symmetries of the Cut Polytope and of Some Relatives
A Greedy Randomized Adaptive Search Procedure for the Quadratic Assignment Problem
A practical perfect hashing algorithm
The Interdisciplinary Scientist of the 21st Century
Approximation of Association Data by Structures and Clusters
Combinatorial property testing (a survey)
Asynchronous packet routers
Mathematical Hierarchies and Biology, Proceedings of a DIMACS Workshop, November 13-15, 1996
The Cographic Multiflow Problem: An Epilogue
Good encodings for DNA-based solutions to combinatorial problems
Observed weaknesses in security dynamics' client/server protocol
On identifying codes
Exascale computer algebra problems interconnect with molecular reactions and complexity theory
Monte Carlo and Markov Chain Techniques for Network Reliability and Sampling
Constellations for Diversity
Wireless Network Information Theory
Estimation of missing distances in path-length matrices: Problems and solutions
Plausibly hard combinatorial tautologies
Automated RTL Verification Based on Predicate Calculus
On the mixing time of the triangulation walk and other Catalan structures
On Some Conjectures of Griggs and Graffiti
Mobile Networks and Computing, Proceedings of a DIMACS Workshop, Piscataway, New Jersey, USA, March 25-27, 1999
Multispace search for quorumcast routing
Asymptotic results for simple groups and some applications
The Combinatorics of Permutation Polytopes
Introduction to Mathematical Modeling of Infectious Disease Dynamics
The performance of the neighbor-joining method of phylogeny reconstruction
Approximate Counting with Uniform Constant-Depth Circuits
Implementing and verifying MSC specifications using Promela/XSpin
Sum Rate of a Class of Multiterminal Gaussian Source Coding Problems
A discrete Lagrangian-based global-search method for solving satisfiability problems
Partitions, refinements, and permutation group computation
On perfect codes in the Johnson scheme
Network Threats, Proceedings of a DIMACS Workshop, December 2-4, 1996
Elementary algebra revisited: Randomized algorithms
Incorporating Stochasticity in Simple Models of Disease Spread
Descriptive complexity and the W hierarchy
A chunking based genetic algorithm for the Steiner tree problem in graphs
GRAPE: A System for Computing with Graphs and Groups
Computational power of gene rearrangement
Finding Salient Convex Groups
Spectrally determined first-order limit laws
Applications of coding theory to universal loss less source coding performance bounds
Discrete Mathematics Software for K-12 Education
Coding Theorems for Reversible Embedding
An injective set representation of closed systems of sets
Rapidly Mixing Markov Chains for Dismantleable Constraint Graphs
Ehrhart Polynomials of Convex Polytopes, h-Vectors of Simplicial Complexes, and Nonsingular Projective Toric Varieties
Linear time temporal logics over Mazurkiewicz traces
DNA Based Computers, Proceedings of a DIMACS Workshop, Philadelphia, Pennsylvania, USA, June 23-25, 1997
A linear programming and rounding approach to max 2-sat
A Context Dependent Equivalence Relation between Kripke Structures
Some Regular Maps and Their Polyhedral Realizations
Databases and Finite-Model Theory
Algebraic manipulations and vector languages
Constructing Representations of Finite Groups
Group and graph theoretical perspectives on the structures of large icosahedral cages
Compositional Design and Verification of Communication Protocols, Using Labelled PETRI Nets
Enumeration of fusenes to h = 20
Maximal throughput in wavelength-routed optical networks
Appendix: Second DIMACS Challenge test problems
Camouflaging independent sets in quasi-random graphs
On Dynamic Full Access in Multistage Interconnection Networks
An application of structure theory of set addition to a question in ergodic theory
A generalized threshold algorithm for the shortest path problem with time windows
Set Theory: The Hajnal Conference, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 15-17, 1999
Automatic Verification of Extensions of Hardware Descriptions
The Width-Length Inequality and Degenerate Projective Planes
SAT versus UNSAT
The Calculus Cycle: Using Biology to Connect Discrete and Continuous Modeling in Calculus
Grouping Edges: An Efficient Bayesian Multiple Hypothesis Approach
The Spin Verification System, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, August, 1996
Towards polynomial time algorithms for matrix groups
Elements of an automata theory over partial orders
Randomization in group algorithms: Conceptual questions
Satisfiability of 3CNF formulas with small clause/variable-ratio
The Leadership Program in Discrete Mathematics
Computing the Convex Hull in the Euclidean Plane in Linear Expected Time
Advances in Network Information Theory, Proceedings of a DIMACS Workshop, Piscataway, New Jersey, USA, March 17-19, 2003
Lower bounds of isoperimetric functions for nilpotent groups
Transition to epileptic seizures: Optimization
Equational calculi and constant depth propositional proofs
GMP/X, An X-Windows Based Graph Manipulation Package
Efficient Algorithms Based on Critical Points Method
Specification, Transformation, and Programming of Concurrent Systems in Rewriting Logic
Volume Approximation of Convex Bodies by Circumscribed Polytopes
Algebraic models of computation and interpolation for algebraic proof systems
Optimization problems in 3D conformal radiation therapy
Gaps in Difference Sets, and the Graph of Nearly Equal Distances
Using Partial Orders to Improve Automatic Verification Methods
Multilevel Detection of Stereo Disparity Surfaces
Do rhinoviruses follow the neutral theory? The role of cross-immunity in maintaining the diversity of the common cold
Complexity and Biology - Bringing Quantitative Science to the Life Sciences Classroom
List of delivered talks
On the minimum number of edges giving maximum oriented chromatic number
Composition of the Universal Relation
Algorithms, Algebra, and the Computer Lab
New Materials to Integrate Biology and Mathematics in High School Curriculum
Rectilinear Steiner Tree Minimization on a Workstation
An adaptive concurrency control protocol for mobile transactions
Computing near-optimal solutions to combinatorial optimization problems
Bases of cocycle lattices and submatrices of a Hadamard matrix
Approximating Concurrent Flow with Unit Demands and Capacities: An Implementation
Graphs and Discovery, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, November 12-16, 2001
Discrete Mathematical Chemistry, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, 1998
Oriented list colouring of undirected graphs
Graph Partitioning and Graph Clustering, 10th DIMACS Implementation Challenge Workshop, Georgia Institute of Technology, Atlanta, GA, USA, February 13-14, 2012. Proceedings
Molecular structure determination by convex, global underestimation of local energy minima
A Discrete Mathematics Textbook for High Schools
Handles and Teeth in the Symmetric Traveling Salesman Problems
The Nordstrom-Robinson Code is the Binary Image of 19 the Octacode
Constraint Satisfaction as a Basis for Designing Nonmasking Fault-Tolerance