yusuke1997/dblp-id-title huggingface dataset:
A New Approach for Solving the Maximum Clique Problem
Fixed-Parameter Algorithms for Kemeny Scores
Improved Parameterized Algorithms for Mixed Domination
Some Results on Incremental Vertex Cover Problem
An Efficient Algorithm for Evacuation Problems in Dynamic Network Flows with Uniform Arc Capacity
Efficient Memoization for Approximate Function Evaluation over Sequence Arguments
Some Basics on Tolerances
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management - Joint International Conference, FAW-AAIM 2011, Jinhua, China, May 28-31, 2011. Proceedings
Local Search Approximation Algorithms for the Spherical k-Means Problem
A Risk-Reward Competitive Analysis of the Bahncard Problem
On Covering Points with Minimum Turns
On Fixed-Order Book Thickness Parameterized by the Pathwidth of the Vertex Ordering
Class Ramsey Numbers Involving Induced Graphs
Algorithmic Applications in Management, First International Conference, AAIM 2005, Xian, China, June 22-25, 2005, Proceedings
On Approximating an Implicit Cover Problem in Biology
An Incremental Approach to Link Evaluation in Topic-Driven Web Resource Discovery
A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing
Fair Division with Weighted and Prioritized Agents
Comparison of Two Algorithms for Computing Page Importance
Range Partitioning Within Sublinear Time in the External Memory Model
Digraph Strong Searching: Monotonicity and Complexity
Robust Airline Fleet Assignment: Imposing Station Purity Using Station Decomposition
Constrained Stochastic Submodular Maximization with State-Dependent Costs
Level of Repair Analysis and Minimum Cost Homomorphisms of Graphs
The Frequency of the Optimal Hamiltonian Cycle Computed with Frequency Quadrilaterals for Traveling Salesman Problem
Computing the One-Visibility Copnumber of Trees
A Dense Hierarchy of Sublinear Time Approximation Schemes for Bin Packing
Constant-Factor Greedy Algorithms for the Asymmetric p-Center Problem in Parameterized Complete Digraphs
Quantum Lung Segmentation: QCU-Net Applied to Chest X-Ray Images
A Fast FPTAS for Two Dimensional Barrier Coverage Using Sink-Based Mobile Sensors with MinSum Movement
An Iterative Method for Generating Loop Invariants
On Perfect Absorbants in De Bruijn Digraphs
On the Transversal Number of k-Uniform Connected Hypergraphs
New Lower Bounds on Broadcast Function
Algorithmic Aspects in Information and Management - 13th International Conference, AAIM 2019, Beijing, China, August 6-8, 2019, Proceedings
Single Machine Scheduling with an Operator Non-availability Period to Minimize Total Completion Time
Online Uniformly Inserting Points on Grid
Weighted Broadcast in Linear Radio Networks
Contracted Webgraphs: Structure Mining and Scale-Freeness
BMA * : An Efficient Algorithm for the One-to-Some Shortest Path Problem on Road Maps
Algorithmic Aspects in Information and Management - 10th International Conference, AAIM 2014, Vancouver, BC, Canada, July 8-11, 2014. Proceedings
A Cost-Efficient Scheduling Algorithm for Traffic Grooming
Online Bottleneck Matching on a Star
Maximizing the Throughput of Multiple Machines On-Line
Submodular Participatory Budgeting
Obtaining Split Graphs by Edge Contraction
Design and Implementation of List and Dictionary in XD-M Language
On Approximation Algorithm for the Edge Metric Dimension Problem
On Envy-Free Pareto Efficient Pricing
Plane Segmentation for Proportional Division of Resources
Minimum Cost Homomorphism Dichotomy for Oriented Cycles
An Efficient, and Fast Convergent Algorithm for Barrier Options
On-line Single Machine Scheduling with Release Dates and Submodular Rejection Penalties
Robust t-Path Topology Control Algorithm in Wireless Ad Hoc Networks
An Almost Linear Time 2.8334-Approximation Algorithm for the Disc Covering Problem
An Optimal On-Line Algorithm for Preemptive Scheduling on Two Uniform Machines in the l p Norm
A Bi-criteria Analysis for Fuzzy C-means Problem
Minimax Regret k-sink Location Problem in Dynamic Path Networks
Algorithmic Aspects in Information and Management, Third International Conference, AAIM 2007, Portland, OR, USA, June 6-8, 2007, Proceedings
Discrete online TSP
An Approximation Algorithm for Weak Vertex Cover Problem in Network Management
On Variants of the Spanning Star Forest Problem
Cost-Sharing Mechanisms for the Selfish Open-End Bin Packing Problem
Graph Bandwidth of Weighted Caterpillars
Expressive Commerce and Its Application to Sourcing: How We Conducted $25 Billion of Generalized Combinatorial Auctions
Approximation Algorithms for Balancing Signed Graphs
A Polynomial Time Algorithm to Find Star Chromatic Index on Bounded Treewidth Graphs with Given Maximum Degree
A Very Fast String Matching Algorithm Based on Condensed Alphabets
Online Exploration of All Vertices in a Simple Polygon
A Comparison of Performance Measures via Online Search
Narrowing the Complexity Gap for Colouring (C s , P t )-Free Graphs
The Complexity of Power-Index Comparison
Recent Developments in the Mechanism Design Problem for Scheduling
A Decentralized Auction Framework with Privacy Protection in Mobile Crowdsourcing
On P 3-Convexity of Graphs with Bounded Degree
Online Minimum Makespan Scheduling with a Buffer
Shortest Path Queries in Polygonal Domains
Approximating Max k-Uncut via LP-rounding Plus Greed, with Applications to Densest k-Subgraph
Polygonal Curve Approximation Using Grid Points with Application to a Triangular Mesh Generation with Small Number of Different Edge Lengths
Multi-Multiway Cut Problem on Graphs of Bounded Branch Width
An Inverse Malfatti's Problem
Some Remarks on the Incompressibility of Width-Parameterized SAT Instances
Single Bounded Parallel-Batch Machine Scheduling with an Unavailability Constraint and Job Delivery
Scheduling a Flexible Batching Machine
Kernels for Packing and Covering Problems - (Extended Abstract)
Finding Faithful Boyce-Codd Normal Form Decompositions
Optimal Order Allocation with Discount Pricing
The k-power Domination Problem in Weighted Trees
An Auction-Bargaining Model for Initial Emission Permits
Quantum Annealing and GNN for Solving TSP with QUBO
Multi-attribute Based Influence Maximization in Social Networks
The Independence Numbers of Weighted Graphs with Forbidden Cycles
Integer Polyhedra for Program Analysis
Linear Programming Polytope and Algorithm for Mean Payoff Games
Dynamically Updating the Exploiting Parameter in Improving Performance of Ant-Based Algorithms
Temperature Aware Online Algorithms for Scheduling Equal Length Jobs
Algorithms for Counting 2-SatSolutions and Colorings with Applications
Improved Approximation Algorithms for Predicting RNA Secondary Structures with Arbitrary Pseudoknots
Solving Difficult SAT Problems by Using OBDDs and Greedy Clique Decomposition
Secure Overlay Network Design
Embedding K Edge-Disjoint Hamiltonian Cycles on Folded Hypercubes
Atomic Routing Games on Maximum Congestion
Edge-Face List Coloring of Halin Graphs
Reliable Edge Intelligence Using JPEG Progressive
Algorithms for Interval Structures with Applications
General Rumor Blocking: An Efficient Random Algorithm with Martingale Approach
Semi-online Early Work Maximization Problem on Two Hierarchical Machines with Partial Information of Processing Time
Approximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs
Minimum Diameter Vertex-Weighted Steiner Tree
On-Line Scheduling of Parallel Jobs in Heterogeneous Multiple Clusters
Parameterized Complexity of Connected Induced Subgraph Problems
Incremental SDN Deployment to Achieve Load Balance in ISP Networks
Zero-Sum Flow Numbers of Hexagonal Grids
Finding Fair and Efficient Allocations of Indivisible Chores
Kernelization for Cycle Transversal Problems
Partial Degree Bounded Edge Packing Problem
Two-Level Push-Relabel Algorithm for the Maximum Flow Problem
Online Bicriteria Algorithms to Balance Coverage and Cost in Team Formation
Computation of Arbitrage in a Financial Market with Various Types of Frictions
Algorithmic Aspects in Information and Management, 5th International Conference, AAIM 2009, San Francisco, CA, USA, June 15-17, 2009. Proceedings
Graphs and Path Equilibria
Perfectness and Imperfectness of the kth Power of Lattice Graphs
The k-Canadian Travelers Problem with Communication
A Primal-Dual Approximation Algorithm for the k -Level Stochastic Facility Location Problem
A Branch and Bound Algorithm for Exact, Upper, and Lower Bounds on Treewidth
Online Scheduling on Parallel Machines with Two GoS Levels
A Compression-Boosting Transform for Two-Dimensional Data
Multi-AGVs Pathfinding Based on Improved Jump Point Search in Logistic Center
Wavelength Assignment for Satisfying Maximal Number of Requests in All-Optical Networks
Improved Approximation Algorithms for Patrol-Scheduling with Min-Max Latency Using Multiclass Minimum Spanning Forests
Cyclically Orderable Generalized Petersen Graphs
Three Results on Frequency Assignment in Linear Cellular Networks
Copeland Voting Fully Resists Constructive Control
Existence and Uniqueness of Strong Solutions for Stochastic Age-Dependent Population
On the Complexity of Clustering with Relaxed Size Constraints
A Heuristic Method for Selecting Support Features from Large Datasets
On ( k , ℓ)-Graph Sandwich Problems
Online BP Functions Maximization
Streaming Algorithms for Maximizing DR-Submodular Functions with d-Knapsack Constraints
Approximation Algorithms for k-Submodular Maximization Under the Fair Constraints and Size Constraints
The Complexity of Algorithms Computing Game Trees on Random Assignments
A Novel Approach to Verifying Context Free Properties of Programs
Bi-criteria Scheduling on Multiple Machines Subject to Machine Availability Constraints
Algorithmic Aspects in Information and Management, Second International Conference, AAIM 2006, Hong Kong, China, June 20-22, 2006, Proceedings
Recursive Merged Community Detection Algorithm Based on Node Cluster
Efficient Algorithms for the Prize Collecting Steiner Tree Problems with Interval Data
On Edge-Independent Sets
Approximation Algorithms for Packing Element-Disjoint Steiner Trees on Bounded Terminal Nodes
Polyhedral Circuits and Their Applications
The Coordinated Decisions of Service Supply Chain Between Tumor Healthcare Alliance and Patients Under Government Intervention
Multiple Sink Location Problems in Dynamic Path Networks
The Spherical k-means++ Algorithm via Local Search
A New Algorithm Design Technique for Hard Problems, Building on Methods of Complexity Theory
Zero-Sum Flow Numbers of Regular Graphs
Online Scheduling with Hard Deadlines on Parallel Machines
Mining a Class of Complex Episodes in Event Sequences
Know When to Persist: Deriving Value from a Stream Buffer - (Extended Abstract)
Assign Ranges in General Ad-Hoc Networks
Multiple Facility Location Games with Envy Ratio
Feasibility Testing for Dial-a-Ride Problems
An Algorithm for Portfolio's Value at Risk Based on Principal Factor Analysis
Computing the Line-Constrained k-center in the Plane for Small k
Algorithmic Aspects in Information and Management, 4th International Conference, AAIM 2008, Shanghai, China, June 23-25, 2008. Proceedings
Computing the lambda -Seeds of a String
A Parallel Algorithm for Constructing Multiple Independent Spanning Trees in Bubble-Sort Networks
Interaction-Aware Influence Maximization and Iterated Sandwich Method
Minimum Width Rectangular Annulus
On Editing Graphs into 2-Club Clusters
Approximation Guarantees for Parallelized Maximization of Monotone Non-submodular Function with a Cardinality Constraint
Facility Location Problems: A Parameterized View
Kernelization and Lower Bounds of the Signed Domination Problem
Approximation Scheme for Single-Machine Rescheduling with Job Delay and Rejection
Online Splitting Interval Scheduling on m Identical Machines
AoI Minimizing of Wireless Rechargeable Sensor Network Based on Trajectory Optimization of Laser-Charged UAV
On the Exact Block Cover Problem
On the Approximability of Some Haplotyping Problems
Sequence Jobs and Assign Due Dates with Uncertain Processing Times and Quadratic Penalty Functions
Strategyproof Mechanisms for 2-Facility Location Games with Minimax Envy
Algorithms for Bandwidth Consecutive Multicolorings of Graphs - (Extended Abstract)
Low-Dimensional Vectors with Density Bounded by 5/6 Are Pinwheel Schedulable
An Efficient Oracle for Counting Shortest Paths in Planar Graphs
A Distributed Method for Negative Content Spread Minimization on Social Networks
Makespan Minimization on Multiple Machines Subject to Machine Unavailability and Total Completion Time Constraints
Approximation Scheme for Scheduling Resumable Proportionally Deteriorating Jobs
The Seeding Algorithm for Spherical k-Means Clustering with Penalties
Online OVSF Code Assignment with Resource Augmentation
Efficient Exact and Approximate Algorithms for the Complement of Maximal Strip Recovery
An Approximation Algorithm for the Dynamic k-level Facility Location Problem
Confidently Cutting a Cake into Approximately Fair Pieces
An Efficient Algorithm for the Evacuation Problem in a Certain Class of a Network with Uniform Path-Lengths
A Distributed Approximation Algorithm for the Total Dominating Set Problem
Energy Efficient Broadcasting and Multicasting in Static Wireless Ad Hoc Networks
Optimal Timing of Firms' R&D Investment Under Asymmetric Duopoly: A Real Options and Game-Theoretic Approach
On the Fast Searching Problem
Selfish Bin Packing with Parameterized Punishment
The Complexity of Degree Anonymization by Vertex Addition
Time Sensitive Sweep Coverage with Multiple UAVs
Total Coloring of Planar Graphs Without Some Adjacent Cycles
Optimal Manpower Planning with Temporal Labor and Contract Period Constraints
Minsum Problem for Discrete and Weighted Set Flow on Dynamic Path Network
Approximation Algorithm for the Uniform Bounded Facility Problem
Efficiently Generating k-Best Solutions to Procurement Auctions
Approximation Algorithm for the Correlation Clustering Problem with Non-uniform Hard Constrained Cluster Sizes
The Early-Warning Model of Evaluation and Prevention for Venous Thromboembolism in Gynecological Tumor Surgical Patients Based on WSOM
Probe Matrix Problems: Totally Balanced Matrices
Polynomial-Time Algorithms for the Touring Rays and Related Problems
Determination of Dual Distances for a Kind of Perfect Mixed Codes
Efficient Mobile Charger Scheduling in Large-Scale Sensor Networks
A Batch Scheduling Problem of Automatic Drug Dispensing System in Outpatient Pharmacy
No lGrid-Points in Spaces of Small Dimension
An Improved Randomized Approximation Algorithm for Maximum Triangle Packing
Recent Developments in the Theory of Pre-processing
Line Segment Facility Location in Weighted Subdivisions
Algorithmic Challenge in Online Advertising
An Approximation Algorithm for Embedding a Directed Hypergraph on a Ring
Coopetitive Game, Equilibrium and Their Applications
Optimal st -Orientations for Plane Triangulations
Erratum: The Approximability of the Exemplar Breakpoint Distance Problem
Algorithmic Aspects of Upper Domination: A Parameterised Perspective
Cutting a Cake for Five People
An Improved Approximation Algorithm for Maximum Edge 2-Coloring in Simple Graphs
A PTAS for Scheduling on Agreeable Unrelated Parallel Batch Processing Machines with Dynamic Job Arrivals
Double Partition: (6+epsilon)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs
Restrained and Total Restrained Domination in Cographs
On Satisfiability Games and the Power of Congestion Games
The Secret Santa Problem
Distance Magic Labeling of the Halved Folded n-Cube
Maximizing Energy Efficiency for Charger Scheduling of WRSNs
Knowledge Graph Embedding Based on Subgraph-Aware Proximity
Factors Impacting the Label Denoising of Neural Relation Extraction
An Optimal Context for Information Retrieval
Improvement of Genetic Algorithm and Its Application in Optimization of Fuzzy Traffic Control Algorithm
Parity-Constrained Weighted k-Center
A Fast 2-Approximation Algorithm for the Minimum Manhattan Network Problem
Solving SAT Problems with TA Algorithms Using Constant and Dynamic Markov Chains Length
A Probabilistic Algorithm for Verification of Geometric Theorems
Improved Algorithms for Non-submodular Function Maximization Problem
Disjoint Small Cycles in Graphs and Bipartite Graphs
Speeding Up Constrained k-Means Through 2-Means
Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree
An Empirical Analysis of Feasibility Checking Algorithms for UTVPI Constraints
Improved Online Algorithms for Multiplexing Weighted Packets in Bounded Buffers
More Efficient Parallel Integer Sorting
Large-Scale Parallel Collaborative Filtering for the Netflix Prize
A Meeting Scheduling Problem Respecting Time and Space
Approximation Algorithms for the Lower-Bounded Knapsack Median Problem
A New Efficient Algorithm for Computing the Longest Common Subsequence
Degree-Driven Design for Correct Geometric Algorithms
Indexing Similar DNA Sequences
Stable Matching with Approval Preferences Under Partial Information
Injective Coloring of Halin Graphs
Subsequence Packing: Complexity, Approximation, and Application
Representation of Dominating Set Variants Using Dataless Neural Networks
The Characterizations and Complexity of Roman {2}-Domination and 2-Domination in Graphs
Model Establishment and Algorithm Research of Tumor Marker Combination Prediction for Colorectal Cancer
Note on an Auction Procedure for a Matching Game in Polynomial Time
A Data-Driven Segmentation of Mongolia's Business Environment Using Machine Learning
Time-Sensitive Target Coverage Under Visibility Constraints with UAVs
The Nearest Neighbor Spearman Footrule Distance for Bucket, Interval, and Partial Orders
Finding Optimal Refueling Policies in Transportation Networks
Nash Bargaining Via Flexible Budget Markets
Releasing and Scheduling of Lots in a Wafer Fab
Large Hypertree Width for Sparse Random Hypergraphs
Global Search Method for Parallel Machine Scheduling
Minimization of the Maximum Distance between the Two Guards Patrolling a Polygonal Region
The Edge-Recoloring Cost of Paths and Cycles in Edge-Colored Graphs and Digraphs
Randomized Algorithms for Removable Online Knapsack Problems
Algorithms with Limited Number of Preemptions for Scheduling on Parallel Machines
Effective Tour Searching for TSP by Contraction of Pseudo Backbone Edges
Injective Edge Coloring of Power Graphs and Necklaces
Approximation Algorithms for Cutting a Convex Polyhedron Out of a Sphere
Approximation Algorithms for Scheduling with a Variable Machine Maintenance
Constructing Correlations in Attack Connection Chains Using Active Perturbation
Efficiently Pricing European-Asian Options - Ultimate Implementation and Analysis of the AMO Algorithm
Efficient Algorithms for the Order Preserving Pattern Matching Problem
On the Complexity of Approximate Sum of Sorted List
Minimum Diameter k-Steiner Forest
On the Structure of Discrete Metric Spaces Isometric to Circles
Facility Location in a Global View
Finding Robust Minimum Cuts
Lattice Embedding of Direction-Preserving Correspondence over Integrally Convex Set
Computing Exact and Approximate Nash Equilibria in 2-Player Games
Protein Name Recognition Based on Dictionary Mining and Heuristics
How to Play the Majority Game with Liars
On Acyclicity of Games with Cycles
A New Linear Kernel for Undirected Planar Feedback Vertex Set: Smaller and Simpler
or-Submodular Maximization Under a Matroid Constraint and a Knapsack Constraint
Maximum Subgraphs in Ramsey Graphs
Wegner's Conjecture on 2-Distance Coloring
An Improved Competitive Algorithm for One-Dimensional Incremental Median Problem
An Algorithm for Optimal Acyclic Edge-Colouring of Cubic Graphs
Edge-Clique Covers of the Tensor Product
Approximation Algorithms for the Minimum Weight Cycle/Path Partition Problem
Fixed Observation Time-Step: Adaptive Influence Maximization
Where Would Refinancing Preferences Go?
Approximation Algorithm for the Balanced 2-correlation Clustering Problem on Well-Proportional Graphs
Design DiffServ Multicast with Selfish Agents
Approximation Algorithms for the Maximum Bounded Connected Bipartition Problem
Constant-Approximation for Prize-Collecting Min-Sensor Sweep Coverage with Base Stations
Visibility Testing and Counting
Three Algorithms for Converting Control Flow Statements from Python to XD-M
Scheduling Many Types of Calibrations
Independent Domination: Reductions from Circular- and Triad-Convex Bipartite Graphs to Convex Bipartite Graphs
Monotone k-Submodular Knapsack Maximization: An Analysis of the Greedy+Singleton Algorithm
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management - Joint International Conference, FAW-AAIM 2012, Beijing, China, May 14-16, 2012. Proceedings
Automatic Timetabling Using Artificial Immune System
Utilizing Large Language Models for Finding All Roots to Nonlinear Systems of Equations: Solutions, Accuracy, and Prompt Design
Randomized Approaches for Nearest Neighbor Search in Metric Space When Computing the Pairwise Distance Is Extremely Expensive
Pilot Pattern Design with Branch and Bound in PSA-OFDM System
Energy Complexity of Satisfying Assignments in Monotone Circuits: On the Complexity of Computing the Best Case
An Algorithm for Determining Whether a Pair of Polygons Is Reversible
Robustness and Approximation for the Linear Contract Design
Partial Inverse Min-Max Spanning Tree Problem Under the Weighted Bottleneck Hamming Distance
Order Preserving Barrier Coverage with Weighted Sensors on a Line
Fixed-Parameter Tractability for Book Drawing with Bounded Number of Crossings per Edge
Personalised Dissemination of Legal Information
Lost in the Flood? The Library of the Court of Justice of the European Union and Its Foreseeable Future
EU Judicial Procedures and Case Law Databases: What's Going on and What May Lay Ahead?
The Rutgers Law Library U.S. Congressional Documents Digitization Collection
Entropy in Digital Information and the Enforcement of Law: Towards a Unification of Remedies?
Semantic Finlex: Transforming, Publishing, and Using Finnish Legislation and Case Law As Linked Open Data on the Web
Improving Public Access to Legislation Through Legal Citations Detection: The Linkoln Project at the Italian Senate
Knowledge Machineries. Introducing the Instrument-Enabled Future of Legal Research and Practice
Akoma Ntoso for Making FAO Resolutions Accessible
Legal Information Institutes and AI: Free Access Legal Expertise
The European Legislation Identifier
Reasoning with Deontic Notions in a Decidable Framework
Closing the Awareness Gap Between IT Practice and IT Law
A Model of Justice as a Platform: A Case Study of Open Data Disclosure
Legal Epistemology in the Times of Big Data
Language Resources as Linked Data for the Legal Domain
Tools for Discovery: Opening Doors to Legal Research
Knowledge of the Law in the Big Data Age, Conference 'Law via the Internet 2018', Florence, Italy, 11-12 October 2018
Right to Science and Open Access to Legal Knowledge in International and European Law
The EU Council Conclusions on the Online Publication of Court Decisions
Opportunities and Challenges in the Legal Tech Services in the Italian and European Framework
Open Science, Open Doctrine, How to Share Knowledge?
DaPIS: An Ontology-Based Data Protection Icon Set
Automation, Legislative Production and Modernization of the Legislative Machine: The New Frontiers of Artificial Intelligence Applied to Law and e-Democracy
Dealing with Privacy Issues in Data Integration: Scenarios for Official Statistics
It's Not Where You Are, It's Where You Are Registered: IoT Location Impact on MUD
Towards cross-layer telemetry
Measurement Vantage Point Selection Using A Similarity Metric
Large Language Model Driven Automated Network Protocol Testing
DeadBolt: Securing IoT Deployments
Characterizing User-to-User Connectivity with RIPE Atlas
Analyzing Internet Background Radiation with Reflective Network Telescopes
Copa: Practical Delay-Based Congestion Control for the Internet
Non-Standard Large TTLs in DNS Query Responses
Measuring Adoption of Security Additions to the HTTPS Ecosystem
Using Explicit (Host-to-Network) Flow Measurements for Network Tomography
Withdrawal Symptoms: Filtering of Announcements from a Route Collector System
Making Google Congestion Control robust over Wi-Fi networks using packet grouping