| Publication | Date of Publication | Type |
|---|
A new characterization of \(P_4\)-connected graphs
| 2024-06-05 | Paper |
On the isomorphism of graphs with few P4s
Graph-Theoretic Concepts in Computer Science | 2024-02-28 | Paper |
Asteroidal triple-free graphs
Graph-Theoretic Concepts in Computer Science | 2024-01-05 | Paper |
On domination elimination orderings and domination graphs
Graph-Theoretic Concepts in Computer Science | 2024-01-05 | Paper |
Time-optimal tree computations on sparse meshes
Graph-Theoretic Concepts in Computer Science | 2024-01-05 | Paper |
Efficient list ranking on the reconfigurable mesh, with applications
| 2023-01-25 | Paper |
Computing a dominating pair in an asteroidal triple-free graph in linear time
Lecture Notes in Computer Science | 2022-12-16 | Paper |
Optimal parallel algorithms for proximate points, with applications (extended abstract)
Lecture Notes in Computer Science | 2022-08-19 | Paper |
Linear time algorithms for dominating pairs in asteroidal triple-free graphs
Automata, Languages and Programming | 2019-01-10 | Paper |
An optimal hardware-algorithm for sorting using a fixed-size parallel sorting device
IEEE Transactions on Computers | 2018-07-09 | Paper |
Toward Efficient Task Management in Wireless Sensor Networks
IEEE Transactions on Computers | 2017-07-27 | Paper |
Toward Adaptive Sleep Schedules for Balancing Energy Consumption in Wireless Sensor Networks
IEEE Transactions on Computers | 2017-07-12 | Paper |
The LBFS structure and recognition of interval graphs
SIAM Journal on Discrete Mathematics | 2010-12-03 | Paper |
On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs
Networks | 2009-07-28 | Paper |
On the L(h,k)-Labeling of Co-comparability Graphs
Combinatorics, Algorithms, Probabilistic and Experimental Methodologies | 2009-03-03 | Paper |
Efficient corona training protocols for sensor networks
Theoretical Computer Science | 2008-08-14 | Paper |
The set of prime extensions of a graph: the finite and the infinite case
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
All minimal prime extensions of hereditary classes of graphs
Theoretical Computer Science | 2007-02-26 | Paper |
QoS provisioning strategies in LEO satellite networks
| 2006-10-17 | Paper |
Linear Orderings of Subfamilies of AT‐Free Graphs
SIAM Journal on Discrete Mathematics | 2006-06-01 | Paper |
scientific article; zbMATH DE number 2209786 (Why is no real title available?)
| 2005-09-28 | Paper |
Single-row transformation of complete graphs
The Journal of Supercomputing | 2005-05-24 | Paper |
AN EFFICIENT EREW ALGORITHM FOR MINIMUM PATH COVER AND HAMILTONICITY ON COGRAPHS
Parallel Algorithms and Applications | 2004-10-06 | Paper |
A COST-OPTIMAL EREW BREADTH-FIRST ALGORITHM FOR ORDERED TREES, WITH APPLICATIONS∗
Parallel Algorithms and Applications | 2004-10-06 | Paper |
The hierarchical cliques interconnection network
Journal of Parallel and Distributed Computing | 2004-09-08 | Paper |
scientific article; zbMATH DE number 2080260 (Why is no real title available?)
| 2004-08-04 | Paper |
scientific article; zbMATH DE number 2044941 (Why is no real title available?)
| 2004-02-18 | Paper |
A time-optimal solution for the path cover problem on cographs.
Theoretical Computer Science | 2003-08-17 | Paper |
Some observations on using meta-heuristics for efficient location management in mobile computing networks.
Journal of Parallel and Distributed Computing | 2003-08-07 | Paper |
scientific article; zbMATH DE number 1823192 (Why is no real title available?)
| 2002-11-04 | Paper |
Fault-tolerant recursive least-squares computations on a mesh-connected parallel processor
Journal of Parallel and Distributed Computing | 2002-10-16 | Paper |
Enhanced simulated annealing technique for the single-row routing problem
The Journal of Supercomputing | 2002-08-20 | Paper |
scientific article; zbMATH DE number 1751212 (Why is no real title available?)
| 2002-06-06 | Paper |
Energy-Efficient Initialization Protocols for Ad-hoc Radio Networks
Algorithms and Computation | 2001-10-23 | Paper |
Efficient algorithms for graphs with few \(P_4\)'s
Discrete Mathematics | 2001-07-18 | Paper |
Upper bounds to the clique width of graphs
Discrete Applied Mathematics | 2001-03-30 | Paper |
On the dynamic initialization of parallel computers
The Journal of Supercomputing | 2000-05-10 | Paper |
Efficiently recognizing the \(P_4\)-structure of trees and of bipartite graphs without short cycles
Graphs and Combinatorics | 2000-01-01 | Paper |
On the \(p\)-connectedness of graphs---a survey
Discrete Applied Mathematics | 1999-12-12 | Paper |
scientific article; zbMATH DE number 1322336 (Why is no real title available?)
| 1999-11-02 | Paper |
Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs
SIAM Journal on Computing | 1999-10-28 | Paper |
scientific article; zbMATH DE number 1303554 (Why is no real title available?)
| 1999-06-17 | Paper |
scientific article; zbMATH DE number 1305500 (Why is no real title available?)
| 1999-06-17 | Paper |
scientific article; zbMATH DE number 1262809 (Why is no real title available?)
| 1999-04-26 | Paper |
Time-optimal proximity graph computations on enhanced meshes
Journal of Parallel and Distributed Computing | 1999-03-30 | Paper |
On the structure of graphs with few \(P_4\)s
Discrete Applied Mathematics | 1998-10-18 | Paper |
A fast parallel algorithm to recognize P4-sparse graphs
Discrete Applied Mathematics | 1998-08-19 | Paper |
scientific article; zbMATH DE number 1107719 (Why is no real title available?)
| 1998-02-16 | Paper |
Asteroidal Triple-Free Graphs
SIAM Journal on Discrete Mathematics | 1998-02-09 | Paper |
Time-optimal tree computations on sparse meshes
Discrete Applied Mathematics | 1997-12-17 | Paper |
Simple linear time recognition of unit interval graphs
Information Processing Letters | 1997-02-28 | Paper |
A linear time algorithm to compute a dominating path in an AT-free graph
Information Processing Letters | 1997-02-28 | Paper |
scientific article; zbMATH DE number 922844 (Why is no real title available?)
| 1996-11-20 | Paper |
Interval Graph Problems on Reconfigurable Meshes
ORSA Journal on Computing | 1996-10-20 | Paper |
Linear time optimization algorithms for \(P_ 4\)-sparse graphs
Discrete Applied Mathematics | 1996-02-06 | Paper |
P-Components and the Homogeneous Decomposition of Graphs
SIAM Journal on Discrete Mathematics | 1995-10-10 | Paper |
Constant-time convexity problems on reconfigurable meshes
Journal of Parallel and Distributed Computing | 1995-09-24 | Paper |
Reconstructing a binary tree from its traversals in doubly logarithmic CREW time
Journal of Parallel and Distributed Computing | 1995-09-24 | Paper |
Optimal parallel colouring algorithms for totally decomposable graphs
International Journal of Computer Mathematics | 1995-02-20 | Paper |
scientific article; zbMATH DE number 622472 (Why is no real title available?)
| 1994-08-21 | Paper |
scientific article; zbMATH DE number 512929 (Why is no real title available?)
| 1994-06-12 | Paper |
A NEW CHARACTERIZATION OF UNBREAKABLE GRAPHS
International Journal of Foundations of Computer Science | 1994-03-27 | Paper |
Selection on rectangular meshes with multiple broadcasting
BIT | 1993-08-23 | Paper |
Optimal greedy algorithms for indifference graphs
Computers & Mathematics with Applications | 1993-06-29 | Paper |
Quasi-brittle graphs, a new class of perfectly orderable graphs
Discrete Mathematics | 1993-06-29 | Paper |
Applications of reconfigurable meshes to constant-time computations
Parallel Computing | 1993-05-16 | Paper |
The morphology of convex polygons
Computers & Mathematics with Applications | 1993-04-01 | Paper |
A constant-time channel-assignment algorithm on reconfigurable meshes
BIT | 1993-01-26 | Paper |
scientific article; zbMATH DE number 97100 (Why is no real title available?)
| 1993-01-17 | Paper |
OPTIMAL PARALLEL ENCODING AND DECODING ALGORITHMS FOR TREES
International Journal of Foundations of Computer Science | 1993-01-16 | Paper |
A charming class of perfectly orderable graphs
Discrete Mathematics | 1992-09-27 | Paper |
An nc algorithm to recognize hhd-free graphs
International Journal of Computer Mathematics | 1992-09-27 | Paper |
Recognizing $P_4 $-Sparse Graphs in Linear Time
SIAM Journal on Computing | 1992-06-28 | Paper |
An optimal parallel algorithm to construct a deap
International Journal of Computer Mathematics | 1992-06-28 | Paper |
Merging heaps in parallel
International Journal of Computer Mathematics | 1992-06-28 | Paper |
An efficient parallel algorithm for multiselection
Parallel Computing | 1992-06-26 | Paper |
A faster optimal algorithm for the measure problem
Parallel Computing | 1992-06-26 | Paper |
On the structure of unbreakable graphs
Journal of Graph Theory | 1992-06-26 | Paper |
On the homogeneous representation of interval graphs
Journal of Graph Theory | 1992-06-25 | Paper |
Graphes parfaitement ordonnables généralisés. (Generalized perfectly orderable graphs)
Discrete Mathematics | 1992-06-25 | Paper |
A generalization of Chvátal's star-cutset lemma
Information Processing Letters | 1992-06-25 | Paper |
An optimal greedy heuristic to color interval graphs
Information Processing Letters | 1991-01-01 | Paper |
A simple linear-time algorithm for computing the center of an interval graph
International Journal of Computer Mathematics | 1990-01-01 | Paper |
On the closure of triangle-free graphs under substitution
Information Processing Letters | 1990-01-01 | Paper |
Wings and perfect graphs
Discrete Mathematics | 1990-01-01 | Paper |
Constructing bimodal convex hexagons
International Journal of Computer Mathematics | 1990-01-01 | Paper |
The strong perfect graph conjecture for pan-free graphs
Journal of Combinatorial Theory. Series B | 1989-01-01 | Paper |
scientific article; zbMATH DE number 4079483 (Why is no real title available?)
| 1989-01-01 | Paper |
A decomposition for strongly perfect graphs
Journal of Graph Theory | 1989-01-01 | Paper |
Weak bipolarizable graphs
Discrete Mathematics | 1989-01-01 | Paper |
A simple linear-time algorithm for computing the ring and MST of unimodal polygons
Information Processing Letters | 1989-01-01 | Paper |
A simple nc algorithm to recognize weakly triangulated graphs
International Journal of Computer Mathematics | 1989-01-01 | Paper |
Paw-free graphs
Information Processing Letters | 1988-01-01 | Paper |
All variations on perfectly orderable graphs
Journal of Combinatorial Theory. Series B | 1988-01-01 | Paper |
No antitwins in minimal imperfect graphs
Journal of Combinatorial Theory. Series B | 1988-01-01 | Paper |
On the strong perfect graph conjecture
Journal of Graph Theory | 1988-01-01 | Paper |
On the unimodality of convex polygons
Information Processing Letters | 1988-01-01 | Paper |
scientific article; zbMATH DE number 4079463 (Why is no real title available?)
| 1988-01-01 | Paper |
