yusuke1997/dblp-id-title huggingface dataset:
Monotone Properties of Uncertain Graphs
Towards Compatible Triangulations
On the Complexity of Computing the Logarithm and Square Root Functions on a Complex Domain
A Randomized FPT Approximation Algorithm for Sorting Unsigned Genomes by Translocations: Breaking the 1.375 Approximation Barrier
An FPTAS for the Volume of Some V -polytopes - It is Hard to Compute the Volume of the Intersection of Two Cross-Polytopes
Computing and Combinatorics, Third Annual International Conference, COCOON '97, Shanghai, China, August 20-22, 1997, Proceedings
Approximation Algorithms on Multiple Two-Stage Flowshops
Flow Shop for Dual CPUs in Dynamic Voltage Scaling
Nondeterministic Auxiliary Depth-Bounded Storage Automata and Semi-Unbounded Fan-In Cascading Circuits - (Extended Abstract)
Efficient Enumeration of Non-Equivalent Squares in Partial Words with Few Holes
On Symbolic Ultrametrics, Cotree Representations, and Cograph Edge Decompositions and Partitions
Minimum Spanning Tree of Line Segments
Finding Maximum Edge Bicliques in Convex Bipartite Graphs
Single-Edge Monotonic Sequences of Graphs and Linear-Time Algorithms for Minimal Completions and Deletions
The Restrained Domination and Independent Restrained Domination in Extending Supergrid Graphs
Spring Algorithms and Symmetry
Skew Circuits of Small Width
A Complex Semidefinite Programming Rounding Approximation Algorithm for the Balanced Max-3-Uncut Problem
Subclasses of Coputable Real Valued Functions
Generalizing the Hypergraph Laplacian via a Diffusion Process with Mediators
Topological Network-Control Games Played on Graphs
Improving Parallel Computation with Fast Integer Sorting
Minimum Cost Homomorphisms with Constrained Costs
An Edge Ordering Problem of Regular Hypergraphs
Speed Scaling for Maximum Lateness
Approximation Algorithms for Inscribing or Circumscribing an Axially Symmetric Polygon to a Convex Polygon
Sink Location Problems in Dynamic Flow Grid Networks
An Effective Branching Strategy for Some Parameterized Edge Modification Problems with Multiple Forbidden Induced Subgraphs
Ideal Separation and General Theorems for Constrained Synchronization and Their Application to Small Constraint Automata
Aggregating Strategy for Online Auctions
Data Structures for One-Dimensional Packet Classification Using Most-Specific-Rule Matching
Rankable Distributions Do Not Provide Harder Instances Than Uniform Distributions
Computing and Combinatorics - 23rd International Conference, COCOON 2017, Hong Kong, China, August 3-5, 2017, Proceedings
Intersection Suffices for Boolean Hierarchy Equivalence
Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems
Minimum Clique Partition Problem with Constrained Weight for Interval Graphs
A Multi-Tree Generating Routing Scheme Using Acyclic Orientations
Fast and Space-Efficient Location of Heavy or Dense Segments in Run-Length Encoded Sequences: (Extended Abstract)
Reconstructing Evolution of Natural Languages: Complexity and Parameterized Algorithms
Analysis and Experimentation on List Update Algorithms
Theoretical Problems Related to the Internet
Non-determinism Reduces Construction Time in Active Self-assembly Using an Insertion Primitive
A Note on Zero Error Algorithms Having Oracle Access to One NP Query
Efficient Partially Blind Signature Scheme with Provable Security
Approximate Minimum Diameter
A New Transference Theorem in the Geometry of Numbers
How to Obtain the Complete List of Caterpillars (Extended Abstract)
Graph-Based Data Clustering with Overlaps
On Local Transformation of Polygons with Visibility Properties
Numerical Tic-Tac-Toe on the 4×4 Board
A Probabilistic Model Revealing Shortcomings in Lua's Hybrid Tables
Area Efficient Exponentiation Using Modular Multiplier/Squarer in GF(2 m
Competitive Auctions and Envy-Freeness for Group of Agents
Directed Figure Codes: Decidability Frontier
Non-empty Cross-3-Intersection Theorems of Subsets
Multi-Radio Channel Detecting Jamming Attack Against Enhanced Jump-Stay Based Rendezvous in Cognitive Radio Networks
Assigning Proximity Facilities for Gatherings
Reoptimization of Path Vertex Cover Problem
A Fast Bit-Parallel Algorithm for Matching Extended Regular Expressions
An Axiomatization for Cylinder Computation Model
Column Generation Algorithms for the Capacitated m-Ring-Star Problem
On the Minimum Edge Bisection of Graph
Scheduling Trees onto Hypercubes and Grids Is NP-complete
Multi-party Quantum Communication Complexity with Routed Messages
A 1-Local 13/9-Competitive Algorithm for Multicoloring Hexagonal Graphs
A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree
One-Time Tables for Two-Party Computation
Combinatorial Problems Arising in Massive Data Sets (Abstract)
An Improved Kernel for the Complementary Maximal Strip Recovery Problem
k-Center Problems with Minimum Coverage
Approximation Algorithms for General Cluster Routing Problem
Bicriteria Network Design via Iterative Rounding
A New View on Worst-Case to Average-Case Reductions for NP Problems
Sublinear-Time Algorithms for Tournament Graphs
Efficient List Ranking Algorithms on Reconfigurable Mesh
Sharpening Occam's Razor
On the Distribution of Eigenvalues of Graphs
Polygon Simplification by Minimizing Convex Corners
Teaching Study on "Algorithm Design and Analysis": Innovation Teaching Method Reform Based on Practice
Minimum Width Color Spanning Annulus
Approximately Covering Vertices by Order-5 or Longer Paths
On Spectral Graph Drawing
Hardness of Sparse Sets and Minimal Circuit Size Problem
Combinatorial Scoring of Phylogenetic Networks
Auspicious Tatami Mat Arrangements
RNA Multiple Structural Alignment with Longest Common Subsequences
Competitive Online Scheduling with Level of Service
Promised and Distributed Quantum Search
The Specker-Blatter Theorem Revisited
Optimal Bidding Algorithms Against Cheating in Multiple-Object Auctions
Approximation Algorithms for Car-Sharing Problems
Approximation Algorithms for the Min-Max Mixed Rural Postmen Cover Problem and Its Variants
Tight Bounds on Local Search to Approximate the Maximum Satisfiability Problems
Fixed Parameter Tractability of Graph Deletion Problems over Data Streams
A Combinatorial View of Holant Problems on Higher Domains
Privacy Aspects in Data Querying
Approximate Sorting of Data Streams with Limited Storage
Non-monochromatic and Conflict-Free Coloring on Tree Spaces and Planar Network Spaces
Online Frequency Assignment in Wireless Communication Networks
Space-Efficient Algorithms for Maximum Cardinality Search, Stack BFS, Queue BFS and Applications
Hexagonal Routings of Multiterminal Nets
Approximate the Lower-Bounded Connected Facility Location Problem
Adjacent Swaps on Strings
Optimally Balanced Forward Degree Sequence
An Improved Approximation Algorithm for the Minimum k-Star Partition Problem
Covering Directed Graphs by In-Trees
Testing Some First-Order Logic Properties on Sparse Graphs
Uni-directional Alternating Group Graphs
Scheduling Selfish Tasks: About the Performance of Truthful Algorithms
Guided Genetic Algorithm for the Influence Maximization Problem
Parameterized Complexity of Maximum Edge Colorable Subgraph
W -Hardness Under Linear FPT-Reductions: Structural Properties and Further Applications
A Note on the Simulation of Exponential Threshold Weights
Rainbow Colouring of Split and Threshold Graphs
Time and Energy Optimal List Ranking Algorithms on the k -Channel Broadcast Communication Model
Probabilistic Analysis of Local Search and NP-Completeness Result for Constraint Satisfaction (Extended Abstract)
Computation and Growth of Road Network Dimensions
Incentive Ratios of a Proportional Sharing Mechanism in Resource Sharing
Varieties Generated by Certain Models of Reversible Finite Automata
On the Power of One-Sided Error Quantum Pushdown Automata with Classical Stack Operations
Complex-Demand Scheduling Problem with Application in Smart Grid
A Combinatorial Approach to Asymmetric Traitor Tracing
New Bounds for Energy Complexity of Boolean Functions
The Worst-Case Time Complexity for Generating All Maximal Cliques
A Self-stabilizing 3-Approximation for the Maximum Leaf Spanning Tree Problem in Arbitrary Networks
Amplitude Amplification for Operator Identification and Randomized Classes
New Streaming Algorithms for Counting Triangles in Graphs
On the Similarity of Sets of Permutations and Its Applications to Genome Comparison
Efficient Universal Quantum Circuits
Finding Hidden Independent Sets in Interval Graphs
Derandomizing HSSW Algorithm for 3-SAT
(2+ f(n))-SAT and Its Properties
Interval Subset Sum and Uniform-Price Auction Clearing
Theoretically Good Distributed CDMA/OVSF Code Assignment for Wireless Ad Hoc Networks
On the Hardness of Switching to a Small Number of Edges
Feasibility Algorithms for the Duplication-Loss Cost
A New Kernel for Parameterized Max-Bisection Above Tight Lower Bound
A New Conditionally Anonymous Ring Signature
W[1]-Hardness of the k-Center Problem Parameterized by the Skeleton Dimension
Disjunctions of Negated Counting Functions Are Efficiently Learnable with Equivalence Queries
The Matrix Orthogonal Decomposition Problem in Intensity-Modulated Radiation Therapy
Experiments for Algorithm Engineering
Improved Throughput Bounds for Interference-Aware Routing in Wireless Networks
Average-Case Deterministic Query Complexity of Boolean Functions with Fixed Weight
On Energy-Efficient Computations With Advice
Weakly Computable Real Numbers and Total Computable Real Functions
A Construction Method for Optimally Universal Hash Families and Its Consequences for the Existence of RBIBDs
Privacy-Preserving Byzantine-Robust Federated Learning via Multiparty Homomorphic Encryption
Maximization of the Size and the Weight of Schedules of Degradable Intervals
A Fast Algorithm for Data Collection along a Fixed Track
Ordered Quantum Branching Programs Are More Powerful than Ordered Probabilistic Branching Programs under a Bounded-Width Restriction
An Exact Characterization of Symmetric Functions in qAC 0 [2]
Using Network Sciences to Evaluate the Brazilian Airline Network
Limited Acceleration Mechanism for Cell Loss Flow Control in ATM Networks
Automatic Verification of Multi-queue Discrete Timed Automata
A Fault-Tolerant Merge Sorting Algorithm
Give and Take: Adaptive Balanced Allocation for Peer Assessments
On the Hardness of Optimization in Power Law Graphs
Finding a Level Ideal of a Poset
Non-approximability of Weighted Multiple Sequence Alignment
Fault Diagnosability Evaluation of BCCC Data Center Networks
Metrical Service Systems with Multiple Servers
Completeness for Parity Problems
Nash Equilibrium and Price of Anarchy for Scheduling Games Based on a Mixed Coordination Mechanism
Eigenvalues, Eigenvectors, and Graph Partitioning
On the Effectiveness of the Linear Programming Relaxation of the 0-1 Multi-commodity Minimum Cost Network Flow Problem
Universal Test Sets for Reversible Circuits
Undecidability of Polynomial Inequalities in Subset Densities and Additive Energies
The Range 1 Query (R1Q) Problem
An Improved Algorithm for Tree Edit Distance Incorporating Structural Linearity
An Algebraic Characterization of Tractable Constraints
Quantum versus Deterministic Counter Automata
A Fast Maximum Finding Algorithm on Broadcast Communication
Efficient Compression of Web Graphs
Deterministic Primal-Dual Algorithms for Online k-Way Matching with Delays
Spreading Messages
Prefix-Free Languages and Initial Segments of Computably Enumerable Degrees
Finding Equilibria in Games of No Chance
On the Area Requirements of Planar Greedy Drawings of Triconnected Planar Graphs
Constructing Independent Spanning Trees in Alternating Group Networks
New Results on the k-Truck Problem
Parameterized Complexity of Finding Subgraphs with Hereditary Properties
Distributionally-Hard Languages
Deleting to Structured Trees
Complexity of a Collision-Aware String Partition Problem and Its Relation to Oligo Design for Gene Synthesis
On the Ádám Conjecture on Circulant Graphs
Robust Quantum Algorithms with epsilon -Biased Oracles
The Weighted Coupon Collector's Problem and Applications
Some Results on Orthogonal Factorizations
On the Minimum Depth of Circuits with Linear Number of Wires Encoding Good Codes
Upper Bounds on Fourier Entropy
An Efficient Data Analysis Method for Big Data Using Multiple-Model Linear Regression
Cost Register Automata for Nested Words
Tree Structure Genetic Algorithm with Nourishment Mechanism
On the d-Claw Vertex Deletion Problem
A New Approach and Faster Exact Methods for the Maximum Common Subgraph Problem
Seamless Interpolation Between Contraction Hierarchies and Hub Labels for Fast and Space-Efficient Shortest Path Queries in Road Networks
A New Approach for Speeding Up Enumeration Algorithms and Its Application for Matroid Bases
An Improved Exact Algorithm for Cubic Graph TSP
A PTAS for a Disc Covering Problem Using Width-Bounded Separators
Computing and Combinatorics - 21st International Conference, COCOON 2015, Beijing, China, August 4-6, 2015, Proceedings
An Efficient Online Algorithm for Square Detection
An On-Orbit Data Balancing Online Algorithm For LEO Satellite Cluster: A Repeated Stochastic Game Approach
A Protocol for Generating Random Elements with Their Probabilities
Approximation Algorithms for the Lower-Bounded k-Median and Its Generalizations
A Declustering Algorithm for Minimizing Spatial Join Cost
Refutation of Spectral Graph Theory Conjectures with Monte Carlo Search
Searching Rigid Data Structures (Extended Abstract)
On the Negation-Limited Circuit Complexity of Merging
A Characterization of Graphs with Vertex Cover Six
The Complexity of Distance-r Dominating Set Reconfiguration
Reduction Algorithms for Constructing Solutions in Graphs with Small Treewidth
A Sufficient Condition for the Existence of Two Completely Independent Spanning Trees
Burchard von Braunmühl, Computable Real Functions of Bounded Variation and Semi-computable Real Numbers
An Efficient Potential Member Promotion Algorithm in Social Networks via Skyline
Finding Cycle Types in Permutation Groups with Few Generators
Algorithmic Graph Embeddings (Extended Abstract)
Maximum Flows and Critical Vertices in AND/OR Graphs
Computing and Combinatorics, 9th Annual International Conference, COCOON 2003, Big Sky, MT, USA, July 25-28, 2003, Proceedings
Using Generalized Forecasts for Online Currency Conversion
Off-Line Algorithms for Minimizing Total Flow Time in Broadcast Scheduling
The Reverse Greedy Algorithm for the Metric K -Median Problem
A Partition-and-Merge Algorithm for Solving the Steiner Tree Problem in Large Graphs
Edge Pricing of Multicommodity Networks for Selfish Users with Elastic Demands
An Integrated Simulated Annealing Algorithm for WiFi-Based Indoor Positioning
Partial Sublinear Time Approximation and Inapproximation for Maximum Coverage
Quartet-Based Phylogeny Reconstruction from Gene Orders
Constructing Craig Interpolation Formulas
The Coordination of Two Parallel Machines Scheduling and Batch Deliveries
A Combinatorial Algorithm for Pfaffians
The Regularized Submodular Maximization via the Lyapunov Method
Polynomial-Time Algorithm for Isomorphism of Graphs with Clique-Width at Most Three
Approximation Algorithms for Scheduling Multiple Two-Stage Flowshops
Online Budget Allocation Maximization Problem on Two Uniform Machines with a Common Due Date
Similarity Enrichment in Image Compression through Weighted Finite Automata
Regularized Submodular Maximization over Integer Lattice
Shortest Paths in Random Weighted Graphs
Closure Properties of Real Number Classes under Limits and Computable Operators
Computational Complexity Characterization of Protecting Elections from Bribery
On Sequential and 1-Deterministic P Systems
Throughput Maximization with Traffic Profile in Wireless Mesh Network
Program Schemes, Queues, the Recursive Spectrum and Zero-One Laws
Smallest Formulas for Parity of 2k
Efficient Algorithms for SNP Haplotype Block Selection Problems
Complexity and Algorithms for Finding a Subset of Vectors with the Longest Sum
Approximating the Longest Cycle Problem on Graphs with Bounded Degree
Counting Cycles on Planar Graphs in Subexponential Time
An Efficient Local Alignment Algorithm for Masked Sequences
Quantum Noisy Rational Function Reconstruction
Star-Shaped Drawings of Graphs with Fixed Embedding and Concave Corner Constraints
A Public Key Cryptoscheme Using Bit-Pairs with Provable Semantical Security
Coding with Noiseless Feedback over the Z-Channel
Distributed Algorithm for Better Approximation of the Maximum Matching
Linear-Time Algorithm for Paired-Domination on Distance-Hereditary Graphs
Bipartite Domination in Outerplanar Graphs
Discrete Effort Distribution via Regret-Enabled Greedy Algorithm
Fully Dynamic k-Center Clustering with Outliers
Finding an Optimal Bridge between Two Polygons
The Monotone Circuit Value Problem with Bounded Genus Is in NC
Streaming and Query Once Space Complexity of Longest Increasing Subsequence
Algorithms for the On-Line Quota Traveling Salesman Problem
On Incentive Compatible Competitive Selection Protocol
Contextual Dependent Click Bandit Algorithm for Web Recommendation
An Improved Time-Space Lower Bound for Tautologies
Server Allocation Algorithms for Tiered Systems
An Improved Algorithm for Extraction of Exact Boundaries and Boundaries Inclusion Relationship
Approximating Latin Square Extensions
Analysis of Quorum-Based Protocols for Distributed (k+1)-Exclusion
Improved Length Lower Bounds for Reflecting Sequences
The Computational Complexity of Link Building
Can the 1.375 Approximation Ratio of Unsigned Genomes Distances be Improved?
Homophilies and Communities Detection among a Subset of Blogfa Persian Weblogs: Computer and Internet Category
Classification of a Class of Counting Problems Using Holographic Reductions
Construction of Nearly Optimal Multiway Trees
Three Dimensional Weak Visibility: Complexity and Applications
Estimating Parameters of Monotone Boolean Functions (Abstract)
The Curse of Connectivity: t -Total Vertex (Edge) Cover
Power Domination Problem in Graphs
MAX-SNP Hardness and Approximation of Selected-Internal Steiner Trees
A Fast Algorithm Finding the Shortest Reset Words
Resource-Adaptive Newton's Method for Distributed Learning
Parametric Scheduling for Network Constraints
Linear Representation of Transversal Matroids and Gammoids Parameterized by Rank
General Max-Min Fair Allocation
Space-Efficient Algorithms for Approximating Polygonal Curves in Two Dimensional Space
Indoor Localization Problem Based on WiFi Using MUSIC Algorithm and Maximum Likelihood Estimation
Self-stabilizing $(\varDelta +1)$-Coloring in Sublinear (in $\varDelta $) Rounds via Locally-Iterative Algorithms
How to Draw a Planar Clustered Graph
Solving the Gene Duplication Feasibility Problem in Linear Time
Reconstructing Tumor Evolution and Progression in Structurally Variant Cancer Cells
2-Compromise Usability in 1-Dimensional Statistical Databases
Computations with Finite Closure Systems and Implications
A Combinatorial Approach for Multiple RNA Interaction: Formulations, Approximations, and Heuristics
Approval-Based Participatory Budgeting with Donations
Approximability of the Minimum Weighted Doubly Resolving Set Problem
Characterizations of Locally Testable Linear- and Affine-Invariant Families
On the Advice Complexity of Tournaments
The Join Can Lower Complexity
An Improved Approximation Algorithm for Scaffold Filling to Maximize the Common Adjacencies
Approaches to Effective Semi-continuity of Real Functions
Mining the Key Structure of the Information Diffusion Network
Perfect Sorting by Reversals
Nonbipartite Dulmage-Mendelsohn Decomposition for Berge Duality
The Number of Rearrangements in a 3-stage Clos Network Using an Auxiliary Switch
DD-POR: Dynamic Operations and Direct Repair in Network Coding-Based Proof of Retrievability
Improving Upper and Lower Bounds for the Total Number of Edge Crossings of Euclidean Minimum Weight Laman Graphs
Multiplying Pessimistic Estimators: Deterministic Approximation of Max TSP and Maximum Triangle Packing
Convex Partitions with 2-Edge Connected Dual Graphs
Generalized Shooter Location Problem
A Three-Valued Quantificational Logic of Context
The Combinatorics of Sequencing the Corn Genome
On the Power of Lookahead in On-Line Vehicle Routing Problems
Depth-Independent Lower Bounds on the Communication Complexity of Read-Once Boolean Formulas
Solving Systems of Linear Equations Through Zero Forcing Set
Variants of Homomorphism Polynomials Complete for Algebraic Complexity Classes
A Simplicial Approach for Discrete Fixed Point Theorems
On Multi-dimensional Hilbert Indexings
Log-Space Constructible Universal Traversal Sequences for Cycles of Length O(n 4.03 )
Convex-Area-Wise Linear Regression and Algorithms for Data Analysis
On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation Analysis
Robust Geometric Computation Based on Digital Topology
Finding Small OBDDs for Incompletely Specified Truth Tables Is Hard
A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions
Improved Approximation Algorithms for the Capacitated Multicast Routing Problem
Optimal Acyclic Edge Colouring of Grid Like Graphs
A Note on Uniform Circuit Lower Bounds for the Counting Hierarchy (Extended Abstract)
Generating Necklaces and Strings with Forbidden Substrings
Succinct Representations of Binary Trees for Range Minimum Queries
Constrained Routing Between Non-Visible Vertices
Area Minimization for Grid Visibility Representation of Hierarchically Planar Graphs
On the Average Sensitivity of Testing Square-Free Numbers
Exact Algorithms for Finding Partial Edge-Disjoint Paths
A PTAS for Cutting Out Polygons with Lines
Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine
The 1/4-Core of the Uniform Bin Packing Game Is Nonempty
On the Conjunctive Capacity of Graphs
Approximate Weighted Farthest Neighbors and Minimum Dilation Stars
Deterministic Application of Grover's Quantum Search Algorithm
Computing Maximum-Scoring Segments in Almost Linear Time
On Bounds for the k-Partitioning of Graphs
Finding Network Communities Using Random Walkers with Improved Accuracy
Direct Sum Theorems From Fortification
Efficient Deterministic Algorithms for Embedding Graphs on Books
An Asynchrolous Parallel Method for Linaer Systems
Average AoI Optimization at Wireless-Powered Network Edge with Stochastic Arrivals
An O(n 3) -Time Algorithm for the Min-Gap Unit-Length Job Scheduling Problem
The Complexity of Physical Mapping with Strict Chimerism
Conditional Automatic Complexity and Its Metrics
The Assembly of the Human and Mouse Genomes
Decomposing Cubic Graphs into Connected Subgraphs of Size Three
k-Balanced Biclique Partition on Signed Bipartite Graphs
Induced Subgraph Isomorphism: Are Some Patterns Substantially Easier Than Others?
Optimal Bi-Level Augmentation for Selectivity Enhancing Graph Connectivity with Applications
A Distributed Algorithm for Rumor Blocking on Social Networks
On Finding a Shortest Path in Circulant Graphs with Two Jumps
Counting Satisfying Assignments in 2-SAT and 3-SAT
Exact Parameterized Multilinear Monomial Counting via k-Layer Subset Convolution and k-Disjoint Sum
The Complexity of Unary Subset Sum
Directional Geometric Routing on Mobile Ad Hoc Networks
Share the Multicast Payment Fairly
Efficient Generation of Elliptic Curve Cryptosystems
Finding a Hidden Code by Asking Questions
On the Distortion of Multi-winner Election Using Single-Candidate Ballots
Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem
Bandwidth of Convex Bipartite Graphs and Related Graphs
Edge Connectivity vs Vertex Connectivity in Chordal Graphs
A New Characterization of P6-Free Graphs
Single Machine Scheduling with Rejection to Minimize the k-th Power of the Makespan
Compact Monotone Drawing of Trees
Proper n-Cell Polycubes in n - 3 Dimensions
Finding Longest Increasing and Common Subsequences in Streaming Data
Simultaneous Encodings for Range and Next/Previous Larger/Smaller Value Queries
Bipartite Graphs of Small Readability
An Approach to Scalability of Parallel Matrix Multiplication Algorithms
Empirical Models for Complex Network Dynamics: A Preliminary Study
Parsimony is Hard to Beat
On Lazy Bin Covering and Packing Problems
On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints