g.2.2

Documents about g.2.2

• Block and Residue Exclusion in Kernel-Root Expansions for Two-Barrier Walks#668189arXiv (OAI Expanded)
• Block and Residue Exclusion in Kernel-Root Expansions for Two-Barrier Walks#670254arXiv (All)
• Context-Aware System Synthesis, Task Assignment, and Routing#986049arXiv (All)
• Extending Exact Integrality Gap Computations for the Metric TSP#986210arXiv (All)
• On the Laplacian spectral gap of generalized pancake graphs#614398arXiv (OAI Expanded)
• On the Laplacian spectral gap of generalized pancake graphs#615365arXiv (All)
• A Note on Approximating the Rural Postman Problem below 3/2#779537arXiv (OAI Expanded)
• A Note on Approximating the Rural Postman Problem below 3/2#780912arXiv (All)
• Distance statistics of block-weighted planar quadrangulations#987863arXiv (All)
• Complexity of Firefighting on Graphs#141736arXiv (OAI)
• A Generalized Ridge Regression and Convolutional LASSO#797032arXiv (OAI Expanded)
• A Generalized Ridge Regression and Convolutional LASSO#798445arXiv (All)
• Nearly $G_2$-manifolds and $G_2$-Laplacian co-flows#820205arXiv (All)
• 2007src0237#930775eCrystals
• 2008src1017#931012eCrystals
• 2008src0980#931011eCrystals
• Cycle-Structure Generating Functions for Special Breakpoint Graphs#808821arXiv (OAI Expanded)
• Cycle-Structure Generating Functions for Special Breakpoint Graphs#818813arXiv (All)
• • ||| A M O N G U S 2 0 2 6 ||| •#266717Internet Archive OAI Repository
• Disjoint chorded cycles in a $2$-connected graph#650591arXiv (OAI Expanded)
• Disjoint chorded cycles in a $2$-connected graph#652044arXiv (All)
• 2007src0178#930772eCrystals
• Separator Theorem for Minor-Free Graphs in Linear Time#986177arXiv (All)
• Term Coding: An Entropic Framework for Extremal Combinatorics and the Guessing--Number Sandwich Theorem#789552arXiv (OAI Expanded)
• Term Coding: An Entropic Framework for Extremal Combinatorics and the Guessing--Number Sandwich Theorem#793556arXiv (All)
• Positive and Negative Square Energies of $2$-Connected Graphs#926914arXiv (All)
• C~28~H~26~Cl~4~Ni~2~O~2~P~2~#941499eCrystals
• AutoGraphForge: Towards Automated Graph Theory Discovery#926397arXiv (All)
• Regularized Coupling Maps on Matrix Polytopes: From Assignment to Graph Matching and Optimal Transport#790086arXiv (OAI Expanded)
• Regularized Coupling Maps on Matrix Polytopes: From Assignment to Graph Matching and Optimal Transport#794105arXiv (All)
• 2009src0138#931042eCrystals
• On the Instance Optimality of Bidirectional Dijkstra's Algorithm#820644arXiv (All)
• Random-Priority Frontier Routing: Tight $Θ(n^c)$ Bounds Against $c$-Node Cartels#820895arXiv (All)
• Fast Geometric Embedding for Node Influence Maximization#177073arXiv (OAI)
• Models of random spanning trees#176992arXiv (OAI)
• A Proof of the Tree Packing Conjecture#821673arXiv (All)
• Learning Latent Graph Geometry via Fixed-Point Schrödinger-Type Activation: A Theoretical Study#984058arXiv (All)
• A framework for distributed discrete evacuation strategies#144275arXiv (OAI)
• 2009src0288#930860eCrystals
• Fast Relax-and-Round Unit Commitment with Economic Horizons#783535arXiv (OAI Expanded)
• Fast Relax-and-Round Unit Commitment with Economic Horizons#785125arXiv (All)
• A Simple Algorithm for the Directed Multiple Source Replacement Paths Problem#622916arXiv (OAI Expanded)
• A Simple Algorithm for the Directed Multiple Source Replacement Paths Problem#625189arXiv (All)
• 2008src0909#930997eCrystals
• (E)-2,4,6-trifluoro-N-(2,3-difluorobenzylidene)aniline#941602eCrystals
• A construction of F-irregular graphs#984646arXiv (All)
• Robustness of Boolean networks to update modes: an application to hereditary angioedema#177064arXiv (OAI)
• Immunoglobulin Replacement Therapy for Immunoglobulin G Subclass 2 Deficient Patients With Bronchiectasis#800280ClinicalTrials.gov
• Evaluating GNNs for Success Prediction in Artist Collaboration Networks#921067arXiv (OAI Expanded)
• Evaluating GNNs for Success Prediction in Artist Collaboration Networks#925303arXiv (All)