| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A branch-and-price algorithm for the ring/ring problem
|
Osório, Cećılia Lescano
|
|
|
195 |
C |
p. 516-522
|
artikel
|
| 2 |
An Approximate Blow-up Lemma for Sparse Hypergraphs
|
Allen, Peter
|
|
|
195 |
C |
p. 394-403
|
artikel
|
| 3 |
An efficient parameterized approximation scheme for the Star k-Hub Center ⁎ ⁎ Research supported by Sao Paulo Research Foundation (FAPESP), grants #2015/11937-9 and #2019/10400-2 and CNPq, grants #425340/2016-3, #422829/2018-8 and #312186/2020-7.
|
Benedito, Marcelo P.L.
|
|
|
195 |
C |
p. 49-58
|
artikel
|
| 4 |
A new formulation for the Weighted Safe Set Problem
|
Malaguti, Enrico
|
|
|
195 |
C |
p. 508-515
|
artikel
|
| 5 |
Automating Tree-Like Resolution in Time n o(log n) Is ETH-Hard
|
de Rezende, Susanna F.
|
|
|
195 |
C |
p. 152-162
|
artikel
|
| 6 |
Biclique Graphs of K 3-free Graphs and Bipartite Graphs
|
Groshaus, Marina
|
|
|
195 |
C |
p. 230-238
|
artikel
|
| 7 |
Bounds on the Diameter of Graph Associahedra
|
Cardinal, Jean
|
|
|
195 |
C |
p. 239-247
|
artikel
|
| 8 |
Cliques in exact distance powers of graphs of given maximum degree ⁎ ⁎ This research was supported by the IFCAM project “Applications of graph homomorphisms” (MA/IFCAM/18/39), by SERB OVDF program (”ODFJ2018_001449”), by the ANR project HOSIGRA (ANR-17-CE40-0022) and by the ANR project DISTANCIA (ANR-17-CE40-0015).
|
Foucaud, Florent
|
|
|
195 |
C |
p. 427-436
|
artikel
|
| 9 |
Codegree conditions for cycle decompositions and Euler tours in 3-uniform hypergraphs
|
Piga, Simón
|
|
|
195 |
C |
p. 350-358
|
artikel
|
| 10 |
Combinatorial Properties for the Green Vehicle Routing Problem ⁎ ⁎ Supported by FAPESP (proc. 2018/25950-5) and by CNPq (proc. 435520/2018-0).
|
Andrade, Matheus Diógenes
|
|
|
195 |
C |
p. 478-488
|
artikel
|
| 11 |
Complete immersions in graphs with independence number two and small forbidden subgraphs
|
Quiroz, Daniel A.
|
|
|
195 |
C |
p. 343-349
|
artikel
|
| 12 |
Consequences of APSP, triangle detection, and 3SUM hardness for separation between determinism and non-determinism
|
Lingas, Andrzej
|
|
|
195 |
C |
p. 163-171
|
artikel
|
| 13 |
Constrained colourings of random graphs ⁎ ⁎ Y. Kohayakawa was partially supported by CNPq (311412/2018-1, 423833/2018-9) and FAPESP (2018/04876-1). C.G. Moreira was partially supported by CNPq and FAPERJ. G.O. Mota was partially supported by CNPq (304733/2017-2, 428385/2018-4) and FAPESP (2018/04876-1, 2019/13364-7). This study was financed in part by the Coordenacão de Aperfeicoamento de Pessoal de Nível Superior, Brasil (CAPES), Finance Code 001. FAPESP is the São Paulo Research Foundation. CNPq is the National Council for Scientific and Technological Development of Brazil.
|
Collares, Maurício
|
|
|
195 |
C |
p. 368-375
|
artikel
|
| 14 |
Contents
|
|
|
|
195 |
C |
p. iii-vi
|
artikel
|
| 15 |
Counting orientations of graphs with no strongly connected tournaments ⁎ ⁎ F. Botler was supported by CNPq (423395/2018-1), and by FAPERJ (211.305/2019); C. Hoppen was partially supported by CNPq (308054/2018-0) and FAPERGS (19/2551-0001727-8); G.O. Mota was partially supported by CNPq (304733/2017-2, 428385/2018-4) and FAPESP (2018/04876-1, 2019/13364-7). This study was financed in part by the Coordenacão de Aperfeicoamento de Pessoal de Nível Superior, Brasil (CAPES), Finance Code 001. FAPERGS, FAPERJ, and FAPESP are the Research Foundations of the states of Rio Grande do Sul, Rio de Janeiro, and Sao Paulo, respectively CNPq is the National Council for Scientific and Technological Development of Conselho Nacional de Desenvolvimento Científico e Tecnologico do Brasil.
|
Botler, Fábio
|
|
|
195 |
C |
p. 385-393
|
artikel
|
| 16 |
Cycle factors in randomly perturbed graphs
|
Böttcher, Julia
|
|
|
195 |
C |
p. 404-411
|
artikel
|
| 17 |
Diameter in linear time for constant-dimension median graphs
|
Bergé, Pierre
|
|
|
195 |
C |
p. 97-107
|
artikel
|
| 18 |
Effective Heuristics for the Perfect Awareness Problem ⁎ ⁎ This work was supported in part by the Brazilian National Council for Scientific and Technological Development (CNPq), Grants #313329/2020-6, #130838/2019-5, #309627/2017-6; Sao Paulo Research Foundation (FAPESP), Grants #2020/09691-0, #2019/22297-1, #2018/26434-0, #2014/12236-1; Fund for Support to Teaching, Research and Outreach Activities (FAEPEX).
|
Pereira, Felipe de C.
|
|
|
195 |
C |
p. 489-498
|
artikel
|
| 19 |
Extending an Integer Formulation for the Guillotine 2D Bin Packing Problem
|
Becker, Henrique
|
|
|
195 |
C |
p. 499-507
|
artikel
|
| 20 |
Graphs with Two Moplexes ⁎ ⁎ This research was funded in part by the Slovenian Research Agency (I0-0035, research programs P1-0285, P1-0383 and research projects J1-1692, J1-9110, J1-9187, N1-0102, and N1-0160). The authors gratefully acknowledge the European Commission for funding the InnoRenew CoE project (Grant Agreement #739574) under the Horizon2020 Widespread-Teaming program and and the Republic of Slovenia (Investment funding of the Republic of Slovenia and the European Union of the European regional Development Fund). Robert Ganian acknowledges support from the Austrian Science Fund (FWF projects P31336, Y1329). Meike Hatzel’s research has been supported by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (ERC Consolidator Grant DISTRUCT, grant agreement No 648527).
|
Dallard, Clément
|
|
|
195 |
C |
p. 248-256
|
artikel
|
| 21 |
Hitting times for arc-disjoint arborescences in random digraph processes ⁎ ⁎ Y. Kohayakawa was partially supported by CNPq (311412/2018-1, 423833/2018-9) and FAPESP (2018/04876-1). This study was financed in part by CAPES, Coordenacão de Aperfeicoamento de Pessoal de Nível Superior, Brazil, Finance Code 001. FAPESP is the Sao Paulo Research Foundation. CNPq is the National Council for Scientific and Technological Development of Brazil.
|
Collares, Maurício
|
|
|
195 |
C |
p. 376-384
|
artikel
|
| 22 |
How to detect whether Shor’s algorithm succeeds against large integers without a quantum computer
|
Bastos, Daniel Chicayban
|
|
|
195 |
C |
p. 145-151
|
artikel
|
| 23 |
Instance Optimal Join Size Estimation
|
Abo-Khamis, Mahmoud
|
|
|
195 |
C |
p. 135-144
|
artikel
|
| 24 |
Intersection models for 2-thin and proper 2-thin graphs
|
Bonomo-Braberman, Flavia
|
|
|
195 |
C |
p. 221-229
|
artikel
|
| 25 |
Kernelization results for Equitable Coloring ⁎ ⁎ This work was partially supported by CAPES, CNPq, and FAPEMIG.
|
Gomes, Guilherme C.M.
|
|
|
195 |
C |
p. 59-67
|
artikel
|
| 26 |
Local Construction of Connected Plane Subgraphs in Graphs Satisfying Redundancy and Coexistence ⁎ ⁎ This work is funded in part by the DFG grant FR 2978/1-2.
|
Böltz, Lucas
|
|
|
195 |
C |
p. 108-117
|
artikel
|
| 27 |
Maximum number of r-edge-colorings such that all copies of Kk are rainbow
|
Bastos, Josefran de Oliveira
|
|
|
195 |
C |
p. 419-426
|
artikel
|
| 28 |
Maximum size of r-cross t-intersecting families
|
Gupta, Pranshu
|
|
|
195 |
C |
p. 453-458
|
artikel
|
| 29 |
Minimum Number of Bends of Paths of Trees in a Grid Embedding
|
de Luca, Vitor Tocci Ferreira
|
|
|
195 |
C |
p. 118-126
|
artikel
|
| 30 |
On equitable total coloring of snarks ⁎ ⁎ This study was financed in part by the Coordenacão de Aperfeicoamento de Pessoal de Nível Superior - Brasil (CAPES) - Finance Code 001, CAPES-PrInt project number 88881.310248/2018-01, CNPq and FAPERJ.
|
Gonçalves, Isabel F.A.
|
|
|
195 |
C |
p. 334-342
|
artikel
|
| 31 |
On feedback vertex set in reducible flow hypergraphs ⁎ ⁎ This project was partially supported by CNPq (308654/2018-8, 304706/2017-5 and 428941/2016-8) and FAPERJ.
|
Faria, Luerbio
|
|
|
195 |
C |
p. 212-220
|
artikel
|
| 32 |
On structural parameterizations of the selective coloring problem ⁎ ⁎ This work was partially supported by CAPES, CNPq, and FAPEMIG.
|
Gomes, Guilherme C.M.
|
|
|
195 |
C |
p. 77-85
|
artikel
|
| 33 |
On the diameter of Schrijver graphs
|
Pastine, Adrián
|
|
|
195 |
C |
p. 266-274
|
artikel
|
| 34 |
On the Inapproximability of the Cable-Trench Problem ⁎ ⁎ Supported by Sao Paulo Research Foundation (FAPESP) grants #2015/11937-9 and #2019/10400-2, and National Council for Scientific and Technological Development (CNPq) grants #425340/2016-3, #422829/2018-8, #140552/2019-7, and #312186/2020-7.
|
Benedito, Marcelo P.L.
|
|
|
195 |
C |
p. 39-48
|
artikel
|
| 35 |
On total coloring of 4-regular circulant graphs ⁎ ⁎ Partially supported by CNPq, FAPERJ and CAPES.
|
Nigro, Mauro
|
|
|
195 |
C |
p. 315-324
|
artikel
|
| 36 |
On total coloring the direct product of complete graphs ⁎ ⁎ Partially supported by CNPq, CAPES, and FAPERJ. M. Valencia-Pabon was supported by the French-Brazilian network in mathematics.
|
Castonguay, D.
|
|
|
195 |
C |
p. 306-314
|
artikel
|
| 37 |
Parameterized algorithms for locating-dominating sets ⁎ ⁎ This work was partially supported by CAPES, CNPq, and FAPEMIG.
|
Cappelle, Márcia R.
|
|
|
195 |
C |
p. 68-76
|
artikel
|
| 38 |
Partitioning Into Prescribed Number of Cycles and Mod k T-join With Slack
|
Barrett, Jordan
|
|
|
195 |
C |
p. 12-20
|
artikel
|
| 39 |
Polarity graphs and C 4-free multipartite graphs
|
Gonçalves, Claudia J.F.
|
|
|
195 |
C |
p. 437-444
|
artikel
|
| 40 |
Preface
|
Ferreira, Carlos
|
|
|
195 |
C |
p. 5-11
|
artikel
|
| 41 |
Recursive constructions of amoebas
|
Hansberg, Adriana
|
|
|
195 |
C |
p. 257-265
|
artikel
|
| 42 |
Reversal and Transposition Distance of Genomes Considering Flexible Intergenic Regions
|
Brito, Klairton Lima
|
|
|
195 |
C |
p. 21-29
|
artikel
|
| 43 |
Survival for a Galton-Watson tree with cousin mergers
|
Eslava, Laura
|
|
|
195 |
C |
p. 445-452
|
artikel
|
| 44 |
Table of Contents
|
|
|
|
195 |
C |
p. 1-4
|
artikel
|
| 45 |
Target set selection with maximum activation time ⁎ ⁎ Supported by CAPES [88887.143992/2017-00] DAAD Probral and [88881.197438/2018-01] STIC AmSud, CNPq Universal [401519/2016-3], [425297/2016-0] and [437841/2018-9], FUNCAP [4543945/2016] Pronem, CAPES-PRINT Institutional Internationalization Program - process 88887.468331/2019-00, and French projects DEMOGRAPH (ANR-16-CE40-0028), ESIGMA (ANR-17-CE23-0010), ELIT (ANR-20-CE48-0008-01), and UTMA (ANR-20-CE92-0027).
|
Keiler, Lucas
|
|
|
195 |
C |
p. 86-96
|
artikel
|
| 46 |
The (a,b)-monochromatic transversal game on biclique-hypergraphs of powers of paths and of powers of cycles ⁎ ⁎ Dedicated to front-line health-care professionals and essential workers amid the COVID-19 pandemic. , ⁎ ⁎ This study was financed in part by the Coordenacão de Aperfeicoamento de Pessoal de Nível Superior - Brasil (CAPES) - Finance Code 001, CAPES-PrInt project number 88881.310248/2018-01, CNPq and FAPERJ.
|
Mendes, Wilder P.
|
|
|
195 |
C |
p. 181-189
|
artikel
|
| 47 |
The chromatic index of split-interval graphs ⁎ ⁎ This study was financed in part by the Coordenacão de Aperfeicoamento de Pessoal de Nível Superior - Brasil (CAPES) - Finance Code 001 and Conselho Nacional de Desenvolvimento Científico e Tecnologico - Brasil (CNPq).
|
da Soledade Gonzaga, Luis Gustavo
|
|
|
195 |
C |
p. 325-333
|
artikel
|
| 48 |
The crossing number of centrally symmetric complete geometric graphs
|
Ábrego, Bernardo M.
|
|
|
195 |
C |
p. 275-279
|
artikel
|
| 49 |
The 2-Decomposition Conjecture for a new class of graphs ⁎ ⁎ F. Botler is supported by CNPq (423395/2018-1), and by FAPERJ (211.305/2019); A. Jimenez is supported by ANID/FONDECYT/INICIACION 11170931 and ANID/PCI/REDES 190071; M. Sambinelli is supported by FAPESP (2017/23623-4) and CNPq (423833/2018-9); Y. Wakabayashi is supported by CNPq (306464/2016-0, 423833/2018-9) and FAPESP (2015/11937-9). FAPERJ and FAPESP are the Research Foundations of the states Rio de Janeiro and São Paulo, respectively. This study is financed in part by CAPES Finance Code 001, ANID/PCI-FAPESP 2019/13364-7 and MATHAMSUD 20-MATH-09.
|
Botler, Fábio
|
|
|
195 |
C |
p. 359-367
|
artikel
|
| 50 |
The signature matrix for 6-Pfaffian graphs
|
Costa Moço, Roberta Rasoviti Marques
|
|
|
195 |
C |
p. 298-305
|
artikel
|
| 51 |
The Speed and Threshold of the Biased Hamilton Cycle Game
|
Brustle, Noah
|
|
|
195 |
C |
p. 200-211
|
artikel
|
| 52 |
The Speed and Threshold of the Biased Perfect Matching Game
|
Brustle, Noah
|
|
|
195 |
C |
p. 190-199
|
artikel
|
| 53 |
Treelength of Series-parallel Graphs
|
Dissaux, Thomas
|
|
|
195 |
C |
p. 30-38
|
artikel
|
| 54 |
Tridiagonal Maximum-Entropy Sampling and Tridiagonal Masks
|
Al-Thani, Hessa
|
|
|
195 |
C |
p. 127-134
|
artikel
|
| 55 |
Tromino Tilings with Pegs via Flow Networks
|
Akagi, Javier T.
|
|
|
195 |
C |
p. 459-467
|
artikel
|
| 56 |
Turán density of cliques of order five in 3-uniform hypergraphs with quasirandom links
|
Berger, Sören
|
|
|
195 |
C |
p. 412-418
|
artikel
|
| 57 |
Tutte’s 3-flow Conjecture for almost even graphs
|
Peres, Léo Vieira
|
|
|
195 |
C |
p. 280-288
|
artikel
|
| 58 |
Unique maximum independent sets in graphs on monomials of a fixed degree
|
Machacek, John
|
|
|
195 |
C |
p. 289-297
|
artikel
|
| 59 |
Unlabelled ordered DAGs and labelled DAGs: constructive enumeration and uniform random sampling
|
Genitrini, Antoine
|
|
|
195 |
C |
p. 468-477
|
artikel
|
| 60 |
Upper Bounds on the Boolean Rank of Kronecker Products
|
Haviv, Ishay
|
|
|
195 |
C |
p. 172-180
|
artikel
|
| 61 |
Valid inequalities and a branch-and-cut algorithm for the routing and spectrum allocation problem
|
Bianchetti, Marcelo
|
|
|
195 |
C |
p. 523-531
|
artikel
|
| 62 |
Valid inequalities and complete characterizations of the 2-domination and the P 3-hull number polytopes
|
Blaum, Manuela
|
|
|
195 |
C |
p. 532-542
|
artikel
|
Tijdschrift beschrijving