yusuke1997/dblp-id-title huggingface dataset:
Minimum Certificate Dispersal with Tree Structures
Linear Programming Based Approximation Algorithms for Feedback Set Problems in Bipartite Tournaments
Time Series Predictions Using Multi-scale Support Vector Regressions
Inertial Bregman Proximal Alternating Linearized Minimization Method with Line Search for Non-convex Split Feasibility Problem
An Algorithmic View on Multi-Related-Segments: A Unifying Model for Approximate Common Interval
Secure Multiparty Computations Using a Dial Lock
A Note on Effective Categoricity for Linear Orderings
Optimal Matroid Bases with Intersection Constraints: Valuated Matroids, M-convex Functions, and Their Applications
Mechanism Design with Predictions for Facility Location Games with Candidate Locations
The Parameterized Complexity of Maximum Betweenness Centrality
The Smoothed Number of Pareto-Optimal Solutions in Non-integer Bicriteria Optimization
Pivot and Loop Complementation on Graphs and Set Systems
Identification and Comparison of Motifs in Brain-Specific and Muscle-Specific Alternative Splicing
Approximating Total Effective Resistance Minimization with Small Budget
Quantitative Aspects of Speed-Up and Gap Phenomena
Two-Layer Planarization Parameterized by Feedback Edge Set
Cognitive Reasoning and Trust in Human-Robot Interactions
Holographic Algorithms on Domain Size k > 2
Group Nearest Neighbor Queries in the L 1 Plane
Supportive Oracles for Parameterized Polynomial-Time Sub-Linear-Space Computations in Relation to L, NL, and P
An O(n 2 ) Algorithm for Computing Optimal Continuous Voltage Schedules
Size of Sets with Small Sensitivity: A Generalization of Simon's Lemma
On the Treewidth and Pathwidth of Biconvex Bipartite Graphs
Some New Consequences of the Hypothesis That P Has Fixed Polynomial-Size Circuits
The Undecidability of the Generalized Collatz Problem
Consistency as a Branching Time Notion
On the Parallel Complexity of Constrained Read-Once Refutations in UTVPI Constraint Systems
Normality, Randomness and Kolmogorov Complexity of Continued Fractions
Real Time Critical Edge of the Shortest Path in Transportation Networks
$(\mathbb {Z}, \text {succ}, U), (\mathbb {Z}, E, U)$, and Their CSP's
Computability on Subsets of Locally Compact Spaces
On the Parameterized Complexity of d -Restricted Boolean Net Synthesis
Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover
Streaming Algorithms for Some Problems in Log-Space
Combinatorial and Spectral Aspects of Nearest Neighbor Graphs in Doubling Dimensional and Nearly-Euclidean Spaces
On Exact Complexity of Subgraph Homeomorphism
Preserving Privacy versus Data Retention
Finding a Duplicate and a Missing Item in a Stream
Approximating EFX Through a New Notion of Fairness
A Categorical View of Timed Weak Bisimulation
Stopping Set Distributions of Algebraic Geometry Codes from Elliptic Curves
Kernelization and Parameterized Algorithms for 3-Path Vertex Cover
Asymptotic Limits of a New Type of Maximization Recurrence with an Application to Bioinformatics
Maximum Independent and Disjoint Coverage
#3-Regular Bipartite Planar Vertex Cover is #P-Complete
The Small Community Phenomenon in Networks: Models, Algorithms and Applications
Generation Complexity Versus Distinction Complexity
Generalized Counters and Reversal Complexity
On Learning Families of Ideals in Lattices and Boolean Algebras
Phase Transition of Multivariate Polynomial Systems
Generalized Finite Automata over Real and Complex Numbers
Parameterized Complexity of Fair Deletion Problems
Embedding the Diamond Lattice in the c.e. tt-Degrees with Superhigh Atoms
On the Amount of Nonconstructivity in Learning Formal Languages from Positive Data
On Existence of Equilibrium Under Social Coalition Structures
Stochastic Programming for Energy Plant Operation
An Optimal and Practical Algorithm for the Planar 2-Center Problem
Quantum Computing: A Great Science in the Making
Some Combinatorial Algorithms on the Eliminating Edge Feedback Number of Hypergraphs
Approximating MAX SAT by Moderately Exponential and Parameterized Algorithms
Propositional Projection Temporal Logic, Bchi Automata and omega-Regular Expressions
An Efficient Algorithm for Generating Colored Outerplanar Graphs
Uniformity of Point Samples in Metric Spaces Using Gap Ratio
An All-or-Nothing Flavor to the Church-Turing Hypothesis
Space Complexity of Streaming Algorithms on Universal Quantum Computers
Analysis of Properties of Petri Synthesis Net
Greedy Local Search and Vertex Cover in Sparse Random Graphs
Learning Juntas in the Presence of Noise
Lower Bounds for the Sum of Small-Size Algebraic Branching Programs
Searching Trees: An Essay
An Algebraic Characterization of Strictly Piecewise Languages
Hamiltonian Cycles in Subcubic Graphs: What Makes the Problem Difficult
Quantum Game Players Can Have Advantage Without Discord
Orthogonal Drawings for Plane Graphs with Specified Face Areas
Energy-Efficient Network Routing with Discrete Cost Functions
Quantum and Randomized Query Complexities (Extended Abstract)
Throughput Maximization for Speed-Scaling with Agreeable Deadlines
Group Theory Based Synthesis of Binary Reversible Circuits
Space Complexity of Optimization Problems in Planar Graphs
Feasibility of Motion Planning on Directed Graphs
Deletion Operations on Deterministic Families of Automata
The Complexity of the Partition Coloring Problem
Online Scheduling on a CPU-GPU Cluster
Card-Based Protocols for Any Boolean Function
Parameterized Complexity of Weighted Target Set Selection
Computable Analysis of Linear Rearrangement Optimization
How to Cut a Graph into Many Pieces
Turing Machines Can Be Efficiently Simulated by the General Purpose Analog Computer
Complexity Information Flow in a Multi-threaded Imperative Language
On Deciding Deep Holes of Reed-Solomon Codes
Maximizing Approximately Non-k-Submodular Monotone Set Function with Matroid Constraint
An Online Algorithm for Applying Reinforcement Learning to Handle Ambiguity in Spoken Dialogues
Submodular Function Minimization under a Submodular Set Covering Constraint
An Exact Algorithm for TSP in Degree-3 Graphs via Circuit Procedure and Amortization on Connectivity Structure
Computationally-Fair Group and Identity-Based Key-Exchange
Two-Stage Non-submodular Maximization
Alternative Measures of Computational Complexity with Applications to Agnostic Learning
Theory and Applications of Models of Computation, 10th International Conference, TAMC 2013, Hong Kong, China, May 20-22, 2013. Proceedings
On Resource-Bounded Versions of the van Lambalgen Theorem
On the Power of Parity Queries in Boolean Decision Trees
Extracting Densest Sub-hypergraph with Convex Edge-Weight Functions
A Gray Code of Ordered Trees
An Almost Totally Universal Tile Set
Mechanism Design for Building Optimal Bridges Between Regions
A Game-Theoretic Approach for Balancing the Tradeoffs between Data Availability and Query Delay in Multi-hop Cellular Networks
Hardness and Approximation of the Asynchronous Border Minimization Problem - (Extended Abstract)
Max-Min Four-Dispersion Problems
On the Impact of Turing Machines
Vector Ambiguity and Freeness Problems in SL (2, ℤ)
A Time Hierarchy Theorem for Nondeterministic Cellular Automata
Width Versus Size in Resolution Proofs
On Load-Balanced Semi-matchings for Weighted Bipartite Graphs
On a Question of Frank Stephan
On a Computability-Theoretic Approach to Boolean-Valued Models
An Approximation Algorithm to the k -Steiner Forest Problem
Succinct Text Indexes on Large Alphabet
A Roadmap for TAMC
The Hardness of Median in the Synchronized Bit Communication Model
Largest Convex Hulls for Constant Size, Convex-Hull Disjoint Clusters
Multi-interval Pairwise Compatibility Graphs - (Extended Abstract)
Parametric Streaming Two-Stage Submodular Maximization
Continuous Firefighting on Infinite Square Grids
Lower Bounds of Shortest Vector Lengths in Random NTRU Lattices
An Improved Approximation Algorithm for Metric Triangle Packing
Battery Scheduling Problem
Improved Deterministic Algorithms for Weighted Matching and Packing Problems
On the Tractability of Maximal Strip Recovery
A Note on Universal Composable Zero Knowledge in Common Reference String Model
Minimizing AND-EXOR Expressions for Multiple-Valued Two-Input Logic Functions
Securely Computing the n -Variable Equality Function with 2 n Cards
The Complexity and Approximability of Minimum Contamination Problems
Theory and Applications of Models of Computation - 19th Annual Conference, TAMC 2025, Jinan, China, September 19-21, 2025, Proceedings
Scheduling Jobs on a Flexible Batching Machine: Model, Complexity and Algorithms
The Worst Case Behavior of Randomized Gossip
Continuous Team Semantics
Integer Representations towards Efficient Counting in the Bit Probe Model
Distributed Connected Dominating Sets in Unit Square and Disk Graphs
Approximating Capacitated Tree-Routings in Networks
Extending Partial Representations of Interval Graphs
Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs
Simultaneity in Event Structures
Sublinear Decoding Schemes for Non-adaptive Group Testing with Inhibitors
Schnyder Greedy Routing Algorithm
Differential Privacy: A Survey of Results
Disjoint NP-Pairs from Propositional Proof Systems
Circle Graph Isomorphism in Almost Linear Time
Tensor Rank and Strong Quantum Nondeterminism in Multiparty Communication
On Some Complexity Issues of NC Analytic Functions
Reconfiguration of Cliques in a Graph
Finite-State Relative Dimension, Dimensions of AP Subsequences and a Finite-State van Lambalgen's Theorem
Reversibility of Elementary Cellular Automata under Fully Asynchronous Update
Encodings and Arithmetic Operations in Membrane Computing
FPT Algorithms for Generalized Feedback Vertex Set Problems
A Dynamic Approach to Frequent Flyer Program
On Probe Permutation Graphs
Approximation Algorithms for Diversity-Bounded Center Problems
ExplicitPRISMSymm: Symmetry Reduction Technique for Explicit Models in PRISM
Locally Injective Homomorphism to the Simple Weight Graphs
Efficient Algorithms for Airline Problem
Algorithmic Aspects of the Maximum Colorful Arborescence Problem
Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems
Finding Minimum 3-Way Cuts in Hypergraphs
Discovering Almost Any Hidden Motif from Multiple Sequences in Polynomial Time with Low Sample Complexity and High Success Probability
Universality of Spiking Neural P Systems with Anti-spikes
Searching a Polygonal Region by Two Guards
The Volume of a Crosspolytope Truncated by a Halfspace
Some Tractable Win-Lose Games
Bisection (Band)Width of Product Networks with Application to Data Centers
On the Maximum Weight Minimal Separator
Proof Complexity of Non-classical Logics
Linear-Time 2-Approximation Algorithm for the Watchman Route Problem
Deterministic Algorithms for Multi-criteria TSP
Maximum Independent Set in Graphs of Average Degree at Most Three in O (1.08537 n ){\mathcal O}(1.08537^n)
On Parameterized and Kernelization Algorithms for the Hierarchical Clustering Problem
The Complexity of Degree Anonymization by Graph Contractions
Feedback Arc Set Problem in Bipartite Tournaments
A Quadratic Kernel for {Claw, Diamond}-free Deletion
Finite Choice, Convex Choice and Sorting
Online Removable Knapsack Problems for Integer-Sized Items
Vector Connectivity in Graphs
Building Resource Auto-scaler with Functional-Link Neural Network and Adaptive Bacterial Foraging Optimization
A Well-Mixed Function with Circuit Complexity 5n±o(n): Tightness of the Lachish-Raz-Type Bounds
FPT Results for Signed Domination
Forecasting Black Holes in Abstract Geometrical Computation is Highly Unpredictable
Interaction and Collective Intelligence on the Internet
Improved Algorithms for Bicluster Editing
Mediated Population Protocols: Leader Election and Applications
Incompleteness Theorems, Large Cardinals, and Automata over Finite Words
Counting on Rainbow k-Connections
Exact and Parameterized Algorithms for Restricted Subset Feedback Vertex Set in Chordal Graphs
Self-stabilizing Minimal Global Offensive Alliance Algorithm with Safe Convergence in an Arbitrary Graph
Distance Constrained Labelings of Trees
Constant-Time Approximation Algorithms for the Knapsack Problem
The Max k -Cut Game and Its Strong Equilibria
Analyzing Chain Programs over Difference Constraints
Weak Bisimulations for the Giry Monad (Extended Abstract)
Combinatorial Properties of Fibonacci Arrays
Competition-Based Generalized Self-profit Maximization in Dual-Attribute Networks
Efficient Algorithms for Touring a Sequence of Convex Polygons and Related Problems
Extensions of Embeddings in the Computably Enumerable Degrees
Linear Kernel for Planar Connected Dominating Set
A Tree Construction of the Preferable Answer Sets for Prioritized Basic Disjunctive Logic Programs
Fixed-Order Book Thickness with Respect to the Vertex-Cover Number: New Observations and Further Analysis
Joint Bidding in Ad Auctions
The Extended Turing Model as Contextual Tool
A Linear Time Algorithm for Determining Almost Bipartite Graphs
Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width
A Characterisation of the Relations Definable in Presburger Arithmetic
Approximability and Fixed-Parameter Tractability for the Exemplar Genomic Distance Problems
Towards an Almost Quadratic Lower Bound on the Monotone Circuit Complexity of the Boolean Convolution
Deterministic Polynomial-Time Algorithms for Designing Short DNA Words
Edge Contractions in Subclasses of Chordal Graphs
On Complexity of Total Vertex Cover on Subcubic Graphs
A Computational Proof of Complexity of Some Restricted Counting Problems
From Turing Machine to Morphogenesis: Forming and Informing Computation
Natural Language Processing, Moving from Rules to Data
Elementary Differences Among Jump Hierarchies
Closure Properties and Characterizations of TotP
Bounds for Semi-disjoint Bilinear Forms in a Unit-Cost Computational Model
Source-Oblivious Broadcast
A Set-Theoretic Representation of Algebraic L-domains
An Approximation Algorithm Based on Chain Implication for Constrained Minimum Vertex Covers in Bipartite Graphs
Acyclic Edge Coloring Conjecture Is True on Planar Graphs Without Intersecting Triangles
Complexity Analysis of a Stochastic Variant of Generalized Alternating Direction Method of Multipliers
Kernelization Algorithms for Packing Problems Allowing Overlaps
Efficient Computation of Algebraic Immunity of Symmetric Boolean Functions
Finding Min-Sum Disjoint Shortest Paths from a Single Source to All Pairs of Destinations
Nondeterministic Communication Complexity of Random Boolean Functions (Extended Abstract)
A Better Upper Bound on Weights of Exact Threshold Functions
Two-Stage Submodular Maximization Under Knapsack and Matroid Constraints
A Moderately Exponential Time Algorithm for Full Degree Spanning Tree
Low Distortion Metric Embedding into Constant Dimension
Streaming Algorithms for Smallest Intersecting Ball of Disjoint Balls
A Personalized Privacy Preserving Method for Publishing Social Network Data
Approximating Edge Dominating Set in Dense Graphs
A Constant Factor Approximation for Lower-Bounded k -Median
On the Computational Complexity of Variants of Combinatorial Voter Control in Elections
Searching a Circular Corridor with Two Flashlights
Best-Order Streaming Model
A Local Search Algorithm for Radius-Constrained k-Median
Scheduling Fully Parallel Jobs with Integer Parallel Units
Cluster Computing and the Power of Edge Recognition
Quantum Complexity: Some Recent Results, Some Open Problems, Some Thoughts
Undecidability of Cost-Bounded Reachability in Priced Probabilistic Timed Automata
Parameterized Complexity of Asynchronous Border Minimization
Parikh Images of Matrix Ins-Del Systems
Tight Bounds on Communication Complexity of Symmetric XOR Functions in One-Way and SMP Models
Behavioral and Logical Equivalence of Stochastic Kripke Models in General Measurable Spaces
Symbolic Algorithm Analysis of Rectangular Hybrid Systems
Modified Greedy Algorithm for Monotone Submodular Maximization with Knapsack and Partition Matroid Constraints
Online Weakly DR-Submodular Optimization with Stochastic Long-Term Constraints
Optimal Allocation in Combinatorial Auctions with Quadratic Utility Functions
Theory and Applications of Models of Computation, 16th International Conference, TAMC 2020, Changsha, China, October 18-20, 2020, Proceedings
On Pure Nash Equilibria in Stochastic Games
Trees in Graphs with Conflict Edges or Forbidden Transitions
Read-Once Certification of Linear Infeasibility in UTVPI Constraints
An Inventory System Optimization for Solving Joint Pricing and Ordering Problem with Trapezoidal Demand and Partial Backlogged Shortages in a Limited Sales Period
Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems
An Improved Upper-Bound for Rivest et al.'s Half-Lie Problem
A Logic for Distributed Higher Order pi-Calculus
A Pseudo-Random Bit Generator Based on Three Chaotic Logistic Maps and IEEE 754-2008 Floating-Point Arithmetic
Computing with and without Arbitrary Large Numbers
On Efficient Constructions of Short Lists Containing Mostly Ramsey Graphs
Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem
Pebble Games over Ordered Structural Abstractions
Planarity Testing Revisited
Sequentialization Using Timestamps
Distributed Systems and Their Environments
On Several Scheduling Problems with Rejection or Discretely Compressible Processing Times
Weakly k-submodular Maximization Under Matroid Constraint
The Complexity of Synthesis for 43 Boolean Petri Net Types
On Characterization of Petrie Partitionable Plane Graphs
Online Makespan Scheduling of Linear Deteriorating Jobs on Parallel Machines
Fair k-Center Clustering with Minimum Representation Guarantees
The General Purpose Analog Computer and Computable Analysis are Two Equivalent Paradigms of Analog Computation
A Visual Model of Computation
Obnoxious Facility Game with a Bounded Service Range
Algorithms for Closest and Farthest String Problems via Rank Distance
Algorithms and Hardness for Signed Domination
Algorithmically Random Functions and Effective Capacities
The Domination Number of On-line Social Networks and Random Geometric Graphs
Revisiting the Impossibility for Boosting Service Resilience
Decidability of Propositional Projection Temporal Logic with Infinite Models
A Novel Initialization Algorithm for Fuzzy C -means Problem
A Dichotomy for k -Regular Graphs with {0, 1}-Vertex Assignments and Real Edge Functions
Minmax-Regret Evacuation Planning for Cycle Networks
A Lookup Table Design Method: Achieving O(1)-Query Complexity and No Memory Waste
Complexity of Paths, Trails and Circuits in Arc-Colored Digraphs
On Two Types of Concept Lattices in the Theory of Numberings
A Real Elementary Approach to the Master Recurrence and Generalizations
Parametrized Complexity of Length-Bounded Cuts and Multi-cuts
Hamiltonicity of Matching Composition Networks with Conditional Edge Faults
A Coq-Based Infrastructure for Quantum Programming, Verification and Simulation
A Note on the Testability of Ramsey's Class
Approximation Algorithms for the Weight-Reducible Knapsack Problem
Finite Automata over Structures - (Extended Abstract)
Learning Overcomplete Representations with a Generalized Gaussian Prior
The Complexity of Geometric Problems in High Dimension
Maximizing the Difference of DR-Submodular Function on the Integer Lattice
A Tight Threshold Bound for Search Trees with 2-Way Comparisons
A Characterization of the Language Classes Learnable with Correction Queries
NEXP Does Not Have Non-uniform Quasipolynomial-Size ACC Circuits of o (loglog n ) Depth
Endogenous Threshold Selection with Two-Interval Restricted Tests
From Nonstandard Analysis to Various Flavours of Computability Theory
Catching a Fast Robber on Interval Graphs
Block Sensitivity of Weakly Symmetric Functions
Non-adaptive Complex Group Testing with Multiple Positive Sets
Complexity and Approximation Algorithms for Fixed Charge Transportation Problems
Parallelizing Scheduling Algorithms for Resource Allocation Under V-RAN
On the Shortest Common Superstring of NGS Reads
Closed Rectangle-of-Influence Drawings for Irreducible Triangulations
The Convergence of Social and Technological Networks
Büchi Automata Recognizing Sets of Reals Definable in First-Order Logic with Addition and Order
Object-Oriented Specification Composition and Refinement Via Category Theoretic Computations
Theory and Applications of Models of Computation - 8th Annual Conference, TAMC 2011, Tokyo, Japan, May 23-25, 2011. Proceedings
Approximate EFX and Efficient Allocations of Chores for Bounded Preferences
Timed Encryption with Application to Deniable Key Exchange
Time-of-Use Scheduling Problem with Equal-Length Jobs
Improved SAT Based Bounded Model Checking
Analyzing the 3-path Vertex Cover Problem in Planar Bipartite Graphs
A 3/4 Differential Approximation Algorithm for Traveling Salesman Problem
Working with the LR Degrees
Generating Internally Triconnected Rooted Plane Graphs
Near Approximation of Maximum Weight Matching through Efficient Weight Reduction
Absolutely Non-effective Predicates and Functions in Computable Analysis
On Solution Concepts for Matching Games
On the Complexity of Breaking Pseudoentropy
Directed Searching Digraphs: Monotonicity and Complexity
Multisource Algorithmic Information Theory
A Primal-Dual Randomized Algorithm for the Online Weighted Set Multi-cover Problem
Universal Cupping Degrees
Generalized Last Open-End Bin Packing Problem
Physical ZKP for Makaro Using a Standard Deck of Cards
Logical Closure Properties of Propositional Proof Systems
Space Lower Bounds for Graph Stream Problems
On the Parameterized Complexity for Token Jumping on Graphs
Approximation Guarantees for Deterministic Maximization of Submodular Function with a Matroid Constraint
Hidden Community Detection on Two-Layer Stochastic Models: A Theoretical Perspective
Kleene Theorems for Lasso Languages and ømega-Languages
Theory and Applications of Models of Computation - 15th Annual Conference, TAMC 2019, Kitakyushu, Japan, April 13-16, 2019, Proceedings
Bounding Run-Times of Local Adiabatic Algorithms
Theory and Applications of Models of Computation - 11th Annual Conference, TAMC 2014, Chennai, India, April 11-13, 2014. Proceedings
A Simple Greedy Algorithm for the k-Disjoint Flow Problem
Complexity Invariance of Real Interpretations
Valiant's Holant Theorem and Matchgate Tensors
Where Join Preservation Fails in the Bounded Turing Degrees of C.E. Sets
Terminal Coalgebras for Measure-Polynomial Functors
Polynomial Kernels for Paw-Free Edge Modification Problems
An Assume/Guarantee Based Compositional Calculus for Hybrid CSP
Studying on Economic-Inspired Mechanisms for Routing and Forwarding in Wireless Ad Hoc Network
A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs
An Application of 1-Genericity in the $\Pi^0_2$ Enumeration Degrees
Multi-player Diffusion Games on Graph Classes
On the Sublinear Processor Gap for Parallel Architectures
Multiple Usage of Random Bits in Finite Automata
Centdian Computation for Sensor Networks
Bounded Jump and the High/Low Hierarchy
An Incremental Algorithm for Computing Prime Implicates in Modal Logic
A Practical Parameterized Algorithm for the Individual Haplotyping Problem MLF
Construct Public Key Encryption Scheme Using Ergodic Matrices over GF(2)
Unambiguous and Co-nondeterministic Computations of Finite Automata and Pushdown Automata Families and the Effects of Multiple Counters
Hide a Liar: Card-Based ZKP Protocol for Usowan
Constraints, Graphs, Algebra, Logic, and Complexity
On Computation Complexity of the Concurrently Enabled Transition Set Problem
Efficient Self-pairing on Ordinary Elliptic Curves
A Note on the Feasibility of Generalized Universal Composability
A Provably Secure Blind Signature Scheme
Introducing Fluctuation into Increasing Order of Symmetric Uncertainty for Consistency-Based Feature Selection
Modelling the Power Supply Network - Hardness and Approximation
Hide-and-Seek: Algorithms for Polygon Walk Problems
The Algorithm for the Two-Sided Scaffold Filling Problem
Theory and Applications of Models of Computation, 4th International Conference, TAMC 2007, Shanghai, China, May 22-25, 2007, Proceedings
Program Analysis Using Quantifier-Elimination Heuristics - (Extended Abstract)