Alle Funktionen optimal nutzen: JETZT ANMELDEN

    A Triangle Process on Regular Graphs (Englisch)

    In: Combinatorial Algorithms ; 310-323 ; 2021

    Wie erhalte ich diesen Titel?

    Exportieren, teilen und zitieren

    Die Inhaltsverzeichnisse werden automatisch erzeugt und basieren auf den im Index des TIB-Portals verfügbaren Einzelnachweisen der enthaltenen Beiträge. Die Anzeige der Inhaltsverzeichnisse kann daher unvollständig oder lückenhaft sein.

    3
    Relaxed and Approximate Graph Realizations
    Bar-Noy, Amotz / Böhnlein, Toni / Peleg, David / Perry, Mor / Rawitz, Dror et al. | 2021
    20
    Search for Combinatorial Objects Using Lattice Aigorithms – Revisited
    Wassermann, Alfred et al. | 2021
    37
    Linear Algorithms for Red and Blue Domination in Convex Bipartite Graphs
    Abbas, Nesrine et al. | 2021
    49
    Combinatorics and Algorithms for Quasi-chain Graphs
    Alecu, Bogdan / Atminas, Aistis / Lozin, Vadim / Malyshev, Dmitriy et al. | 2021
    63
    Composed Degree-Distance Realizations of Graphs
    Bar-Noy, Amotz / Peleg, David / Perry, Mor / Rawitz, Dror et al. | 2021
    78
    All Subgraphs of a Wheel Are 5-Coupled-Choosable
    Barr, Sam / Biedl, Therese et al. | 2021
    92
    Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs
    Bhyravarapu, Sriram / Hartmann, Tim A. / Kalyanasundaram, Subrahmanyam / Reddy, I. Vinod et al. | 2021
    107
    Edge Exploration of Temporal Graphs
    Bumpus, Benjamin Merlin / Meeks, Kitty et al. | 2021
    122
    Optimal Monomial Quadratization for ODE Systems
    Bychkov, Andrey / Pogudin, Gleb et al. | 2021
    137
    A Hamilton Cycle in the k-Sided Pancake Network
    Cameron, B. / Sawada, J. / Williams, A. et al. | 2021
    152
    Algorithms and Complexity of s-Club Cluster Vertex Deletion
    Chakraborty, Dibyayan / Chandran, L. Sunil / Padinhatteeri, Sajith / Pillai, Raji R. et al. | 2021
    165
    Covering Convex Polygons by Two Congruent Disks
    Choi, Jongmin / Jeong, Dahye / Ahn, Hee-Kap et al. | 2021
    179
    The Tandem Duplication Distance Problem Is Hard over Bounded Alphabets
    Cicalese, Ferdinando / Pilati, Nicoló et al. | 2021
    194
    On the Oriented Coloring of the Disjoint Union of Graphs
    Coelho, Erika Morais Martins / Coelho, Hebert / Faria, Luerbio / Ferreira, Mateus de Paula / Gravier, Sylvain / Klein, Sulamita et al. | 2021
    208
    The Pony Express Communication Problem
    Coleman, Jared / Kranakis, Evangelos / Krizanc, Danny / Morales-Ponce, Oscar et al. | 2021
    223
    Skyline Groups Are Ideals. An Efficient Algorithm for Enumerating Skyline Groups
    Coumes, Simon / Bouadi, Tassadit / Nourine, Lhouari / Termier, Alexandre et al. | 2021
    237
    Vertex Cover at Distance on H-Free Graphs
    Dallard, Clément / Krbezlija, Mirza / Milanič, Martin et al. | 2021
    252
    On an Ordering Problem in Weighted Hypergraphs
    Damaschke, Peter et al. | 2021
    265
    An Efficient Noisy Binary Search in Graphs via Median Approximation
    Dereniowski, Dariusz / Łukasiewicz, Aleksander / Uznański, Przemysław et al. | 2021
    282
    A Study on the Existence of Null Labelling for 3-Hypergraphs
    Marco, Niccolò Di / Frosini, Andrea / Kocay, William Lawrence et al. | 2021
    295
    Piercing All Translates of a Set of Axis-Parallel Rectangles
    Dumitrescu, Adrian / Tkadlec, Josef et al. | 2021
    310
    A Triangle Process on Regular Graphs
    Cooper, Colin / Dyer, Martin / Greenhill, Catherine et al. | 2021
    324
    Complexity and Algorithms for MUL-Tree Pruning
    Gascon, Mathieu / Dondi, Riccardo / El-Mabrouk, Nadia et al. | 2021
    340
    Makespan Trade-Offs for Visiting Triangle Edges: (Extended Abstract)
    Georgiou, Konstantinos / Kundu, Somnath / Prałat, Paweł et al. | 2021
    356
    Augmenting a Tree to a k-Arbor-Connected Graph with Pagenumber k
    Hasunuma, Toru et al. | 2021
    370
    Approximation Algorithms for Hitting Subgraphs
    Brüstle, Noah / Elbaz, Tal / Hatami, Hamed / Kocer, Onur / Ma, Bingchan et al. | 2021
    385
    Isomorphic Unordered Labeled Trees up to Substitution Ciphering
    Ingels, Florian / Azaïs, Romain et al. | 2021
    400
    Intersecting Disks Using Two Congruent Disks
    Kang, Byeonguk / Choi, Jongmin / Ahn, Hee-Kap et al. | 2021
    414
    Disjoint Paths and Connected Subgraphs for H-Free Graphs
    Kern, Walter / Martin, Barnaby / Paulusma, Daniël / Smith, Siani / Leeuwen, Erik Jan van et al. | 2021
    428
    Prophet Secretary for k-Knapsack and l-Matroid Intersection via Continuous Exchange Property
    Kumabe, Soh / Maehara, Takanori et al. | 2021
    442
    Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters
    Kučera, Martin / Suchý, Ondřej et al. | 2021
    456
    Non-preemptive Tree Packing
    Lendl, Stefan / Woeginger, Gerhard / Wulf, Lasse et al. | 2021
    469
    Card-Based Cryptographic Protocols for Three-Input Functions Using Private Operations
    Manabe, Yoshifumi / Ono, Hibiki et al. | 2021
    485
    Königsberg Sightseeing: Eulerian Walks in Temporal Graphs
    Marino, Andrea / Silva, Ana et al. | 2021
    501
    Reconfiguring Simple s, t Hamiltonian Paths in Rectangular Grid Graphs
    Nishat, Rahnuma Islam / Srinivasan, Venkatesh / Whitesides, Sue et al. | 2021
    516
    New Approximations and Hardness Results for Submodular Partitioning Problems
    Santiago, Richard et al. | 2021
    531
    An FPT Algorithm for Matching Cut and d-Cut
    Aravind, N. R. / Saxena, Roopam et al. | 2021
    544
    Backtrack Search for Parallelisms of Projective Spaces
    Topalova, Svetlana / Zhelezova, Stela et al. | 2021
    558
    Approximating Multistage Matching Problems
    Chimani, Markus / Troost, Niklas / Wiedera, Tilo et al. | 2021
    571
    Heuristically Enhanced IPO Algorithms for Covering Array Generation
    Wagner, Michael / Kampel, Ludwig / Simos, Dimitris E. et al. | 2021

    Wie erhalte ich diesen Titel?

    Exportieren, teilen und zitieren

    Feedback