![]() (∆−1)-dicolouring of digraphs abstract : Abstracts sciencesconf.org:jga-2025:673354 |
![]() Adaptive sparsification of linear programs: new results for mixed packing and covering problems abstract : Abstracts sciencesconf.org:jga-2025:673445 |
![]() Algorithms and Hardness for Geodetic Set on Tree-like Digraphs abstract : Abstracts sciencesconf.org:jga-2025:673475 |
![]() Antimagie des graphes avec une clique dominante abstract : Abstracts sciencesconf.org:jga-2025:673464 |
![]() Arbres couvrants complètement indépendants dans les graphes scindés abstract : Abstracts sciencesconf.org:jga-2025:673094 |
![]() Augmentation fortemment connexe planaire abstract : Abstracts sciencesconf.org:jga-2025:673913 |
![]() Chromatic discrepancy of locally s-colourable graphs abstract : Abstracts sciencesconf.org:jga-2025:669811 |
![]() Colorations centrées dans les classes de graphes closes par mineur abstract : Abstracts sciencesconf.org:jga-2025:670263 |
![]() Coloring claw-free graphs of bounded codegree abstract : Abstracts sciencesconf.org:jga-2025:672314 |
![]() Complexity Classification of Coloring Problems with Parity Constraints abstract : Abstracts sciencesconf.org:jga-2025:673438 |
![]() Constrained acyclic orientations of grids abstract : Abstracts sciencesconf.org:jga-2025:673529 |
![]() Contraction perfect graphs and co-$k$-plex polytopes abstract : Abstracts sciencesconf.org:jga-2025:673111 |
![]() Cycle Counting under Local Differential Privacy for Degeneracy-bounded Graphs abstract : Abstracts sciencesconf.org:jga-2025:673196 |
![]() Des 2-clubs maximums abstract : Abstracts sciencesconf.org:jga-2025:672721 |
![]() Determining a graph from its reconfiguration graph abstract : Abstracts sciencesconf.org:jga-2025:672994 |
![]() Dr abstract : Abstracts sciencesconf.org:jga-2025:673046 |
![]() Enumerating Minimal Dominating Sets and Variants in Chordal Bipartite Graphs abstract : Abstracts sciencesconf.org:jga-2025:671720 |
![]() Extending Ghouila-Houri's Characterization of Comparability Graphs to Temporal Graphs abstract : Abstracts sciencesconf.org:jga-2025:673108 |
![]() Feedback vertex sets dans les graphes planaires orientés abstract : Abstracts sciencesconf.org:jga-2025:673118 |
![]() Graph Irregularity via Edge Deletions abstract : Abstracts sciencesconf.org:jga-2025:671647 |
![]() Growing binary trees abstract : Abstracts sciencesconf.org:jga-2025:671601 |
![]() Induced Disjoint Paths Without an Induced Minor abstract : Abstracts sciencesconf.org:jga-2025:672801 |
![]() Linear kernel for independent set reconfiguration in graphs of bounded pathwidth abstract : Abstracts sciencesconf.org:jga-2025:673513 |
![]() Local vs. Global Behavior in Bounded-Degree Hypergraphs: A Property Testing Perspective abstract : Abstracts sciencesconf.org:jga-2025:673494 |
![]() Lollipops, dense cycles and chords abstract : Abstracts sciencesconf.org:jga-2025:673190 |
![]() Making Graphs Irregular through IrregularisingWalks abstract : Abstracts sciencesconf.org:jga-2025:672945 |
![]() Matching Cut Variants in H-free Graphs abstract : Abstracts sciencesconf.org:jga-2025:673165 |
![]() Nowhere-zero flows in signed graphs abstract : Abstracts sciencesconf.org:jga-2025:672934 |
![]() Oblivious reductions abstract : Abstracts sciencesconf.org:jga-2025:672816 |
![]() On Modular Edge Colourings of Graphs abstract : Abstracts sciencesconf.org:jga-2025:673417 |
![]() On sufficient conditions for short journeys in temporal graphs. abstract : Abstracts sciencesconf.org:jga-2025:673268 |
![]() On the enumeration of Potential Maximal Cliques abstract : Abstracts sciencesconf.org:jga-2025:672817 |
![]() On the Modular Chromatic Index of Random Uniform Hypergraphs abstract : Abstracts sciencesconf.org:jga-2025:673149 |
![]() Packing many dominating sets in a graph abstract : Abstracts sciencesconf.org:jga-2025:673447 |
![]() Parameterized Critical Node Cut Revisited abstract : Abstracts sciencesconf.org:jga-2025:670982 |
![]() Parameterized Restless Temporal Path abstract : Abstracts sciencesconf.org:jga-2025:672718 |
![]() Proper conflict-free colouring of graphs abstract : Abstracts sciencesconf.org:jga-2025:673029 |
![]() Réalisation de requêtes de connexité avec un graphe temporel minimum abstract : Abstracts sciencesconf.org:jga-2025:670994 |
![]() Reconfiguration of flows abstract : Abstracts sciencesconf.org:jga-2025:673199 |
![]() Resoudre les problèmes raccomodables de manière autostabilisante dans des systèmes distribués soumis à des pannes byzantines abstract : Abstracts sciencesconf.org:jga-2025:673628 |
![]() Small universal posets abstract : Abstracts sciencesconf.org:jga-2025:671851 |
![]() Structural Parameters for Steiner Orientation abstract : Abstracts sciencesconf.org:jga-2025:673545 |
![]() Structure of graphs edge-coverable by a few isometric paths or trees abstract : Abstracts sciencesconf.org:jga-2025:670771 |
![]() Subexponential and parameterized mixing times of Glauber dynamics on independent sets abstract : Abstracts sciencesconf.org:jga-2025:673112 |
![]() t-tone k-coloring of graphs abstract : Abstracts sciencesconf.org:jga-2025:672774 |
![]() The Parameterized Complexity Landscape of Two-Sets Cut-Uncut abstract : Abstracts sciencesconf.org:jga-2025:673433 |
![]() Un algorithme simple pour le problème des chemins disjoints abstract : Abstracts Graphs sciencesconf.org:jga-2025:669081 |
![]() Un lemme de voisinage dense, et applications à la coloration et à la domination abstract : Abstracts sciencesconf.org:jga-2025:671686 |
![]() Une amélioration de la borne sur la layered treedepth des graphes excluant un apex-chemin. abstract : Abstracts sciencesconf.org:jga-2025:673203 |
Loading...