×

Found 269 Documents (Results 1–100)

Approximation algorithms for the directed path partition problems. (English) Zbl 1528.68280

Chen, Jing (ed.) et al., Frontiers of algorithmics. International joint conference, IJTCS-FAW 2021, Beijing, China, August 16–19, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12874, 23-36 (2022).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Algorithmic aspects of small quasi-kernels. (English) Zbl 07682423

Bekos, Michael A. (ed.) et al., Graph-theoretic concepts in computer science. 48th international workshop, WG 2022, Tübingen, Germany, June 22–24, 2022. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 13453, 370-382 (2022).
MSC:  68R10
PDFBibTeX XMLCite
Full Text: DOI arXiv

Parameterized complexity of weighted multicut in trees. (English) Zbl 07682415

Bekos, Michael A. (ed.) et al., Graph-theoretic concepts in computer science. 48th international workshop, WG 2022, Tübingen, Germany, June 22–24, 2022. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 13453, 257-270 (2022).
MSC:  68R10
PDFBibTeX XMLCite
Full Text: DOI arXiv

Twin-width is linear in the poset width. (English) Zbl 07803584

Golovach, Petr A. (ed.) et al., 16th international symposium on parameterized and exact computation, IPEC 2021, Lisbon, Portugal, September 8–10, 2021. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 214, Article 6, 13 p. (2021).
MSC:  68Q25 68Q27 68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Lexicographic product of digraphs and related boundary-type sets. (English) Zbl 07497534

Mudgal, Apurva (ed.) et al., Algorithms and discrete applied mathematics. 7th international conference, CALDAM 2021, Rupnagar, India, February 11–13, 2021. Proceedings. Lect. Notes Comput. Sci. 12601, 234-246 (2021).
PDFBibTeX XMLCite
Full Text: DOI

Skew-harmonic and skew-sum connectivity energy of some digraphs. (English) Zbl 1482.05210

Paikray, Susanta Kumar (ed.) et al., New trends in applied analysis and computational mathematics. Proceedings of the international conference on advances in mathematics and computing, ICAMC 2020, Odisha, India, February 7–8, 2020. Singapore: Springer. Adv. Intell. Syst. Comput. 1356, 287-300 (2021).
PDFBibTeX XMLCite
Full Text: DOI

Upward point set embeddings of paths and trees. (English) Zbl 07405965

Uehara, Ryuhei (ed.) et al., WALCOM: algorithms and computation. 15th international conference and workshops, WALCOM 15, Yangon, Myanmar, February 28 – March 2, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12635, 234-246 (2021).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

More glimpses of the RC4 internal state array. (English) Zbl 1492.94076

Bhargavan, Karthikeyan (ed.) et al., Progress in cryptology – INDOCRYPT 2020. 21st international conference on cryptology in India, Bangalore, India, December 13–16, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12578, 294-311 (2020).
MSC:  94A60 05C20
PDFBibTeX XMLCite
Full Text: DOI

Subset sum problems with special digraph constraints. (English) Zbl 1476.90281

Neufeld, Janis S. (ed.) et al., Operations research proceedings 2019. Selected papers of the annual international conference of the German Operations Research Society (GOR), Dresden, Germany, September 4–6, 2019. Cham: Springer. Oper. Res. Proc., 339-346 (2020).
MSC:  90C27
PDFBibTeX XMLCite
Full Text: DOI

Exact and approximate digraph bandwidth. (English) Zbl 07650315

Chattopadhyay, Arkadev (ed.) et al., 39th IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2019, Bombay, India, December 11–13, 2019. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 150, Article 18, 15 p. (2019).
MSC:  68N30 68Qxx
PDFBibTeX XMLCite
Full Text: DOI

A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs. (English) Zbl 1516.68069

Rossmanith, Peter (ed.) et al., 44th international symposium on mathematical foundations of computer science, MFCS 2019, Aachen, Germany, August 26–30, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 138, Article 28, 14 p. (2019).
PDFBibTeX XMLCite
Full Text: DOI

Linial’s conjecture for arc-spine digraphs. (English) Zbl 07515226

Coutinho, Gabriel (ed.) et al., Proceedings of LAGOS 2019, the tenth Latin and American algorithms, graphs and optimization symposium, Belo Horizonte, Brazil, June 2–7 2019. Amsterdam: Elsevier. Electron. Notes Theor. Comput. Sci. 346, 735-746 (2019).
MSC:  05Cxx 90Cxx
PDFBibTeX XMLCite
Full Text: DOI

On the complexity of finding internally vertex-disjoint long directed paths. (English) Zbl 1485.68171

Bender, Michael A. (ed.) et al., Latin 2018: theoretical informatics. 13th Latin American symposium, Buenos Aires, Argentina, April 16–19, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10807, 66-79 (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Directed path-width of sequence digraphs. (English) Zbl 1521.68099

Kim, Donghyun (ed.) et al., Combinatorial optimization and applications. 12th international conference, COCOA 2018, Atlanta, GA, USA, December 15–17, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11346, 79-93 (2018).
PDFBibTeX XMLCite
Full Text: DOI

Cut sparsifiers for balanced digraphs. (English) Zbl 1522.05164

Epstein, Leah (ed.) et al., Approximation and online algorithms. 16th international workshop, WAOA 2018, Helsinki, Finland, August 23–24, 2018. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 11312, 277-294 (2018).
PDFBibTeX XMLCite
Full Text: DOI

Dyck-Eulerian digraphs. (English) Zbl 1397.05094

Garijo, Delia (ed.) et al., Discrete mathematics days 2018. Extended abstracts of the 11th “Jornadas de matemática discreta y algorítmica” (JMDA), Sevilla, Spain, June 27–29, 2018. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 68, 239-244 (2018).
MSC:  05C45 05C20 68R15
PDFBibTeX XMLCite
Full Text: DOI

On the power domination number of de Bruijn and Kautz digraphs. (English) Zbl 1508.05126

Brankovic, Ljiljana (ed.) et al., Combinatorial algorithms. 28th international workshop, IWOCA 2017, Newcastle, NSW, Australia, July 17–21, 2017. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 10765, 264-272 (2018).
MSC:  05C69 05C20
PDFBibTeX XMLCite
Full Text: DOI arXiv

Settlement fund circulation problem. (English) Zbl 1457.91264

Okamoto, Yoshio (ed.) et al., 28th international symposium on algorithms and computation, ISAAC 2017, December 9–12, 2017, Phuket, Thailand. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 92, Article 46, 13 p. (2017).
PDFBibTeX XMLCite
Full Text: DOI

An IP algorithm for RNA folding trajectories. (English) Zbl 1443.92135

Schwartz, Russell (ed.) et al., 17th international workshop on algorithms in bioinformatics, WABI 2017, Boston, MA, USA, August 21–23, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 88, Article 6, 16 p. (2017).
MSC:  92D20 90C10 92-04
PDFBibTeX XMLCite
Full Text: DOI

Exploring the complexity of layout parameters in tournaments and semi-complete digraphs. (English) Zbl 1441.68161

Chatzigiannakis, Ioannis (ed.) et al., 44th international colloquium on automata, languages, and programming, ICALP 2017, Warsaw, Poland July 10–14, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 80, Article 70, 13 p. (2017).
PDFBibTeX XMLCite
Full Text: DOI

Attainable values of reset thresholds. (English) Zbl 1441.68123

Larsen, Kim G. (ed.) et al., 42nd international symposium on mathematical foundations of computer science, MFCS 2017, August 21–25, 2017, Aalborg, Denmark. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 83, Article 40, 14 p. (2017).
MSC:  68Q45
PDFBibTeX XMLCite
Full Text: DOI

Expansion of digraph size of 1-D fractional system with delay. (English) Zbl 1422.05047

Babiarz, Artur (ed.) et al., Theory and applications of non-integer order systems. Papers of the 8th conference on non-integer order calculus and its applications, Zakopane, Poland, September 20–21, 2016. Cham: Springer. Lect. Notes Electr. Eng. 407, 467-476 (2017).
MSC:  05C20 05C31
PDFBibTeX XMLCite
Full Text: DOI

Bounds on directed star arboricity in some digraph classes. (English) Zbl 1383.05137

Bassino, Frédérique (ed.) et al., LAGOS 2017. Selected papers of the 9th Latin-American algorithms, graphs, and optimization symposium, Marseille, France, September 11–15, 2017. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 62, 267-272 (2017).
MSC:  05C20 05C75
PDFBibTeX XMLCite
Full Text: DOI

\(k\)-quasi-transitive digraphs of large diameter. (English) Zbl 1383.05132

Bassino, Frédérique (ed.) et al., LAGOS 2017. Selected papers of the 9th Latin-American algorithms, graphs, and optimization symposium, Marseille, France, September 11–15, 2017. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 62, 213-218 (2017).
MSC:  05C20 05C45 05C38
PDFBibTeX XMLCite
Full Text: DOI

Bispindle in strongly connected digraphs with large chromatic number. (English) Zbl 1383.05128

Bassino, Frédérique (ed.) et al., LAGOS 2017. Selected papers of the 9th Latin-American algorithms, graphs, and optimization symposium, Marseille, France, September 11–15, 2017. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 62, 69-74 (2017).
MSC:  05C20 05C40 05C15
PDFBibTeX XMLCite
Full Text: DOI arXiv Link

Packing arborescences in random digraphs. (English) Zbl 1379.05101

Drmota, Michael (ed.) et al., Extended abstracts of the ninth European conference on combinatorics, graph theory and applications, EuroComb 2017, Vienna, Austria, August 28 – September 1, 2017. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 61, 615-621 (2017).
MSC:  05C80 05C20 05C05
PDFBibTeX XMLCite
Full Text: DOI arXiv

Coloring dense digraphs. (English) Zbl 1379.05035

Drmota, Michael (ed.) et al., Extended abstracts of the ninth European conference on combinatorics, graph theory and applications, EuroComb 2017, Vienna, Austria, August 28 – September 1, 2017. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 61, 577-583 (2017).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Evenly partite directed bigraph factorization of wreath product of graphs. (English) Zbl 1496.05144

Arumugam, S. (ed.) et al., Theoretical computer science and discrete mathematics. First international conference, ICTCSDM 2016, Krishnankoil, India, December 19–21, 2016. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 10398, 83-89 (2017).
MSC:  05C70 05C76 05C20
PDFBibTeX XMLCite
Full Text: DOI

Some families of graphs, hypergraphs and digraphs defined by systems of equations: a survey. (English) Zbl 1373.05094

Labbate, Domenico (ed.), Selected topics in graph theory and its applications. Potenza: Seminario Interdisciplinare di Matematica (S.I.M.) (ISBN 978-88-97478-19-5/pbk). Lecture Notes of Seminario Interdisciplinare di Matematica 14, 105-142 (2017).
PDFBibTeX XMLCite

Diclique clustering in a directed random graph. (English) Zbl 1398.68388

Bonato, Anthony (ed.) et al., Algorithms and models for the web graph. 13th international workshop, WAW 2016, Montreal, QC, Canada, December 14–15, 2016. Proceedings. Cham: Springer (ISBN 978-3-319-49786-0/pbk; 978-3-319-49787-7/ebook). Lecture Notes in Computer Science 10088, 22-33 (2016).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Transformations of digraphs viewed as intersection digraphs. (English) Zbl 1369.05095

Adiprasito, Karim (ed.) et al., Convexity and discrete geometry including graph theory. Mulhouse, France, September 1–11, 2014. Cham: Springer (ISBN 978-3-319-28184-1/hbk; 978-3-319-28186-5/ebook). Springer Proceedings in Mathematics & Statistics 148, 27-35 (2016).
MSC:  05C20 05C76
PDFBibTeX XMLCite
Full Text: DOI

A geometric approach to dense Cayley digraphs of finite abelian groups. (English) Zbl 1356.05068

de Mier, Anna (ed.) et al., Discrete mathematical days. Extended abstracts of the 10th “Jornadas de matemática discreta y algorítmica” (JMDA), Barcelona, Spain, July 6–8, 2016. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 54, 277-282 (2016).
PDFBibTeX XMLCite
Full Text: DOI Link

Černý conjecture for edge-colored digraphs with few junctions. (English) Zbl 1356.05051

de Mier, Anna (ed.) et al., Discrete mathematical days. Extended abstracts of the 10th “Jornadas de matemática discreta y algorítmica” (JMDA), Barcelona, Spain, July 6–8, 2016. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 54, 115-120 (2016).
MSC:  05C15 05C20 68Q45
PDFBibTeX XMLCite
Full Text: DOI

Diameter of some monomial digraphs. (English) Zbl 1354.05060

Canteaut, Anne (ed.) et al., Contemporary developments in finite fields and applications. Based on the presentations at the 12th international conference on finite fields and their applications (Fq12), Saratoga Springs, NY, July 13–17, 2015. Hackensack, NJ: World Scientific (ISBN 978-981-4719-25-4/hbk; 978-981-4719-27-8/ebook). 160-177 (2016).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Dichromatic polynomial of product digraphs. (English) Zbl 1347.05164

Hinz, Andreas (ed.) et al., Proceedings of the international conference on graph theory and its applications (ICGTA-15), Coimbatore, India, December 16–19, 2015. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 53, 165-172, electronic only (2016).
MSC:  05C76 05C20 05C15
PDFBibTeX XMLCite
Full Text: DOI

Further results on graceful directed graphs. (English) Zbl 1347.05187

Hinz, Andreas (ed.) et al., Proceedings of the international conference on graph theory and its applications (ICGTA-15), Coimbatore, India, December 16–19, 2015. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 53, 149-154, electronic only (2016).
MSC:  05C78 05C20 05C10
PDFBibTeX XMLCite
Full Text: DOI

Parameterized algorithms for MIN-MAX multiway cut and List digraph homomorphism. (English) Zbl 1378.68084

Husfeldt, Thore (ed.) et al., 10th international symposium on parameterized and exact computation, IPEC 2015, Patras, Greece, September 16–18, 2015. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-92-7). LIPIcs – Leibniz International Proceedings in Informatics 43, 78-89 (2015).
MSC:  68Q25 05C85 68R10
PDFBibTeX XMLCite
Full Text: DOI arXiv

Sparse semi-magic squares and magic labelings of directed graphs. (English) Zbl 1347.05206

Arumugam, S. (ed.) et al., Proceedings of the 8th international workshop on graph labelings (IWOGL 2014), Krishnankoil, Tamil Nadu, India, December 3–6, 2014. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 48, 3-10, electronic only (2015).
MSC:  05C78 05C20 05B15
PDFBibTeX XMLCite
Full Text: DOI

Graph saturation games. (English) Zbl 1347.05121

Campêlo, Manoel (ed.) et al., LAGOS ’15. Selected papers of the 8th Latin-American algorithms, graphs, and optimization symposium, Praia das Fontes, Beberibe, Brazil, May 11–15, 2015. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 50, 349-354, electronic only (2015).
PDFBibTeX XMLCite
Full Text: DOI

Chronological rectangle digraphs. (English) Zbl 1347.05084

Campêlo, Manoel (ed.) et al., LAGOS ’15. Selected papers of the 8th Latin-American algorithms, graphs, and optimization symposium, Praia das Fontes, Beberibe, Brazil, May 11–15, 2015. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 50, 157-162, electronic only (2015).
MSC:  05C20
PDFBibTeX XMLCite
Full Text: DOI Link

Cycles and matchings in randomly perturbed digraphs and hypergraphs. (English) Zbl 1346.05095

Nešetril, Jaroslav (ed.) et al., Extended abstracts of the eight European conference on combinatorics, graph theory and applications, EuroComb 2015, Bergen, Norway, August 31 – September 4, 2015. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 49, 181-187, electronic only (2015).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Mixed Moore Cayley graphs. (English) Zbl 1337.05031

Rodríguez Velázques, Juan Alberto (ed.) et al., Extended abstracts of the IX “Jornadas de matemática discreta y algorítmica” (JMDA), Tarragona, Spain, July 7–9, 2014. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 46, 193-200, electronic only (2014).
MSC:  05C12 05C20
PDFBibTeX XMLCite
Full Text: DOI

Computing cutwidth and pathwidth of semi-complete digraphs via degree orderings. (English) Zbl 1354.68302

Portier, Natacha (ed.) et al., 30th international symposium on theoretical aspects of computer science, STACS’ 13, Kiel, Germany, February 27 – March 2, 2013. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-50-7). LIPIcs – Leibniz International Proceedings in Informatics 20, 197-208 (2013).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Subgraphs satisfying MSO properties on \(z\)-topologically orderable digraphs. (English) Zbl 1406.68048

Gutin, Gregory (ed.) et al., Parameterized and exact computation. 8th international symposium, IPEC 2013, Sophia Antipolis, France, September 4–6, 2013. Revised selected papers. Berlin: Springer (ISBN 978-3-319-03897-1/pbk). Lecture Notes in Computer Science 8246, 123-136 (2013).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Random walks on some basic classes of digraphs. (English) Zbl 1405.68136

Liu, Zhiming (ed.) et al., Theoretical aspects of computing – ICTAC 2013. 10th international colloquium, Shanghai, China, September 4–6, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-39717-2/pbk). Lecture Notes in Computer Science 8049, 122-140 (2013).
PDFBibTeX XMLCite
Full Text: DOI

Best response digraphs for two location games on graphs. (English) Zbl 1229.91086

Petrosyan, Leon A. (ed.) et al., Contributions to game theory and management. Vol. IV. The 4th international conference game theory and management (GTM 2010), June 28–30, 2010, St. Petersburg, Russia. Collected papers. St. Petersburg: Graduate School of Management, St. Petersburg University (ISBN 978-5-9924-0069-4/pbk). 378-388 (2011).
MSC:  91A43 91A05
PDFBibTeX XMLCite

Hardness of finding two edge-disjoint Min-Min paths in digraphs. (English) Zbl 1329.68124

Atallah, Mikhail (ed.) et al., Frontiers in algorithmics and algorithmic aspects in information and management. Joint international conference, FAW-AAIM 2011, Jinhua, China, May 28–31, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21203-1/pbk). Lecture Notes in Computer Science 6681, 300-307 (2011).
PDFBibTeX XMLCite
Full Text: DOI

Well-quasi-ordering hereditarily finite sets. (English) Zbl 1333.03111

Dediu, Adrian-Horia (ed.) et al., Language and automata theory and applications. 5th international conference, LATA 2011, Tarragona, Spain, May 26–31, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21253-6/pbk). Lecture Notes in Computer Science 6638, 440-451 (2011).
MSC:  03E05 05C20
PDFBibTeX XMLCite
Full Text: DOI

An algebraic analogue of a formula of Knuth. (English. French summary) Zbl 1374.05115

Proceedings of the 22nd annual international conference on formal power series and algebraic combinatorics, FPSAC 2010, San Francisco, USA, August 2–6, 2010. Nancy: The Association. Discrete Mathematics & Theoretical Computer Science (DMTCS). Discrete Mathematics and Theoretical Computer Science. Proceedings, 379-390 (2010).
MSC:  05C25 05C50
PDFBibTeX XMLCite
Full Text: Link

Strong orientations of planar graphs with bounded stretch factor. (English) Zbl 1284.68469

Patt-Shamir, Boaz (ed.) et al., Structural information and communication complexity. 17th international colloquium, SIROCCO 2010, Şirince, Turkey, June 7–11, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13283-4/pbk). Lecture Notes in Computer Science 6058, 224-236 (2010).
MSC:  68R10 05C10 05C20
PDFBibTeX XMLCite
Full Text: DOI

Injective oriented colourings. (English) Zbl 1273.05074

Paul, Christophe (ed.) et al., Graph-theoretic concepts in computer science. 35th international workshop, WG 2009, Montpellier, France, June 24–26, 2009. Revised papers. Berlin: Springer (ISBN 978-3-642-11408-3/pbk). Lecture Notes in Computer Science 5911, 262-272 (2010).
MSC:  05C15 68Q25
PDFBibTeX XMLCite
Full Text: DOI

Factorization and catenary degree in 3-generated numerical semigroups. (English) Zbl 1273.05082

Nešetřil, Jaroslav (ed.) et al., Extended abstracts of the 5th European conference on combinatorics, graph theory and applications, EuroComb’09, Bordeaux, France, September 7–11, 2009. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 34, 157-161 (2009).
MSC:  05C20 05C70 05C85
PDFBibTeX XMLCite
Full Text: DOI

A classification of arc-locally semicomplete digraphs. (English) Zbl 1272.05063

Nešetřil, Jaroslav (ed.) et al., Extended abstracts of the 5th European conference on combinatorics, graph theory and applications, EuroComb’09, Bordeaux, France, September 7–11, 2009. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 34, 59-61 (2009).
MSC:  05C20
PDFBibTeX XMLCite
Full Text: DOI

Discrete potential theory for iterated maps of the interval. (English) Zbl 1185.37098

Elaydi, Saber (ed.) et al., Advances in discrete dynamical systems. Proceedings of the 11th international conference on difference equations and applications (ICDEA 06), Kyoto, Japan, July 24–28, 2006. Tokyo: Mathematical Society of Japan (ISBN 978-4-931469-49-5/hbk). Advanced Studies in Pure Mathematics 53, 121-128 (2009).
MSC:  37E05 31C20
PDFBibTeX XMLCite

Crossing-optimal acyclic HP-completion for outerplanar \(st\)-digraphs. (English) Zbl 1248.05204

Ngo, Hung Q. (ed.), Computing and combinatorics. 15th annual international conference, COCOON 2009, Niagara Falls, NY, USA, July 13–15, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02881-6/pbk). Lecture Notes in Computer Science 5609, 76-85 (2009).
MSC:  05C85 05C10 05C20
PDFBibTeX XMLCite
Full Text: DOI

Groups and designs. (English) Zbl 1202.05013

Koolen, Jack (ed.) et al., Applications of group theory to combinatorics. Selected papers from the Com\(^2\)MaC conference, Pohang, Korea, July 9–12, 2007. Boca Raton, FL: CRC Press (ISBN 978-0-415-47184-8/hbk). 133-146 (2008).
MSC:  05B05 20B25
PDFBibTeX XMLCite

Automorphism groups of Cayley digraphs. (English) Zbl 1202.05060

Koolen, Jack (ed.) et al., Applications of group theory to combinatorics. Selected papers from the Com\(^2\)MaC conference, Pohang, Korea, July 9–12, 2007. Boca Raton, FL: CRC Press (ISBN 978-0-415-47184-8/hbk). 13-25 (2008).
MSC:  05C25 05C20 20B25
PDFBibTeX XMLCite

On the algorithmic effectiveness of digraph decompositions and complexity measures. (English) Zbl 1183.68312

Hong, Seok-Hee (ed.) et al., Algorithms and computation. 19th international symposium, ISAAC 2008, Gold Coast, Australia, December 15–17, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-92181-3/pbk). Lecture Notes in Computer Science 5369, 220-231 (2008).
PDFBibTeX XMLCite
Full Text: DOI

On the complexity of feedback set problems in signed digraphs. (English) Zbl 1341.05112

Liebling, Th. (ed.) et al., The IV Latin-American algorithms, graphs, and optimization symposium, Puerto Varas, Chile, November 25–29, 2007. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 30, 249-254 (2008).
MSC:  05C22 05C20 68Q17
PDFBibTeX XMLCite
Full Text: DOI

Minimum cost homomorphisms to reflexive digraphs. (English) Zbl 1136.68462

Laber, Eduardo Sany (ed.) et al., LATIN 2008: Theoretical informatics. 8th Latin American symposium, Búzios, Brazil, April 7–11, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-78772-3/pbk). Lecture Notes in Computer Science 4957, 182-193 (2008).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Codes and adjustment in digraphs of root simplexes of real polynomials. (Russian. English summary) Zbl 1299.93095

Pinus, A.G. (ed.) et al., Algebra and model theory 6. Collection of papers from the 7th summer school “Frontiers in model theory and universal algebra”, Erlogol, Russia, June 26–30, 2007. Novosibirsk: Novosibirsk State Technical University (ISBN 978-5-7782-0849-0). 7-15 (2007).
PDFBibTeX XMLCite

Triple-loop-networks with multiple minimum distance diagrams. (Spanish) Zbl 1210.90129

Camacho Moreno, José Carlos (ed.) et al., Avances en matemática discreta en Andalucía. Cádiz: Servicio de Publicaciones, Universidad de Cádiz (ISBN 978-84-9828-133-0/pbk). 223-230 (2007).
PDFBibTeX XMLCite

Kernels by monocromatic paths in 3-quasitransitive digraphs. (Núcleos por trayectorias monocromáticas en digráficas 3-quasitransitivas.) (Spanish) Zbl 1193.05077

Camacho Moreno, José Carlos (ed.) et al., Avances en matemática discreta en Andalucía. Cádiz: Servicio de Publicaciones, Universidad de Cádiz (ISBN 978-84-9828-133-0/pbk). 97-103 (2007).
MSC:  05C15 05C20
PDFBibTeX XMLCite

Minimum-path diagram in double-loop digraphs. (Diagrama de caminos mínimos en digrafos de doble lazo.) (Spanish) Zbl 1298.05139

Camacho Moreno, José Carlos (ed.) et al., Avances en matemática discreta en Andalucía. Cádiz: Servicio de Publicaciones, Universidad de Cádiz (ISBN 978-84-9828-133-0/pbk). 25-31 (2007).
MSC:  05C20 05C12 05C38
PDFBibTeX XMLCite

NP by means of lifts and shadows. (English) Zbl 1147.68534

Kučera, Luděk (ed.) et al., Mathematical foundations of computer science 2007. 32nd international symposium, MFCS 2007, Český Krumlov, Czech Republic, August 26–31, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-74455-9/pbk). Lecture Notes in Computer Science 4708, 171-181 (2007).
MSC:  68Q25 90C27
PDFBibTeX XMLCite
Full Text: DOI

The multidimensional Manhattan network. (English) Zbl 1341.05099

Márquez, Alberto (ed.) et al., Proceedings of the 4th European conference on combinatorics, graph theory and applications, EuroComb’07, Seville, Spain, September 11–15, 2007. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 29, 383-387 (2007).
MSC:  05C20 05C25 05C82
PDFBibTeX XMLCite
Full Text: DOI

A spectral study of the Manhattan networks. (English) Zbl 1341.05151

Márquez, Alberto (ed.) et al., Proceedings of the 4th European conference on combinatorics, graph theory and applications, EuroComb’07, Seville, Spain, September 11–15, 2007. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 29, 267-271 (2007).
PDFBibTeX XMLCite
Full Text: DOI

Sets of gaps in sequences of Frobenius’ problems with 3 elements. (English) Zbl 1341.05096

Márquez, Alberto (ed.) et al., Proceedings of the 4th European conference on combinatorics, graph theory and applications, EuroComb’07, Seville, Spain, September 11–15, 2007. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 29, 231-236 (2007).
MSC:  05C20
PDFBibTeX XMLCite
Full Text: DOI

Normal Cayley digraphs on minimal non-Abelian groups. (English) Zbl 1341.05115

Márquez, Alberto (ed.) et al., Proceedings of the 4th European conference on combinatorics, graph theory and applications, EuroComb’07, Seville, Spain, September 11–15, 2007. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 29, 123-127 (2007).
MSC:  05C25 05C20 20B25
PDFBibTeX XMLCite
Full Text: DOI

Kernel perfect and critical kernel imperfect digraphs structure. (English) Zbl 1293.05133

Hliněný, Petr (ed.) et al., 6th Czech-Slovak international symposium on combinatorics, graph theory, algorithms and applications, DIMATIA Center, Charles University, Prague, Czech Republic, July 10–16, 2006. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 28, 401-408 (2007).
MSC:  05C20
PDFBibTeX XMLCite
Full Text: DOI Link

Infinite families of \((n+1)\)-dichromatic vertex critical circulant tournaments. (English) Zbl 1291.05078

Hliněný, Petr (ed.) et al., 6th Czech-Slovak international symposium on combinatorics, graph theory, algorithms and applications, DIMATIA Center, Charles University, Prague, Czech Republic, July 10–16, 2006. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 28, 141-144 (2007).
MSC:  05C20 05C15
PDFBibTeX XMLCite
Full Text: DOI

Some contributions to the Frobenius’ problem. (English) Zbl 1293.05130

Hliněný, Petr (ed.) et al., 6th Czech-Slovak international symposium on combinatorics, graph theory, algorithms and applications, DIMATIA Center, Charles University, Prague, Czech Republic, July 10–16, 2006. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 28, 61-68 (2007).
MSC:  05C20 05C12
PDFBibTeX XMLCite
Full Text: DOI

Two proofs of Bermond-Thomassen conjecture for regular tournaments. (English) Zbl 1291.05079

Hliněný, Petr (ed.) et al., 6th Czech-Slovak international symposium on combinatorics, graph theory, algorithms and applications, DIMATIA Center, Charles University, Prague, Czech Republic, July 10–16, 2006. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 28, 47-53 (2007).
MSC:  05C20 05C38 05C35
PDFBibTeX XMLCite
Full Text: DOI

Kernels in orientations of pretransitive orientable graphs. (English) Zbl 1115.05041

Bondy, Adrian (ed.) et al., Graph theory in Paris. Proceedings of a conference, GT04, in memory of Claude Berge, Paris, France, July 2004. Basel: Birkhäuser (ISBN 3-7643-7228-1/hbk). Trends in Mathematics, 197-208 (2007).
MSC:  05C20
PDFBibTeX XMLCite

Robust correspondence recognition for computer vision. (English) Zbl 1437.62042

Rizzi, Alfredo (ed.) et al., COMPSTAT. Proceedings in computational statistics. 17th symposium held in Rome, Italy, August 28 – September 1, 2006. With CD-Rom. Heidelberg: Physica-Verlag. 119-131 (2006).
MSC:  62-08 62H25
PDFBibTeX XMLCite
Full Text: DOI

On the behaviour of sequences of iterated eccentric digraphs. (English) Zbl 1167.05320

Martínez Moro, Edgar (ed.), V jornadas de matemática discreta y algorítmica. Valladolid: Universidade de Valladolid, Secretariado de Publicaciones e Intercambio Editorial (ISBN 978-84-8448-380-9/pbk). Ciencias (Valladolid) 23, 303-310 (2006).
MSC:  05C20
PDFBibTeX XMLCite

On the existence of almost Moore digraphs of diameter three. (English) Zbl 1183.05030

Martínez Moro, Edgar (ed.), V jornadas de matemática discreta y algorítmica. Valladolid: Universidade de Valladolid, Secretariado de Publicaciones e Intercambio Editorial (ISBN 978-84-8448-380-9/pbk). Ciencias (Valladolid) 23, 255-262 (2006).
MSC:  05C20
PDFBibTeX XMLCite

Twinless strongly connected components. (English) Zbl 1113.90164

Alt, Frank B. (ed.) et al., Perspectives in operations research. Papers in honor of Saul Gass’ 80th birthday. Papers partly based on the presentations at the symposium “Operations research in the 21st Century. New York, NY: Springer (ISBN 0-387-39933-X/hbk). Operations Research/Computer Science Interfaces Series 36, 285-304 (2006).
MSC:  90C35
PDFBibTeX XMLCite

Additional results on the reachability index of positive 2-D systems. (English) Zbl 1132.93004

Commault, Christian (ed.) et al., Positive systems. Proceedings of the second multidisciplinary international symposium on positive systems: Theory and applications (POSTA 06), Grenoble, France, August 30 – September 1, 2006. Berlin: Springer (ISBN 3-540-34771-2/pbk). Lecture Notes in Control and Information Sciences 341, 73-80 (2006).
MSC:  93B03 15B48
PDFBibTeX XMLCite

Profinite graphs – comparing notions. (English) Zbl 1100.05026

Giambruno, Antonio (ed.) et al., Groups, rings and group rings. Proceedings of the conference, Ubatuba, Brazil, July 26–31, 2004. In honor of the 60th birthday of Prof. César Polcino Milies. Boca Raton, FL: Chapman & Hall/CRC (ISBN 1-58488-581-5/pbk). Lecture Notes in Pure and Applied Mathematics 248, 33-41 (2006).
PDFBibTeX XMLCite

Semikernels modulo F in digraphs. (English) Zbl 1192.05062

Felsner, Stefan (ed.), 2005 European conference on combinatorics, graph theory and applications (EuroComb ’05). Extended abstracts from the conference, Technische Universität Berlin, Berlin, Germany, September 5–9, 2005. Paris: Maison de l’Informatique et des Mathématiques Discrètes (MIMD). Discrete Mathematics & Theoretical Computer Science. Proceedings. AE, 257-262, electronic only (2005).
MSC:  05C20 05C69
PDFBibTeX XMLCite
Full Text: Link

Supermodularity on chains and complexity of maximum constraint satisfaction. (English) Zbl 1192.68352

Felsner, Stefan (ed.), 2005 European conference on combinatorics, graph theory and applications (EuroComb ’05). Extended abstracts from the conference, Technische Universität Berlin, Berlin, Germany, September 5–9, 2005. Paris: Maison de l’Informatique et des Mathématiques Discrètes (MIMD). Discrete Mathematics & Theoretical Computer Science. Proceedings. AE, 51-56, electronic only (2005).
MSC:  68Q25 90C27
PDFBibTeX XMLCite
Full Text: Link

New sufficient conditions for the existence of kernels in digraphs. (English) Zbl 1200.05092

Raspaud, André (ed.) et al., 7th international colloquium on graph theory, Hyeres, France, September 12–16, 2005. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 22, 287-290 (2005).
MSC:  05C20
PDFBibTeX XMLCite
Full Text: DOI

On gradient flows in global optimization (Extended abstract). (English) Zbl 1133.90379

Zadnik Stirn, Lidija (ed.) et al., SOR ’05 proceedings. The 8th international symposium on operational research in Slovenia, Nova Gorica, Slovenia, September 28–30, 2005. Ljubljana: Slovenian Society Informatika (SDI), Section for Operational Research (SOR) (ISBN 961-6165-20-8/pbk). 11-12 (2005).
MSC:  90C26
PDFBibTeX XMLCite

On the combinatorial aspects of max-algebra. (English) Zbl 1086.15015

Litvinov, G. L. (ed.) et al., Idempotent mathematics and mathematical physics. Proceedings of the international workshop, Vienna, Austria, February 3–10, 2003. Providence, RI: American Mathematical Society (AMS) (ISBN 0-8218-3538-6/pbk). Contemporary Mathematics 377, 93-103 (2005).
PDFBibTeX XMLCite

Cycles: vertex pancyclic in-tournaments. (English) Zbl 1089.05029

Fischermann, Miranca (ed.) et al., First Aachener day on graph theory on the occasion of the 60th birthday of Professor Dr. Lutz Volkmann, RWTH Aachen University, Aachen, Germany, January 9th, 2004. Abstracts of talks. Aachen: RWTH Aachen, Lehrstuhl II für Mathematik. 77-85 (2004).
MSC:  05C20 05C38 05C35
PDFBibTeX XMLCite

Almost regular multipartite tournaments. (English) Zbl 1075.05043

Fischermann, Miranca (ed.) et al., First Aachener day on graph theory on the occasion of the 60th birthday of Professor Dr. Lutz Volkmann, RWTH Aachen University, Aachen, Germany, January 9th, 2004. Abstracts of talks. Aachen: RWTH Aachen, Lehrstuhl II für Mathematik. 41-46 (2004).
MSC:  05C20 05C38
PDFBibTeX XMLCite

Filter Results by …

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field