Publication | Date of Publication | Type |
---|
Rainbow domination regular graphs that are not vertex transitive | 2024-04-02 | Paper |
A fresh look to a randomized massively parallel graph coloring algorithm | 2023-09-21 | Paper |
60 years of OR in Slovenia: development from a first conference to a vibrant community | 2023-08-04 | Paper |
On the 2-rainbow independent domination numbers of some graphs | 2023-08-04 | Paper |
A linear time algorithm for weighted \(k\)-fair domination problem in cactus graphs | 2022-09-29 | Paper |
Clustering as a dual problem to colouring | 2022-05-23 | Paper |
Methodologies and applications for resilient global development from the aspect of SDI-SOR special issues of CJOR | 2021-11-24 | Paper |
On sufficient properties of sufficient matrices | 2021-11-24 | Paper |
Real forms of the complex Neumann system: a method for finding real roots of polynomial \(U_{\mathcal{S}} ( \lambda )\) | 2021-02-12 | Paper |
On median and quartile sets of ordered random variables | 2020-09-15 | Paper |
https://portal.mardi4nfdi.de/entity/Q5206328 | 2019-12-18 | Paper |
Networks with Extremal Closeness | 2019-08-14 | Paper |
Independent rainbow domination of graphs | 2019-06-17 | Paper |
The Hosoya polynomial of double weighted graphs | 2019-03-27 | Paper |
On 2-rainbow domination of generalized Petersen graphs | 2019-03-11 | Paper |
https://portal.mardi4nfdi.de/entity/Q4568163 | 2018-06-15 | Paper |
https://portal.mardi4nfdi.de/entity/Q4604353 | 2018-02-23 | Paper |
Reliability Hosoya-Wiener Polynomial of Double Weighted Trees* | 2017-11-09 | Paper |
https://portal.mardi4nfdi.de/entity/Q4975260 | 2017-08-04 | Paper |
https://portal.mardi4nfdi.de/entity/Q4975296 | 2017-08-04 | Paper |
https://portal.mardi4nfdi.de/entity/Q5738823 | 2017-06-13 | Paper |
https://portal.mardi4nfdi.de/entity/Q2966400 | 2017-03-07 | Paper |
Broadcasting on cactus graphs | 2017-03-03 | Paper |
On local search based heuristics for optimization problems | 2017-03-03 | Paper |
WEIGHTED DOMINATION NUMBER OF CACTUS GRAPHS | 2017-02-09 | Paper |
https://portal.mardi4nfdi.de/entity/Q2835386 | 2016-12-02 | Paper |
Mixed connectivity of Cartesian graph products and bundles | 2016-10-26 | Paper |
https://portal.mardi4nfdi.de/entity/Q2816052 | 2016-07-01 | Paper |
Improved approximative multicoloring of hexagonal graphs | 2016-06-04 | Paper |
Multicoloring of cannonball graphs | 2016-06-01 | Paper |
Self Similarities of the Tower of Hanoi Graphs and a proof of the Frame-Stewart Conjecture | 2016-01-17 | Paper |
Mixed fault diameter of Cartesian graph bundles II | 2015-10-05 | Paper |
On rainbow domination numbers of graphs | 2015-09-25 | Paper |
https://portal.mardi4nfdi.de/entity/Q2943939 | 2015-09-07 | Paper |
https://portal.mardi4nfdi.de/entity/Q2943940 | 2015-09-07 | Paper |
Perfect codes in direct graph bundles | 2015-06-02 | Paper |
Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles | 2014-12-05 | Paper |
https://portal.mardi4nfdi.de/entity/Q5420870 | 2014-06-13 | Paper |
Mixed fault diameter of Cartesian graph bundles | 2014-04-16 | Paper |
https://portal.mardi4nfdi.de/entity/Q5747413 | 2014-02-14 | Paper |
Wide-diameter of Product Graphs | 2013-08-26 | Paper |
GIS technology as an environment for testing an advanced mathematical model for optimization of road maintenance | 2013-07-08 | Paper |
1-local 7/5-competitive algorithm for multicoloring hexagonal graphs | 2013-04-03 | Paper |
https://portal.mardi4nfdi.de/entity/Q3144353 | 2012-12-07 | Paper |
Roman domination number of the Cartesian products of paths and cycles | 2012-10-24 | Paper |
https://portal.mardi4nfdi.de/entity/Q2915717 | 2012-09-18 | Paper |
A linear time algorithm for \(7\)-\([3\)coloring triangle-free hexagonal graphs] | 2012-07-25 | Paper |
Cyclic bundle Hamiltonicity | 2012-05-15 | Paper |
1-local 7/5-competitive Algorithm for Multicoloring Hexagonal Graphs | 2012-05-13 | Paper |
https://portal.mardi4nfdi.de/entity/Q3112180 | 2012-01-13 | Paper |
https://portal.mardi4nfdi.de/entity/Q3112207 | 2012-01-13 | Paper |
https://portal.mardi4nfdi.de/entity/Q3112208 | 2012-01-13 | Paper |
Simpler multicoloring of triangle-free hexagonal graphs | 2012-01-11 | Paper |
https://portal.mardi4nfdi.de/entity/Q3088443 | 2011-08-19 | Paper |
Constructive heuristics for the canister filling problem | 2011-08-12 | Paper |
1-Local 33/24-Competitive Algorithm for Multicoloring Hexagonal Graphs | 2011-06-08 | Paper |
https://portal.mardi4nfdi.de/entity/Q3070930 | 2011-01-28 | Paper |
https://portal.mardi4nfdi.de/entity/Q3162565 | 2010-10-20 | Paper |
2-local 7/6-competitive algorithm for multicolouring a sub-class of hexagonal graphs | 2010-09-14 | Paper |
https://portal.mardi4nfdi.de/entity/Q5748001 | 2010-09-14 | Paper |
https://portal.mardi4nfdi.de/entity/Q5748002 | 2010-09-14 | Paper |
https://portal.mardi4nfdi.de/entity/Q3575760 | 2010-07-28 | Paper |
https://portal.mardi4nfdi.de/entity/Q3575767 | 2010-07-28 | Paper |
https://portal.mardi4nfdi.de/entity/Q3575769 | 2010-07-28 | Paper |
https://portal.mardi4nfdi.de/entity/Q3575430 | 2010-07-27 | Paper |
Wide diameter of Cartesian graph bundles | 2010-05-28 | Paper |
Permutation Routing and (ℓ, k)-Routing on Plane Grids | 2010-02-09 | Paper |
https://portal.mardi4nfdi.de/entity/Q3400664 | 2010-02-05 | Paper |
Fault-diameter of Cartesian graph bundles | 2010-01-29 | Paper |
https://portal.mardi4nfdi.de/entity/Q3656590 | 2010-01-13 | Paper |
https://portal.mardi4nfdi.de/entity/Q3656597 | 2010-01-13 | Paper |
Hamilton cycles in graph bundles over a cycle with tree as a fibre | 2009-12-15 | Paper |
https://portal.mardi4nfdi.de/entity/Q3643741 | 2009-11-09 | Paper |
Edge-contributions of some topological indices and arboreality of molecular graphs | 2009-10-14 | Paper |
https://portal.mardi4nfdi.de/entity/Q3181533 | 2009-10-12 | Paper |
Edge, vertex and mixed fault diameters | 2009-09-14 | Paper |
2-local 5/4-competitive algorithm for multicoloring triangle-free hexagonal graphs | 2009-07-21 | Paper |
The edge fault-diameter of Cartesian graph bundles | 2009-06-17 | Paper |
https://portal.mardi4nfdi.de/entity/Q3515284 | 2008-07-29 | Paper |
Perfect codes in direct products of cycles-a complete characterization | 2008-06-26 | Paper |
(l,k)-Routing on Plane Grids | 2008-03-19 | Paper |
https://portal.mardi4nfdi.de/entity/Q5446945 | 2008-03-06 | Paper |
https://portal.mardi4nfdi.de/entity/Q5446946 | 2008-03-06 | Paper |
https://portal.mardi4nfdi.de/entity/Q5446947 | 2008-03-06 | Paper |
The fault-diameter of Cartesian products | 2008-03-05 | Paper |
Partial cubes are distance graphs | 2008-02-14 | Paper |
https://portal.mardi4nfdi.de/entity/Q5439008 | 2008-02-08 | Paper |
A note onn-tuple colourings and circular colourings of planar graphs with large odd girth | 2007-12-12 | Paper |
Edge Fault-Diameter of Cartesian Product of Graphs | 2007-11-15 | Paper |
https://portal.mardi4nfdi.de/entity/Q5310614 | 2007-10-11 | Paper |
https://portal.mardi4nfdi.de/entity/Q5296363 | 2007-08-01 | Paper |
Weak k-reconstruction of cartesian product graphs | 2007-05-29 | Paper |
Behzad-Vizing conjecture and Cartesian product graphs | 2007-05-29 | Paper |
2-local distributed algorithms for generalized coloring of hexagonal graphs | 2007-05-29 | Paper |
Weak reconstruction of strong product graphs | 2007-02-13 | Paper |
An almost complete description of perfect codes in direct products of cycles | 2007-02-13 | Paper |
https://portal.mardi4nfdi.de/entity/Q3412140 | 2006-12-05 | Paper |
On domination numbers of graphs bundles | 2006-12-04 | Paper |
https://portal.mardi4nfdi.de/entity/Q3410616 | 2006-11-29 | Paper |
https://portal.mardi4nfdi.de/entity/Q3409872 | 2006-11-20 | Paper |
https://portal.mardi4nfdi.de/entity/Q3409958 | 2006-11-20 | Paper |
Algorithmic Learning Theory | 2006-11-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q5482462 | 2006-08-28 | Paper |
https://portal.mardi4nfdi.de/entity/Q5482469 | 2006-08-28 | Paper |
https://portal.mardi4nfdi.de/entity/Q5482507 | 2006-08-28 | Paper |
https://portal.mardi4nfdi.de/entity/Q5471149 | 2006-06-06 | Paper |
https://portal.mardi4nfdi.de/entity/Q5708552 | 2005-11-18 | Paper |
https://portal.mardi4nfdi.de/entity/Q5708617 | 2005-11-18 | Paper |
https://portal.mardi4nfdi.de/entity/Q4674155 | 2005-05-09 | Paper |
https://portal.mardi4nfdi.de/entity/Q4674156 | 2005-05-09 | Paper |
https://portal.mardi4nfdi.de/entity/Q4674183 | 2005-05-09 | Paper |
2-local <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mn>4</mml:mn><mml:mo stretchy="false">/</mml:mo><mml:mn>3</mml:mn></mml:math>-competitive algorithm for multicoloring hexagonal graphs | 2005-05-04 | Paper |
Weak k-reconstruction of Cartesian products | 2004-10-27 | Paper |
https://portal.mardi4nfdi.de/entity/Q4815802 | 2004-09-08 | Paper |
https://portal.mardi4nfdi.de/entity/Q4815835 | 2004-09-08 | Paper |
Homomorphisms of hexagonal graphs to odd cycles | 2004-08-06 | Paper |
The obnoxious center problem on weighted cactus graphs. | 2004-03-14 | Paper |
https://portal.mardi4nfdi.de/entity/Q4431015 | 2003-10-13 | Paper |
A polynomial algorithm for the strong Helly property | 2003-06-24 | Paper |
Improved lower bound on the Shannon capacity of \(C_7\) | 2003-06-24 | Paper |
https://portal.mardi4nfdi.de/entity/Q4519268 | 2002-09-08 | Paper |
Behzad-Vizing conjecture and Cartesian-product graphs | 2002-09-03 | Paper |
Counterexamples to the uniform shortest path routing conjecture for vertex-transitive graphs | 2002-08-29 | Paper |
Algorithm for recognizing Cartesian graph bundles | 2002-08-29 | Paper |
https://portal.mardi4nfdi.de/entity/Q4547479 | 2002-08-21 | Paper |
https://portal.mardi4nfdi.de/entity/Q4547480 | 2002-08-21 | Paper |
https://portal.mardi4nfdi.de/entity/Q4546602 | 2002-08-20 | Paper |
On recognizing Cartesian graph bundles | 2002-06-30 | Paper |
https://portal.mardi4nfdi.de/entity/Q4531975 | 2002-05-27 | Paper |
Finding a five bicolouring of a triangle-free subgraph of the triangular lattice | 2002-05-21 | Paper |
Unique square property and fundamental factorizations of graph bundles | 2002-05-21 | Paper |
An algorithm forK-convex closure and an application | 2002-04-21 | Paper |
https://portal.mardi4nfdi.de/entity/Q2779818 | 2002-04-15 | Paper |
https://portal.mardi4nfdi.de/entity/Q2777507 | 2002-03-07 | Paper |
https://portal.mardi4nfdi.de/entity/Q2741375 | 2001-09-23 | Paper |
https://portal.mardi4nfdi.de/entity/Q2715585 | 2001-09-03 | Paper |
Recognizing weighted directed cartesian graph bundles | 2001-08-20 | Paper |
https://portal.mardi4nfdi.de/entity/Q4511029 | 2001-02-28 | Paper |
On the linearK-arboricity of cubic graphs | 2000-12-21 | Paper |
https://portal.mardi4nfdi.de/entity/Q4519306 | 2000-12-03 | Paper |
https://portal.mardi4nfdi.de/entity/Q4934361 | 2000-10-17 | Paper |
https://portal.mardi4nfdi.de/entity/Q4944167 | 2000-03-19 | Paper |
The independence number of the strong product of odd cycles | 1998-08-11 | Paper |
https://portal.mardi4nfdi.de/entity/Q4394828 | 1998-06-11 | Paper |
Distance-related invariants on polygraphs | 1998-04-08 | Paper |
Recognizing Cartesian graph bundles | 1997-11-25 | Paper |
https://portal.mardi4nfdi.de/entity/Q4348950 | 1997-08-10 | Paper |
On the weak reconstruction of Cartesian-product graphs | 1997-03-23 | Paper |
https://portal.mardi4nfdi.de/entity/Q5688116 | 1997-03-11 | Paper |
Algebraic approach to fasciagraphs and rotagraphs | 1996-10-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4328255 | 1995-06-11 | Paper |
Factoring cartesian‐product graphs | 1995-04-18 | Paper |
A randomized algorithm for \(k\)-colorability | 1995-01-26 | Paper |
https://portal.mardi4nfdi.de/entity/Q4695019 | 1993-08-17 | Paper |
A counterexample to conjecture of Barefoot, Harary, and Jones | 1993-08-11 | Paper |
Bounding the probability of success of stochastic methods for global optimization | 1993-07-21 | Paper |
Computing the Diameter in Multiple-Loop Networks | 1993-05-16 | Paper |
https://portal.mardi4nfdi.de/entity/Q4036189 | 1993-05-16 | Paper |
A parallel variant of a heuristical algorithm for graph coloring -- corrigendum | 1993-01-17 | Paper |
A parallel variant of a heuristical algorithm for graph colouring | 1990-01-01 | Paper |
A randomised heuristical algorithm for estimating the chromatic number of a graph | 1989-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3358770 | 1989-01-01 | Paper |