yusuke1997/dblp-id-title huggingface dataset:
Head Finalization Reordering for Chinese-to-Japanese Machine Translation
Manipuri-English Bidirectional Statistical Machine Translation Systems using Morphology and Dependency Relations
Word's Vector Representations meet Machine Translation
Dependency-Based Automatic Evaluation for Machine Translation
Ternary Segmentation for Improving Search in Top-down Induction of Segmental ITGs
Seeding Statistical Machine Translation with Translation Memory Output through Tree-Based Structural Alignment
Translating Negation: Induction, Search And Model Errors
Proceedings of the Third Workshop on Syntax and Structure in Statistical Translation, SSST@HLT-NAACL 2009, Boulder, CO, USA, June 5, 2009
Improving Chinese-English PropBank Alignment
Intersecting Hierarchical and Phrase-Based Models of Translation: Formal Aspects and Algorithms
A Rule-Driven Dynamic Programming Decoder for Statistical MT
Hierarchical Alignment Decomposition Labels for Hiero Grammar Rules
Empirical Lower Bounds on Aligment Error Rates in Syntax-Based Machine Translation
Towards Probabilistic Acceptors and Transducers for Feature Structures
Transduction Recursive Auto-Associative Memory: Learning Bilingual Compositional Distributed Vector Representations of Inversion Transduction Grammars
Proceedings of the Second Workshop on Syntax and Structure in Statistical Translation, SSST@ACL 2008, Columbus, Ohio, USA, June 20, 2008
Combining Word Reordering Methods on different Linguistic Abstraction Levels for Statistical Machine Translation
A CYK+ Variant for SCFG Decoding Without a Dot Chart
Comparing Reordering Constraints for SMT Using Efficient BLEU Oracle Computation
Discriminative Reordering with Chinese Grammatical Relations Features
Automatic Projection of Semantic Structures: an Application to Pairwise Translation Ranking
Experiments in Discriminating Phrase-Based Translations on the Basis of Syntactic Coupling Features
Linguistically-Enriched Models for Bulgarian-to-English Machine Translation
Combining Top-down and Bottom-up Search for Unsupervised Induction of Transduction Grammars
New Parameterizations and Features for PSCFG-Based Machine Translation
Reducing the Impact of Data Sparsity in Statistical Machine Translation
Machine Translation as Tree Labeling
Transformation and Decomposition for Efficiently Implementing and Improving Dependency-to-String Model In Moses
Proceedings of the Ninth Workshop on Syntax, Semantics and Structure in Statistical Translation, SSST@NAACL-HLT 2015, Denver, Colorado, USA, 4 June 2015
Prior Derivation Models For Formally Syntax-Based Translation Using Linguistically Syntactic Parsing and Tree Kernels
Translation reranking using source phrase dependency features
Syntax-Driven Learning of Sub-Sentential Translation Equivalents and Translation Rules from Parsed Parallel Corpora
Imposing Constraints from the Source Tree on ITG Constraints for SMT
Factorization of Synchronous Context-Free Grammars in Linear Time
How Synchronous are Adjuncts in Translation Data?
Semantic vs. Syntactic vs. N-gram Structure for Machine Translation Evaluation
Decoding with Syntactic and Non-Syntactic Phrases in a Syntax-Based Machine Translation System
Improved Language Modeling for English-Persian Statistical Machine Translation
Syntactic Reordering Integrated with Phrase-Based SMT
An Evaluation and Possible Improvement Path for Current SMT Behavior on Ambiguous Nouns
Overcoming the Curse of Sentence Length for Neural Machine Translation using Automatic Segmentation
Proceedings of the Sixth Workshop on Syntax, Semantics and Structure in Statistical Translation, SSST@ACT 2012, Jeju, Korea, 12 July 2012
Using Parallel Features in Parsing of Machine-Translated Sentences for Correction of Grammatical Errors
Better Semantic Frame Based MT Evaluation via Inversion Transduction Grammars
A Study of Translation Rule Classification for Syntax-based Statistical Machine Translation
A Walk on the Other Side: Using SMT Components in a Transfer-Based Translation System
Towards a Predicate-Argument Evaluation for MT
On 2-Strong Connectivity Orientations of Mixed Graphs and Related Problems
An Optimal Algorithm for the Popular Condensation Problem
Speeding Up Cover Time of Sparse Graphs Using Local Knowledge
Further Results on the Mycielskian of Graphs
Combinatorial Algorithms - 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers
On Fast Enumeration of Pseudo Bicliques
Optimal Monomial Quadratization for ODE Systems
Simple Random Sampling of Binary Forests with Fixed Number of Nodes and Trees
Minimum Polygons for Fixed Visibility VC-Dimension
Testing the Simultaneous Embeddability of Two Graphs Whose Intersection Is a Biconnected Graph or a Tree
On Critical Node Problems with Vulnerable Vertices
The Min-max Edge q-Coloring Problem
Parameterized Longest Previous Factor
Iterated Type Partitions
Power Edge Set and Zero Forcing Set Remain Difficult in Cubic Graphs
Range Extremum Queries
Drawing Reeb Graphs
Chains-into-Bins Processes
Burn and Win
Loose Cover of Graphs by a Local Structure
Fast Pattern Matching with Epsilon Transitions
Shortest Paths between Shortest Paths and Independent Sets
Fast Convolutions and Their Applications in Approximate String Matching
List Colouring and Partial List Colouring of Graphs On-line
Kernel in Oriented Circulant Graphs
Makespan Trade-Offs for Visiting Triangle Edges - (Extended Abstract)
Advice Complexity of the Online Search Problem
Resolving Sets in Temporal Graphs
Efficient Chaining of Seeds in Ordered Trees
Complexity and Algorithms for Semipaired Domination in Graphs
A Linear Algorithm for Radio k-Coloring Powers of Paths Having Small Diameter
An Adjacency Labeling Scheme Based on a Decomposition of Trees into Caterpillars
Optimal Random Bit Complexity in Efficient Sampling of Set Partition-Like Structures
Efficient Neighborhood Encoding for Interval Graphs and Permutation Graphs and O ( n ) Breadth-First Search
Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth
Decremental Optimization of Dominating Sets Under the Reconfiguration Framework
Parameterized Algorithms for Graph Burning Problem
Point Enclosure Problem for Homothetic Polygons
Planar Biconnectivity Augmentation with Fixed Embedding
Randomized Postoptimization of Covering Arrays
Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing
Circuit Complexity of Shuffle
On Maximum Rank Aggregation Problems
A \varGamma -magic Rectangle Set and Group Distance Magic Labeling
On the Existence of a Subgroup Magic Rectangle
Self-similar planar graphs as models for complex networks
Make a Graph Singly Connected by Edge Orientations
Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs
On the Complexity of Rainbow Coloring Problems
Approximate Cycle Double Cover
How Not to Characterize Planar-Emulable Graphs
A New View on Rural Postman Based on Eulerian Extension and Matching
On Antimagic Labeling of Odd Regular Graphs
On the Finiteness of k-Vertex-Critical 2P 2 -Free Graphs with Forbidden Induced Squids or Bulls
The Complexity Status of Problems Related to Sparsest Cuts
Edge-Disjoint Branchings in Temporal Graphs
Computational Complexity Relationship between Compaction, Vertex-Compaction, and Retraction
On an Ordering Problem in Weighted Hypergraphs
Combinatorial Algorithms - 35th International Workshop, IWOCA 2024, Ischia, Italy, July 1-3, 2024, Proceedings
Capacity-Preserving Subgraphs of Directed Flow Networks
Skyline Computation with Noisy Comparisons
Approximating Subset Sum Ratio via Subset Sum Computations
Combinatorial Algorithms - 33rd International Workshop, IWOCA 2022, Trier, Germany, June 7-9, 2022, Proceedings
Approximation Results for the Incremental Knapsack Problem
A Golden Ratio Parameterized Algorithm for Cluster Editing
Piercing All Translates of a Set of Axis-Parallel Rectangles
Dichotomy for Coloring of Dart Graphs
Touring Polygons: An Approximation Algorithm
An improved Algorithm for the Black-and-White Coloring Problem on Trees
Combinatorial Algorithms - 32nd International Workshop, IWOCA 2021, Ottawa, ON, Canada, July 5-7, 2021, Proceedings
Using Edge Contractions and Vertex Deletions to Reduce the Independence Number and the Clique Number
Convex-Geometric k-Planar Graphs Are Convex-Geometric (k+1)-Quasiplanar
An Application of Completely Separating Systems to Graph Labeling
Path factors and parallel knock-out schemes of almost claw-free graphs
Monotone Classes, Even Graphs and the Hamiltonian Cycle Problem
Degree Associated Edge Reconstruction Number
Solving Group Interval Scheduling Efficiently
Bounded Embeddings of Graphs in the Plane
Bicriteria FPT-Approximation Algorithms for Vertex Deletion to Bounded Degeneracy Graphs
Matchings in Hypercubes Extend to Long Cycles
List Covering of Regular Multigraphs
Finding Gapped Palindromes Online
Perfect Roman Domination: Aspects of Enumeration and Parameterization
Efficient Reconstruction of RC-Equivalent Strings
Algorithm and Hardness Results on Liar's Dominating Set and \varveck -tuple Dominating Set
On a Relationship between Completely Separating Systems and Antimagic Labeling of Regular Graphs
An Additive Approximation Scheme for the Nash Social Welfare Maximization with Identical Additive Valuations
Minimum Surgical Probing with Convexity Constraints
Construction Techniques for Digraphs with Minimum Diameter
Metric Dimension for Amalgamations of Graphs
Intractability in Graph Drawing and Geometry: FPT Approaches
Gray Code Compression
Extension and Its Price for the Connected Vertex Cover Problem
Feedback Vertex Set on Graphs of Low Cliquewidth
Induced Subtrees in Interval Graphs
The Crossing Number of Seq-Shellable Drawings of Complete Graphs
Phase Transition of Random Non-uniform Hypergraphs
Distance from Triviality 2.0: Hybrid Parameterizations
On the Computational Complexity of Degenerate Unit Distance Representations of Graphs
Inverting Parameterized Burrows-Wheeler Transform
Improved Steiner Tree Algorithms for Bounded Treewidth
Finding Small Complete Subgraphs Efficiently
Solution of Peter Winkler's Pizza Problem
On Computing Large Temporal (Unilateral) Connected Components
SAT and IP Based Algorithms for Magic Labeling with Applications
Computational Complexity of Robot Arm Simulation Problems
Kinetic Euclidean Minimum Spanning Tree in the Plane
Gray Codes for AT-Free Orders via Antimatroids
Separating Interaction Effects Using Locating and Detecting Arrays
Approximating Multistage Matching Problems
Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination
Approximation Algorithms for Node-Weighted Directed Steiner Problems
Minimum Activation Cost Edge-Disjoint Paths in Graphs with Bounded Tree-Width
The School Bus Routing Problem: An Analysis and Algorithm
Cop-Win Graphs with Maximal Capture-Time
Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes
Partial-Adaptive Submodular Maximization
Conjunctive Hierarchical Secret Sharing Scheme Based on MDS Codes
Covering with Clubs: Complexity and Approximability
On the Crossing Numbers of Cartesian Products of Stars and Graphs on Five Vertices
Essential Constraints of Edge-Constrained Proximity Graphs
On the Maximum Independent Set Problem in Subclasses of Subcubic Graphs
Weighted de Bruijn Graphs for the Menage Problem and Its Generalizations
Incidence Coloring Game and Arboricity of Graphs
Fair Packing of Independent Sets
1-Extendability of Independent Sets
Augmenting a Tree to a k-Arbor-Connected Graph with Pagenumber k
The Cover Time of Cartesian Product Graphs
Partitioning Bispanning Graphs into Spanning Trees
Trivially-Perfect Width
Directing Road Networks by Listing Strong Orientations
Lower Bounds for Leaf Rank of Leaf Powers
LPF Computation Revisited
Super Connectivity of the Generalized Mycielskian of Graphs
Minimax Trees in Linear Time with Applications
Motif Matching Using Gapped Patterns
Distance Queries in Large-Scale Fully Dynamic Complex Networks
3-Coloring Triangle-Free Planar Graphs with a Precolored 9-Cycle
Algorithmic Aspects of the S-Labeling Problem
Vertex Cover at Distance on H-Free Graphs
Average Sensitivity of Breadth-First Search Algorithms on Grids
Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs
Reconfiguration and Enumeration of Optimal Cyclic Ladder Lotteries
An Improved Version of Cuckoo Hashing: Average Case Analysis of Construction Cost and Search Operations
Linear Clique-Width of Bi-complement Reducible Graphs
Linear Search for an Escaping Target with Unknown Speed
Fast Multiple Order-Preserving Matching Algorithms
Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions
1.5-Approximation Algorithm for the 2-Convex Recoloring Problem
Combinatorial algorithms in concorde
Coordinating Swarms of Objects at Extreme Dimensions
An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs
Reconstructing Sets of Strings from Their k-Way Projections: Algorithms & Complexity - (Extended Abstract)
Complexity of Most Vital Nodes for Independent Set in Graphs Related to Tree Structures
Reaching 3-Connectivity via Edge-Edge Additions
Making the Interval Membership Width of Temporal Graphs Connected and Bidirectional
Advice Complexity Bounds for Online Delayed ℱ-Node-, H-Node- and H-Edge-Deletion Problems
Combinatorial Algorithms - 24th International Workshop, IWOCA 2013, Rouen, France, July 10-12, 2013, Revised Selected Papers
Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings
On the Structure of Hamiltonian Graphs with Small Independence Number
On the pagenumber of the cube-connected cycles
Structure-Aware Combinatorial Group Testing: A New Method for Pandemic Screening
Shortest Unique Palindromic Substring Queries in Semi-dynamic Settings
Weighted Improper Colouring
Fully Leafed Tree-Like Polyominoes and Polycubes
Prophet Secretary for k-Knapsack and l-Matroid Intersection via Continuous Exchange Property
Minsum k-Sink Problem on Dynamic Flow Path Networks
Weighted Online Problems with Advice
Graph Parameters, Implicit Representations and Factorial Properties
On Decomposing the Complete Graph into the Union of Two Disjoint Cycles
Efficient Computation of Crossing Components and Shortcut Hulls
Further Results on Online Node- and Edge-Deletion Problems with Advice
Approximation Algorithms for the p-Hub Center Routing Problem in Parameterized Metric Graphs
Complexity of Fall Coloring for Restricted Graph Classes
Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs
Construction of Extremal Graphs
Border Correlations, Lattices, and the Subgraph Component Polynomial
Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters
Stable Noncrossing Matchings
ETH Lower Bounds for n-Queens: Time Waits for Nobody
Maximum Spectral Radius of Graphs with Connectivity at Most k and Minimum Degree at Least δ
Finding Periods in Cartesian Tree Matching
Fixed-Parameter Tractability of (n-k) List Coloring
Exact Polynomial Time Algorithm for the Response Time Analysis of Harmonic Tasks
New Approximations and Hardness Results for Submodular Partitioning Problems
Exact Learning of Weighted Graphs Using Composite Queries
Factorizations of Complete Graphs into Spanning Trees with All Possible Maximum Degrees
Placing Segments on Parallel Arcs
Hypergraph Dualization with FPT-delay Parameterized by the Degeneracy and Dimension
Improving Multikey Quicksort for Sorting Strings
Improved Approximation for Unpopularity in (3, 3)-Hypergraph Matching with One-Sided Preferences
Finding Paths Between 3-Colourings
Nonexistence Certificates for Ovals in a Projective Plane of Order Ten
Combinatorial Algorithms - 36th International Workshop, IWOCA 2025, Bozeman, MT, USA, July 21-24, 2025, Proceedings
Thread Graphs, Linear Rank-Width and Their Algorithmic Applications
An Improved Fixed-Parameter Algorithm for Max-Cut Parameterized by Crossing Number
Deterministic Fuzzy Automata on Fuzzy Regular ω -Languages
Lightweight Parameterized Suffix Array Construction
Parameterized Complexity of k -Anonymity: Hardness and Tractability
On Antimagic Labeling for Generalized Web and Flower Graphs
Computing Giant Graph Diameters
Rainbow Connection in Graphs with Minimum Degree Three
An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest
Deterministic Performance Guarantees for Bidirectional BFS on Real-World Networks
Ranking and Drawing in Subexponential Time
An Efficient Representation of Partitions of Integers
Graphs that Are Not Pairwise Compatible: A New Proof Technique (Extended Abstract)
Combinatorial Algorithms - 34th International Workshop, IWOCA 2023, Tainan, Taiwan, June 7-10, 2023, Proceedings
Parameterized Algorithms for Partial Vertex Covers in Bipartite Graphs
Computing the BWT and the LCP Array in Constant Space
Maximal Irredundant Set Enumeration in Bounded-Degeneracy and Bounded-Degree Hypergraphs
An Algorithm for Road Coloring
Linear-Time Self-stabilizing Algorithms for Minimal Domination in Graphs
On the Parameterized Complexity of Colorful Components and Related Problems
Three Complexity Results on Coloring P k -Free Graphs
On the Complexity of Singly Connected Vertex Deletion
Supermagic Graphs with Many Odd Degrees
Computing the k-Crossing Visibility Region of a Point in a Polygon
Space-Efficient B Trees via Load-Balancing
Graph Editing to a Fixed Target
On Proper Labellings of Graphs with Minimum Label Sum
Cops and Robber on Some Families of Oriented Graphs
Minimal Sum Labeling of Graphs
Approximate Word Sequence Matching on an Inverted File Index
EERTREE: An Efficient Data Structure for Processing Palindromes in Strings
Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space
Maximal Distortion of Geodesic Diameters in Polygonal Domains
A General Algorithmic Scheme for Modular Decompositions of Hypergraphs and Applications
Efficient Codon Optimization with Motif Engineering
Approximation Algorithms for Hitting Subgraphs
Efficient Unbounded Fault-Tolerant Aggregate Signatures Using Nested Cover-Free Families
Ranking and Loopless Generation of k-ary Dyck Words in Cool-lex Order
Computational Complexity of Distance Edge Labeling
Reductions of Matrices Associated with Nowhere-Zero Flows
Min-Max Relative Regret for Scheduling to Minimize Maximum Lateness
Towards a Complexity Dichotomy for Colourful Components Problems on k-caterpillars and Small-Degree Planar Graphs
Embedded Trees and the Support of the ISE
A New Temporal Interpretation of Cluster Editing
Recoverable Robust Cardinality Constrained Maximization with Commitment of a Submodular Function
Parameterized Complexity of Paired Domination
Multi-priority Graph Sparsification
Fitting Voronoi Diagrams to Planar Tesselations
Broadcasting in Stars of Cliques
The Tandem Duplication Distance Problem Is Hard over Bounded Alphabets
On the Maximum Crossing Number
On the Area Requirements of Straight-Line Orthogonal Drawings of Ternary Trees
Linear Search with Probabilistic Detection and Variable Speeds
Two Robots Patrolling on a Line: Integer Version and Approximability
Controlling Weighted Voting Games by Deleting or Adding Players with or Without Changing the Quota
Enumerating Minimal Vertex Covers and Dominating Sets with Capacity and/or Connectivity Constraints
Efficient Exploration of Anonymous Undirected Graphs
Faster Algorithm for Finding Maximum 1-Restricted Simple 2-Matchings
Kinetic Reverse k-Nearest Neighbor Problem
Approximate Realizations for Outerplanaric Degree Sequences
Disjoint Set Forest Digraph Representation for an Efficient Dominator Tree Construction
Efficient Algorithms for Decomposing Integers as Sums of Few Tetrahedral Numbers
Efficient Connectivity Testing of Hypercubic Networks with Faults
A Pretty Complete Combinatorial Algorithm for the Threshold Synthesis Problem
Minimax Regret 1-Median Problem in Dynamic Path Networks
Computing the Partial Word Avoidability Indices of Ternary Patterns
Efficiently Listing Bounded Length st-Paths
Privacy-Preserving and Co-utile Distributed Social Credit
Integrality Properties of Certain Special Balanceable Families
Bounds on Quasi-Completeness
A Study on the Existence of Null Labelling for 3-Hypergraphs
The Red-Blue Separation Problem on Graphs
Approximating the Max Edge-Coloring Problem
The Pony Express Communication Problem
Skyline Groups Are Ideals. An Efficient Algorithm for Enumerating Skyline Groups
Minimum Degree Conditions and Optimal Graphs for Completely Independent Spanning Trees
Reconfiguration of Steiner Trees in an Unweighted Graph
On partitional labelings of graphs
An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs
Approaches and Mathematical Models for Robust Solutions to Optimization Problems with Stochastic Problem Data Instances
Computing Longest Common Subsequence Under Cartesian-Tree Matching Model
Disjoint Clustering in Combinatorial Circuits
On the Average Case of MergeInsertion
Indexing Highly Repetitive Collections
Detecting K 2,3 as an Induced Minor
Antibandwidth of d-Dimensional Meshes
Isomorphic Unordered Labeled Trees up to Substitution Ciphering
A Sequential Recursive Implementation of Dead-Zone Single Keyword Pattern Matching
Parameterized Algorithms for Eccentricity Shortest Path Problem
The (2, 1)-Total Labeling Number of Outerplanar Graphs Is at Most Δ + 2
Improved Complexity for Power Edge Set Problem
Star-Forest Decompositions of Complete Graphs
Computing Minimum Length Representations of Sets of Words of Uniform Length
Hamiltonian Orthogeodesic Alternating Paths
Speeding up Dynamic Programming in the Line-Constrained k-median
Contagious Sets in Dense Graphs
Intersecting Disks Using Two Congruent Disks
Analysis of Information Leakage Due to Operative Errors in Card-Based Protocols
Crushing Disks Efficiently
A Parameterized Perspective on Attacking and Defending Elections
Heuristically Enhanced IPO Algorithms for Covering Array Generation
Hypergraph Covering Problems Motivated by Genome Assembly Questions
On the Complexity of Broadcast Domination and Multipacking in Digraphs
Entire H-irregularity Strength of Plane Graphs
On the Expected Number of Distinct Gapped Palindromic Factors
On Integer Linear Programs for Treewidth Based on Perfect Elimination Orderings
Combinatorial Algorithms - 31st International Workshop, IWOCA 2020, Bordeaux, France, June 8-10, 2020, Proceedings
Extremal Kernelization: A Commemorative Paper
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
Adding Isolated Vertices Makes Some Online Algorithms Optimal
The 1-Neighbour Knapsack Problem
A Shift Gray Code for Fixed-Content Łukasiewicz Words
Combinatorial Algorithms - 27th International Workshop, IWOCA 2016, Helsinki, Finland, August 17-19, 2016, Proceedings
Burrows-Wheeler Transform of Words Defined by Morphisms
On the Galois Lattice of Bipartite Distance Hereditary Graphs
Derandomization for k-Submodular Maximization
Suffix Tree of Alignment: An Efficient Index for Similar Data
A Suffix Tree Or Not a Suffix Tree?
A Graph Theoretic Model to Solve the Approximate String Matching Problem Allowing for Translocations
Reconfiguring Simple s, t Hamiltonian Paths in Rectangular Grid Graphs
On Improved Exact Algorithms for L (2, 1)-Labeling of Graphs
Generating Cyclic Rotation Gray Codes for Stamp Foldings and Semi-meanders
Combinatorial Algorithms - 29th International Workshop, IWOCA 2018, Singapore, July 16-19, 2018, Proceedings
Cryptographic Limitations on Polynomial-Time a Posteriori Query Learning
Optimal In-place Algorithms for Basic Graph Problems
An Improved Scheme in the Two Query Adaptive Bitprobe Model
Improved Approximation Algorithm for the Number of Queries Necessary to Identify a Permutation
Testing Monotone Read-Once Functions
The Solution Space of Sorting with Recurring Comparison Faults
Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem
Computability of Width of Submodular Partition Functions
Efficient Conditional Expectation Algorithms for Constructing Hash Families
Protein Folding in 2D-Triangular Lattice Revisited - (Extended Abstract)
Limits of Greedy Approximation Algorithms for the Maximum Planar Subgraph Problem
Solving the Tree Containment Problem for Genetically Stable Networks in Quadratic Time
Shortest Unique Palindromic Substring Queries in Optimal Time