Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/endm/endm8.bht:"
download as .bib file
@article{DBLP:journals/endm/Bang-JensenY01,
author = {J{\o}rgen Bang{-}Jensen and
Anders Yeo},
title = {Making a tournament k-arc-strong by reversing arcs},
journal = {Electron. Notes Discret. Math.},
volume = {8},
pages = {2--5},
year = {2001},
url = {https://doi.org/10.1016/S1571-0653(05)80064-2},
doi = {10.1016/S1571-0653(05)80064-2},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/Bang-JensenY01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/BerryB01,
author = {Anne Berry and
Jean Paul Bordat},
title = {Moplex elimination orderings},
journal = {Electron. Notes Discret. Math.},
volume = {8},
pages = {6--9},
year = {2001},
url = {https://doi.org/10.1016/S1571-0653(05)80065-4},
doi = {10.1016/S1571-0653(05)80065-4},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/BerryB01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/BoltenSSSS01,
author = {Eva Bolten and
Alexander Schliep and
Sebastian Schneckener and
Dietmar Schomburg and
Rainer Schrader},
title = {Strongly Connected Components can Predict Protein Structure},
journal = {Electron. Notes Discret. Math.},
volume = {8},
pages = {10--13},
year = {2001},
url = {https://doi.org/10.1016/S1571-0653(05)80066-6},
doi = {10.1016/S1571-0653(05)80066-6},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/BoltenSSSS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/BouchitteKMT01,
author = {Vincent Bouchitt{\'{e}} and
Dieter Kratsch and
Haiko M{\"{u}}ller and
Ioan Todinca},
title = {On treewidth approximations},
journal = {Electron. Notes Discret. Math.},
volume = {8},
pages = {98--101},
year = {2001},
url = {https://doi.org/10.1016/S1571-0653(05)80091-5},
doi = {10.1016/S1571-0653(05)80091-5},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/BouchitteKMT01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/BroersmaFHP01,
author = {Hajo Broersma and
Ulrich Faigle and
Johann L. Hurink and
Stefan Pickl},
title = {Preface: Volume 8},
journal = {Electron. Notes Discret. Math.},
volume = {8},
pages = {1},
year = {2001},
url = {https://doi.org/10.1016/S1571-0653(05)80063-0},
doi = {10.1016/S1571-0653(05)80063-0},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/endm/BroersmaFHP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/CalamoneriP01,
author = {Tiziana Calamoneri and
Rossella Petreschi},
title = {LD-Coloring of Regular Tiling (Extended Abstract)},
journal = {Electron. Notes Discret. Math.},
volume = {8},
pages = {18--21},
year = {2001},
url = {https://doi.org/10.1016/S1571-0653(05)80068-X},
doi = {10.1016/S1571-0653(05)80068-X},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/CalamoneriP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/Ceroi01,
author = {St{\'{e}}phan Ceroi},
title = {Clique number and ball containment number of unit ball graphs},
journal = {Electron. Notes Discret. Math.},
volume = {8},
pages = {22--25},
year = {2001},
url = {https://doi.org/10.1016/S1571-0653(05)80069-1},
doi = {10.1016/S1571-0653(05)80069-1},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/Ceroi01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/DoerrS01a,
author = {Benjamin Doerr and
Anand Srivastav},
title = {Multicolor Discrepancy of Arithmetic Progressions - Extended Abstract},
journal = {Electron. Notes Discret. Math.},
volume = {8},
pages = {27--30},
year = {2001},
url = {https://doi.org/10.1016/S1571-0653(05)80071-X},
doi = {10.1016/S1571-0653(05)80071-X},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/DoerrS01a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/DumbK01,
author = {A. F. Dumb and
Walter Kern},
title = {A simple dual ascent algorithm for the multilevel facility location
problem},
journal = {Electron. Notes Discret. Math.},
volume = {8},
pages = {14--17},
year = {2001},
url = {https://doi.org/10.1016/S1571-0653(05)80067-8},
doi = {10.1016/S1571-0653(05)80067-8},
timestamp = {Sat, 23 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/DumbK01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/EppingHO01,
author = {Thomas Epping and
Winfried Hochst{\"{a}}ttler and
Peter Oertel},
title = {Some Results on a Paint Shop Problem for Words},
journal = {Electron. Notes Discret. Math.},
volume = {8},
pages = {31--33},
year = {2001},
url = {https://doi.org/10.1016/S1571-0653(05)80072-1},
doi = {10.1016/S1571-0653(05)80072-1},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/EppingHO01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/FeketeKT01,
author = {S{\'{a}}ndor P. Fekete and
Ekkehard K{\"{o}}hler and
J{\"{u}}rgen Teich},
title = {Extending Partial Suborders},
journal = {Electron. Notes Discret. Math.},
volume = {8},
pages = {34--37},
year = {2001},
url = {https://doi.org/10.1016/S1571-0653(05)80073-3},
doi = {10.1016/S1571-0653(05)80073-3},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/FeketeKT01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/FinocchiP01,
author = {Irene Finocchi and
Rossella Petreschi},
title = {Tree partitioning via vertex deletion},
journal = {Electron. Notes Discret. Math.},
volume = {8},
pages = {38--41},
year = {2001},
url = {https://doi.org/10.1016/S1571-0653(05)80074-5},
doi = {10.1016/S1571-0653(05)80074-5},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/FinocchiP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/Gropp01,
author = {Harald Gropp},
title = {Nonsymmetric configurations with line sizek=4},
journal = {Electron. Notes Discret. Math.},
volume = {8},
pages = {42--45},
year = {2001},
url = {https://doi.org/10.1016/S1571-0653(05)80075-7},
doi = {10.1016/S1571-0653(05)80075-7},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/Gropp01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/IzhutkinS01,
author = {V. S. Izhutkin and
A. A. Sushenzov},
title = {Study of Methods of Nonlinear Optimization Using Computer Means},
journal = {Electron. Notes Discret. Math.},
volume = {8},
pages = {106--110},
year = {2001},
url = {https://doi.org/10.1016/S1571-0653(05)80093-9},
doi = {10.1016/S1571-0653(05)80093-9},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/IzhutkinS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/KaderaliS01,
author = {Lars Kaderali and
Alexander Schliep},
title = {A new Algorithm for Accelerating Pair-Wise Computations of Melting
Temperature},
journal = {Electron. Notes Discret. Math.},
volume = {8},
pages = {46--49},
year = {2001},
url = {https://doi.org/10.1016/S1571-0653(05)80076-9},
doi = {10.1016/S1571-0653(05)80076-9},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/KaderaliS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/Kloock01,
author = {M. Kloock},
title = {Factorization as a {SAT} problem},
journal = {Electron. Notes Discret. Math.},
volume = {8},
pages = {50--53},
year = {2001},
url = {https://doi.org/10.1016/S1571-0653(05)80077-0},
doi = {10.1016/S1571-0653(05)80077-0},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/Kloock01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/KosterBH01,
author = {Arie M. C. A. Koster and
Hans L. Bodlaender and
Stan P. M. van Hoesel},
title = {Treewidth: Computational Experiments},
journal = {Electron. Notes Discret. Math.},
volume = {8},
pages = {54--57},
year = {2001},
url = {https://doi.org/10.1016/S1571-0653(05)80078-2},
doi = {10.1016/S1571-0653(05)80078-2},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/endm/KosterBH01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/LiZB01,
author = {Xueliang Li and
Shenggui Zhang and
Hajo Broersma},
title = {Paths and Cycles in Colored Graphs},
journal = {Electron. Notes Discret. Math.},
volume = {8},
pages = {128--132},
year = {2001},
url = {https://doi.org/10.1016/S1571-0653(05)80098-8},
doi = {10.1016/S1571-0653(05)80098-8},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/endm/LiZB01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/Lozovanu01,
author = {Dmitrii Lozovanu},
title = {Discrete optimal control problems and dynamic games with p players},
journal = {Electron. Notes Discret. Math.},
volume = {8},
pages = {58--61},
year = {2001},
url = {https://doi.org/10.1016/S1571-0653(05)80079-4},
doi = {10.1016/S1571-0653(05)80079-4},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/Lozovanu01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/Malafiejski01,
author = {Michal Malafiejski},
title = {The complexity of the chromatic sum problem on cubic planar graphs
and regular graphs},
journal = {Electron. Notes Discret. Math.},
volume = {8},
pages = {62},
year = {2001},
url = {https://doi.org/10.1016/S1571-0653(05)80080-0},
doi = {10.1016/S1571-0653(05)80080-0},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/Malafiejski01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/Meloni01,
author = {Carlo Meloni},
title = {A linear algorithm for the Hamiltonian completion number of the line
graph of a cactus},
journal = {Electron. Notes Discret. Math.},
volume = {8},
pages = {26},
year = {2001},
url = {https://doi.org/10.1016/S1571-0653(05)80070-8},
doi = {10.1016/S1571-0653(05)80070-8},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/Meloni01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/MishraS01,
author = {Sounaka Mishra and
Kripasindhu Sikdar},
title = {On Approximability of Linear Ordering and Related NP-optimization
Problems on Graphs (Extended Abstract)},
journal = {Electron. Notes Discret. Math.},
volume = {8},
pages = {63--66},
year = {2001},
url = {https://doi.org/10.1016/S1571-0653(05)80081-2},
doi = {10.1016/S1571-0653(05)80081-2},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/MishraS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/MohamedT01,
author = {M. M. Ibrahim Mohamed and
B. Tawfik},
title = {A Prim-based Heuristic Algorithm for Obstacle Avoiding Rectilinear
Steiner Minimal Tree},
journal = {Electron. Notes Discret. Math.},
volume = {8},
pages = {102--105},
year = {2001},
url = {https://doi.org/10.1016/S1571-0653(05)80092-7},
doi = {10.1016/S1571-0653(05)80092-7},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/MohamedT01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/NiciilitsaVV01,
author = {Angela Niciilitsa and
Vitaly I. Voloshin and
Heinz{-}J{\"{u}}rgen Voss},
title = {Circular and uniquely colorable mixed hypergraphs},
journal = {Electron. Notes Discret. Math.},
volume = {8},
pages = {115--118},
year = {2001},
url = {https://doi.org/10.1016/S1571-0653(05)80095-2},
doi = {10.1016/S1571-0653(05)80095-2},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/NiciilitsaVV01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/Nikolopoulos01,
author = {Stavros D. Nikolopoulos},
title = {Hamiltonian Cycles in Quasi-threshold Graphs},
journal = {Electron. Notes Discret. Math.},
volume = {8},
pages = {67},
year = {2001},
url = {https://doi.org/10.1016/S1571-0653(05)80082-4},
doi = {10.1016/S1571-0653(05)80082-4},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/Nikolopoulos01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/Oriolo01,
author = {Gianpaolo Oriolo},
title = {Clique Covers in Claw-Free Berge Graphs},
journal = {Electron. Notes Discret. Math.},
volume = {8},
pages = {68--71},
year = {2001},
url = {https://doi.org/10.1016/S1571-0653(05)80083-6},
doi = {10.1016/S1571-0653(05)80083-6},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/Oriolo01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/Pickl01,
author = {Stefan Pickl},
title = {Combinatorial Structures of Max-Type Functions characterizing the
Optimal Solution of the Equivalence Problem},
journal = {Electron. Notes Discret. Math.},
volume = {8},
pages = {72--75},
year = {2001},
url = {https://doi.org/10.1016/S1571-0653(05)80084-8},
doi = {10.1016/S1571-0653(05)80084-8},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/Pickl01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/PopKSF01,
author = {Petrica C. Pop and
Walter Kern and
Georg Still and
Ulrich Faigle},
title = {Relaxation methods for the Generalized Minimum Spanning Tree Problem},
journal = {Electron. Notes Discret. Math.},
volume = {8},
pages = {76--79},
year = {2001},
url = {https://doi.org/10.1016/S1571-0653(05)80085-X},
doi = {10.1016/S1571-0653(05)80085-X},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/PopKSF01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/Porschen01,
author = {Stefan Porschen},
title = {On Covering Z-Grid Points by Rectangles},
journal = {Electron. Notes Discret. Math.},
volume = {8},
pages = {80--83},
year = {2001},
url = {https://doi.org/10.1016/S1571-0653(05)80086-1},
doi = {10.1016/S1571-0653(05)80086-1},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/Porschen01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/RanderathS01,
author = {Bert Randerath and
Ingo Schiermeyer},
title = {3-Colorability element oF {P} for p\({}_{\mbox{6}}\)-free Graphs},
journal = {Electron. Notes Discret. Math.},
volume = {8},
pages = {85--89},
year = {2001},
url = {https://doi.org/10.1016/S1571-0653(05)80088-5},
doi = {10.1016/S1571-0653(05)80088-5},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/RanderathS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/SantanaOS01,
author = {Roberto Santana and
Carlos Alberto Ochoa Ort{\'{\i}}z Zezzatti and
Marta Soto},
title = {On the use of Factorized Distribution Algorithms for problems defined
on graphs},
journal = {Electron. Notes Discret. Math.},
volume = {8},
pages = {84},
year = {2001},
url = {https://doi.org/10.1016/S1571-0653(05)80087-3},
doi = {10.1016/S1571-0653(05)80087-3},
timestamp = {Wed, 12 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/endm/SantanaOS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/SchreyerW01,
author = {Jens Schreyer and
Hansjoachim Walther},
title = {Edge-Oblique Polyhedral Graphs},
journal = {Electron. Notes Discret. Math.},
volume = {8},
pages = {90--93},
year = {2001},
url = {https://doi.org/10.1016/S1571-0653(05)80089-7},
doi = {10.1016/S1571-0653(05)80089-7},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/SchreyerW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/Skupien01,
author = {Zdzislaw Skupien},
title = {{BCH} codes are good for distance multicolorings with radio frequencies
in hypercubes asymptotically},
journal = {Electron. Notes Discret. Math.},
volume = {8},
pages = {94--97},
year = {2001},
url = {https://doi.org/10.1016/S1571-0653(05)80090-3},
doi = {10.1016/S1571-0653(05)80090-3},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/Skupien01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/VernetM01,
author = {Oswaldo Vernet and
Lilian Markenzon},
title = {Solving Problems for Maximal Reducible Flowgraphs},
journal = {Electron. Notes Discret. Math.},
volume = {8},
pages = {111--114},
year = {2001},
url = {https://doi.org/10.1016/S1571-0653(05)80094-0},
doi = {10.1016/S1571-0653(05)80094-0},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/VernetM01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/WangLZ01,
author = {Ligong Wang and
Xueliang Li and
Shenggui Zhang},
title = {Some New Families of Integral Trees with Diameters 4 and 6},
journal = {Electron. Notes Discret. Math.},
volume = {8},
pages = {119--123},
year = {2001},
url = {https://doi.org/10.1016/S1571-0653(05)80096-4},
doi = {10.1016/S1571-0653(05)80096-4},
timestamp = {Wed, 21 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/endm/WangLZ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/Weber01,
author = {Gerhard{-}Wilhelm Weber},
title = {Impulses from Results of Inverse Problems to Discrete Tomography},
journal = {Electron. Notes Discret. Math.},
volume = {8},
pages = {124--127},
year = {2001},
url = {https://doi.org/10.1016/S1571-0653(05)80097-6},
doi = {10.1016/S1571-0653(05)80097-6},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/Weber01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/ZmazekZ01,
author = {Blaz Zmazek and
Janez Zerovnik},
title = {The obnoxious center problem on weighted cactus graphs (Extended Abstract)},
journal = {Electron. Notes Discret. Math.},
volume = {8},
pages = {133--136},
year = {2001},
url = {https://doi.org/10.1016/S1571-0653(05)80099-X},
doi = {10.1016/S1571-0653(05)80099-X},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/ZmazekZ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
retrieved on 2024-05-31 03:46 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
