Distributed algorithms for finding centers and medians in networks
ACM Transactions on Programming Languages and Systems (TOPLAS)
On Fault Isolation and Identification in t1/t1-Diagnosable Systems
IEEE Transactions on Computers
IEEE Transactions on Computers - The MIT Press scientific computation series
Test Schedules for VLSI Circuits Having Built-In Test Hardware
IEEE Transactions on Computers - The MIT Press scientific computation series
Polynomial-time algorithm for the orbit problem
Journal of the ACM (JACM)
Geometry of planar graphs with angles
SCG '86 Proceedings of the second annual symposium on Computational geometry
Quadratic bounds for hidden line elimination
SCG '86 Proceedings of the second annual symposium on Computational geometry
The Comparison Approach to Multiprocessor Fault Diagnosis
IEEE Transactions on Computers
Parallel algorithms for minimum cuts and maximum flows in planar networks
Journal of the ACM (JACM)
Interprocessor Traffic Scheduling Algorithm for Multiple-Processor Networks
IEEE Transactions on Computers
Pattern formation and chaos in networks
Communications of the ACM
Nonconstructive tools for proving polynomial-time decidability
Journal of the ACM (JACM)
Distributed Diagnosis and the System User
IEEE Transactions on Computers
Flip-Trees: Fault-Tolerant Graphs with Wide Containers
IEEE Transactions on Computers - Fault-Tolerant Computing
Space-Efficient and Fault-Tolerant Message Routing in Outerplanar Networks
IEEE Transactions on Computers
On the Complexity of Single Fault Set Diagnosability and Diagnosis Problems
IEEE Transactions on Computers
A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
Resource Sharing Interconnection Networks in Multiprocessors
IEEE Transactions on Computers
Via Assignment in Single-Row Routing
IEEE Transactions on Computers
INGRID: A graph invariant manipulator
Journal of Symbolic Computation
Local reorientation, global order, and planar topology
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Generalized Measures of Fault Tolerance with Application to N-Cube Networks
IEEE Transactions on Computers
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
A separator theorem for graphs with an excluded minor and its applications
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Functional dependencies in Horn clause queries
ACM Transactions on Database Systems (TODS)
3-D Object Recognition Using Bipartite Matching Embedded in Discrete Relaxation
IEEE Transactions on Pattern Analysis and Machine Intelligence
The Orientation of Modules Based on Graph Decomposition
IEEE Transactions on Computers
Increased Throughput for the Testing and Repair of RAMs with Redundancy
IEEE Transactions on Computers
Upward planar drawing of single source acyclic digraphs
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Vertex-transitivity and routing for Cayley graphs in GCR representations
SAC '92 Proceedings of the 1992 ACM/SIGAPP symposium on Applied computing: technological challenges of the 1990's
Complexity of Fault Diagnosis in Comparison Models
IEEE Transactions on Computers
Structural and behavioral equivalence of simulation models
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Parallel algorithms for gray-scale image component labeling on a mesh-connected computer
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Optimal Fault Diagnosis in Comparison Models
IEEE Transactions on Computers
Data Transfers in Broadcast Networks
IEEE Transactions on Computers
An Observation on the Bisectional Interconnection Networks
IEEE Transactions on Computers
O(nlog log n)-work parallel algorithms for straight-line grid embeddings of planar graphs
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
A contraction procedure for planar directed graphs
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
A graph-aided inference browser for developing knowledge-based systems
SAC '92 Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing: technological challenges of the 1990's
Scheduling algorithms for multi-hop radio networks
SIGCOMM '92 Conference proceedings on Communications architectures & protocols
Toward zero-cost branches using instruction registers
MICRO 25 Proceedings of the 25th annual international symposium on Microarchitecture
On Self-Diagnosable Multiprocessor Systems: Diagnosis by the Comparison Approach
IEEE Transactions on Computers
Scheduling algorithms for multihop radio networks
IEEE/ACM Transactions on Networking (TON)
Area-efficient upward tree drawings
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Distributed code assignments for CDMA Packet Radio Network
IEEE/ACM Transactions on Networking (TON)
Optimal graph constraint reduction for symbolic layout compaction
DAC '93 Proceedings of the 30th international Design Automation Conference
Fault diagnosis in a small constant number of parallel testing rounds
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
An algebraic theory of graph reduction
Journal of the ACM (JACM)
Efficient low-contention parallel algorithms
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
On testing consecutive-ones property in parallel
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Algorithm-Based Fault Tolerant Synthesis for Linear Operations
IEEE Transactions on Computers
Codes Based on Complete Graphs
Designs, Codes and Cryptography - Special issue dedicated to Hanfried Lenz
ACM Computing Surveys (CSUR)
An O(n) algorithm for transistor stacking with performance constraints
DAC '96 Proceedings of the 33rd annual Design Automation Conference
On Minimizing the Lengths of Checking Sequences
IEEE Transactions on Computers
Complexity of simulation models: a graph theoretic approach
WSC '93 Proceedings of the 25th conference on Winter simulation
On floorplans of planar graphs
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
IEEE Transactions on Parallel and Distributed Systems
Algorithms for capacitated vehicle routing
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
A direct lower bound for k-set consensus
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Linearly Derived Steiner Triple Systems
Designs, Codes and Cryptography
Fault Tolerance Measures for m-Ary n-Dimensional Hypercubes Based on Forbidden Faulty Sets
IEEE Transactions on Computers
IEEE Transactions on Parallel and Distributed Systems
Algorithms for choosing differential gene expression experiments
RECOMB '99 Proceedings of the third annual international conference on Computational molecular biology
Analysis of nonblocking ATM switches with multiple input queues
IEEE/ACM Transactions on Networking (TON)
The role graph model and conflict of interest
ACM Transactions on Information and System Security (TISSEC) - Special issue on role-based access control
IEEE Transactions on Parallel and Distributed Systems
Routing with guaranteed delivery in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Optimal construction of edge-disjoint paths in random regular graphs
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Optimal construction of edge-disjoint paths in random graphs
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Fast backtracking principles applied to find new cages
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
All-to-all optical routing in optimal chordal rings of degree four
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Colouring graphs with prescribed induced cycle lengths
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Point-based approaches to qualitative temporal reasoning
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Efficient spare allocation in reconfigurable arrays
DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
WSC '88 Proceedings of the 20th conference on Winter simulation
An efficient parallel algorithm that finds independent sets of guaranteed size
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Some Hamilton Paths and a Minimal Change Algorithm
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Graph Problems on a Mesh-Connected Processor Array
Journal of the ACM (JACM)
Solving the rural postman problem using a genetic algorithm with a graph transformation
SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
A grouping genetic algorithm for coloring the edges of graphs
SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 1
Broadcasting under network ignorance scenario
SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 2
Edge-disjoint paths in expander graphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
ICCAD '99 Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design
The implementation of temporal intervals in qualitative simulation graphs
ACM Transactions on Modeling and Computer Simulation (TOMACS)
On optimum switch box designs for 2-D FPGAs
Proceedings of the 38th annual Design Automation Conference
Neighborhood unions and regularity in graphs
Theoretical Computer Science
Partitioning vertices of 1-tough graphs into paths
Theoretical Computer Science
Independent triangles covering given vertices of a graph
Theoretical Computer Science
A comparison of point-based approaches to qualitative temporal reasoning
Artificial Intelligence
Routing with guaranteed delivery in ad hoc wireless networks
Wireless Networks
Constructing One-to-Many Disjoint Paths in Folded Hypercubes
IEEE Transactions on Computers
Channel assignment and graph multicoloring
Handbook of wireless networks and mobile computing
Dominating-set-based routing in ad hoc wireless networks
Handbook of wireless networks and mobile computing
A framework for human-computer interaction in directed graph drawing
APVis '01 Proceedings of the 2001 Asia-Pacific symposium on Information visualisation - Volume 9
The drawability problem for minimum weight triangulations
Theoretical Computer Science
A necessary condition for a graph to be the visibility graph of simple polygon
Theoretical Computer Science
Parallel subgraph matching on a hierarchical interconnection network
Hardware implementation of intelligent systems
Iterative procedural abstraction for code size reduction
CASES '02 Proceedings of the 2002 international conference on Compilers, architecture, and synthesis for embedded systems
On some intriguing problems in hamiltonian graph theory: a survey
Discrete Mathematics
Forbidden triples for hamiltonicity
Discrete Mathematics
A note on hamiltonicity of generalized net-free graphs of large diameter
Discrete Mathematics
On pancyclism in hamiltonian graphs
Discrete Mathematics
Three-colourbility and forbidden subgraphs. II: polynomial algorithms
Discrete Mathematics
Journal of Combinatorial Theory Series B
Polynomials associated with nowhere-zero flows
Journal of Combinatorial Theory Series B
Graphs with magnetic Schrödinger operators of low corank
Journal of Combinatorial Theory Series B
Coverings of Graphs and Maps, Orthogonality, and Eigenvectors
Journal of Algebraic Combinatorics: An International Journal
Combinatorial Optimization by Dynamic Contraction
Journal of Heuristics
Multimedia Tools and Applications
Optimal Scheduling for Parallel CBR Video Servers
Multimedia Tools and Applications
Suppressing marginal totals from a two-dimensional table to protect sensitive information
Statistics and Computing
General models for optimum arbitrary-dimension FPGA switch box designs
Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design
On Hamiltonian Toeplitz graphs
Discrete Mathematics
Hamiltonicity of {K1,4,K1,4 + e}-free graphs
Discrete Mathematics
Ring embedding in faulty honeycomb rectangular torus
Information Processing Letters
Trade spectra of complete partite graphs
Discrete Mathematics
Hamiltonian cycles in 3-connected claw-free graphs
Discrete Mathematics
Edge-gracefulness of the composition of paths with null graphs
Discrete Mathematics
Block-cutvertex trees and block-cutvertex partitions
Discrete Mathematics
Forbidden subgraphs implying the MIN-algorithm gives a maximum independent set
Discrete Mathematics
The incidence coloring number of Halin graphs and outerplanar graphs
Discrete Mathematics
Hamiltonian iterated line graphs
Discrete Mathematics
A note on the ultimate categorical matching in a graph
Discrete Mathematics
A proof of a conjecture of minus domination in graphs
Discrete Mathematics
Line graphs of complete multipartite graphs have small cycle double covers
Discrete Mathematics
Polyunsaturated posets and graphs and the Greene-Kleitman theorem
Discrete Mathematics - Kleitman and combinatorics: a celebration
Reduction design for generic universal switch blocks
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Journal of Combinatorial Theory Series B
Bipartizing matchings and Sabidussi's compatibility conjecture
Discrete Mathematics - Algebraic and topological methods in graph theory
A note on degree conditions for Hamiltonicity in 2-connected claw-free graphs
Discrete Mathematics - Algebraic and topological methods in graph theory
A new technique for the characterization of graphs with a maximum number of spanning trees
Discrete Mathematics - Algebraic and topological methods in graph theory
Discrete Mathematics
Hypergraphical Codes Arising from Binary Trades
Designs, Codes and Cryptography
Information Processing Letters
Fault-tolerant hamiltonian laceability of hypercubes
Information Processing Letters
Structural Fault Testing of Embedded Cores Using Pipelining
Journal of Electronic Testing: Theory and Applications
Searching a minimal semantically-equivalent subset of a set of partial values
The VLDB Journal — The International Journal on Very Large Data Bases
Conditional Connectivity Measures for Large Multiprocessor Systems
IEEE Transactions on Computers
Decomposition of {0,1}-Matrices
IEEE Transactions on Computers
Information Dissemination in Distributed Systems with Faulty Units
IEEE Transactions on Computers
Compiler-Assisted Multiple Instruction Rollback Recovery Using a Read Buffer
IEEE Transactions on Computers
DCC Linear Congruential Graphs: A New Class of Interconnection Networks
IEEE Transactions on Computers
Toward Optimal Broadcast in a Star Graph Using Multiple Spanning Trees
IEEE Transactions on Computers
Query Evaluability in Statistical Databases
IEEE Transactions on Knowledge and Data Engineering
Evaluating Aggregate Operations Over Imprecise Data
IEEE Transactions on Knowledge and Data Engineering
Properties and Performance of Folded Hypercubes
IEEE Transactions on Parallel and Distributed Systems
A Comparative Study of Topological Properties of Hypercubes and Star Graphs
IEEE Transactions on Parallel and Distributed Systems
Interleaved All-to-All Reliable Broadcast on Meshes and Hypercubes
IEEE Transactions on Parallel and Distributed Systems
Algorithms and Properties of a New Two-Level Network with Folded Hypercubes as Basic Modules
IEEE Transactions on Parallel and Distributed Systems
Filtering Random Graphs to Synthesize Interconnection Networks with Multiple Objectives
IEEE Transactions on Parallel and Distributed Systems
Discrete Applied Mathematics
Pushing vertices in digraphs without long induced cycles
Discrete Applied Mathematics
On Wiener numbers of polygonal nets
Discrete Applied Mathematics
Enumeration of 2-connected loopless 4-regular maps on the plane
European Journal of Combinatorics
On the Laplacian spectrum of (α, ω)-graphs
European Journal of Combinatorics
Products of circulant graphs are metacirculant
Journal of Combinatorial Theory Series B
Coloring face-hypergraphs of graphs on surfaces
Journal of Combinatorial Theory Series B
Closure and forbidden pairs for Hamiltonicity
Journal of Combinatorial Theory Series B
Discrete Applied Mathematics - Special issue: Special issue devoted to the fifth annual international computing and combinatories conference (COCOON'99) Tokyo, Japan 26-28 July 1999
Determination of the star valency of a graph
Discrete Applied Mathematics
Maximum genus of a graph in terms of its embedding properties
Discrete Mathematics
A survey of communication protocol testing
Journal of Systems and Software
Complexity of domination-type problems in graphs
Nordic Journal of Computing
Independence and connectivity in 3-domination-critical graphs
Discrete Mathematics
K1,k-factorization of complete bipartite graphs
Discrete Mathematics
Graphs with chromatic polynomial Σl≤m0 (l/m0-l)(λ)l
Discrete Mathematics
General Models and a Reduction Design Technique for FPGA Switch Box Designs
IEEE Transactions on Computers
Super-connectivity and super-edge-connectivity for some interconnection networks
Applied Mathematics and Computation
Bipartite density of cubic graphs
Discrete Mathematics
New types of integral sum graphs
Discrete Mathematics
[2,3]-factors in a 3-connected infinite planar graph
The Korean Journal of Computational & Applied Mathematics
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
New Perspectives in Distributed Computing
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Subgraph Isomorphism, log-Bounded Fragmentation and Graphs of (Locally) Bounded Treewidth
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Embeddings of k-Connected Graphs of Pathwidth k
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Finding Planar Geometric Automorphisms in Planar Graphs
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Approximation Algorithms for Channel Assignment with Constraints
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Online Routing in Triangulations
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Tight Bounds on Maximal and Maximum Matchings
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
On the Spanning Ratio of Gabriel Graphs and beta-skeletons
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
A New Family of Optimal 1-Hamiltonian Graphs with Small Diameter
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
Plane Graphs with Acyclic Complex
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Some Results on Orthogonal Factorizations
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
A Highly Efficient Algorithm to Determine Bicritical Graphs
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
On Assigning Prefix Free Codes to the Vertices of a Graph
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Coloring Algorithms on Subcubic Graphs
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Bucket Hashing and its Application to Fast Message Authentication
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Using Nondeterminism to Design Deterministic Algorithms
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Parallel Edge Coloring of a Tree on a Mesh Connected Computer
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Minimum Weight Drawings of Maximal Triangulations (Extended Abstract)
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
Dihamiltonian Decomposition of Regular Graphs with Degree Three
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
(g, f)-Factorizations Orthogonal to k Subgraphs
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
A Simple Linear Time Algorithm for Finding Even Triangulations of 2-Connected Bipartite Plane Graphs
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
A Logical Model for Privacy Protection
ISC '01 Proceedings of the 4th International Conference on Information Security
Exponential Speedup of Fixed-Parameter Algorithms on K3, 3-Minor-Free or K5-Minor-Free Graphs
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Finding Smallest Supertrees Under Minor Containment
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Hamiltonian Decomposition of Recursive Circulants
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
On embedding an outer-planar graph in a point set
Computational Geometry: Theory and Applications
Efficient visibility queries in simple polygons
Computational Geometry: Theory and Applications
Towards area requirements for drawing hierarchically planar graphs
Theoretical Computer Science - Algorithms,automata, complexity and games
Experimental results on quadrangulations of sets of fixed points
Computer Aided Geometric Design
A note on minimum degree conditions for supereulerian graphs
Discrete Applied Mathematics - Sixth Twente Workshop on Graphs and Combinatorial Optimization
Bounds for the chromatic number of graphs with partial information
Discrete Mathematics
Partition the vertices of a graph into induced matchings
Discrete Mathematics
Scheduling length for switching element disjoint multicasting in Banyan-type switching networks
Journal of Systems Architecture: the EUROMICRO Journal
Blocking nonorientability of a surface
Journal of Combinatorial Theory Series B
The chromatic number of a graph of girth 5 on a fixed surface
Journal of Combinatorial Theory Series B
Loopback recovery from neighboring double-link failures in WDM mesh networks
Information Sciences—Informatics and Computer Science: An International Journal - Special issue: Photonics, networking & computing
Algorithms for data migration with cloning
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Uniform multi-hop all-to-all optical routings in rings
Theoretical Computer Science - Latin American theoretical informatics
The intrinsic dimensionality of graphs
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
A time-optimal solution for the path cover problem on cographs
Theoretical Computer Science
Volume upper bounds for 3D graph drawing
CASCON '94 Proceedings of the 1994 conference of the Centre for Advanced Studies on Collaborative research
Information Processing Letters
ACSC '03 Proceedings of the 26th Australasian computer science conference - Volume 16
Two conjectures on uniquely totally colorable graphs
Discrete Mathematics - Special issue: The 18th British combinatorial conference
Cycles in Hamiltonian graphs of prescribed maximum degree
Discrete Mathematics - Special issue: The 18th British combinatorial conference
Edge-disjoint trees containing some given vertices in a graph
Journal of Combinatorial Theory Series B
Scheduling for large-scale parallel video servers
FRONTIERS '96 Proceedings of the 6th Symposium on the Frontiers of Massively Parallel Computation
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Examples of hard tautologies in the propositional calculus
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
An efficient algorithm for determining whether a cubic graph is toroidal
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
Implicit data structures (Preliminary Draft)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
A polynomial-time algorithm for determining the isomorphism of graphs of fixed genus
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
The orbit problem is decidable
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
1.3 Parallelism in Structural Fault Testing of Embedded Cores
VTS '98 Proceedings of the 16th IEEE VLSI Test Symposium
Reducing Test Application Time in High-Level Test Generation
ITC '00 Proceedings of the 2000 IEEE International Test Conference
Factor criticality and complete closure of graphs
Discrete Mathematics
Complete-factors and (g,f)-factors
Discrete Mathematics
Hamiltonicity of 3-connected quasi-claw-free graphs
Discrete Mathematics
Total domination and least domination in a tree
Discrete Mathematics
Ring embedding in faulty pancake graphs
Information Processing Letters
Pancake problems with restricted prefix reversals and some corresponding Cayley networks
Journal of Parallel and Distributed Computing
Odyssey: a high-performance clustered video server
Software—Practice & Experience
Some problems on factorizations with constraints in bipartite graphs
Discrete Applied Mathematics
Every 3-connected distance claw-free graph is Hamilton-connected
Discrete Mathematics
Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
Information Processing Letters
Matching games: the least core and the nucleolus
Mathematics of Operations Research
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Privacy in multidimensional databases
Multidimensional databases
Identifying Regulatory Signals in DNA-Sequences with a Non-statistical Approximation Approach
CSB '03 Proceedings of the IEEE Computer Society Conference on Bioinformatics
M-alternating paths in n-extendable bipartite graphs
Discrete Mathematics
Note: small cycle cover of 2-connected cubic graphs
Discrete Mathematics
Planar k-cycle resonant graphs with k = 1,2
Discrete Applied Mathematics
Graphs with fourth Laplacian eigenvalue less than two
European Journal of Combinatorics
Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces
Computational Geometry: Theory and Applications
The complexity of the locally connected spanning tree problem
Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
Mickey: a macro cell global router
EURO-DAC '91 Proceedings of the conference on European design automation
Some connections between bounded query classes and non-uniform complexity
Information and Computation
A note on the bounded fragmentation property and its applications in network reliability
European Journal of Combinatorics
Fault Hamiltonicity and Fault Hamiltonian Connectivity of the Arrangement Graphs
IEEE Transactions on Computers
Data-gathering wireless sensor networks: organization and capacity
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Wireless sensor networks
On local and global independence numbers of a graph
Discrete Applied Mathematics - Special issue on stability in graphs and related topics
Challenges in graph-based relational data visualization
CASCON '92 Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 1
Journal of Combinatorial Theory Series B
Circular chromatic number and a generalization of the construction of Mycielski
Journal of Combinatorial Theory Series B
The maximum deviation just-in-time scheduling problem
Discrete Applied Mathematics
Some optimization problems on weak-bisplit graphs
Information Processing Letters
On the Circuit Cover Problem for Mixed Graphs
Combinatorics, Probability and Computing
Algorithmic Aspects of a Chip-Firing Game
Combinatorics, Probability and Computing
Optimal Construction of Edge-Disjoint Paths in Random Regular Graphs
Combinatorics, Probability and Computing
On Vertex-Triads in 3-Connected Binary Matroids
Combinatorics, Probability and Computing
Connectivity of k-extendable graphs with large k
Discrete Applied Mathematics - Discrete mathematics and theoretical computer science (DMTCS)
Expanding and forwarding parameters of product graphs
Discrete Applied Mathematics - Discrete mathematics and theoretical computer science (DMTCS)
An efficient parameterized algorithm for m-set packing
Journal of Algorithms
Subexponential parameterized algorithms on graphs of bounded-genus and H-minor-free graphs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
The largest eigenvalue of nonregular graphs
Journal of Combinatorial Theory Series B
Paired-domination in inflated graphs
Theoretical Computer Science
A fast pessimistic one-step diagnosis algorithm for hypercube multicomputer systems
Journal of Parallel and Distributed Computing
On the complexity of the approximation of nonplanarity parameters for cubic graphs
Discrete Applied Mathematics - Brazilian symposium on graphs, algorithms and combinatorics
On the construction of most reliable networks
Discrete Applied Mathematics
Neighborhood unions and cyclability of graphs
Discrete Applied Mathematics
Web-based simulation 2: the ABELS system: designing an adaptable interface for linking simulations
Proceedings of the 34th conference on Winter simulation: exploring new frontiers
The super laceability of the hypercubes
Information Processing Letters
Hyper hamiltonian laceability on edge fault star graph
Information Sciences: an International Journal
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
Journal of Computer and System Sciences
The super-connected property of recursive circulant graphs
Information Processing Letters
Rational quadratic approximation to real algebraic curves
Computer Aided Geometric Design - Special issue: Geometric modeling and processing 2004
Generating cycle spaces for graphs on surfaces with small genera
European Journal of Combinatorics
The number of removable edges in a 4-connected graph
Journal of Combinatorial Theory Series B
Three-coloring Klein bottle graphs of girth five
Journal of Combinatorial Theory Series B
Distributive online channel assignment for hexagonal cellular networks with constraints
Discrete Applied Mathematics
Discrete Applied Mathematics
Minor-minimal 6-regular graphs in the Klein bottle
European Journal of Combinatorics - Special issue: Topological graph theory
Characterization of networks supporting multi-dimensional linear interval routing schemes
Theoretical Computer Science
Loopback recovery from double-link failures in optical mesh networks
IEEE/ACM Transactions on Networking (TON)
Triangle Density and Contractibility
Combinatorics, Probability and Computing
Autonomous Decentralized Community Communication for Information Dissemination
IEEE Internet Computing
Fault-Hamiltonicity of Hypercube-Like Interconnection Networks
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Roads, codes, and spatiotemporal queries
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Embeddings of k-connected graphs of pathwidth k
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Eulerian subgraphs and Hamilton-connected line graphs
Discrete Applied Mathematics
Double covers of cubic graphs with oddness 4
Journal of Combinatorial Theory Series B
Max-flow problem in undirected planar networks with node capacities being in NC
Journal of Computer Science and Technology
Interference-aware topology control and QoS routing in multi-channel wireless mesh networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Some remarks on Hajós' conjecture
Journal of Combinatorial Theory Series B
Journal of Combinatorial Theory Series B - Special issue dedicated to professor W. T. Tutte
Bidimensionality: new connections between FPT algorithms and PTASs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Parallel Routing Algorithms for Nonblocking Electronic and Photonic Switching Networks
IEEE Transactions on Parallel and Distributed Systems
Parallel Computing
Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs
Journal of the ACM (JACM)
The complexity of matrix completion
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Many-to-Many Disjoint Path Covers in Hypercube-Like Interconnection Networks with Faulty Elements
IEEE Transactions on Parallel and Distributed Systems
The super connectivity of shuffle-cubes
Information Processing Letters
Edge-fault-tolerant edge-bipancyclicity of hypercubes
Information Processing Letters
Designs from the Group PSL2(q), q Even
Designs, Codes and Cryptography
A new sufficient condition for Hamiltonicity of graphs
Information Processing Letters
The number of spanning trees of plane graphs with reflective symmetry
Journal of Combinatorial Theory Series A
The Ramsey numbers of trees versus W6 or W7
European Journal of Combinatorics
Tracers placement for IP traceback against DDoS attacks
Proceedings of the 2006 international conference on Wireless communications and mobile computing
Subpancyclicity of line graphs and degree sums along paths
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
Complexities of homomorphism and isomorphism for definite logic programs
Journal of Computer Science and Technology
On generalized gossiping and broadcasting
Journal of Algorithms
Two classes of edge domination in graphs
Discrete Applied Mathematics
Lower bounds on the vertex-connectivity of digraphs and graphs
Information Processing Letters
Hamiltonicity in 3-connected claw-free graphs
Journal of Combinatorial Theory Series B
Every 3-connected, essentially 11-connected line graph is Hamiltonian
Journal of Combinatorial Theory Series B
Acyclic domination on bipartite permutation graphs
Information Processing Letters
Some basic properties of multiple Hamiltonian covers
Discrete Applied Mathematics - Special issue: Traces of the Latin American conference on combinatorics, graphs and applications: a selection of papers from LACGA 2004, Santiago, Chile
Work-efficient BSR-based parallel algorithms for some fundamental problems in graph theory
The Journal of Supercomputing
Power domination in block graphs
Theoretical Computer Science
On optimally-λ(3) transitive graphs
Discrete Applied Mathematics
Group connectivity of graphs with diameter at most 2
European Journal of Combinatorics
A practical fast parallel routing architecture for Clos networks
Proceedings of the 2006 ACM/IEEE symposium on Architecture for networking and communications systems
Extending SQL with graph matching and set covering for decision support applications
Journal of Management Information Systems
Strong Rabin numbers of folded hypercubes
Theoretical Computer Science
The super connectivity of the pancake graphs and the super laceability of the star graphs
Theoretical Computer Science
Eigenvectors of interval matrices over max-plus algebra
Discrete Applied Mathematics - Special issue: Max-algebra
Minimal invariant sets in a vertex-weighted graph
Theoretical Computer Science
Test generation for interaction detection in feature-rich communication systems
Computer Networks: The International Journal of Computer and Telecommunications Networking
Note: A note on the computational complexity of graph vertex partition
Discrete Applied Mathematics
Note: Hajós' conjecture for line graphs
Journal of Combinatorial Theory Series B
Contractions, cycle double covers, and cyclic colorings in locally connected graphs
Journal of Combinatorial Theory Series B
Incremental assignment problem
Information Sciences: an International Journal
An analogue of Dirac's theorem on circular super-critical graphs
European Journal of Combinatorics
Many 3-colorings of triangle-free planar graphs
Journal of Combinatorial Theory Series B
A constructive characterization of 3-connected triangle-free graphs
Journal of Combinatorial Theory Series B
Homomorphisms and edge-colourings of planar graphs
Journal of Combinatorial Theory Series B
Connected (n,m)-graphs with minimum and maximum zeroth-order general Randić index
Discrete Applied Mathematics
A Min-Max Relation on Packing Feedback Vertex Sets
Mathematics of Operations Research
Chords of longest circuits in locally planar graphs
European Journal of Combinatorics
List edge and list total colorings of planar graphs without 4-cycles
Theoretical Computer Science
Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth
Journal of Computer and System Sciences
Algorithms for long paths in graphs
Theoretical Computer Science
Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
Theoretical Computer Science
Contractions of 6-connected toroidal graphs
Journal of Combinatorial Theory Series B
Local solutions for global problems in wireless networks
Journal of Discrete Algorithms
Computing crossing number in linear time
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
A Robust Spanning Tree Topology for Data Collection and Dissemination in Distributed Environments
IEEE Transactions on Parallel and Distributed Systems
On the restricted forwarding index problem in communication networks
Computers & Mathematics with Applications
The neighbour-scattering number can be computed in polynomial time for interval graphs
Computers & Mathematics with Applications
Node-disjoint paths in hierarchical hypercube networks
Information Sciences: an International Journal
On the spanning connectivity and spanning laceability of hypercube-like networks
Theoretical Computer Science
The linear arboricity of planar graphs with no short cycles
Theoretical Computer Science
A census of boundary cubic rooted planar maps
Discrete Applied Mathematics
A modeling for hole problem in wireless sensor networks
IWCMC '07 Proceedings of the 2007 international conference on Wireless communications and mobile computing
An efficient condition for a graph to be Hamiltonian
Discrete Applied Mathematics
Multiple choice tries and distributed hash tables
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Cycles passing through prescribed edges in a hypercube with some faulty edges
Information Processing Letters
On the complexity of dominating set problems related to the minimum all-ones problem
Theoretical Computer Science
Note: Corrections of proofs for Hansen and Mélot's two theorems
Discrete Applied Mathematics
MacLane's planarity criterion for locally finite graphs
Journal of Combinatorial Theory Series B
A new degree sum condition for the existence of a contractible edge in a κ-connected graph
Journal of Combinatorial Theory Series B
Foundations and Trends® in Networking
Hybrid one-dimensional reversible cellular automata are regular
Discrete Applied Mathematics
IEEE Transactions on Computers
On Fault Identification in Diagnosable Systems
IEEE Transactions on Computers
An 0(n2.5) Fault Identification Algorithm for Diagnosable Systems
IEEE Transactions on Computers
A Hardware Hashing Scheme in the Design of a Multiterm String Comparator
IEEE Transactions on Computers
Spanning cycles in regular matroids without M*(K5) minors
European Journal of Combinatorics
On the number of contractible triples in 3-connected graphs
Journal of Combinatorial Theory Series B
ACST'07 Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology
On conditional diagnosability of the folded hypercubes
Information Sciences: an International Journal
New integer linear programming approaches for course timetabling
Computers and Operations Research
Some properties on f-edge covered critical graphs
Journal of Applied Mathematics and Computing
Labelling of some planar graphs with a condition at distance two
Journal of Applied Mathematics and Computing
Panconnectivity and edge-pancyclicity of faulty recursive circulant G(2m,4)
Theoretical Computer Science
Hamilton cycles in circuit graphs of matroids
Computers & Mathematics with Applications
The complete optimal stars-clustering-tree problem
Discrete Applied Mathematics
An upper bound on the independence number of benzenoid systems
Discrete Applied Mathematics
Complexity results for three-dimensional orthogonal graph drawing
Journal of Discrete Algorithms
Energy conservation in wireless sensor networks and connectivity of graphs
Theoretical Computer Science
The computational complexity of the parallel knock-out problem
Theoretical Computer Science
On the hardness of optimization in power-law graphs
Theoretical Computer Science
A method for representing 3D tree objects using chain coding
Journal of Visual Communication and Image Representation
Topological design of a K-connected communication network
EHAC'07 Proceedings of the 6th WSEAS International Conference on Electronics, Hardware, Wireless and Optical Communications
A graphical criterion of planarity for RNA secondary structures with pseudoknots in Rivas–Eddy class
Theoretical Computer Science
A homological solution for the Gauss code problem in arbitrary surfaces
Journal of Combinatorial Theory Series B
Hyper-Hamiltonian generalized Petersen graphs
Computers & Mathematics with Applications
Topological design of a K-connected communication network
EHAC'07 Proceedings of the 6th WSEAS International Conference on Electronics, Hardware, Wireless and Optical Communications
Graph connectivity, partial words, and a theorem of Fine and Wilf
Information and Computation
Modal Expressiveness of Graph Properties
Electronic Notes in Theoretical Computer Science (ENTCS)
Locally constrained graph homomorphisms and equitable partitions
European Journal of Combinatorics
The 2nd-order conditional 3-coloring of claw-free graphs
Theoretical Computer Science
Note: Paths in circuit graphs of matroids
Theoretical Computer Science
Solving the shortest path problem in vehicle navigation system by ant colony algorithm
ISCGAV'07 Proceedings of the 7th WSEAS International Conference on Signal Processing, Computational Geometry & Artificial Vision
The Ramsey numbers R(Cm,K7) and R(C7,K8)
European Journal of Combinatorics
Computers & Mathematics with Applications
Special classes of mathematical programming models with fuzzy random variables
Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology
The two-equal-disjoint path cover problem of Matching Composition Network
Information Processing Letters
Dual-link failure resiliency through backup link mutual exclusion
IEEE/ACM Transactions on Networking (TON)
The edge-pancyclicity of dual-cube extensive networks
CEA'08 Proceedings of the 2nd WSEAS International Conference on Computer Engineering and Applications
Minimum-cost sensor arrangement for achieving wanted coverage lifetime
International Journal of Sensor Networks
Authentication codes and bipartite graphs
European Journal of Combinatorics
Geodesic pancyclicity of crossed cubes
MATH'06 Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS
Trees with m-matchings and the fourth and fifth minimal Hosoya index
Computers & Mathematics with Applications
Fast exact and heuristic methods for role minimization problems
Proceedings of the 13th ACM symposium on Access control models and technologies
Ore-condition and Z3-connectivity
European Journal of Combinatorics
The Ramsey numbers for stars of even order versus a wheel of order nine
European Journal of Combinatorics
Graph parameters measuring neighbourhoods in graphs-Bounds and applications
Discrete Applied Mathematics
On conditional diagnosability and reliability of the BC networks
The Journal of Supercomputing
Embedding hamiltonian paths in hypercubes with a required vertex in a fixed position
Information Processing Letters
Generalized matching networks and their properties
International Journal of Parallel, Emergent and Distributed Systems
Fast reconfiguration algorithms for time, space, and wavelength dilated optical Benes networks
International Journal of Parallel, Emergent and Distributed Systems
A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges
Information Processing Letters
Edge vulnerability parameters of bisplit graphs
Computers & Mathematics with Applications
Convex drawings of graphs with non-convex boundary constraints
Discrete Applied Mathematics
A classification of tightly attached half-arc-transitive graphs of valency 4
Journal of Combinatorial Theory Series B
Note: A note on the signed edge domination number in graphs
Discrete Applied Mathematics
On quartic half-arc-transitive metacirculants
Journal of Algebraic Combinatorics: An International Journal
Nowhere-zero 3-flows in triangularly connected graphs
Journal of Combinatorial Theory Series B
Improved Upper Bounds for λ-Backbone Colorings Along Matchings and Stars
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Binding Number and Connected (g,f + 1)-Factors in Graphs
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007
Some Results on List Total Colorings of Planar Graphs
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007
Heavy Cycles in 2-Connected Weighted Graphs with Large Weighted Degree Sums
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007
A Class of Graphs of f-Class 1
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007
Hamiltonian Connected Line Graphs
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007
A Degree-Condition for (s, t)-Supereulerian Graphs
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007
On (s, t)-Supereulerian Locally Connected Graphs
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007
Even Factors with Degree at Most Four in Claw-Free Graphs
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007
An Algorithm to Solve the Partition into Perfect Matchings Problem in Halin Graphs
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007
The Edge Connectivity of Circuit Graphs of Matroids
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007
On f-Edge Cover-Coloring of Simple Graphs
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007
Upper Bounds on the D(β)-Vertex-Distinguishing Edge-Chromatic Numbers of Graphs
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007
Fault Tolerance in the Biswapped Network
ICA3PP '08 Proceedings of the 8th international conference on Algorithms and Architectures for Parallel Processing
Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Algorithms and Implementation for Interconnection Graph Problem
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Computer Simulation and Word-Updating Dynamical Systems (WDS) on Digraphs
ICIC '08 Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence
List edge and list total colorings of planar graphs without short cycles
Information Processing Letters
A note about some properties of BC graphs
Information Processing Letters
Extremal Hosoya index and Merrifield-Simmons index of hexagonal spiders
Discrete Applied Mathematics
Vertex-neighbour-integrity of composition graphs of paths and cycles
International Journal of Computer Mathematics
Super-connected and hyper-connected jump graphs
International Journal of Computer Mathematics
International Journal of Computer Mathematics
Vulnerability parameters of split graphs
International Journal of Computer Mathematics
The flow and tension spaces and lattices of signed graphs
European Journal of Combinatorics
Vertex-bipancyclicity of the generalized honeycomb tori
Computers & Mathematics with Applications
The connectivity of a graph and its complement
Discrete Applied Mathematics
International Journal of Computer Mathematics
The Ramsey number for a cycle of length six versus a clique of order eight
Discrete Applied Mathematics
Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width
Discrete Applied Mathematics
Discrete Applied Mathematics
Note: On extremal unicyclic molecular graphs with maximal Hosoya index
Discrete Applied Mathematics
Note: A note on list improper coloring of plane graphs
Discrete Applied Mathematics
On the number of 4-contractible edges in 4-connected graphs
Journal of Combinatorial Theory Series B
On mod (2p +1)-orientations of graphs
Journal of Combinatorial Theory Series B
Some three-color Ramsey numbers, R(P4,P5,Ck) and R(P4,P6,Ck)
European Journal of Combinatorics
Every line graph of a 4-edge-connected graph is Z3-connected
European Journal of Combinatorics
Long paths in hypercubes with conditional node-faults
Information Sciences: an International Journal
On graphs with the third largest number of maximal independent sets
Information Processing Letters
Efficient Scheduling Algorithms for Bluetooth Scatternets
Wireless Personal Communications: An International Journal
Coloring triangle-free graphs on surfaces
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
The subdivision-constrained minimum spanning tree problem
Theoretical Computer Science
On the bipanpositionable bipanconnectedness of hypercubes
Theoretical Computer Science
Note: On the inapproximability of independent domination in 2P3-free perfect graphs
Theoretical Computer Science
Super-connected arc-transitive digraphs
Discrete Applied Mathematics
Minimally 3-restricted edge connected graphs
Discrete Applied Mathematics
Discrete Applied Mathematics
Groups with the same non-commuting graph
Discrete Applied Mathematics
Upper bounds and algorithms for parallel knock-out numbers
Theoretical Computer Science
Hamiltonian connectedness in 3-connected line graphs
Discrete Applied Mathematics
Bi-cycle extendable through a given set in balanced bipartite graphs
Discrete Applied Mathematics
Enumerating spanning trees of graphs with an involution
Journal of Combinatorial Theory Series A
Some results on topological properties of folded hypercubes
Information Processing Letters
A note on the lower bound of edge guards of polyhedral terrains
International Journal of Computer Mathematics
On the spanning fan-connectivity of graphs
Discrete Applied Mathematics
The number of independent sets in unicyclic graphs with a given diameter
Discrete Applied Mathematics
Electronic Notes in Theoretical Computer Science (ENTCS)
Cross-layer Routing Design in Cognitive Radio Networks by Colored Multigraph Model
Wireless Personal Communications: An International Journal
The super spanning connectivity and super spanning laceability of the enhanced hypercubes
The Journal of Supercomputing
Conditional fault hamiltonian connectivity of the complete graph
Information Processing Letters
On path bipancyclicity of hypercubes
Information Processing Letters
Web Structure Mining by Isolated Cliques
IEICE - Transactions on Information and Systems
On a conjecture of the Randić index
Discrete Applied Mathematics
Some results related to the tenacity and existence of k-trees
Discrete Applied Mathematics
Bi-objective Optimization: An Online Algorithm for Job Assignment
GPC '09 Proceedings of the 4th International Conference on Advances in Grid and Pervasive Computing
Note: A note on transformations of edge colorings of bipartite graphs
Journal of Combinatorial Theory Series B
Conditional matching preclusion for hypercube-like interconnection networks
Theoretical Computer Science
On fractional (f,n)-critical graphs
Information Processing Letters
On f-fault tolerant arc-forwarding and optical indices of all-optical folded hypercubes
Information Processing Letters
Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable
Discrete Applied Mathematics
On the extremal Merrifield-Simmons index and Hosoya index of quasi-tree graphs
Discrete Applied Mathematics
The signless Laplacian spectral radius of graphs with given degree sequences
Discrete Applied Mathematics
Nowhere-zero 3-flows in Cayley graphs and Sylow 2-subgroups
Journal of Algebraic Combinatorics: An International Journal
International Journal of Communication Networks and Distributed Systems
A User Modeling Framework for Exploring Creative Problem-Solving Ability
Proceedings of the 2005 conference on Artificial Intelligence in Education: Supporting Learning through Intelligent and Socially Informed Technology
Many-to-many disjoint paths in faulty hypercubes
Information Sciences: an International Journal
On the annihilation number of a graph
AMATH'09 Proceedings of the 15th american conference on Applied mathematics
A sufficient condition for pancyclic graphs
Information Processing Letters
Approximate Conditional Distributions of Distances between Nodes in a Two-Dimensional Sensor Network
ASMTA '09 Proceedings of the 16th International Conference on Analytical and Stochastic Modeling Techniques and Applications
A Linear Time Algorithm for Computing the Most Reliable Source on a Tree with Faulty Vertices
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Hamiltonian Decomposition of Some Interconnection Networks
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
A Logical Approach to Hamiltonian Graphs
Electronic Notes in Theoretical Computer Science (ENTCS)
On graphs determining links with maximal number of components via medial construction
Discrete Applied Mathematics
Refined MDP-Based Branch-and-Fix Algorithm for the Hamiltonian Cycle Problem
Mathematics of Operations Research
Maximally Local Connectivity on Augmented Cubes
ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
Single-link failure detection in all-optical networks using monitoring cycles and paths
IEEE/ACM Transactions on Networking (TON)
The bipanpositionable bipancyclic property of the hypercube
Computers & Mathematics with Applications
Embedding Hamiltonian paths in augmented cubes with a required vertex in a fixed position
Computers & Mathematics with Applications
Exploiting symmetries in POMDPs for point-based algorithms
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
Consistency and random constraint satisfaction models
Journal of Artificial Intelligence Research
The Gn,mphase transition is not hard for the Hamiltonian cycle problem
Journal of Artificial Intelligence Research
On the discovery of mathematical theorems
IJCAI'87 Proceedings of the 10th international joint conference on Artificial intelligence - Volume 1
How is meaning grounded in dictionary definitions?
TextGraphs-3 Proceedings of the 3rd Textgraphs Workshop on Graph-Based Algorithms for Natural Language Processing
The restricted arc connectivity of Cartesian product digraphs
Information Processing Letters
Note: Acyclic edge coloring of planar graphs with large girth
Theoretical Computer Science
Multi-modal scene segmentation using scene transition graphs
MM '09 Proceedings of the 17th ACM international conference on Multimedia
Embedding geodesic and balanced cycles into hypercubes
WSEAS Transactions on Mathematics
The spread of the unicyclic graphs
European Journal of Combinatorics
Relay node placement in large scale wireless sensor networks
Computer Communications
IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
Supereulerianity of k-edge-connected graphs with a restriction on small bonds
Discrete Applied Mathematics
Note: A characterization of block graphs
Discrete Applied Mathematics
Cycles embedding in exchanged hypercubes
Information Processing Letters
Hamiltonian paths and cycles passing through a prescribed path in hypercubes
Information Processing Letters
On the capacity of ad hoc networks under random packet losses
IEEE Transactions on Information Theory
LocalCom: a community-based epidemic forwarding scheme in disruption-tolerant networks
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
Some matching properties in 4-γ×2--critical graphs
Computers & Mathematics with Applications
Circle path based sink location service for geographic routing scheme
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
How to hide information for later use on networks
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
Application of Dynamic Programming to Solving K Postmen Chinese Postmen Problem
ICIC '07 Proceedings of the 3rd International Conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence
On Protein Structure Alignment under Distance Constraint
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Embeddings of k-connected graphs of pathwidth k
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Eigenvectors of interval matrices over max-plus algebra
Discrete Applied Mathematics
Note: Two classes of edge domination in graphs
Discrete Applied Mathematics
On optimally-λ(3) transitive graphs
Discrete Applied Mathematics
Subpancyclicity of line graphs and degree sums along paths
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
The Countable Character of Uncountable Graphs
Electronic Notes in Theoretical Computer Science (ENTCS)
A new sufficient condition for Hamiltonicity of graphs
Information Processing Letters
On generalized gossiping and broadcasting
Journal of Algorithms
Consensus of linear time-invariant multi-agent systems based on dynamic output feedback
CCDC'09 Proceedings of the 21st annual international conference on Chinese control and decision conference
NP-Completeness of st-orientations for plane graphs
Theoretical Computer Science
Note: Counting labelled trees with given indegree sequence
Journal of Combinatorial Theory Series A
Robust distributed noise reduction in hearing aids with external acoustic sensor nodes
EURASIP Journal on Advances in Signal Processing - Special issue on digital signal processing for hearing instruments
The existence and upper bound for two types of restricted connectivity
Discrete Applied Mathematics
Secure and efficient data transmission in RFID sensor networks
International Journal of Security and Networks
Locally Optimal Source Routing for energy-efficient geographic routing
Wireless Networks
Single-step creation of localized Delaunay triangulations
Wireless Networks
TopoToolbox: A set of Matlab functions for topographic analysis
Environmental Modelling & Software
On toughness and fractional (g,f,n )-critical graphs
Information Processing Letters
On even triangulations of 2-connected embedded graphs
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Upper bounds and algorithms for parallel knock-out numbers
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
A graph based algorithm for intersection of subdivision surfaces
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII
Sufficient conditions for the existence of perfect heterochromatic matchings in colored graphs
CJCDGCGT'05 Proceedings of the 7th China-Japan conference on Discrete geometry, combinatorics and graph theory
Hamiltonicity of complements of total graphs
CJCDGCGT'05 Proceedings of the 7th China-Japan conference on Discrete geometry, combinatorics and graph theory
A note on the integrity of middle graphs
CJCDGCGT'05 Proceedings of the 7th China-Japan conference on Discrete geometry, combinatorics and graph theory
The decycling number of cubic planar graphs
CJCDGCGT'05 Proceedings of the 7th China-Japan conference on Discrete geometry, combinatorics and graph theory
Quasilocally connected, almost locally connected Or triangularly connected claw-free graphs
CJCDGCGT'05 Proceedings of the 7th China-Japan conference on Discrete geometry, combinatorics and graph theory
Two classes of simple MCD graphs
CJCDGCGT'05 Proceedings of the 7th China-Japan conference on Discrete geometry, combinatorics and graph theory
CJCDGCGT'05 Proceedings of the 7th China-Japan conference on Discrete geometry, combinatorics and graph theory
The binding number of a digraph
CJCDGCGT'05 Proceedings of the 7th China-Japan conference on Discrete geometry, combinatorics and graph theory
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
Hamiltonian connectivity and globally 3*-connectivity of dual-cube extensive networks
Computers and Electrical Engineering
Long alternating cycles in edge-colored complete graphs
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
Notes on fractional (1, f)-odd factors of graphs
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
Removable edges of a spanning tree in 3-connected 3-regular graphs
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
A surface-based DNA computing for the positive integer linear programming problem
ICIC'07 Proceedings of the intelligent computing 3rd international conference on Advanced intelligent computing theories and applications
ESA'07 Proceedings of the 15th annual European conference on Algorithms
The size of a minimum critically m-neighbor-scattered graph
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
The minimum all-ones problem for graphs with small treewidth
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Reducing inter-piconet delay for large-scale bluetooth scatternets
PAKDD'07 Proceedings of the 2007 international conference on Emerging technologies in knowledge discovery and data mining
Coloring triangle-free graphs on surfaces
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Torsion formulas for signed graphs
Discrete Applied Mathematics
A clustering model for multicast on hypercube network
GPC'08 Proceedings of the 3rd international conference on Advances in grid and pervasive computing
Unique factorization theorem and formal concept analysis
CLA'06 Proceedings of the 4th international conference on Concept lattices and their applications
On the chromatic number of integral circulant graphs
Computers & Mathematics with Applications
Hole reshaping routing in large-scale mobile ad-hoc networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Comparing universal covers in polynomial time
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Note: The competition number of a graph whose holes do not overlap much
Discrete Applied Mathematics
Woven graph codes: asymptotic performances and examples
IEEE Transactions on Information Theory
Cycles passing through a prescribed path in a hypercube with faulty edges
Information Processing Letters
Information Sciences: an International Journal
Algorithm for two disjoint long paths in 2-connected graphs
Theoretical Computer Science
Minimum distance lower bounds for girth-constrained RA code ensembles
IEEE Transactions on Communications
The smallest values of algebraic connectivity for unicyclic graphs
Discrete Applied Mathematics
Note: Random walks and the effective resistance sum rules
Discrete Applied Mathematics
Embedding of tori and grids into twisted cubes
Theoretical Computer Science
Extremal graphs with given order and the rupture degree
Computers & Mathematics with Applications
Sink location service based on circle and line paths in wireless sensor networks
IEEE Communications Letters
On the k-tuple domination of generalized de Brujin and Kautz digraphs
Information Sciences: an International Journal
A simple algorithm for triconnectivity of a multigraph
CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
Mutually independent Hamiltonian cycles in k-ary n-cubes when k is odd
AMERICAN-MATH'10 Proceedings of the 2010 American conference on Applied mathematics
A kind of conditional fault tolerance of alternating group graphs
Information Processing Letters
A kind of conditional fault tolerance of (n,k)-star graphs
Information Processing Letters
Note: Hamiltonicity of 6-connected line graphs
Discrete Applied Mathematics
Note: Connectivity of iterated line graphs
Discrete Applied Mathematics
ACM Transactions on Algorithms (TALG)
Conditional connectivity of Cayley graphs generated by transposition trees
Information Processing Letters
On the unimodality of independence polynomials of some graphs
European Journal of Combinatorics
A family of Hamiltonian and Hamiltonian connected graphs with fault tolerance
The Journal of Supercomputing
Mutually independent Hamiltonian cycles in dual-cubes
The Journal of Supercomputing
Flow-cut gaps for integer and fractional multiflows
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Algorithms and theory of computation handbook
A representation for efficient temporal reasoning
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Behavioral test generation using mixed integer non-linear programming
ITC'94 Proceedings of the 1994 international conference on Test
The throughput order of ad hoc networks employing network coding and broadcasting
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Node-disjoint paths in hierarchical hypercube networks
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Edge-fault-tolerant diameter and bipanconnectivity of hypercubes
Information Processing Letters
On edge colorings of 1-planar graphs
Information Processing Letters
A linear time algorithm for computing a most reliable source on a tree network with faulty nodes
Theoretical Computer Science
Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs
Information Processing Letters
On the hardness and inapproximability of optimization problems on power law graphs
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
Cyclic vertex connectivity of star graphs
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
A new result on [k, k + 1]-factors containing given hamiltonian cycles
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
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 Combinatoric biclustering algorithm
Proceedings of the 2011 conference on Neural Nets WIRN10: Proceedings of the 20th Italian Workshop on Neural Nets
Supereulerian graphs in the graph family C2(6,k)
Discrete Applied Mathematics
Enumeration of spanning trees of graphs with rotational symmetry
Journal of Combinatorial Theory Series A
IEA/AIE'10 Proceedings of the 23rd international conference on Industrial engineering and other applications of applied intelligent systems - Volume Part III
Nowhere-zero 3-flows in dihedral Cayley graphs
Information Processing Letters
Toughness and (a,b,k)-critical graphs
Information Processing Letters
Generalization of matching extensions in graphs (III)
Discrete Applied Mathematics
Degree distance of unicyclic and bicyclic graphs
Discrete Applied Mathematics
On the minimum communication effort for secure group key exchange
SAC'10 Proceedings of the 17th international conference on Selected areas in cryptography
An Ad Hoc Routing Protocol with Multiple Backup Routes
Wireless Personal Communications: An International Journal
Mutually independent Hamiltonian cycles in k-ary n-cubes when k is even
Computers and Electrical Engineering
On protein structure alignment under distance constraint
Theoretical Computer Science
Fast computation of small cuts via cycle space sampling
ACM Transactions on Algorithms (TALG)
Experimental evaluation of algorithms for the orthogonal milling problem with turn costs
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
One-to-one disjoint path covers on k-ary n-cubes
Theoretical Computer Science
One conjecture of bubble-sort graphs
Information Processing Letters
Discrete Applied Mathematics
Nordhaus-Gaddum-type theorem for Wiener index of graphs when decomposing into three parts
Discrete Applied Mathematics
Greedy routing via embedding graphs onto semi-metric spaces
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
An implicit degree condition for cyclability in graphs
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Animated construction of line drawings
Proceedings of the 2011 SIGGRAPH Asia Conference
On edge covering colorings of graphs
Information Processing Letters
Total coloring of planar graphs with maximum degree 7
Information Processing Letters
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Restricted edge connectivity of harary graphs
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Conflict packing yields linear vertex-kernels for k-FAST, k-dense RTI and a related problem
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Total restrained domination in graphs
Computers & Mathematics with Applications
Mod (2p+1)-orientations in line graphs
Information Processing Letters
Characterization of minimally (2,l)-connected graphs
Information Processing Letters
A primal-dual approximation algorithm for the vertex cover P3 problem
Theoretical Computer Science
Z3-connectivity of 4-edge-connected 2-triangular graphs
European Journal of Combinatorics
Super cyclically edge connected transitive graphs
Journal of Combinatorial Optimization
On the maximum size of a minimal k-edge connected augmentation
Journal of Combinatorial Theory Series B
Further results on the eccentric distance sum
Discrete Applied Mathematics
Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
ISPA'06 Proceedings of the 2006 international conference on Frontiers of High Performance Computing and Networking
The fuzzy weighted k-cardinality tree and its hybrid genetic algorithm
FSKD'06 Proceedings of the Third international conference on Fuzzy Systems and Knowledge Discovery
Graph labelings derived from models in distributed computing
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
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
Construct optimal diameter network and d-partition routing algorithm
ISPA'05 Proceedings of the 2005 international conference on Parallel and Distributed Processing and Applications
Complexity results for three-dimensional orthogonal graph drawing
GD'05 Proceedings of the 13th international conference on Graph Drawing
Edge fault tolerance of super edge connectivity for three families of interconnection networks
Information Sciences: an International Journal
Packing chromatic number of distance graphs
Discrete Applied Mathematics
Edge fault tolerance of graphs with respect to super edge connectivity
Discrete Applied Mathematics
Two conditions for reducing the maximal length of node-disjoint paths in hypercubes
Theoretical Computer Science
Traversal pattern mining in web environment
WINE'05 Proceedings of the First international conference on Internet and Network Economics
On-line coloring of h-free bipartite graphs
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
A novel approach model for chinese postman problem
ICIC'06 Proceedings of the 2006 international conference on Computational Intelligence and Bioinformatics - Volume Part III
DNA computing model of the integer linear programming problem based on molecular beacon
ICIC'06 Proceedings of the 2006 international conference on Computational Intelligence and Bioinformatics - Volume Part III
Minimal chordal sense of direction and circulant graphs
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Matrix and graph orders derived from locally constrained graph homomorphisms
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
On the capacity of wireless ad-hoc network basing on graph theory
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part II
DNA computing model of graph isomorphism based on three dimensional DNA graph structures
ICIC'05 Proceedings of the 2005 international conference on Advances in Intelligent Computing - Volume Part II
The weak 3-flow conjecture and the weak circular flow conjecture
Journal of Combinatorial Theory Series B
Many-to-Many disjoint path covers in a graph with faulty elements
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
Test generation for interaction detection in feature-rich communication systems
TestCom'05 Proceedings of the 17th IFIP TC6/WG 6.1 international conference on Testing of Communicating Systems
On the super connectivity of Kronecker products of graphs
Information Processing Letters
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Irregular redistribution scheduling by partitioning messages
ACSAC'05 Proceedings of the 10th Asia-Pacific conference on Advances in Computer Systems Architecture
Time optimal d-list colouring of a graph
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
The decycling number of cubic graphs
IJCCGGT'03 Proceedings of the 2003 Indonesia-Japan joint conference on Combinatorial Geometry and Graph Theory
Improved algorithms for data migration
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Matroidal approaches to rough sets via closure operators
International Journal of Approximate Reasoning
Note: On the connectivity of p-diamond-free vertex transitive graphs
Discrete Applied Mathematics
On the reciprocal degree distance of graphs
Discrete Applied Mathematics
The asymptotic behavior of some indices of iterated line graphs of regular graphs
Discrete Applied Mathematics
Note: A note on entire choosability of plane graphs
Discrete Applied Mathematics
A novel evolutionary algorithm for multi-constrained path selection
AI'06 Proceedings of the 19th Australian joint conference on Artificial Intelligence: advances in Artificial Intelligence
Certifying algorithms for the path cover and related problems on interval graphs
ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part II
Edge-bipancyclicity of all conditionally faulty hypercubes
ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part II
The computational complexity of the parallel knock-out problem
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Application of the maximum real roots of matching polynomial
ICICA'11 Proceedings of the Second international conference on Information Computing and Applications
Computing rupture degrees of some graphs
WSEAS Transactions on Mathematics
Perfect matchings in paired domination vertex critical graphs
Journal of Combinatorial Optimization
Hamiltonian numbers of Möbius double loop networks
Journal of Combinatorial Optimization
Fault-tolerant diameter for three family interconnection networks
Journal of Combinatorial Optimization
An application of rough sets to graph theory
Information Sciences: an International Journal
E-super vertex magic labelings of graphs
Discrete Applied Mathematics
Total colorings of planar graphs without intersecting 5-cycles
Discrete Applied Mathematics
Collapsible graphs and Hamiltonian connectedness of line graphs
Discrete Applied Mathematics
Interlaced switch boxes placement for three-dimensional FPGA architecture design
International Journal of Circuit Theory and Applications
Group Connectivity of Complementary Graphs
Journal of Graph Theory
Knowledge evolution course discovery in a professional virtual community
Knowledge-Based Systems
Research: Synchronizable test sequence generation using UIO sequences
Computer Communications
Mutually independent hamiltonian cycles of binary wrapped butterfly graphs
Mathematical and Computer Modelling: An International Journal
Minimizing a class of unicyclic graphs by means of Hosoya index
Mathematical and Computer Modelling: An International Journal
Sphere-of-influence graphs using the sup-norm
Mathematical and Computer Modelling: An International Journal
Smallest (1, 2)-eulerian weight and shortest cycle covering
Journal of Graph Theory
On r-acyclic edge colorings of planar graphs
Discrete Applied Mathematics
Intelligent transportation systems-Enabling technologies
Mathematical and Computer Modelling: An International Journal
Some extended results on diameter-stable graphs
Mathematical and Computer Modelling: An International Journal
Vertex-disjoint chorded cycles in a graph
Operations Research Letters
The robust minimum spanning tree problem: Compact and convex uncertainty
Operations Research Letters
On zeroth-order general Randić index of quasi-tree graphs containing cycles
Discrete Optimization
Approximability results for the maximum and minimum maximal induced matching problems
Discrete Optimization
Minimum partition of an independence system into independent sets
Discrete Optimization
Triangle-free graphs with large independent domination number
Discrete Optimization
Sports tournaments, home-away assignments, and the break minimization problem
Discrete Optimization
Geodesic pancyclicity of twisted cubes
Information Sciences: an International Journal
Claw-free graphs and 2-factors that separate independent vertices
Journal of Graph Theory
Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs
Journal of Graph Theory
A note on the minimum cut cover of graphs
Operations Research Letters
On the integral plane two-commodity flow problem
Operations Research Letters
A tight lower bound for optimal bin packing
Operations Research Letters
On minimal cost-reliability ratio spanning trees and related problems
Operations Research Letters
A successful algorithm for solving directed Hamiltonian path problems
Operations Research Letters
On the complexity of recognizing a class of generalized networks
Operations Research Letters
On the fractional chromatic index of a graph and its complement
Operations Research Letters
On separation and adjacency problems for perfectly matchable subgraph polytopes of a graph
Operations Research Letters
Operations Research Letters
Lifting facets of the cut polytope
Operations Research Letters
Quorum based sink location service for irregular wireless sensor networks
Computer Communications
New techniques for approximating optimal substructure problems in power-law graphs
Theoretical Computer Science
Weak models of distributed computing, with connections to modal logic
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
An algorithmic development to minimize crossings in electronic circuits
Journal of Computational Methods in Sciences and Engineering
Logic and Program Semantics
Color degree and heterochromatic cycles in edge-colored graphs
European Journal of Combinatorics
The linear arboricity of planar graphs with maximum degree at least 5
Information Processing Letters
Binding Number, Minimum Degree, and Cycle Structure in Graphs
Journal of Graph Theory
Finding patterns in an unknown graph
AI Communications - The Symposium on Combinatorial Search
On the 1-fault hamiltonicity for graphs satisfying Ore's theorem
Information Processing Letters
On the Co-PI and Laplacian Co-PI eigenvalues of a graph
Discrete Applied Mathematics
Reductions For Primitive 2-Structures
Fundamenta Informaticae
Some results on the injective chromatic number of graphs
Journal of Combinatorial Optimization
On cyclic vertex-connectivity of Cartesian product digraphs
Journal of Combinatorial Optimization
The paths embedding of the arrangement graphs with prescribed vertices in given position
Journal of Combinatorial Optimization
Linear time algorithms for finding a dominating set of fixed size in degenerated graphs
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
On the hardness of optimization in power law graphs
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Hamiltonicity and Pancyclicity of binary recursive networks
ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
Nonlinear fixed charge transportation problem by minimum cost flow-based genetic algorithm
Computers and Industrial Engineering
On the L(h, k)-labeling of co-comparability graphs
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Constrained cycle covers in Halin graphs
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
On the complexity of the max-edge-coloring problem with its variants
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Quantitative analysis of multi-hop wireless networks using a novel paradigm
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Computing connected components of simple undirected graphs based on generalized rough sets
Knowledge-Based Systems
TSP tours in cubic graphs: beyond 4/3
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Panconnectivity of n-dimensional torus networks with faulty vertices and edges
Discrete Applied Mathematics
The smallest randić index for trees
WISM'12 Proceedings of the 2012 international conference on Web Information Systems and Mining
Theoretical Computer Science
Effective channel assignments in cognitive radio networks
Computer Communications
Page Number and Graph Treewidth
International Journal of Applied Metaheuristic Computing
Optimal Clustering Selection on Hierarchical System Network
ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)
Signless Laplacian eigenvalues and circumference of graphs
Discrete Applied Mathematics
Note: On 4-γt -critical graphs of diameter two
Discrete Applied Mathematics
Hamiltonian claw-free graphs involving minimum degrees
Discrete Applied Mathematics
The 2-path-bipanconnectivity of hypercubes
Information Sciences: an International Journal
The vertex cover P3 problem in cubic graphs
Information Processing Letters
Fan-type degree condition restricted to triples of induced subgraphs ensuring Hamiltonicity
Information Processing Letters
Nowhere-zero 3-flows and modulo k-orientations
Journal of Combinatorial Theory Series B
The distance spectral radius of digraphs
Discrete Applied Mathematics
The relationship between the eccentric connectivity index and Zagreb indices
Discrete Applied Mathematics
Construction of optimal independent spanning trees on folded hypercubes
Information Sciences: an International Journal
Greedy routing via embedding graphs onto semi-metric spaces
Theoretical Computer Science
A new relative chain code in 3D
Pattern Recognition
Note: Comment on "Kirchhoff index in line, subdivision and total graphs of a regular graph"
Discrete Applied Mathematics
Algorithms for unipolar and generalized split graphs
Discrete Applied Mathematics
Graph partition into small cliques
Discrete Applied Mathematics
Note: The matching energy of graphs with given parameters
Discrete Applied Mathematics
Minimum degree, independence number and pseudo [2,b]-factors in graphs
Discrete Applied Mathematics
A new sufficient condition for pancyclability of graphs
Discrete Applied Mathematics
Rainbow triangles in edge-colored graphs
European Journal of Combinatorics
Cubic bi-Cayley graphs over abelian groups
European Journal of Combinatorics
Nowhere-zero 3-flows of graphs with prescribed sizes of odd edge cuts
European Journal of Combinatorics
Graphs with small second largest Laplacian eigenvalue
European Journal of Combinatorics
Theoretical Computer Science
Total coloring of planar graphs with maximum degree 8
Theoretical Computer Science
A Localized Computing Approach for Connectivity Improvement Analysis in Wireless Personal Networks
Wireless Personal Communications: An International Journal
Note: A note on "Tenacity of a graph with maximum connectivity"
Discrete Applied Mathematics
Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree
Discrete Applied Mathematics
Circular L(j,k)-labeling number of direct product of path and cycle
Journal of Combinatorial Optimization
Research note: An efficient construction of one-to-many node-disjoint paths in folded hypercubes
Journal of Parallel and Distributed Computing
Minimum diameter cost-constrained Steiner trees
Journal of Combinatorial Optimization
On the computational complexity of membership problems for the completely positive cone and its dual
Computational Optimization and Applications
The packing coloring of distance graphs D(k,t)
Discrete Applied Mathematics
Maximally edge-connected graphs and Zeroth-order general Randić index for 0
Discrete Applied Mathematics
The minimum restricted edge-connected graph and the minimum size of graphs with a given edge-degree
Discrete Applied Mathematics
Residual Closeness in Cycles and Related Networks
Fundamenta Informaticae
| Hi-index | 0.29 |