yusuke1997/dblp-id-title huggingface dataset:
Proof of Toft's Conjecture: Every Graph Containing No Fully Odd K 4 Is 3-Colorable
Optimal MST Maintenance for Transient Deletion of Every Node in Planar Graphs
Parameterized Algorithms for Cluster Vertex Deletion on Degree-4 Graphs and General Graphs
Improved Approximation Algorithms for the Facility Location Problems with Linear/submodular Penalty
An Optimal Algorithm for Proper Learning of Unions of Two Rectangles with Queries
Theory of Equal-Flows in Networks
Quantum Query Lower Bounds for Key Recovery Attacks on the Even-Mansour Cipher
Facility Assignment with Fair Cost Sharing: Equilibrium and Mechanism Design
Some Results on Tries with Adaptive Branching
Space Limited Graph Algorithms on Big Data
Extracting Computational Entropy and Learning Noisy Linear Functions
On Online Approximation Algorithms for Two-Stage Bins
On the Minimum Degree Hypergraph Problem with Subset Size Two and the Red-Blue Set Cover Problem with the Consecutive Ones Property
Online Integrated Allocation of Berths and Quay Cranes in Container Terminals with 1-Lookahead
Minimum-Segment Convex Drawings of 3-Connected Cubic Plane Graphs
A Robust Distributed Minimax Learning Method Against Model Poisoning Attacks
Reconfiguring Multiple Connected Components with Size Multiset Constraints
Improved Bounds for On-line Load Balancing
Cluttered Orderings for the Complete Graph
Approximation Algorithms for Maximum Agreement Forest on Multiple Trees
GraphDHV: Graph Neural Network with Dual Hybrid View on Imbalanced Node Classification
On-Line Algorithms for Market Equilibria
No-Bend Orthogonal Drawings and No-Bend Orthogonally Convex Drawings of Planar Graphs (Extended Abstract)
Enumerate and Expand: New Runtime Bounds for Vertex Cover Variants
A Linear-Time Algorithm for Constructing an Optimal Node-Search Strategy of a Tree
On Proving Circuit Lower Bounds against the Polynomial-Time Hierarchy: Positive and Negative Results
More Efficient Algorithms for Stochastic Diameter and Some Unapproximated Problems in Metric Space
The Power of Duples (in Self-Assembly): It's Not So Hip to Be Square
A Linear-Space Data Structure for Range-LCP Queries in Poly-Logarithmic Time
Approximating Min-Max (Regret) Versions of Some Polynomial Problems
Deternimization of Büchi Automata as Partitioned Automata
Approximate Truthful Mechanism Design for Two-Dimensional Orthogonal Knapsack Problem
Computing and Combinatorics - 25th International Conference, COCOON 2019, Xi'an, China, July 29-31, 2019, Proceedings
On Sorting Signed Permutations by Flanked DCJs
Complexity Theoretic Aspects of Some Cryptographic Functions
Sequence Decomposition Method for Computing a Gröbner Basis and Its Application to Bivariate Spline
Online Tree Node Assignment with Resource Augmentation
Matching and P 2-Packing: Weighted Versions
Flipping Triangles and Rectangles
Network Topologies for Weakly Pareto Optimal Nonatomic Selfish Routing
Computing and Combinatorics - 20th International Conference, COCOON 2014, Atlanta, GA, USA, August 4-6, 2014. Proceedings
Challenges from Cancer Immunotherapy
A Lower Bound on the Growth Constant of Polyaboloes on the Tetrakis Lattice
Fair and Efficient Graphical Resource Allocation with Matching-Induced Utilities
Visibility Polygon Queries Among Dynamic Polygonal Obstacles in Plane
Geometric Representation of Graphs in Low Dimension
Security Issues in Collaborative Computing
Q-Ary Ulam-Rényi Game with Weighted Constrained Lies
Stochastic Model for Rumor Blocking Problem in Social Networks Under Rumor Source Uncertainty
Overlap-Free Regular Languages
Maximum Stabbing Line in 2D Plane
A Cost Optimal Parallel Algorithm for Computing Force Field in N-Body Simulations
Genome Halving under DCJ Revisited
On Edge-Unfolding One-Layer Lattice Polyhedra with Cubic Holes
Finding the Most Vital Node of a Shortest Path
Social Network Path Analysis Based on HBase
Oblivious and Adaptive Strategies for the Majority and Plurality Problems
Tight Approximation for the Minimum Bottleneck Generalized Matching Problem
Near Optimal Solutions for Maximum Quasi-bicliques
Broadcasting in Heterogeneous Tree Networks
Coloring Octrees
The On-Line Heilbronn's Triangle Problem in d Dimensions
DR-Submodular Function Maximization with Adaptive Stepsize
Relations Between Monotone Complexity Measures Based on Decision Tree Complexity
Monotony and Surprise
Online Interval Scheduling: Randomized and Multiprocessor Cases
Independent Spanning Trees of Chordal Rings
Private Certificate-Based Remote Data Integrity Checking in Public Clouds
Evaluating Matrix Circuits
The Closest Pair Problem under the Hamming Metric
Computability on Continuou, Lower Semi-continuous and Upper Semi-continuous Real Functions
New Symmetry-less ILP Formulation for the Classical One Dimensional Bin-Packing Problem
YASCA: An Ensemble-Based Approach for Community Detection in Complex Networks
Algorithms for Shortest Path Tour Problem in Large-Scale Road Network
An Efficient Algorithm for Local Testability Problem of Finite State Automata
Joint Topology Control and Power Conservation for Wireless Sensor Networks Using Transmit Power Adjustment
A Practical Exact Algorithm for the Individual Haplotyping Problem MEC/GI
Distributed Generalized Deutsch-Jozsa Algorithm
The Concentration of the Maximum Degree in the Duplication-Divergence Models
The Rectilinear k -Bends TSP
Geometric Spanner of Objects under L1 Distance
Isolation Concepts for Enumerating Dense Subgraphs
Tracking a Generator by Persistence
The k -Separator Problem
Approximation Algorithms for the Black and White Traveling Salesman Problem
Two-Dimensional Pattern Matching on a Dynamic Library of Texts
Consistent Simplification of Polyline Tree Bundles
Pareto Optimal Matching with Multilayer Preferences: How Hard Can It Be?
Community Expansion Model Based on Charged System Theory
Colored Simultaneous Geometric Embeddings
An External Memory Data Structure for Shortest Path Queries
Tractable and Intractable Second-Order Matching Problems
Computing and Combinatorics, 13th Annual International Conference, COCOON 2007, Banff, Canada, July 16-19, 2007, Proceedings
Maximum Tree-Packing in Time O(n 5/2 )
Compact Location Problems with Budget and Communication Constraints
Sum-of-Max Chain Partition of a Tree
Influence Spread in Social Networks with both Positive and Negative Influences
Resource-Limited Network Security Games with General Contagious Attacks
Triangulating a Convex Polygon with Small Number of Non-standard Bars
An Algorithmic Framework for Labeling Network Maps
Computing and Combinatorics, 7th Annual International Conference, COCOON 2001, Guilin, China, August 20-23, 2001, Proceedings
Multi-party Finite Computations
Efficient Randomized Incremental Algorithm For The Closest Pair Problem Using Leafary Trees
Packing Two Disks into a Polygonal Environment
Inferring a Union of Halfspaces from Examples
Extracting Representative Co-location Patterns Considering Distributions of Spatial Features and Instances
Counting H-Colorings of Partial k-Trees
Two Standard Decks of Playing Cards Are Sufficient for a ZKP for Sudoku
Sequences Characterizing k -Trees
Algorithms for k-median Clustering over Distributed Streams
Polynomial Interpolation of the Elliptic Curve and XTR Discrete Logarithm
On Contact Representations of Directed Planar Graphs
New Efficient Simple Authenticated Key Agreement Protocol
Minimum Transactions Problem
Generalized Vertex-Rankings of Partial k-trees
A Simple Local Search Gives a PTAS for the Feedback Vertex Set Problem in Minor-Free Graphs
Analyzing the Vulnerabilities of Targets in Clean-Label Data Poisoning Attacks
On Measures of Space over Real and Complex Numbers
The Complexity of Bounded Register and Skew Arithmetic Computation
Model Checking MSVL Programs Based on Dynamic Symbolic Execution
Capacitated Facility Location with Outliers/Penalties
Approximated Vertex Cover for Graphs with Perfect Matchings
A Linear-Time Algorithm for the Minimum Degree Hypergraph Problem with the Consecutive Ones Property
An Approximation for Finding a Smallest 2-Edge-Connected Subgraph Containing a Specified Spanning Tree
Subspace Approximation with Outliers
Computing and Combinatorics - 29th International Conference, COCOON 2023, Hawaii, HI, USA, December 15-17, 2023, Proceedings, Part I
Approximating 3D Points with Cylindrical Segments
Better Approximation of Diagonal-Flip Transformation and Rotation Transformation
Homomorphic Evaluation of Lattice-Based Symmetric Encryption Schemes
Bilevel Adversarial Scheduling Problem on Parallel Machines
On the Threshold of Having a Linear Treewidth in Random Graphs
Algorithms for Partition of Some Class of Graphs under Compaction
On Assigning Prefix Free Codes to the Vertices of a Graph
A Short-Term Prediction Model of Topic Popularity on Microblogs
Constrained Hitting Set Problem with Intervals
On the Approximation of Computing Evolutionary Trees
Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm
New Architecture and Algorithms for Degradable VLSI/WSI Arrays
Efficient Algorithms for the kSmallest Cuts Enumeration
Probabilistic Local Majority Voting for the Agreement Problem on Finite Graphs
Limits to List Decoding Random Codes
Efficient Power-Sum Systolic Architectures for Public-Key Cryptosystems in GF(2 m )
On a Fixed Haplotype Variant of the Minimum Error Correction Problem
Optimal Coding with One Asymmetric Error: Below the Sphere Packing Bound
The Weakly Dimension-Balanced Pancyclicity on Toroidal Mesh Graph T m, n When Both m and n Are Odd
Parallel Geometric Algorithms in Coarse-Grain Network Models
Clustering with or without the Approximation
TCFNet: Temporal-Correlated Feature Fused Network for Multivariate Time Series Classification
An Improved Lower Bound on the Growth Constant of Polyiamonds
Parameterized Algorithms for Maximum Agreement Forest on Multiple Trees
Approximation Algorithm for Prize-Collecting Hypergraph Vertex Cover with Fairness Constraints
On Linear-Size Pseudorandom Generators and Hardcore Functions
Extending the Hong-Kung Model to Memory Hierarchies
On a Conjecture on Wiener Indices in Combinatorial Chemistry
Random Schreier Graphs as Expanders
Approximate Rank Aggregation (Preliminary Version)
A Lockout Avoidance Algorithm without Using Time-Stamps for the k-Exclusion Problem
On Detecting Some Defective Items in Group Testing
A Combinatorial Approach to Anonymous Membership Broadcast
Approximating Minimum Keys and Optimal Substructure Screens
A Modified EXP3 in Adversarial Bandits with Multi-user Delayed Feedback
Data Structures for Incremental Interval Coloring
Computing with Cells: Membrane Systems
Algebraic Properties for P-Selectivity
Testing Containment of Object-Oriented Conjunctive Queries is Pi_2^p-hard
Geometric Algorithms for Agglomerative Hierarchical Clustering
An Improved Approximation Algorithm for rSPR Distance
On Set Systems with Restricted Intersections Modulo a Composite Number
Contiguous Minimum Single-Source-Multi-Sink Cuts in Weighted Planar Graphs
Computing and Combinatorics, 4th Annual International Conference, COCOON '98, Taipei, Taiwan, R.o.C., August 12-14, 1998, Proceedings
On the Right-Seed Array of a String
Red-Black Spanners for Mixed-Charging Vehicular Networks
An FPT Constant-Factor Approximation Algorithm for Correlation Clustering
Complexity of Counting the Optimal Solutions
Parameterized Complexity of Influence Maximization
Randomly Generating Triangulations of a Simple Polygon
Projective Torus Networks
On an Online Traveling Repairman Problem with Flowtimes: Worst-Case and Average-Case Analysis
Many-to-One Packed Routing via Matchings
Majority Equilibrium for Public Facility Allocation (Preliminary Version)
Cylindrical Hierarchy for Deforming Necklaces
Improved Non-approximability Results for Vertex Cover with Density Constraints
On the Complexity of the Balanced Vertex Ordering Problem
An Efficient k Nearest Neighbor Searching Algorithm for a Query Line
Random Shortening of Linear Codes and Applications
On the Kernelization Complexity of String Problems
Finding Maximal Common Subgraphs via Time-Space Efficient Reverse Search
On the Mystery of Negations in Circuits: Structure vs Power
The Complexity of Counting Solutions to Systems of Equations over Finite Semigroups
Bicriteria Approximation Algorithms for the Unit Disk Coverage Problem
Algorithms for Almost-uniform Generation with an Unbiased Binary Source
Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model
Optimal Strategies for the One-Round Discrete Voronoi Game on a Line
Minimum Congestion Embedding of Complete Binary Trees into Tori
Incremental Optimization of Independent Sets Under the Reconfiguration Framework
On Boolean Lowness and Boolean Highness
Efficient Fixed-Size Systolic Arrays for the Modular Multiplication
Semidefinite Programming and its Applications to NP Problems
Generalized Sweeping Line Spanners
Approximation Algorithms for a Network Design Problem
Optimal Tree Structures for Group Key Tree Management Considering Insertion and Deletion Cost
Primal-Dual Approximation Algorithms for Submodular Vertex Cover Problems with Linear/Submodular Penalties
Topological Network-Control Games
A Note on the Self-Witnessing Property of Computational Problems
Random Methods for Parameterized Problems
Maximum Weight Independent Sets in ( S_1, 1, 3 , bull)-free Graphs
Circuits and Context-Free Languages
Computing Convex-Straight-Skeleton Voronoi Diagrams for Segments and Convex Polygons
Distributions of Points in d Dimensions and Large k -Point Simplices
Contrast-Optimal k out of n Secret Sharing Schemes in Visual Cryptography
Supertrees by Flipping
Depth Distribution in High Dimensions
Truthfulness for the Sum of Weighted Completion Times
Commuting Quantum Circuits with Few Outputs are Unlikely to be Classically Simulatable
Heterogeneous Subset Sampling
A New Measure of Edit Distance between Labeled Trees
Effect of Corner Information in Simultaneous Placement of K Rectangles and Tableaux
Computing Infinite Relations Using Finite Expressions: A New Approach To The Safety Issue In Relational Databases
On the Parameterized Complexity of Labelled Correlation Clustering Problem
The Rectilinear Steiner Tree Problem with Given Topology and Length Restrictions
Proactive Bi-objective Multi-path Planning for Wireless Sensor Networks
Linear-Time Algorithms for Eliminating Claws in Graphs
Opportunistic Data Structures for Range Queries
Cophenetic Distances: A Near-Linear Time Algorithmic Framework
Constructing Independent Spanning Trees on Bubble-Sort Networks
Improving Local Search for Weighted Partial MaxSAT by Initializing with Historical Information
On All-Substrings Alignment Problems
Dominating Set on Overlap Graphs of Rectangles Intersecting a Line
Crossing-Optimal Acyclic HP-Completion for Outerplanar st -Digraphs
Minimum Color Spanning Circle in Imprecise Setup
Computable Invariance
Improved Approximation Algorithms for Computing k Disjoint Paths Subject to Two Constraints
Algorithmic Aspects of Disjunctive Domination in Graphs
Threshold Rules for Online Sample Selection
The Web as a Graph: Measurements, Models, and Methods
On the Complexity of Finding an Unknown Cut Via Vertex Queries
On the Minimum Caterpillar Problem in Digraphs
Private Neural Network Training with Packed Secret Sharing
Limit Property of Unbalanced Development in Economic Network
Assortment Planning with Sponsored Products
Course Design and Textbook Development for Introduction to Computer Systems Course in the Era of Concurrency
Super-Polynomial Versus Half-Exponential Circuit Size in the Exponential Hierarchy
Combinatorial Group Testing for Corruption Localizing Hashing
Frequent-Itemset Mining Using Locality-Sensitive Hashing
Tight Gap-Dependent Memory-Regret Trade-Off for Single-Pass Streaming Stochastic Multi-Armed Bandits
Efficient Non-intersection Queries on Aggregated Geometric Data
Single-Pass Streaming Algorithms to Partition Graphs into Few Forests
New Results for Network Pollution Games
Semi-strict Chordal Digraphs
A Truthful (2-2/ k )-Approximation Mechanism for the Steiner Tree Problem with k Terminals
Understanding and Inductive Inference
Competitive Cost-Savings in Data Stream Management Systems
Spectrum Bidding in Wireless Networks and Related
On Reachability in Graphs with Bounded Independence Number
Simultaneous Embeddings with Vertices Mapping to Pre-specified Points
Simpler Algorithms for Testing Two-Page Book Embedding of Partitioned Graphs
Finding Paths with Minimum Shared Edges
1.6-Approximation Algorithm for Generalized Traveling Salesman Path Problem
Fitch Graph Completion
Maximin Share Allocation Under Knapsack Constraints
Fast Separator Decomposition for Finite Element Meshes
Rapid Homology Search with Two-Stage Extension and Daughter Seeds
Finding Cheapest Deadline Paths
Computing and Combinatorics, 15th Annual International Conference, COCOON 2009, Niagara Falls, NY, USA, July 13-15, 2009, Proceedings
Online Interval Scheduling to Maximize Total Satisfaction
Efficient Algorithms for Simplifying Flow Networks
A Tight Analysis of the Maximal Matching Heuristic
The Colored Sector Search Tree: A Dynamic Data Structure for Efficient High Dimensional Nearest-Foreign-Neighbor Queries
Counting Polycubes without the Dimensionality Curse
New Bounds on the Number of Edges in a k-Map Graph
Sublinear Time Approximate Sum via Uniform Random Sampling
Convex Recoloring Revisited: Complexity and Exact Algorithms
A Discharging Method: Improved Kernels for Edge Triangle Packing and Covering
Robust Reductions
Summing Symbols in Mutual Recurrences
Constructions of Teaching Materials, Curriculums, and the Teaching System Cross-Region for "Solving Problems by Programming"
Removing Complexity Assumptions from Concurrent Zero-Knowledge Proofs
Output-Sensitive Reporting of Disjoint Paths (Extended Abstract)
HITS Can Converge Slowly, but Not Too Slowly, in Score and Rank
On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms
A Parameterized Algorithm for Bounded-Degree Vertex Deletion
Properties of Symmetric Incentive Compatible Auctions
A Study for Conditional Diagnosability of Pancake Graphs
An Algorithm for Identifying Spliced Languages
On the Complexity of Computational Problems Associated with Simple Stochastic Games (Extended Abstract)
Time-Space Tradeoffs for Dynamic Programming Algorithms in Trees and Bounded Treewidth Graphs
Quantum Algorithms for Finding Constant-Sized Sub-hypergraphs
Combination of Two-Machine Flow Shop Scheduling and Shortest Path Problems
Extending MSVL with Semaphore
Efficient Parallel Algorithms for some Tree Layout Problems
Constant Factor Approximation Algorithm for l-Pseudoforest Deletion Problem
A Physical Zero-Knowledge Proof for Sumplete, a Puzzle Generated by ChatGPT
Randomized Quicksort and the Entropy of the Random Source
Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT
On Universally Polynomial Context-Free Languages
Reductions and Convergence Rates of Average Time
Reoptimization of Minimum Latency Problem
Activation Probability Maximization for Target Users Under Influence Decay Model
Lower Bounds of Functions on Finite Abelian Groups
Largest Area Convex Hull of Axis-Aligned Squares Based on Imprecise Data
Inferring Peptide Composition from Molecular Formulas
Approximation Algorithms for the b -Edge Dominating Set Problem and Its Related Problems
Constructing Tree Decompositions of Graphs with Bounded Gonality
Extended Formulations via Decision Diagrams
The Greedier the Better: An Efficient Algorithm for Approximating Maximum Independent Set
A Theoretical Upper Bound for IP-Based Floorplanning
Improved Lower Bounds for the Online Bin Packing Problem with Cardinality Constraints
A Kolmogorov Complexity Proof of the Lovász Local Lemma for Satisfiability
Restricted Mesh Simplification Using Edge Contractions
Approximating the Minimum Independent Dominating Set in Perturbed Graphs
Tripods Do Not Pack Densely
New Approximation Algorithms for Some Dynamic Storage Allocation Problems
On Totally Unimodularity of Edge-Edge Adjacency Matrices
Geometric Intersection Graphs: Do Short Cycles Help?
Bounded Computable Enumerability and Hierarchy of Computably Enumerable Reals
Broadcasting in General Networks I: Trees
Deletion Graph Problems Based on Deadlock Resolution
A Sparse Dynamic Programming Algorithm for Solving the Coding Sequence Design Problem
On Three Parameters of Invisibility Graphs
Routing and Coloring for Maximal Number of Trees
The Bound Coverage Problem by Aligned Disks in L 1 Metric
Mappings for Conflict-Free Access of Paths in Elementary Data Structures
Diameter of Colorings Under Kempe Changes
Improved Algorithms for the Point-Set Embeddability Problem for Plane 3-Trees
SDP Primal-Dual Approximation Algorithms for Directed Hypergraph Expansion and Sparsest Cut with Product Demands
On the Approximation Hardness of Geodetic Set and Its Variants
Enhancing Crowding Event Detection on Campus with Multidimensional Logs: A Meta-Heuristic Search Approach
Layout Problems on Lattice Graphs
Self-Assembling Finite Automata
The Informational Content of Canonical Disjoint NP-Pairs
Partitioning a Multi-weighted Graph to Connected Subgraphs of Almost Uniform Size
Cluster: A Fast Tool to Identify Groups of Similar Programs
Computing and Combinatorics, 12th Annual International Conference, COCOON 2006, Taipei, Taiwan, August 15-18, 2006, Proceedings
Error-Set Codes and Related Objects
Improved Approximation Algorithms for Multidepot Capacitated Vehicle Routing
On the Sequential Price of Anarchy of Isolation Games
On Some City Guarding Problems
Can Large Fanin Circuits Perform Reliable Computations in the Presence of Noise ?
Minimizing Mean Response Time in Batch Processing System
Approximate Set Union via Approximate Randomization
Two-Dimensional On-Line Bin Packing Problem with Rotatable Items
Multilevel Drawings of Clustered Graphs
On the Generalised Character Compatibility Problem for Non-branching Character Trees
LP-Based Pivoting Algorithm for Higher-Order Correlation Clustering
MNP: A Class of NP Optimization Problems (Extended Abstract)
Maximizing Diversity and Persuasiveness of Opinion Articles in Social Networks
Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees
Facility Location Games with Group Externalities
Weight Biased Leftist Trees and Modified Skip Lists
Some Results on Critical (P 5,H )-Free Graphs
A Sublinear Time Randomized Algorithm for Coset Enumeration in the Black Box Model
Generating Well-Shaped d-dimensional Delaunay Meshes
Bend Complexity and Hamiltonian Cycles in Grid Graphs
How Good Is Sink Insertion?
On the 2-Central Path Problem
Unconstrained and Constrained Fault-Tolerant Resource Allocation
Approximation Algorithms for the Watchman Route and Zookeeper's Problems
Overlaps Help: Improved Bounds for Group Testing with Interval Queries
On The Bahncard Problem
A Characterization of Uniquely Representable Two-Directional Orthogonal Ray Graphs
Counting Overlapping Pairs of Words
Bi-criteria Sublinear Time Algorithms for Clustering with Outliers in High Dimensions
On Public-Key Cryptosystem Based on Church-Rosser String-Rewriting Systems (Extended Abstract)
A Dominating Set Based Approach to Identify Effective Leader Group of Social Network
Imbalance Is Fixed Parameter Tractable
A Further Improvement on Approximating TTP-2
Computing Minimum Dilation Spanning Trees in Geometric Graphs
A Duality between Small-Face Problems in Arrangements of Lines and Heilbronn-Type Problems
On Crossing Numbers of 5-Regular Graphs
Perfect Indistinguishability Obfuscation for Boolean Polynomial Vector Spaces via Learning
On the Complexity of Insertion Propagation with Functional Dependency Constraints
Tally Languages Accepted by Alternating Multitape Finite Automata
Robust Matroid Bandit Optimization Against Adversarial Contamination
Computing and Combinatorics, 14th Annual International Conference, COCOON 2008, Dalian, China, June 27-29, 2008, Proceedings
A New Measure for Locally t-Diagnosable Under PMC Model
Rectangular Drawings of Plane Graphs Without Designated Corners
Hardness and Approximation Results of Roman {3}-Domination in Graphs
Recent Progress and Prospects for Integer Factorisation Algorithms
Approximation Algorithms for a Two-Phase Knapsack Problem
Identity-Based Authenticated Asymmetric Group Key Agreement Protocol