Efficient Schemes for Parallel Communication
Journal of the ACM (JACM)
A complexity theory based on Boolean algebra
Journal of the ACM (JACM)
How to assign votes in a distributed system
Journal of the ACM (JACM)
Closures of database hypergraphs
Journal of the ACM (JACM)
Fault-Tolerant Multiprocessors with Redundant-Path Interconnection Networks
IEEE Transactions on Computers - The MIT Press scientific computation series
Electing a leader in a synchronous ring
Journal of the ACM (JACM)
New lower bounds for parallel computation
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
The equivalence of solving queries and producing tree projections (extended abstract)
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
Doubly lexical orderings of matrices
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Dynamic query interpretation in relational databases
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Answering queries in categorical databases
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Recognizing planar perfect graphs
Journal of the ACM (JACM)
Distributed algorithms for load balancing in very large homogeneous systems
ACM '87 Proceedings of the 1987 Fall Joint Computer Conference on Exploring technology: today and tomorrow
Communications of the ACM
The coloring and maximum independent set problems on planar perfect graphs
Journal of the ACM (JACM)
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Connectivity of Imase and Itoh Digraphs
IEEE Transactions on Computers
Software Complexity and its Impact on Software Reliability
IEEE Transactions on Software Engineering
The pebble crurching model for load balancing in concurrent hypercube ensembles
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
A robust protocol for parallel join operation in distributed data bases
DPDS '88 Proceedings of the first international symposium on Databases in parallel and distributed systems
A data model for flexible hypertext database systems
ACM Transactions on Information Systems (TOIS)
Synthesis of Mutual Exclusion Solutions Based on Binary Semaphores
IEEE Transactions on Software Engineering
Concurrency in heavily loaded neighborhood-constrained systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
An efficient parallel algorithm for computing a large independent set in a plan graph
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Expressibility of bounded-arity fixed-point query hierarchies
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
Aggregate evaluability in statistical databases
VLDB '89 Proceedings of the 15th international conference on Very large data bases
A transient hypergraph-based model for data access
ACM Transactions on Information Systems (TOIS)
A Synthesis Approach to Design Optimally Fault Tolerant Network Architecture
IEEE Transactions on Computers
Independence-reducible database schemes
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Complete formal model for information retrieval systems
SIGIR '91 Proceedings of the 14th annual international ACM SIGIR conference on Research and development in information retrieval
Structural testing of rule-based expert systems
ACM Transactions on Software Engineering and Methodology (TOSEM)
Different perspectives of the N-Queens problem
CSC '92 Proceedings of the 1992 ACM annual conference on Communications
On Self-Diagnosable Multiprocessor Systems: Diagnosis by the Comparison Approach
IEEE Transactions on Computers
Efficient Distributed Algorithms for Self Testing of Multiple Processor Systems
IEEE Transactions on Computers
Blocking for external graph searching
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Solving queries by tree projections
ACM Transactions on Database Systems (TODS)
Optimal parallel construction of Hamiltonian cycles and spanning trees in random graphs
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Fishing for clarity in hyperdocuments with enhanced fisheye-views
ECHT '92 Proceedings of the ACM conference on Hypertext
A nested-graph model for the representation and manipulation of complex objects
ACM Transactions on Information Systems (TOIS)
New approximation algorithms for graph coloring
Journal of the ACM (JACM)
Randomized graph drawing with heavy-duty preprocessing
AVI '94 Proceedings of the workshop on Advanced visual interfaces
From text to hypertext by indexing
ACM Transactions on Information Systems (TOIS)
The universality of multidimensional switching networks
IEEE/ACM Transactions on Networking (TON)
A programming project: trimming the spring algorithm for drawing hypergraphs
ACM SIGCSE Bulletin
A versatile data structure for edge-oriented graph algorithms
Communications of the ACM
Unconstrained duals and their use in achieving all-uses coverage
ISSTA '96 Proceedings of the 1996 ACM SIGSOFT international symposium on Software testing and analysis
Reducing and estimating the cost of test coverage criteria
Proceedings of the 18th international conference on Software engineering
Graphical Templates for Model Registration
IEEE Transactions on Pattern Analysis and Machine Intelligence
Navigating hierarchically clustered networks through fisheye and full-zoom methods
ACM Transactions on Computer-Human Interaction (TOCHI)
Drawing graphs nicely using simulated annealing
ACM Transactions on Graphics (TOG)
Embedding Classical Communication Topologies in the Scalable OPAM Architecture
IEEE Transactions on Parallel and Distributed Systems
A survey of approximately optimal solutions to some covering and packing problems
ACM Computing Surveys (CSUR)
Complexity of simulation models: a graph theoretic approach
WSC '93 Proceedings of the 25th conference on Winter simulation
Distributed/parallel traffic simulation for IVHS applications
WSC '93 Proceedings of the 25th conference on Winter simulation
An Extended Relational Data Model For Probabilistic Reasoning
Journal of Intelligent Information Systems
Approximate graph coloring by semidefinite programming
Journal of the ACM (JACM)
Computational bounds for fundamental problems on general-purpose parallel models
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
WebACE: a Web agent for document categorization and exploration
AGENTS '98 Proceedings of the second international conference on Autonomous agents
Which search problems are random?
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Multiwavelength optical networks with limited wavelength conversion
IEEE/ACM Transactions on Networking (TON)
Configuration of Locally Spared Arrays in the Presence of Multiple Fault Types
IEEE Transactions on Computers
Multilevel k-way hypergraph partitioning
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Automatic layout algorithms for function blocks of CMOS gate arrays
DAC '85 Proceedings of the 22nd ACM/IEEE Design Automation Conference
A formal approach to the definition and the design of conceptual schemata for databased systems
ACM Transactions on Database Systems (TODS)
A simplied universal relation assumption and its properties
ACM Transactions on Database Systems (TODS)
Open Shop Scheduling to Minimize Finish Time
Journal of the ACM (JACM)
The Bottleneck Traveling Salesman Problem: Algorithms and Probabilistic Analysis
Journal of the ACM (JACM)
Some Matching Problems for Bipartite Graphs
Journal of the ACM (JACM)
The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems
Journal of the ACM (JACM)
Journal of the ACM (JACM)
A Sufficient Condition for Backtrack-Free Search
Journal of the ACM (JACM)
A Theory of Safe Locking Policies in Database Systems
Journal of the ACM (JACM)
On the Desirability of Acyclic Database Schemes
Journal of the ACM (JACM)
A parallel algorithm for finding a maximum flow in 0-1 networks
CSC '87 Proceedings of the 15th annual conference on Computer Science
On a Lightwave Network Topology Using Kautz Digraphs
IEEE Transactions on Computers
Model structure and load balancing in optimistic parallel discrete event simulation
PADS '00 Proceedings of the fourteenth workshop on Parallel and distributed simulation
Strictly non-blocking WDM cross-connects
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
ABCD: eliminating array bounds checks on demand
PLDI '00 Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation
Jump Minimization in Linear Time
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
New methods to color the vertices of a graph
Communications of the ACM
On computing sets of shortest paths in a graph
Communications of the ACM
The complexity of acyclic conjunctive queries
Journal of the ACM (JACM)
Simplicial families of drawings
Proceedings of the 14th annual ACM symposium on User interface software and technology
4×4 Tac-Tix is a second person game
ACM-SE 20 Proceedings of the 20th annual Southeast regional conference
Sparse and limited wavelength conversion in all-optical tree networks
Theoretical Computer Science
The management of applications for reconfigurable computing using an operating system
CRPIT '02 Proceedings of the seventh Asia-Pacific conference on Computer systems architecture
On the Performance of Parallel Matrix Factorisation on the Hypermesh
The Journal of Supercomputing
Edge coloring of bipartite graphs with constraints
Theoretical Computer Science
A priori optimization for the probabilistic maximum independent set problem
Theoretical Computer Science
The Relational Structure of Belief Networks
Journal of Intelligent Information Systems
Data declustering and cluster ordering technique for spatial join scheduling
Information organization and databases
Optimal code for control structures
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On the recognition and design of acyclic databases
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
Connections in acyclic hypergraphs: extended abstract
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
On kernels, defaults and even graphs
Annals of Mathematics and Artificial Intelligence
A System for Generating Reverse Engineering Tools: A Case Study of Software Modularisation
Automated Software Engineering
A New Correctness Criterion for Cyclic Proof Nets
Journal of Logic, Language and Information
Uniquely colorable mixed hypergraphs
Discrete Mathematics
Some bounds for the b-chromatic number of a graph
Discrete Mathematics
Antimagic vertex labelings of hypergraphs
Discrete Mathematics
A Note on the Approximation of a Minimum-Weight Maximal Independent Set
Computational Optimization and Applications
Hypermeshes: implementation and performance
Journal of Systems Architecture: the EUROMICRO Journal
On the merits of hypermeshes and tori with adaptive routing
Journal of Systems Architecture: the EUROMICRO Journal
Hypergraph Coloring and Reconfigured RAM Testing
IEEE Transactions on Computers
Efficient Join-Index-Based Spatial-Join Processing: A Clustering Approach
IEEE Transactions on Knowledge and Data Engineering
The Automatic Construction of a View-Independent Relational Model for 3-D Object Recognition
IEEE Transactions on Pattern Analysis and Machine Intelligence
Fast Nearest-Neighbor Search in Dissimilarity Spaces
IEEE Transactions on Pattern Analysis and Machine Intelligence
Fault-Tolerant Algorithms for Fair Interprocess Synchronization
IEEE Transactions on Parallel and Distributed Systems
Connective Fault Tolerance in Multiple-Bus Systems
IEEE Transactions on Parallel and Distributed Systems
A global approach to record clustering and file reorganization
SIGIR '84 Proceedings of the 7th annual international ACM SIGIR conference on Research and development in information retrieval
Coloring face-hypergraphs of graphs on surfaces
Journal of Combinatorial Theory Series B
From relational program dependencies to hypertextual access structures
Nordic Journal of Computing
Fast In-Place Verification of Data Dependencies
IEEE Transactions on Knowledge and Data Engineering
Routing a Permutation in the Hypercube by Two Sets of Edge-Disjoint Paths
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Edge Coloring of Bipartite Graphs with Constraints
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Directed Hypergraphs: Problems, Algorithmic Results, and a Novel Decremental Approach
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
A Notion of Cross-Perfect Bipartite Graphs
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
A Structural Characterization of DAG-Isomorphic Dependency Models
AI '02 Proceedings of the 15th Conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence
Approximate Constrained Bipartite Edge Coloring
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
A Generic Greedy Algorithm, Partially-Ordered Graphs and NP-Completeness
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Weighted Node Coloring: When Stable Sets Are Expensive
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
DNA Sequencing, Eulerian Graphs, and the Exact Perfect Matching Problem
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Algorithms and Models for the On-Line Vertex-Covering
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Cluster Graph Modification Problems
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Self-Duality of Bounded Monotone Boolean Functions and Related Problems
ALT '00 Proceedings of the 11th International Conference on Algorithmic Learning Theory
Wide-Sense Nonblocking WDM Cross-Connects
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
On Complexity of Colouring Mixed Hypertrees
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Social Network Analysis Used for Modelling Collaboration in Distance Learning Groups
ITS '02 Proceedings of the 6th International Conference on Intelligent Tutoring Systems
Bounds for the chromatic number of graphs with partial information
Discrete Mathematics
Algebraic and combinatorial graph theory for optimal structural analysis
Civil and structural engineering computing: 2001
Conductance and congestion in power law graphs
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Greedy algorithms, H-colourings and a complexity-theoretic dichotomy
Theoretical Computer Science
Fault tolerance of a class of connecting networks
ISCA '80 Proceedings of the 7th annual symposium on Computer Architecture
The complexity of facets (and some facets of complexity)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
On structuring flowcharts (Preliminary Version)
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Universal circuits (Preliminary Report)
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Algorithms for edge coloring bipartite graphs
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Node-and edge-deletion NP-complete problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
On determining the genus of a graph in O(v O(g)) steps(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Negation can be exponentially powerful
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Scheduling file transfers in a distributed network
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Distributed algorithms for ensuring fair interprocess communicatons
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Predetermining visibility priority in 3-D scenes (Preliminary Report)
SIGGRAPH '79 Proceedings of the 6th annual conference on Computer graphics and interactive techniques
Filling regions in binary raster images: A graph-theoretic approach
SIGGRAPH '80 Proceedings of the 7th annual conference on Computer graphics and interactive techniques
The impact of synchronous communication on the problem of electing a leader in a ring
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
A new look at fault tolerant network routing
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
A heuristic procedure for ordering MOS arrays
DAC '75 Proceedings of the 12th Design Automation Conference
Multiwavelength Optical Networks with Limited Wavelength Conversion
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
The power of small coalitions in graphs
Discrete Applied Mathematics
Using stable sets to bound the chromatic number
Information Processing Letters
A Nim game played on graphs II
Theoretical Computer Science
Efficient dominating sets in Cayley graphs
Discrete Applied Mathematics
Decomposing non-manifold objects in arbitrary dimensions
Graphical Models - Special issue: Discrete topology and geometry for image and object representation
Pathways database system: an integrated set of tools for biological pathways
Proceedings of the 2003 ACM symposium on Applied computing
Neural network-based heuristic algorithms for hypergraph coloring problems with applications
Journal of Parallel and Distributed Computing - Special section best papers from the 2002 international parallel and distributed processing symposium
A notion of cross-perfect bipartite graphs
Information Processing Letters
Two-Connected Networks with Rings of Bounded Cardinality
Computational Optimization and Applications
On Task Scheduling Accuracy: Evaluation Methodology and Results
The Journal of Supercomputing
Two party immediate response disputes: properties and efficiency
Artificial Intelligence
Clique family inequalities for the stable set polytope of quasi-line graphs
Discrete Applied Mathematics - Special issue on stability in graphs and related topics
All Ramsey Numbers r(K3, G) for Connected Graphs of Order 7 and 8
Combinatorics, Probability and Computing
Abstraction and control for shapely nested graph transformation
Fundamenta Informaticae - Special issue on the first international conference on graph transformation (ICGT 2002)
Hypergraph Models and Algorithms for Data-Pattern-Based Clustering
Data Mining and Knowledge Discovery
Disjunctive feature structures as hypergraphs
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 2
Parallelism versus memory allocation in pipelined router forwarding engines
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
An NC algorithm for finding a maximal acyclic set in a graph
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Mappings of Figure Spaces and Systems of These Spaces
Cybernetics and Systems Analysis
A limit characterization for the number of spanning trees of graphs
Information Processing Letters
Lower bounds for adaptive collect and related objects
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
When graph theory helps self-stabilization
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Communications of the ACM
Journal of Parallel and Distributed Computing
Proceedings of the thirteenth ACM international conference on Information and knowledge management
Journal of Parallel and Distributed Computing
A partial join approach for mining co-location patterns
Proceedings of the 12th annual ACM international workshop on Geographic information systems
Discovering Colocation Patterns from Spatial Data Sets: A General Approach
IEEE Transactions on Knowledge and Data Engineering
A variation of a classical Turán-type extremal problem
European Journal of Combinatorics
Approximate constrained bipartite edge coloring
Discrete Applied Mathematics
Cluster graph modification problems
Discrete Applied Mathematics - Discrete mathematics & data mining (DM & DM)
Comparative Modeling of Network Topologies and Routing Strategies in Multicomputers
International Journal of High Performance Computing Applications
Optimal coteries for rings and related networks
Distributed Computing
Communication Contention in Task Scheduling
IEEE Transactions on Parallel and Distributed Systems
Locally guided randomized elections in trees: the totally fair case
Information and Computation
A hypocoloring model for batch scheduling
Discrete Applied Mathematics
Constraint solving via fractional edge covers
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Construction of sports schedules with multiple venues
Discrete Applied Mathematics
Discrete Applied Mathematics
An adjustable linear time parallel algorithm for maximum weight bipartite matching
Information Processing Letters
Weighted coloring: further complexity and approximability results
Information Processing Letters
The Hamiltonian problem on distance-hereditary graphs
Discrete Applied Mathematics
Decomposition of structural learning about directed acyclic graphs
Artificial Intelligence
Rearrangeability of bit permutation networks
Theoretical Computer Science
GXL: a graph-based standard exchange format for reengineering
Science of Computer Programming - Software analysis, evolution and re-engineering
Circular mixed hypergraphs II: the upper chromatic number
Discrete Applied Mathematics
Hamming hypermeshes: high performance interconnection networks for pin-out limited systems
Performance Evaluation
Time-stamps for Mazurkiewicz traces
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Efficient interference-aware TDMA link scheduling for static wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking
(p, k)-coloring problems in line graphs
Theoretical Computer Science
International Journal of Robotics and Automation
An introduction to competition-reachability of a graph
Proceedings of the 43rd annual Southeast regional conference - Volume 1
Depth of nodes in random recursive k-ary trees
Information Processing Letters
An efficient parallel strategy for the perfect domination problem on distance-hereditary graphs
The Journal of Supercomputing
IEEE Transactions on Parallel and Distributed Systems
Theoretical Computer Science
Tangent circle graphs and 'orders'
Discrete Applied Mathematics
Conflict-free star-access in parallel memory systems
Journal of Parallel and Distributed Computing
On the number of broadcast schemes in networks
Information Processing Letters
Coloring some classes of mixed graphs
Discrete Applied Mathematics
On the complexity of spill everywhere under SSA form
Proceedings of the 2007 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems
Partitioning of Variables for Multiple-Register-File VLIW Architectures
ICPP '94 Proceedings of the 1994 International Conference on Parallel Processing - Volume 01
Computational properties of argument systems satisfying graph-theoretic constraints
Artificial Intelligence
Bi-objective release planning for evolving software systems
Proceedings of the the 6th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering
Characterization and recognition of generalized clique-Helly graphs
Discrete Applied Mathematics
Fault-Tolerance of Dynamic-Full-Access Interconnection Networks
IEEE Transactions on Computers
A Representation of Hypergraphs in the Euclidean Space
IEEE Transactions on Computers
Efficient Design of Self-Checking Checker for any m-Out-of-n Code
IEEE Transactions on Computers
Greedy Diagnosis as the Basis of an Intermittent-Fault/ Transient-Upset Tolerant System Design
IEEE Transactions on Computers
Survey of graph database models
ACM Computing Surveys (CSUR)
Preemptive open shop scheduling with multiprocessors: polynomial cases and applications
Journal of Scheduling
The k-edge intersection graphs of paths in a tree
Discrete Applied Mathematics
Discrete Applied Mathematics
Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs
Discrete Applied Mathematics
The k-Homotopic Thinning and a Torus-Like Digital Image in Zn
Journal of Mathematical Imaging and Vision
Multicast tree allocation algorithms for Distributed Interactive Simulation
International Journal of High Performance Computing and Networking
Multi-level direct K-way hypergraph partitioning with multiple constraints and fixed vertices
Journal of Parallel and Distributed Computing
Graph products for configuration processing of space structures
Computers and Structures
Link scheduling in wireless sensor networks: Distributed edge-coloring revisited
Journal of Parallel and Distributed Computing
Recognition and processing of hand-drawn diagrams using syntactic and semantic analysis
AVI '08 Proceedings of the working conference on Advanced visual interfaces
Self-duality of bounded monotone boolean functions and related problems
Discrete Applied Mathematics
Discrete Applied Mathematics
The 0-1 inverse maximum stable set problem
Discrete Applied Mathematics
Finding Hamiltonian circuits in quasi-adjoint graphs
Discrete Applied Mathematics
Complexity measures for software engineering
Journal of Computational Methods in Sciences and Engineering - Selected papers from the International Conference on Computer Science,Software Engineering, Information Technology, e-Business, and Applications, 2003
On handshakes in random graphs
Information Processing Letters
The flow and tension spaces and lattices of signed graphs
European Journal of Combinatorics
Equivalences and the complete hierarchy of intersection graphs of paths in a tree
Discrete Applied Mathematics
Generalised arc consistency for the AllDifferent constraint: An empirical survey
Artificial Intelligence
A new connection between quantum circuits, graphs and the Ising partition function
Quantum Information Processing
Applications and Rewriting of Omnigraphs --- Exemplified in the Domain of MDD
Applications of Graph Transformations with Industrial Relevance
Flexible Process Graph: A Prologue
OTM '08 Proceedings of the OTM 2008 Confederated International Conferences, CoopIS, DOA, GADA, IS, and ODBASE 2008. Part I on On the Move to Meaningful Internet Systems:
Note: On the inapproximability of independent domination in 2P3-free perfect graphs
Theoretical Computer Science
On Generating All Maximal Acyclic Subhypergraphs with Polynomial Delay
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Subdivision Drawings of Hypergraphs
Graph Drawing
Weighted coloring on planar, bipartite and split graphs: Complexity and approximation
Discrete Applied Mathematics
Inducing regulation of any digraphs
Discrete Applied Mathematics
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Efficient approximation of min set cover by moderately exponential algorithms
Theoretical Computer Science
Intersection models of weakly chordal graphs
Discrete Applied Mathematics
On the complexity of recognizing directed path families
Discrete Applied Mathematics
Linear connectivity problems in directed hypergraphs
Theoretical Computer Science
Approximation of min coloring by moderately exponential algorithms
Information Processing Letters
Complexity Properties of Restricted Abstract Argument Systems
Proceedings of the 2006 conference on Computational Models of Argument: Proceedings of COMMA 2006
Pricing traffic in a spanning network
Proceedings of the 10th ACM conference on Electronic commerce
Synthesis and Composition of Web Services
Formal Methods for Web Services
On the complexity of linking deductive and abstract argument systems
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Algorithms on Subtree Filament Graphs
Graph Theory, Computational Intelligence and Thought
Finding relations in polynomial time
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
Journal of Artificial Intelligence Research
A note on t-complementing permutations for graphs
Information Processing Letters
Iterative exhaustive pattern generation for logic testing
IBM Journal of Research and Development
On complementary graph entropy
IEEE Transactions on Information Theory
Hypergraph Cuts & Unsupervised Representation for Image Segmentation
Fundamenta Informaticae
A hypocoloring model for batch scheduling
Discrete Applied Mathematics
Cluster graph modification problems
Discrete Applied Mathematics
The Hamiltonian problem on distance-hereditary graphs
Discrete Applied Mathematics
Minimum node disjoint path covering for circular-arc graphs
Information Processing Letters
F-factors of graphs: A generalized matching problem
Information Processing Letters
An adjustable linear time parallel algorithm for maximum weight bipartite matching
Information Processing Letters
Weighted Coloring: further complexity and approximability results
Information Processing Letters
Depth of nodes in random recursive k-ary trees
Information Processing Letters
Combined network complexity measures
IBM Journal of Research and Development
Sharing the Cost of a Capacity Network
Mathematics of Operations Research
Visualization of network structure by the application of hypernodes
International Journal of Approximate Reasoning
Paper: Parallel computation of matchings in trees
Parallel Computing
There are spanning spiders in dense graphs (and we know how to find them)
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Community detection in scale-free networks based on hypergraph model
PAISI'07 Proceedings of the 2007 Pacific Asia conference on Intelligence and security informatics
Structural learning about independence graphs from multiple databases
PAKDD'07 Proceedings of the 11th Pacific-Asia conference on Advances in knowledge discovery and data mining
Reformulating constraint satisfaction problems to improve scalability
SARA'07 Proceedings of the 7th International conference on Abstraction, reformulation, and approximation
Reformulating CSPs for scalability with application to geospatial reasoning
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Navigational complexity in web interactions
Proceedings of the 19th international conference on World wide web
A new algorithm for the maximum weighted stable set problem in claw-free graphs
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
An improved algorithm for finding cycles through elements
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Increased connectivity at lower cost: The case for multi-radio nodes in multi-hop wireless networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Minimum sum edge colorings of multicycles
Discrete Applied Mathematics
Birth and growth of multicyclic components in random hypergraphs
Theoretical Computer Science
Optimal guard sets and the Helly property
European Journal of Combinatorics
On a scalable topology for lightwave networks
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
The 3-colour ramsey number of a 3-uniform berge cycle
Combinatorics, Probability and Computing
Linear time analysis of properties of conflict-free and general Petri nets
Theoretical Computer Science
The extended global cardinality constraint: An empirical survey
Artificial Intelligence
Using cellular automata on a graph to model the exchanges of cash and goods
ACRI'10 Proceedings of the 9th international conference on Cellular automata for research and industry
On parallel recognition of cographs
Theoretical Computer Science
SIAM Journal on Discrete Mathematics
Universality considerations in VLSI circuits
IEEE Transactions on Computers
The complexity of acyclic subhypergraph problems
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Note: Recognizing Helly Edge-Path-Tree graphs and their clique graphs
Discrete Applied Mathematics
Blocks of hypergraphs: applied to hypergraphs and outerplanarity
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Mining social networks and their visual semantics from social photos
Proceedings of the International Conference on Web Intelligence, Mining and Semantics
Community Discovery via Metagraph Factorization
ACM Transactions on Knowledge Discovery from Data (TKDD)
Woven convolutional graph codes with large free distances
Problems of Information Transmission
Theoretical Computer Science
Redesigning group key exchange protocol based on bilinear pairing suitable for various environments
Inscrypt'10 Proceedings of the 6th international conference on Information security and cryptology
Soft constraints of difference and equality
Journal of Artificial Intelligence Research
A mathematical model for managing XML data
International Journal of Metadata, Semantics and Ontologies
Hypergraph spectral hashing for similarity search of social image
MM '11 Proceedings of the 19th ACM international conference on Multimedia
Testing implication of probabilistic dependencies
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
Arboricity: An acyclic hypergraph decomposition problem motivated by database theory
Discrete Applied Mathematics
Edge-Connectivity, Eigenvalues, and Matchings in Regular Graphs
SIAM Journal on Discrete Mathematics
Properties of markovian subgraphs of a decomposable graph
MICAI'06 Proceedings of the 5th Mexican international conference on Artificial Intelligence
Finding intersection models of weakly chordal graphs
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Weighted coloring: further complexity and approximability results
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Putting contacts into context: mobility modeling beyond inter-contact times
MobiHoc '11 Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing
Highly acyclic groups, hypergraph covers, and the guarded fragment
Journal of the ACM (JACM)
Efficient and simple generation of random simple connected graphs with prescribed degree sequence
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
The max quasi-independent set problem
Journal of Combinatorial Optimization
Creation and growth of components in a random hypergraph process
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
DNA hypernetworks for information storage and retrieval
DNA'06 Proceedings of the 12th international conference on DNA Computing
Computing optimal solutions for the MIN 3-SET COVERING problem
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Computation of chromatic polynomials using triangulations and clique trees
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Weighted coloring on planar, bipartite and split graphs: complexity and improved approximation
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
On finding acyclic subhypergraphs
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Conflict-Free coloring made stronger
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Complexity of linear connectivity problems in directed hypergraphs
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Characterization and recognition of generalized clique-helly graphs
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
The hypocoloring problem: complexity and approximability results when the chromatic number is small
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
ACG'09 Proceedings of the 12th international conference on Advances in Computer Games
A survey of approximation results for local search algorithms
Efficient Approximation and Online Algorithms
Approximation algorithms for path coloring in trees
Efficient Approximation and Online Algorithms
The lovász-local-lemma and scheduling
Efficient Approximation and Online Algorithms
Interpretation of medical images based on ontological models
ICAISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Soft Computing
On the notion of dimension in digital spaces
IWCIA'06 Proceedings of the 11th international conference on Combinatorial Image Analysis
On planar supports for hypergraphs
GD'09 Proceedings of the 17th international conference on Graph Drawing
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Hypergraph based network model and architechture for deep space exploration
ICICA'11 Proceedings of the Second international conference on Information Computing and Applications
A hypergraph-based storage policy for RDF version management system
Proceedings of the 6th International Conference on Ubiquitous Information Management and Communication
A meta-model for studying the coevolution of knowledge and collaboration networks
KSEM'11 Proceedings of the 5th international conference on Knowledge Science, Engineering and Management
Parameterized fairness axioms on cycle-free graph games
Journal of Global Optimization
The complexity of evaluating path expressions in SPARQL
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Improved worst-case complexity for the MIN 3-SET COVERING problem
Operations Research Letters
Survey: A survey on the structure of approximation classes
Computer Science Review
Approximability results for the maximum and minimum maximal induced matching problems
Discrete Optimization
Operations Research Letters
On the core of a traveling salesman cost allocation game
Operations Research Letters
Lifting facets of the cut polytope
Operations Research Letters
Conflict, consistency and truth-dependencies in graph representations of answer set logic programs
GKR'11 Proceedings of the Second international conference on Graph Structures for Knowledge Representation and Reasoning
Abstraction and Control for Shapely Nested Graph Transformation
Fundamenta Informaticae - The First International Conference on Graph Transformation (ICGT 2002)
Intuitionistic fuzzy hypergraphs with applications
Information Sciences: an International Journal
Reduced-by-matching Graphs: Toward Simplifying Hamiltonian Circuit Problem
Fundamenta Informaticae
Complexity Issues in Computational Biology
Fundamenta Informaticae - Watching the Daisies Grow: from Biology to Biomathematics and Bioinformatics — Alan Turing Centenary Special Issue
Intent-aware temporal query modeling for keyword suggestion
Proceedings of the 5th Ph.D. workshop on Information and knowledge
On acyclic conjunctive queries and constant delay enumeration
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
A simulation-based decision support system to model complex demand driven healthcare facilities
Proceedings of the Winter Simulation Conference
Proceedings of the Winter Simulation Conference
Hierarchical Clustering Based on Hyper-edge Similarity for Community Detection
WI-IAT '12 Proceedings of the The 2012 IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technology - Volume 01
Minimum clique cover in claw-free perfect graphs and the weak Edmonds-Johnson property
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
A term-based inverted index partitioning model for efficient distributed query processing
ACM Transactions on the Web (TWEB)
Boolean functions with long prime implicants
Information Processing Letters
Upper bounds on the rate of low density stabilizer codes for the quantum erasure channel
Quantum Information & Computation
Cyclomatic complexity metric for component based software
ACM SIGSOFT Software Engineering Notes
A Graph Coloring Based TDMA Scheduling Algorithm for Wireless Sensor Networks
Wireless Personal Communications: An International Journal
Recognizing vertex intersection graphs of paths on bounded degree trees
Discrete Applied Mathematics
Characterization of classical graph classes by weighted clique graphs
Discrete Applied Mathematics
SYSTEM MODELING AND ANALYSIS USING COMMUNICATION CHANNELS
Journal of Integrated Design & Process Science
Groupoids, Hypergraphs, and Symmetries in Finite Models
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.19 |