Improved methods for storing and updating information in the out-of-kilter algorithm
Journal of the ACM (JACM)
A new approach to the maximum flow problem
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Constructing a perfect matching is in random NC
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Solving minimum-cost flow problems by successive approximation
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Partitioning Problems in Parallel, Pipeline, and Distributed Computing
IEEE Transactions on Computers
A new approach to the maximum-flow problem
Journal of the ACM (JACM)
A faster strongly polynomial minimum cost flow algorithm
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Finding minimum-cost circulations by canceling negative cycles
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
On the use of the linear assignment algorithm in module placement
25 years of DAC Papers on Twenty-five years of electronic design automation
Resource Sharing Interconnection Networks in Multiprocessors
IEEE Transactions on Computers
On maximum flows in polyhedral domains
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Finding minimum-cost circulations by canceling negative cycles
Journal of the ACM (JACM)
Convex separable optimization is not much harder than linear optimization
Journal of the ACM (JACM)
Protocol conformance test generation using multiple UIO sequences with overlapping
SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
Fast approximation algorithms for multicommodity flow problems
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
3-D Object Recognition Using Bipartite Matching Embedded in Discrete Relaxation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Pad placement and ring routing for custom chip layout
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
A parallel shortest augmenting path algorithm for the assignment problem
Journal of the ACM (JACM)
Faster scaling algorithms for general graph matching problems
Journal of the ACM (JACM)
An O(n1.5logn) 1-d compaction algorithm
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
On the Complexity of Generating Optimal Test Sequences
IEEE Transactions on Software Engineering
On minimal closure constraint generation for symbolic cell assembly
DAC '91 Proceedings of the 28th ACM/IEEE Design Automation Conference
Tight bounds on the number of minimum-mean cycle cancellations and related results
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Algorithms and complexity analysis for some flow problems
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Efficient algorithms for the Hitchcock transportation problem
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Optimal Task Assignment in Linear Array Networks
IEEE Transactions on Computers
A Polynomial Algorithm for Balancing Acyclic Data Flow Graphs
IEEE Transactions on Computers
An Õ(n2) algorithm for minimum cuts
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
An O(n2(m + Nlog n)log n) min-cost flow algorithm
Journal of the ACM (JACM)
Register allocation and binding for low power
DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
Short length versions of Menger's theorem
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A new approach to the minimum cut problem
Journal of the ACM (JACM)
Improvements on bottleneck matching and related problems using geometry
Proceedings of the twelfth annual symposium on Computational geometry
Optimal Task Assignment in Homogeneous Networks
IEEE Transactions on Parallel and Distributed Systems
Algorithmic aspects in speech recognition: an introduction
Journal of Experimental Algorithmics (JEA)
Edge profiling versus path profiling: the showdown
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Beyond the flow decomposition barrier
Journal of the ACM (JACM)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
A capacity scaling algorithm for convex cost submodular flows
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
A polynomial algorithm for abstract maximum flow
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Combinatorial optimization games
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
A faster algorithm for minimum cost submodular flows
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A Note on Dijkstra's Shortest Path Algorithm
Journal of the ACM (JACM)
Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases
Journal of the ACM (JACM)
Efficient Algorithms for Shortest Paths in Sparse Networks
Journal of the ACM (JACM)
Flow Switching Approach to the Maximum Flow Problem: I
Journal of the ACM (JACM)
Some Matching Problems for Bipartite Graphs
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Techniques for collision resolution in hash tables with open addressing
ACM '86 Proceedings of 1986 ACM Fall joint computer conference
Eavesdropping games: a graph-theoretic approach to privacy in distributed systems
Journal of the ACM (JACM)
A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
On dual minimum cost flow algorithms (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Efficient identification of Web communities
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Computational Comparison of Eight Methods for the Maximum Network Flow Problem
ACM Transactions on Mathematical Software (TOMS)
A Survey of Analysis Techniques for Discrete Algorithms
ACM Computing Surveys (CSUR)
An Efficient Algorithm for Finding a Maximum Weight k-Independent Set on Trapezoid Graphs
Computational Optimization and Applications
A combinatorial strongly polynomial algorithm for minimizing submodular functions
Journal of the ACM (JACM)
Path set selection in mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Three-Dimensional Reconstruction of Points and Lines with Unknown Correspondence across Images
International Journal of Computer Vision
Matrix rounding under the Lp-discrepancy measure and its application to digital halftoning
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Electronic Commerce Research
A note on practical construction of maximum bandwidth paths
Information Processing Letters
A Network Flow Model for Load Balancing in Circuit-Switched Multicomputers
IEEE Transactions on Parallel and Distributed Systems
The Complexity of Generic Primal Algorithms for Solving General Integer Programs
Mathematics of Operations Research
Critical Extreme Points of the 2-Edge Connected Spanning Subgraph Polytope
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
Weighted sequence graphs: boosting iterated dynamic programming using locally suboptimal solutions
Discrete Applied Mathematics - Special issue: Computational molecular biology series issue IV
Non-standard approaches to integer programming
Discrete Applied Mathematics
Interactive authoring of multimedia documents in a constraint-based authoring system
Multimedia Systems - Special section on video libraries
On the use of the linear assignment algorithm in module placement
DAC '81 Proceedings of the 18th Design Automation Conference
A data structure for dynamic trees
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
The analysis of an improved hashing technique
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Network flow and generalized path compression
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Scaling and related techniques for geometry problems
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
An approach to optimal partitioning of hypergraphs
ACM '74 Proceedings of the 1974 annual conference - Volume 1
Implementations and experimental studies of dynamic graph algorithms
Experimental algorithmics
Fully dynamic shortest paths in digraphs with arbitrary arc weights
Journal of Algorithms
Finding optimal paths in MREP routing
Information Processing Letters
Fast approximate probabilistically checkable proofs
Information and Computation
Min-cut program decomposition for thread-level speculation
Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation
Selfish load balancing and atomic congestion games
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Towards Fast Vickrey Pricing using Constraint Programming
Artificial Intelligence Review
Register binding and port assignment for multiplexer optimization
Proceedings of the 2004 Asia and South Pacific Design Automation Conference
A generalization of the scaling max-flow algorithm
Computers and Operations Research
A self-stabilizing algorithm for the maximum flow problem
Distributed Computing
Chips on wafers, or packing rectangles into grids
Computational Geometry: Theory and Applications - Special issue on the 19th European workshop on computational geometry - EuroCG 03
Discovery and regeneration of hidden emails
Proceedings of the 2005 ACM symposium on Applied computing
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Building connected neighborhood graphs for isometric data embedding
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
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
A simple GAP-canceling algorithm for the generalized maximum flow problem
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Weighted isotonic regression under the L1 norm
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Building k-Connected Neighborhood Graphs for Isometric Data Embedding
IEEE Transactions on Pattern Analysis and Machine Intelligence
Data embedding techniques and applications
Proceedings of the 2nd international workshop on Computer vision meets databases
Optimal chain rule placement for instruction selection based on SSA graphs
SCOPES '07 Proceedingsof the 10th international workshop on Software & compilers for embedded systems
Partial content distribution on high performance networks
Proceedings of the 16th international symposium on High performance distributed computing
On packing and coloring hyperedges in a cycle
Discrete Applied Mathematics
Faster dynamic matchings and vertex connectivity
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A survey of physical database design methodology and techniques
VLDB '78 Proceedings of the fourth international conference on Very Large Data Bases - Volume 4
Metropolitan Ethernet Network: A move from LAN to MAN
Computer Networks: The International Journal of Computer and Telecommunications Networking
Movement-assisted sensor redeployment scheme for network lifetime increase
Proceedings of the 10th ACM Symposium on Modeling, analysis, and simulation of wireless and mobile systems
Efficient preflow push algorithms
Computers and Operations Research
CEA'07 Proceedings of the 2007 annual Conference on International Conference on Computer Engineering and Applications
Geometrical k-cut problem and an optimal solution for hypercubes
MATH'07 Proceedings of the 12th WSEAS International Conference on Applied Mathematics
Optimal vertex elimination in single-expression-use graphs
ACM Transactions on Mathematical Software (TOMS)
Approximate labelled subtree homeomorphism
Journal of Discrete Algorithms
Randomized cuts for 3D mesh analysis
ACM SIGGRAPH Asia 2008 papers
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Iterative Compression and Exact Algorithms
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
The Partial Augment---Relabel Algorithm for the Maximum Flow Problem
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Computing the Minimal Tiling Path from a Physical Map by Integer Linear Programming
WABI '08 Proceedings of the 8th international workshop on Algorithms in Bioinformatics
An exterior simplex type algorithm for the Minimum Cost Network Flow Problem
Computers and Operations Research
Outlier detection and evaluation by network flow
International Journal of Computer Applications in Technology
An Experimental Comparison of Discrete and Continuous Shape Optimization Methods
ECCV '08 Proceedings of the 10th European Conference on Computer Vision: Part I
Optimality of belief propagation for random assignment problem
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Bottleneck flows in unit capacity networks
Information Processing Letters
An O(n log n) algorithm for maximum st-flow in a directed planar graph
Journal of the ACM (JACM)
MNCM: a critical node matching approach to scheduling for input buffered switches with no speedup
IEEE/ACM Transactions on Networking (TON)
A Weighted kt, t-Free t-Factor Algorithm for Bipartite Graphs
Mathematics of Operations Research
Belief Propagation: An Asymptotically Optimal Algorithm for the Random Assignment Problem
Mathematics of Operations Research
An approach to the parallel solution of a high-dimensional basic flow problem
Cybernetics and Systems Analysis
An optimal algorithm for tree geometrical k-cut problem
MACMESE'08 Proceedings of the 10th WSEAS international conference on Mathematical and computational methods in science and engineering
CIS'09 Proceedings of the international conference on Computational and information science 2009
Maximum Bipartite Flow in Networks with Adaptive Channel Width
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Journal of Experimental Algorithmics (JEA)
Maximum weight bipartite matching in matrix multiplication time
Theoretical Computer Science
Approximation algorithms for temporal reasoning
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
Adaptation of organizational models for multi-agent systems based on max flow networks
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Graph connectivity measures for unsupervised word sense disambiguation
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Chips on wafers, or packing rectangles into grids
Computational Geometry: Theory and Applications - Special issue on the 19th European workshop on computational geometry - EuroCG 03
Comparative study of partitioning methods for program testing
SEA '07 Proceedings of the 11th IASTED International Conference on Software Engineering and Applications
On the Core and f-Nucleolus of Flow Games
Mathematics of Operations Research
Using combinatorial optimization in model-based trimmed clustering with cardinality constraints
Computational Statistics & Data Analysis
Stop word and related problems in web interface integration
Proceedings of the VLDB Endowment
Framework for evaluating clustering algorithms in duplicate detection
Proceedings of the VLDB Endowment
Optimization models for planning wireless mesh networks: a comparative study
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Extracting Research Communities by Improved Maximum Flow Algorithm
KES '09 Proceedings of the 13th International Conference on Knowledge-Based and Intelligent Information and Engineering Systems: Part II
Resilience technologies in Ethernet
Computer Networks: The International Journal of Computer and Telecommunications Networking
Improving network lifetime with mobile wireless sensor networks
Computer Communications
Iterative compression and exact algorithms
Theoretical Computer Science
Toward a General Framework for Polyphonic Comparison
Fundamenta Informaticae - Special Issue on Stringology
A minutia-based partial fingerprint recognition system
Pattern Recognition
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
On coordination among multiple auctions
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
On the cost of interchange rearrangement in strings
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Incentive-compatible interdomain routing with linear utilities
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
A weighted Kt, t-free t-factor algorithm for bipartite graphs
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
A polynomial algorithm for weighted abstract flow
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
A memetic algorithm for binary image reconstruction
IWCIA'08 Proceedings of the 12th international conference on Combinatorial image analysis
Proceedings of the forty-second ACM symposium on Theory of computing
A memetic approach to discrete tomography from noisy projections
Pattern Recognition
On the design of bi-connected wireless mesh network infrastructure with QoS constraints
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Implementation and evaluation of layer-1 bandwidth-on-demand capabilities in SINET3
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Relating Reputation and Money in Online Markets
ACM Transactions on the Web (TWEB)
The Traveling Salesman Problem with Pickups, Deliveries, and Handling Costs
Transportation Science
Proceedings of the 19th ACM International Symposium on High Performance Distributed Computing
Fair Division under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
A new strategy for the undirected two-commodity maximum flow problem
Computational Optimization and Applications
MENTA: inducing multilingual taxonomies from wikipedia
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
An improved algorithm for extracting research communities from bibliographic data
DASFAA'10 Proceedings of the 15th international conference on Database systems for advanced applications
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Advanced combinatorial algorithms
Algorithms and theory of computation handbook
Updating Network Flows Given Multiple, Heterogeneous Arc Attribute Changes
Journal of Mathematical Modelling and Algorithms
Minimal-cost network flow problems with variable lower bounds on arc flows
Computers and Operations Research
Throughput Gateways-Congestion Trade-Off in Designing Multi-Radio Wireless Networks
Mobile Networks and Applications
Optimal balancing of satellite queues in packet transmission to ground stations
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
A TDM slot allocation flow based on multipath routing in NoCs
Microprocessors & Microsystems
An optimal algorithm for general array geometrical k-cut problem
MMACTEE'09 Proceedings of the 11th WSEAS international conference on Mathematical methods and computational techniques in electrical engineering
A distributed algorithm for min-max tree and max-min cut problems in communication networks
IEEE/ACM Transactions on Networking (TON)
Deploying a massively multiplayer online game with a low-latency server infrastructure
Information Technology and Management
Improved call graph comparison using simulated annealing
Proceedings of the 2011 ACM Symposium on Applied Computing
On the design of reliable wireless mesh network infrastructure with QoS constraints
Computer Networks: The International Journal of Computer and Telecommunications Networking
Syntax highlighting in business process models
Decision Support Systems
Neighborhood based fast graph search in large networks
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Modeling data flow in socio-information networks: a risk estimation approach
Proceedings of the 16th ACM symposium on Access control models and technologies
Near approximation of maximum weight matching through efficient weight reduction
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
A metric for phylogenetic trees based on matching
ISBRA'11 Proceedings of the 7th international conference on Bioinformatics research and applications
BFS solution for disjoint paths in P systems
UC'11 Proceedings of the 10th international conference on Unconventional computation
Recommendation systems with complex constraints: A course recommendation perspective
ACM Transactions on Information Systems (TOIS)
Lagrangian relaxation applied to sparse global network alignment
PRIB'11 Proceedings of the 6th IAPR international conference on Pattern recognition in bioinformatics
Network flow for collaborative ranking
PKDD'06 Proceedings of the 10th European conference on Principle and Practice of Knowledge Discovery in Databases
A distributed preflow-push for the maximum flow problem
IICS'05 Proceedings of the 5th international conference on Innovative Internet Community Systems
A scaling algorithm for maximum weight matching in bipartite graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Quantum algorithms for matching and network flows
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Efficient algorithms for the electric power transaction problem
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Editing distances between membrane structures
WMC'05 Proceedings of the 6th international conference on Membrane Computing
Design of scalable and efficient multi-radio wireless networks
Wireless Networks
An analysis of permutations in arrays
VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
Minimum-cost optimization in multicommodity logistic chain network
IWMM'04/GIAE'04 Proceedings of the 6th international conference on Computer Algebra and Geometric Algebra with Applications
Weighted bipartite matching in matrix multiplication time
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
A-FAST: autonomous flow approach to scheduling tasks
HiPC'04 Proceedings of the 11th international conference on High Performance Computing
Congestion games, load balancing, and price of anarchy
CAAN'04 Proceedings of the First international conference on Combinatorial and Algorithmic Aspects of Networking
Maximum likelihood estimation of Gaussian mixture models using stochastic search
Pattern Recognition
A framework for path-oriented network simplification
IDA'10 Proceedings of the 9th international conference on Advances in Intelligent Data Analysis
Dinitz' algorithm: the original version and even's version
Theoretical Computer Science
Dynamic Landmarking for Surface Feature Identification and Change Detection
ACM Transactions on Intelligent Systems and Technology (TIST)
A generalized bi-criteria fuzzy integer flow sharing problem
International Journal of Approximate Reasoning
Polyphonic alignment algorithms for symbolic music retrieval
CMMR/ICAD'09 Proceedings of the 6th international conference on Auditory Display
Efficient processing of distance queries in large graphs: a vertex cover approach
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
A hybrid nature-inspired optimizer for wireless mesh networks design
Computer Communications
A Metric for Phylogenetic Trees Based on Matching
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Efficient rank aggregation using partial data
Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
A new Karzanov-type O(n3) max-flow algorithm
Mathematical and Computer Modelling: An International Journal
Mathematical and Computer Modelling: An International Journal
Selfish splittable flows and NP-completeness
Computer Science Review
On shortest disjoint paths in planar graphs
Discrete Optimization
Complexity of linear programming
Operations Research Letters
On strongly polynomial variants of the network simplex algorithm for the maximum flow problem
Operations Research Letters
Parallel algorithms for the assignment and minimum-cost flow problems
Operations Research Letters
A new scaling algorithm for the minimum cost network flow problem
Operations Research Letters
A maximum flow algorithm using MA ordering
Operations Research Letters
The MA-ordering max-flow algorithm is not strongly polynomial for directed networks
Operations Research Letters
Travel-Route-Centered Metro Map Layout and Annotation
Computer Graphics Forum
An O(m(m+nlogn)log(nC)) -time algorithm to solve the minimum cost tension problem
Theoretical Computer Science
Efficient methods for selfish network design
Theoretical Computer Science
Belief Propagation for Min-Cost Network Flow: Convergence and Correctness
Operations Research
Decomposition of binary images-A survey and comparison
Pattern Recognition
Contraction network for solving maximum flow problem
Proceedings of the ACM SIGKDD Workshop on Mining Data Semantics
Toward a General Framework for Polyphonic Comparison
Fundamenta Informaticae - Special Issue on Stringology
Notions of connectivity in overlay networks
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Second-Price ad auctions with binary bids and markets with good competition
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Constructing sensor barriers with minimum cost in wireless sensor networks
Journal of Parallel and Distributed Computing
Topology optimisation of repairable flow networks for a maximum average availability
Computers & Mathematics with Applications
A fast parallel algorithm for minimum-cost small integral flows
Euro-Par'12 Proceedings of the 18th international conference on Parallel Processing
Rectangular decomposition of binary images
ACIVS'12 Proceedings of the 14th international conference on Advanced Concepts for Intelligent Vision Systems
ACIVS'12 Proceedings of the 14th international conference on Advanced Concepts for Intelligent Vision Systems
Generic cuts: an efficient algorithm for optimal inference in higher order MRF-MAP
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part V
Maximum flow networks for stability analysis of LEGO®Structures
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
RNA tree comparisons via unrooted unordered alignments
WABI'12 Proceedings of the 12th international conference on Algorithms in Bioinformatics
New solutions for disjoint paths in P systems
Natural Computing: an international journal
Classification of high-dimension PDFs using the hungarian algorithm
SSPR'12/SPR'12 Proceedings of the 2012 Joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
A new approach to solve the k-server problem based on network flows and flow cost reduction
Computers and Operations Research
Software verification and graph similarity for automated evaluation of students' assignments
Information and Software Technology
Improved bounds for large scale capacitated arc routing problem
Computers and Operations Research
Group and link analysis of multi-relational scientific social networks
Journal of Systems and Software
Proceedings of the 2013 9th Joint Meeting on Foundations of Software Engineering
Efficient relay deployment for controlling connectivity in delay tolerant mobile networks
Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems
A Graph-Theoretical Approach to the Selection of the Minimum Tiling Path from a Physical Map
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Capacity-Constrained network-voronoi diagram: a summary of results
SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases
Linear-Time Approximation for Maximum Weight Matching
Journal of the ACM (JACM)
Maximum Complex Task Assignment: Towards Tasks Correlation in Spatial Crowdsourcing
Proceedings of International Conference on Information Integration and Web-based Applications & Services
Game-theoretic question selection for tests
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
SDC-based modulo scheduling for pipeline synthesis
Proceedings of the International Conference on Computer-Aided Design
An island strategy for memetic discrete tomography reconstruction
Information Sciences: an International Journal
Improved Multiple Sequence Alignments Using Coupled Pattern Mining
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Review: A survey on architectures and energy efficiency in Data Center Networks
Computer Communications
Extracting research communities from bibliographic data
International Journal of Knowledge-based and Intelligent Engineering Systems - Intelligent Information Processing: Techniques and Applications
Measuring similarity of graph nodes by neighbor matching
Intelligent Data Analysis
| Hi-index | 0.02 |