Optimal phase conflict removal for layout of dark field alternating phase shifting masks
ISPD '99 Proceedings of the 1999 international symposium on Physical design
A new property and a faster algorithm for baseball elimination
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
TSP-based curve reconstruction in polynomial time
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
RECOMB '01 Proceedings of the fifth annual international conference on Computational biology
New graph bipartizations for double-exposure, bright field alternating phase-shift mask layout
Proceedings of the 2001 Asia and South Pacific Design Automation Conference
Address code generation for digital signal processors
Proceedings of the 38th annual Design Automation Conference
Online server allocation in a server farm via benefit task systems
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Efficient instruction-level optimization methodology for low-power embedded systems
Proceedings of the 14th international symposium on Systems synthesis
Algorithm for optimal winner determination in combinatorial auctions
Artificial Intelligence
Channel assignment and graph labeling
Handbook of wireless networks and mobile computing
Edge dominating and hypomatchable sets
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Algorithms for fault-tolerant routing in circuit switched networks
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
The cable trench problem: combining the shortest path and minimum spanning tree problems
Computers and Operations Research
A Class of Global Optimization Problems as Models of the Phase Unwrapping Problem
Journal of Global Optimization
Tractable combinatorial auctions and b-matching
Artificial Intelligence
Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Semidefinite Programming Methods for the Symmetric Traveling Salesman Problem
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
On the Rank of Mixed 0, 1 Polyhedra
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
An Exponential Lower Bound on the Length of Some Classes of Branch-and-Cut Proofs
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
The T-join Problem in Sparse Graphs: Applications to Phase Assignment Problem in VLSI Mask Layout
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Solving Optimal Location of Traffic Counting Points at Urban Intersections in CLP(FD)
MICAI '02 Proceedings of the Second Mexican International Conference on Artificial Intelligence: Advances in Artificial Intelligence
Approximations for ATSP with Parametrized Triangle Inequality
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
An Experimental Comparison of Min-cut/Max-flow Algorithms for Energy Minimization in Vision
EMMCVPR '01 Proceedings of the Third International Workshop on Energy Minimization Methods in Computer Vision and Pattern Recognition
Segmentation of Dynamic N-D Data Sets via Graph Cuts Using Markov Models
MICCAI '01 Proceedings of the 4th International Conference on Medical Image Computing and Computer-Assisted Intervention
An Online Algorithm for the Postman Problem with a Small Penalty
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
Construction Heuristics and Domination Analysis for the Asymmetric TSP
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
On 2-Coverings and 2-Packings of Laminar Families
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Resource Constrained Shortest Paths
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Cutting planes in integer and mixed integer programming
Discrete Applied Mathematics
A Graph Theoretic Approach for Design and Synthesis of Multiplierless FIR Filters
Proceedings of the 12th international symposium on System synthesis
Characterizing the flow equivalent trees of a network
Discrete Applied Mathematics
The reliable algorithmic software challenge RASC
Computer Science in Perspective
Algorithmic characterization of bipartite b-matching and matroid intersection
Combinatorial optimization - Eureka, you shrink!
Independent-tree ad hoc multicast routing (ITAMAR)
Mobile Networks and Applications
Selecting forwarding neighbors in wireless ad hoc networks
Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
Edge-disjoint odd cycles in planar graphs
Journal of Combinatorial Theory Series B
Minimizing the stabbing number of matchings, trees, and triangulations
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Integer programming models for computational biology problems
Journal of Computer Science and Technology - Special issue on bioinformatics
On test generation for transition faults with minimized peak power dissipation
Proceedings of the 41st annual Design Automation Conference
An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision
IEEE Transactions on Pattern Analysis and Machine Intelligence
Problems of synthesis of connected networks with respect to isomorphic subgraphs
Cybernetics and Systems Analysis
Determination of the candidate arc set for the asymmetric traveling salesman problem
Computers and Operations Research
A class of network optimization methods for planar grid generation
Applied Numerical Mathematics
Optimal sequencing of tasks in an aluminium smelter casthouse
Computers in Industry - Special issue: Application of genetics algorithms in industry
Design of capacitated survivable networks with a single facility
IEEE/ACM Transactions on Networking (TON)
Approximation algorithms for some vehicle routing problems
Discrete Applied Mathematics
Automated resource-driven mission phasing techniques for constrained agents
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
The Million-Variable "March" for Stochastic Combinatorial Optimization
Journal of Global Optimization
QoS for data relaying in hierarchical wireless sensor networks
Proceedings of the 1st ACM international workshop on Quality of service & security in wireless and mobile networks
Improved results for data migration and open shop scheduling
ACM Transactions on Algorithms (TALG)
Fast and efficient phase conflict detection and correction in standard-cell layouts
ICCAD '05 Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design
Multiprocessor scheduling under precedence constraints: polyhedral results
Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
Graph Cuts and Efficient N-D Image Segmentation
International Journal of Computer Vision
Mathematical programming for deliberation scheduling in time-limited domains
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Mixed-integer linear programming for transition-independent decentralized MDPs
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Querying priced information in databases: The conjunctive case
ACM Transactions on Algorithms (TALG)
Short length Menger's theorem and reliable optical routing
Theoretical Computer Science
Metaheuristics for optimization problems in computer communications
Computer Communications
How to collect balls moving in the Euclidean plane
Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University
B-spline curve fitting based on adaptive curve refinement using dominant points
Computer-Aided Design
Exponential Lower Bounds on the Lengths of Some Classes of Branch-and-Cut Proofs
Mathematics of Operations Research
An optimization algorithm based on chaotic behavior and fractal nature
Journal of Computational and Applied Mathematics
A unified approach to approximating partial covering problems
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
An algebraic algorithm for weighted linear matroid intersection
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Buying cheap is expensive: hardness of non-parametric multi-product pricing
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Matrix scaling by network flow
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Sequential resource allocation in multiagent systems with uncertainties
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Matroid intersection, pointer chasing, and Young's seminormal representation of Sn
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
International Journal of Business Information Systems
Finding an optimal tooth color match
Crossroads
Approximation algorithms for partially covering with edges
Theoretical Computer Science
Set covering approach for reconstruction of sibling relationships
Optimization Methods & Software - Systems Analysis, Optimization and Data Mining in Biomedicine
Discovering correlated spatio-temporal changes in evolving graphs
Knowledge and Information Systems
The Erdős--Hajnal conjecture for bull-free graphs
Journal of Combinatorial Theory Series B
Triangle-Free Simple 2-Matchings in Subcubic Graphs (Extended Abstract)
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Verifying Dominant Strategy Equilibria in Auctions
CEEMAS '07 Proceedings of the 5th international Central and Eastern European conference on Multi-Agent Systems and Applications V
Some Issues About Cognitive Modelling and Functionalism
AI*IA '07 Proceedings of the 10th Congress of the Italian Association for Artificial Intelligence on AI*IA 2007: Artificial Intelligence and Human-Oriented Computing
Even factors, jump systems, and discrete convexity
Journal of Combinatorial Theory Series B
On the Approximability of Combinatorial Exchange Problems
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Learning Scoring Schemes for Sequence Alignment from Partial Examples
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Weighted coloring on planar, bipartite and split graphs: Complexity and approximation
Discrete Applied Mathematics
Post-Silicon Clock-Timing Tuning Based on Statistical Estimation
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Approximating minimum-power edge-covers and 2,3-connectivity
Discrete Applied Mathematics
Optimal Routing and Call Scheduling in Wireless Mesh Networks with Localized Informations
Trustworthy Global Computing
Robust Optimization for Empty Repositioning Problems
Operations Research
Learning Models for Aligning Protein Sequences with Predicted Secondary Structure
RECOMB 2'09 Proceedings of the 13th Annual International Conference on Research in Computational Molecular Biology
A Fast Approximation Algorithm for the k Partition-Distance Problem
ICCSA '09 Proceedings of the International Conference on Computational Science and Its Applications: Part II
On the Complexity of the Asymmetric VPN Problem
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Using a greedy random adaptative search procedure to solve the cover printing problem
Computers and Operations Research
A class of network optimization methods for planar grid generation
Applied Numerical Mathematics
Network coding for undirected information exchange
IEEE Communications Letters
Graph cut optimization for the Mumford-Shah model
VIIP '07 The Seventh IASTED International Conference on Visualization, Imaging and Image Processing
Optimal sequencing of tasks in an aluminium smelter casthouse
Computers in Industry - Special issue: Application of genetics algorithms in industry
Approximation algorithms for some vehicle routing problems
Discrete Applied Mathematics
Multiprocessor scheduling under precedence constraints: Polyhedral results
Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
Algorithms for the design of network topologies with balanced disjoint rings
Journal of Heuristics
A Plant Location Guide for the Unsure: Approximation Algorithms for Min-Max Location Problems
Mathematics of Operations Research
On minimum power connectivity problems
Journal of Discrete Algorithms
Differential approximation for some routing problems
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
Algorithms for variable-weighted 2-SAT and dual problems
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
On minimum power connectivity problems
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Approximation algorithms for k-duplicates combinatorial auctions with subadditive bidders
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Min sum edge coloring in multigraphs via configuration LP
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Approximating minimum-power degree and connectivity problems
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
An algorithmic framework for wireless information flow
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Load balancing and orientability thresholds for random hypergraphs
Proceedings of the forty-second ACM symposium on Theory of computing
Construction of candidate topologies for large-scale networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Spending Constraint Utilities with Applications to the Adwords Market
Mathematics of Operations Research
A history of graph entropy measures
Information Sciences: an International Journal
Resource-driven mission-phasing techniques for constrained agents in stochastic environments
Journal of Artificial Intelligence Research
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
Sum edge coloring of multigraphs via configuration LP
ACM Transactions on Algorithms (TALG)
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Approximating Steiner Networks with Node-Weights
SIAM Journal on Computing
SIAM Journal on Computing
Minimum congestion mapping in a cloud
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Exact approaches for integrated aircraft fleeting and routing at TunisAir
Computational Optimization and Applications
From Uncertainty to Nonlinearity: Solving Virtual Private Network via Single-Sink Buy-at-Bulk
Mathematics of Operations Research
The Chvátal-Gomory Closure of a Strictly Convex Body
Mathematics of Operations Research
Framework for optimizing the capacity of wireless mesh networks
Computer Communications
Capacitated vehicle routing with non-uniform speeds
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
A cost-aggregating integer linear program for motif finding
Journal of Discrete Algorithms
Optimality conditions for a bilevel matroid problem
Journal of Combinatorial Optimization
On the maximum size of a minimal k-edge connected augmentation
Journal of Combinatorial Theory Series B
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Reducing the lengths of checking sequences by overlapping
TestCom'06 Proceedings of the 18th IFIP TC6/WG6.1 international conference on Testing of Communicating Systems
Separating stable sets in claw-free graphs via Padberg-Rao and compact linear programs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
A compact mathematical programming formulation for DNA motif finding
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Truthful auction for cooperative communications
MobiHoc '11 Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing
Bounding the payment of approximate truthful mechanisms
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Some aspects regarding the application of the ant colony meta-heuristic to scheduling problems
LSSC'09 Proceedings of the 7th international conference on Large-Scale Scientific Computing
A component-based planning framework for adaptive systems
ODBASE'06/OTM'06 Proceedings of the 2006 Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, DOA, GADA, and ODBASE - Volume Part II
Tolerance based algorithms for the ATSP
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
The chvátal-gomory closure of an ellipsoid is a polyhedron
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
On the approximability of some degree-constrained subgraph problems
Discrete Applied Mathematics
Reload cost trees and network design
Networks
Using critical sets to solve the maximum independent set problem
Operations Research Letters
Computer Science Review
Metric inequalities and the Network Loading Problem
Discrete Optimization
Facets of the independent path-matching polytope
Discrete Optimization
Monotonizing linear programs with up to two nonzeroes per column
Operations Research Letters
Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems
SIAM Journal on Computing
A New Algorithm for the Open-Pit Mine Production Scheduling Problem
Operations Research
Possible and necessary winners of partial tournaments
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Solving tantrix via integer programming
FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
Changing of the guards: strip cover with duty cycling
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Gap inequalities for the max-cut problem: a cutting-plane algorithm
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
A Proof Theoretic View of Constraint Programming
Fundamenta Informaticae
Deanonymizing mobility traces: using social network as a side-channel
Proceedings of the 2012 ACM conference on Computer and communications security
Inverse sequence alignment from partial examples
WABI'07 Proceedings of the 7th international conference on Algorithms in Bioinformatics
Pricing of parking for congestion reduction
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
Journal of the ACM (JACM)
A graph-based approach to optimal scan chain stitching using RTL design descriptions
VLSI Design - Special issue on New Algorithmic Techniques for Complex EDA Problems
Capacity-Constrained network-voronoi diagram: a summary of results
SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases
Enumerating colorings, tensions and flows in cell complexes
Journal of Combinatorial Theory Series A
Note: Parameterized complexity of k-Chinese Postman Problem
Theoretical Computer Science
Compressed data aggregation: energy-efficient and high-fidelity data collection
IEEE/ACM Transactions on Networking (TON)
Binary Accelerated Particle Swarm Algorithm (BAPSA) for discrete optimization problems
Journal of Global Optimization
A bilevel programming problem with maximization of a supermodular function in the lower level
Journal of Combinatorial Optimization
Discrete Tomography Data Footprint Reduction via Natural Compression
Fundamenta Informaticae - Strategies for Tomography
| Hi-index | 0.00 |