updates: theory, formal

data/formal-out-papers.csv

@@ -24,22 +24,22 @@
 2017,MSCS,"A rewriting framework and logic for activities subject to regulations.",UFPB,Max I. Kanovich; Tajana Ban Kirigin; Vivek Nigam; Andre Scedrov; Carolyn L. Talcott; Ranko Perovic,https://doi.org/10.1017/S096012951500016X,null,J,no_arxiv,4
 2017,Theor. Comput. Sci.,"On concurrent behaviors and focusing in linear logic.",UFRN,Carlos Olarte; Elaine Pimentel,https://doi.org/10.1016/j.tcs.2016.08.026,null,J,no_arxiv,3
 2016,J. Log. Comput.,"An extended framework for specifying and reasoning about proof systems.",UFRN; UFPB,Vivek Nigam; Elaine Pimentel; Giselle Reis,https://doi.org/10.1093/logcom/exu029,null,J,no_arxiv,11
-2016,WoLLIC,"On the Formalization of Some Results of Context-Free Language Theory.",UFPE,Marcus Vinícius Midena Ramos; Ruy J. G. B. de Queiroz; Nelma Moreira; José Carlos Bacelar Almeida,https://doi.org/10.1007/978-3-662-52921-8_21,null,C,no_arxiv,1
+2016,WoLLIC,"On the Formalization of Some Results of Context-Free Language Theory.",UFPE,Marcus Vinícius Midena Ramos; Ruy J. G. B. de Queiroz; Nelma Moreira; José Carlos Bacelar Almeida,https://doi.org/10.1007/978-3-662-52921-8_21,null,C,no_arxiv,2
 2015,J. Log. Comput.,"Towards a uniform presentation of logical systems by indexed categories and adjoint situations.",PUC-Rio,Uwe Wolter; Alfio Martini; Edward Hermann Haeusler,https://doi.org/10.1093/logcom/exs038,null,J,no_arxiv,0
 2015,SCP,"A rewriting logic semantics for NCL.",UFF,Joel André Ferreira dos Santos; Christiano Braga; Débora C. Muchaluat-Saade,https://doi.org/10.1016/j.scico.2015.04.006,null,J,no_arxiv,2
 2015,SEFM,"Memory Management Test-Case Generation of C Programs Using Bounded Model Checking.",UFAM,Herbert Rocha; Raimundo S. Barreto; Lucas C. Cordeiro,https://doi.org/10.1007/978-3-319-22969-0_18,null,C,no_arxiv,2
 2015,TPLP,"Abstract interpretation of temporal concurrent constraint programs.",UFRN,Moreno Falaschi; Carlos Olarte; Catuscia Palamidessi,https://doi.org/10.1017/S1471068413000641,null,J,http://arxiv.org/abs/1312.2552v1,4
 2015,Theor. Comput. Sci.,"Bivalent semantics, generalized compositionality and analytic classic-like tableaux for finite-valued logics.",UFRN,Carlos Caleiro; João Marcos 0001; Marco Volpe 0001,https://doi.org/10.1016/j.tcs.2015.07.016,null,J,no_arxiv,10
-2014,FM,"A Modular Theory of Object Orientation in Higher-Order UTP.",UFPE,Frank Zeyda; Thiago L. V. L. Santos; Ana Cavalcanti; Augusto Sampaio,https://doi.org/10.1007/978-3-319-06410-9_42,null,C,no_arxiv,1
+2014,FM,"A Modular Theory of Object Orientation in Higher-Order UTP.",UFPE,Frank Zeyda; Thiago L. V. L. Santos; Ana Cavalcanti; Augusto Sampaio,https://doi.org/10.1007/978-3-319-06410-9_42,null,C,no_arxiv,2
 2014,FM,"A Refinement Based Strategy for Local Deadlock Analysis of Networks of CSP Processes.",UFPE,Pedro R. G. Antonino; Augusto Sampaio; Jim Woodcock,https://doi.org/10.1007/978-3-319-06410-9_5,null,C,no_arxiv,11
 2014,J. Log. Comput.,"A resolution-based calculus for Coalition Logic.",UnB,Cláudia Nalon; Lan Zhang 0001; Clare Dixon; Ullrich Hustadt,https://doi.org/10.1093/logcom/ext074,null,J,no_arxiv,3
 2014,J. Log. Comput.,"Propositional dynamic logics for communicating concurrent programs with CCS's parallel operator.",DCC/UFRJ,Mario R. F. Benevides; L. Menasché Schechter,https://doi.org/10.1093/logcom/exu001,null,J,no_arxiv,1
 2014,SCP,"Compositionality and correctness of fault tolerant patterns in HOL4.",UFPE,Diego Machado Dias; Juliano Iyoda,https://doi.org/10.1016/j.scico.2013.07.009,null,J,no_arxiv,0
 2014,SCP,"Consistency of model transformation contracts.",UFF,Christiano Braga; Cassio Santos; Viviane Torres da Silva,https://doi.org/10.1016/j.scico.2013.08.013,null,J,no_arxiv,1
-2014,SCP,"NAT2TEST: Test case generation from natural language requirements based on SCR specifications.",UFPE,Gustavo Carvalho; Diogo Falcão; Flávia de Almeida Barros; Augusto Sampaio; Alexandre Mota 0001; Leonardo Motta; Mark R. Blackburn,https://doi.org/10.1016/j.scico.2014.06.007,null,J,no_arxiv,11
+2014,SCP,"NAT2TEST: Test case generation from natural language requirements based on SCR specifications.",UFPE,Gustavo Carvalho; Diogo Falcão; Flávia de Almeida Barros; Augusto Sampaio; Alexandre Mota 0001; Leonardo Motta; Mark R. Blackburn,https://doi.org/10.1016/j.scico.2014.06.007,null,J,no_arxiv,12
 2014,SEFM,"Rapid Prototyping of a Semantically Well Founded Circus Model Checker.",UFPE,Alexandre Mota 0001; Adalberto Farias; André Didier; Jim Woodcock,https://doi.org/10.1007/978-3-319-10431-7_17,null,C,no_arxiv,5
 2014,SEFM,"Test Suite Completeness and Partial Models.",UNICAMP,Adilson Luiz Bonifácio; Arnaldo Vieira Moura,https://doi.org/10.1007/978-3-319-10431-7_8,null,C,no_arxiv,4
 2014,TPLP,"A Proof Theoretic Study of Soft Concurrent Constraint Programming.",UFRN; UFPB,Elaine Pimentel; Carlos Olarte; Vivek Nigam,https://doi.org/10.1017/S147106841400026X,null,J,http://arxiv.org/abs/1405.2329v1,4
-2014,Theor. Comput. Sci.,"A framework for linear authorization logics.",UFPB,Vivek Nigam,https://doi.org/10.1016/j.tcs.2014.02.018,null,J,no_arxiv,3
+2014,Theor. Comput. Sci.,"A framework for linear authorization logics.",UFPB,Vivek Nigam,https://doi.org/10.1016/j.tcs.2014.02.018,null,J,no_arxiv,4
 2014,WoLLIC,"On Distributed Stochastic Logics for Mobile Systems.",UFF,Juliana Küster Filipe Bowles; Petrucio Viana,https://doi.org/10.1007/978-3-662-44145-9_14,null,C,no_arxiv,0
 2014,WoLLIC,"Sequentialization for N-Graphs via Sub-N-Graphs.",UFPE,Ruan Carvalho; Laís Andrade; Anjolina Grisi de Oliveira; Ruy J. G. B. de Queiroz,https://doi.org/10.1007/978-3-662-44145-9_7,null,C,no_arxiv,0

data/profs/search/Alexandre-Mota.csv

@@ -1,2 +1,2 @@
-2014,SCP,"NAT2TEST: Test case generation from natural language requirements based on SCR specifications.",Gustavo Carvalho; Diogo Falcão; Flávia de Almeida Barros; Augusto Sampaio; Alexandre Mota 0001; Leonardo Motta; Mark R. Blackburn,https://doi.org/10.1016/j.scico.2014.06.007,null,J,no_arxiv,11
+2014,SCP,"NAT2TEST: Test case generation from natural language requirements based on SCR specifications.",Gustavo Carvalho; Diogo Falcão; Flávia de Almeida Barros; Augusto Sampaio; Alexandre Mota 0001; Leonardo Motta; Mark R. Blackburn,https://doi.org/10.1016/j.scico.2014.06.007,null,J,no_arxiv,12
 2014,SEFM,"Rapid Prototyping of a Semantically Well Founded Circus Model Checker.",Alexandre Mota 0001; Adalberto Farias; André Didier; Jim Woodcock,https://doi.org/10.1007/978-3-319-10431-7_17,null,C,no_arxiv,5

data/profs/search/Andre-Rossi.csv

@@ -10,4 +10,4 @@
 2016,Networks,"Partial target coverage to extend the lifetime in wireless multi-role sensor networks.",Fabian Castaño; Eric Bourreau; André Rossi; Marc Sevaux; Nubia Velasco,https://doi.org/10.1002/net.21682,null,J,no_arxiv,4
 2015,EJOR,"Exact approaches for lifetime maximization in connectivity constrained wireless multi-role sensor networks.",Fabian Castaño; Eric Bourreau; Nubia Velasco; André Rossi; Marc Sevaux,https://doi.org/10.1016/j.ejor.2014.08.013,null,J,no_arxiv,14
 2014,Computers & OR,"A column generation approach to extend lifetime in wireless sensor networks with coverage and connectivity constraints.",Fabian Castaño; André Rossi; Marc Sevaux; Nubia Velasco,https://doi.org/10.1016/j.cor.2013.11.001,null,J,no_arxiv,22
-2016,Discrete Applied Math.,"Maximizing the robustness for simple assembly lines with fixed cycle time and limited number of workstations.",André Rossi; Evgeny Gurevsky; Olga Battaïa; Alexandre Dolgui,https://doi.org/10.1016/j.dam.2016.03.005,null,J,no_arxiv,5
+2016,Discrete Applied Math.,"Maximizing the robustness for simple assembly lines with fixed cycle time and limited number of workstations.",André Rossi; Evgeny Gurevsky; Olga Battaïa; Alexandre Dolgui,https://doi.org/10.1016/j.dam.2016.03.005,null,J,no_arxiv,6

data/profs/search/Augusto-Sampaio.csv

@@ -3,7 +3,7 @@
 2019,SCP,"CPN simulation-based test case generation from controlled natural-language requirements.",Bruno Cesar F. Silva; Gustavo Carvalho; Augusto Sampaio,https://doi.org/10.1016/j.scico.2019.04.001,null,J,no_arxiv,1
 2019,SEFM,"Multi-objective Search for Effective Testing of Cyber-Physical Systems.",Hugo L. S. Araujo; Gustavo Carvalho; Mohammad Reza Mousavi; Augusto Sampaio,https://doi.org/10.1007/978-3-030-30446-1_10,null,C,no_arxiv,0
 2018,SCP,"Sound conformance testing for cyber-physical systems: Theory and implementation.",Hugo L. S. Araujo; Gustavo Carvalho; Morteza Mohaqeqi; Mohammad Reza Mousavi; Augusto Sampaio,https://doi.org/10.1016/j.scico.2017.07.002,null,J,no_arxiv,2
-2014,SCP,"NAT2TEST: Test case generation from natural language requirements based on SCR specifications.",Gustavo Carvalho; Diogo Falcão; Flávia de Almeida Barros; Augusto Sampaio; Alexandre Mota 0001; Leonardo Motta; Mark R. Blackburn,https://doi.org/10.1016/j.scico.2014.06.007,null,J,no_arxiv,11
+2014,SCP,"NAT2TEST: Test case generation from natural language requirements based on SCR specifications.",Gustavo Carvalho; Diogo Falcão; Flávia de Almeida Barros; Augusto Sampaio; Alexandre Mota 0001; Leonardo Motta; Mark R. Blackburn,https://doi.org/10.1016/j.scico.2014.06.007,null,J,no_arxiv,12
 2014,FM,"A Refinement Based Strategy for Local Deadlock Analysis of Networks of CSP Processes.",Pedro R. G. Antonino; Augusto Sampaio; Jim Woodcock,https://doi.org/10.1007/978-3-319-06410-9_5,null,C,no_arxiv,11
-2014,FM,"A Modular Theory of Object Orientation in Higher-Order UTP.",Frank Zeyda; Thiago L. V. L. Santos; Ana Cavalcanti; Augusto Sampaio,https://doi.org/10.1007/978-3-319-06410-9_42,null,C,no_arxiv,1
+2014,FM,"A Modular Theory of Object Orientation in Higher-Order UTP.",Frank Zeyda; Thiago L. V. L. Santos; Ana Cavalcanti; Augusto Sampaio,https://doi.org/10.1007/978-3-319-06410-9_42,null,C,no_arxiv,2
 2017,SoSyM,"An integrated semantics for reasoning about SysML design models using refinement.",Lucas Lima; Alvaro Miyazawa; Ana Cavalcanti; Márcio Cornélio; Juliano Iyoda; Augusto Sampaio; Ralph Hains; Adrian Larkham; Vaughan Lewis,https://doi.org/10.1007/s10270-015-0492-y,null,J,no_arxiv,6

data/profs/search/Cristina-Fernandes.csv

@@ -3,7 +3,7 @@
 2018,Algorithmica,"Improved Approximation Algorithms for Capacitated Fault-Tolerant k-Center.",Cristina G. Fernandes; Samuel P. de Paula; Lehilton L. C. Pedrosa,https://doi.org/10.1007/s00453-017-0398-x,null,J,no_arxiv,1
 2018,Algorithmica,"Approximation Algorithms for the Max-Buying Problem with Limited Supply.",Cristina G. Fernandes; Rafael Crivellari Saliba Schouery,https://doi.org/10.1007/s00453-017-0364-7,null,J,no_arxiv,0
 2018,J. of Graph Theory,"On minimum bisection and related cut problems in trees and tree-like graphs.",Cristina G. Fernandes; Tina Janne Schmidt; Anusch Taraz,https://doi.org/10.1002/jgt.22248,null,J,no_arxiv,0
-2017,Discrete Mathematics,"Nonempty intersection of longest paths in series-parallel graphs.",Guantao Chen; Julia Ehrenmüller; Cristina G. Fernandes; Carl Georg Heise; Songling Shan; Ping Yang; Amy N. Yates,https://doi.org/10.1016/j.disc.2016.07.023,null,J,no_arxiv,4
+2017,Discrete Mathematics,"Nonempty intersection of longest paths in series-parallel graphs.",Guantao Chen; Julia Ehrenmüller; Cristina G. Fernandes; Carl Georg Heise; Songling Shan; Ping Yang; Amy N. Yates,https://doi.org/10.1016/j.disc.2016.07.023,null,J,no_arxiv,5
 2016,Discrete Applied Math.,"Repetition-free longest common subsequence of random sequences.",Cristina G. Fernandes; Marcos A. Kiwi,https://doi.org/10.1016/j.dam.2015.07.005,null,J,no_arxiv,2
 2016,Discrete Mathematics,"Spanning trees with nonseparating paths.",Cristina G. Fernandes; César Hernández-Vélez; Orlando Lee; José Coelho de Pina,https://doi.org/10.1016/j.disc.2015.08.020,null,J,http://arxiv.org/abs/1409.4239v1,0
 2016,Theor. Comput. Sci.,"Kinetic clustering of points on the line.",Cristina G. Fernandes; Marcio T. I. Oshiro,https://doi.org/10.1016/j.tcs.2016.05.020,null,J,http://arxiv.org/abs/1512.04303v1,0

data/profs/search/Fabio-Protti.csv

@@ -18,4 +18,4 @@
 2015,Discrete Applied Math.,"Cycles in complementary prisms.",Dirk Meierling; Fábio Protti; Dieter Rautenbach; Aline Ribeiro de Almeida,https://doi.org/10.1016/j.dam.2015.04.016,null,J,no_arxiv,2
 2015,Theor. Comput. Sci.,"The predecessor-existence problem for k-reversible processes.",Leonardo I. L. Oliveira; Valmir Carneiro Barbosa; Fábio Protti,https://doi.org/10.1016/j.tcs.2014.10.018,null,J,no_arxiv,1
 2015,Theor. Comput. Sci.,"Tractability and hardness of flood-filling games on trees.",Michael R. Fellows; Uéverton dos Santos Souza; Fábio Protti; Maise Dantas da Silva,https://doi.org/10.1016/j.tcs.2015.02.008,null,J,no_arxiv,3
-2015,Theor. Comput. Sci.,"Complexity analysis of P-convexity problems on bounded-degree and planar graphs.",Lucia Draque Penso; Fábio Protti; Dieter Rautenbach; Uéverton dos Santos Souza,https://doi.org/10.1016/j.tcs.2015.10.003,null,J,no_arxiv,8
+2015,Theor. Comput. Sci.,"Complexity analysis of P-convexity problems on bounded-degree and planar graphs.",Lucia Draque Penso; Fábio Protti; Dieter Rautenbach; Uéverton dos Santos Souza,https://doi.org/10.1016/j.tcs.2015.10.003,null,J,no_arxiv,9

data/profs/search/Gustavo-Carvalho.csv

@@ -1,4 +1,4 @@
 2019,SCP,"CPN simulation-based test case generation from controlled natural-language requirements.",Bruno Cesar F. Silva; Gustavo Carvalho; Augusto Sampaio,https://doi.org/10.1016/j.scico.2019.04.001,null,J,no_arxiv,1
 2019,SEFM,"Multi-objective Search for Effective Testing of Cyber-Physical Systems.",Hugo L. S. Araujo; Gustavo Carvalho; Mohammad Reza Mousavi; Augusto Sampaio,https://doi.org/10.1007/978-3-030-30446-1_10,null,C,no_arxiv,0
 2018,SCP,"Sound conformance testing for cyber-physical systems: Theory and implementation.",Hugo L. S. Araujo; Gustavo Carvalho; Morteza Mohaqeqi; Mohammad Reza Mousavi; Augusto Sampaio,https://doi.org/10.1016/j.scico.2017.07.002,null,J,no_arxiv,2
-2014,SCP,"NAT2TEST: Test case generation from natural language requirements based on SCR specifications.",Gustavo Carvalho; Diogo Falcão; Flávia de Almeida Barros; Augusto Sampaio; Alexandre Mota 0001; Leonardo Motta; Mark R. Blackburn,https://doi.org/10.1016/j.scico.2014.06.007,null,J,no_arxiv,11
+2014,SCP,"NAT2TEST: Test case generation from natural language requirements based on SCR specifications.",Gustavo Carvalho; Diogo Falcão; Flávia de Almeida Barros; Augusto Sampaio; Alexandre Mota 0001; Leonardo Motta; Mark R. Blackburn,https://doi.org/10.1016/j.scico.2014.06.007,null,J,no_arxiv,12

data/profs/search/Jayme-Szwarcfiter.csv

@@ -1,7 +1,7 @@
 2018,Annals OR,"And/or-convexity: a graph convexity based on processes and deadlock models.",Carlos Vinícius G. C. Lima; Fábio Protti; Dieter Rautenbach; Uéverton S. Souza; Jayme Luiz Szwarcfiter,https://doi.org/10.1007/s10479-017-2666-1,null,J,no_arxiv,0
 2018,Annals OR,"Perfect edge domination: hard and solvable cases.",Min Chih Lin; Vadim V. Lozin; Veronica A. Moyano; Jayme Luiz Szwarcfiter,https://doi.org/10.1007/s10479-017-2664-3,null,J,http://arxiv.org/abs/1705.08379v1,1
 2019,Algorithmica,"Full Characterization of a Class of Graphs Tailored for Software Watermarking.",Lucila M. S. Bento; Davidson R. Boccardo; Raphael C. S. Machado; Vinícius Gusmão Pereira de Sá; Jayme Luiz Szwarcfiter,https://doi.org/10.1007/s00453-019-00557-w,null,J,no_arxiv,0
-2019,Discrete Applied Math.,"On the P3-hull number of some products of graphs.",Erika M. M. Coelho; Hebert Coelho; Julliano R. Nascimento; Jayme Luiz Szwarcfiter,https://doi.org/10.1016/j.dam.2018.04.024,null,J,no_arxiv,0
+2019,Discrete Applied Math.,"On the P3-hull number of some products of graphs.",Erika M. M. Coelho; Hebert Coelho; Julliano R. Nascimento; Jayme Luiz Szwarcfiter,https://doi.org/10.1016/j.dam.2018.04.024,null,J,no_arxiv,1
 2019,Discrete Applied Math.,"Dijkstra graphs.",Lucila M. S. Bento; Davidson R. Boccardo; Raphael C. S. Machado; Flávio Keidi Miyazawa; Vinícius Gusmão Pereira de Sá; Jayme Luiz Szwarcfiter,https://doi.org/10.1016/j.dam.2017.07.033,null,J,no_arxiv,0
 2018,Discrete Applied Math.,"On the resilience of canonical reducible permutation graphs.",Lucila M. S. Bento; Davidson R. Boccardo; Raphael C. S. Machado; Vinícius Gusmão Pereira de Sá; Jayme Luiz Szwarcfiter,https://doi.org/10.1016/j.dam.2016.09.038,null,J,no_arxiv,1
 2018,Discrete Applied Math.,"The convexity of induced paths of order three and applications: Complexity aspects.",Rafael T. Araújo; Rudini M. Sampaio; Vinícius Fernandes dos Santos; Jayme Luiz Szwarcfiter,https://doi.org/10.1016/j.dam.2017.11.007,null,J,no_arxiv,1
@@ -13,7 +13,7 @@
 2017,Theor. Comput. Sci.,"Generalized threshold processes on graphs.",Carlos Vinícius G. C. Lima; Dieter Rautenbach; Uéverton S. Souza; Jayme Luiz Szwarcfiter,https://doi.org/10.1016/j.tcs.2017.05.010,null,J,no_arxiv,0
 2016,Discrete Applied Math.,"Near-linear-time algorithm for the geodetic Radon number of grids.",Mitre Costa Dourado; Vinícius Gusmão Pereira de Sá; Dieter Rautenbach; Jayme Luiz Szwarcfiter,https://doi.org/10.1016/j.dam.2015.05.001,null,J,no_arxiv,3
 2016,Discrete Mathematics,"Forbidden induced subgraphs for bounded p-intersection number.",Claudson F. Bornstein; José W. C. Pinto; Dieter Rautenbach; Jayme Luiz Szwarcfiter,https://doi.org/10.1016/j.disc.2015.09.022,null,J,no_arxiv,1
-2015,Discrete Applied Math.,"Graphs with few P's under the convexity of paths of order three.",Victor A. Campos; Rudini Menezes Sampaio; Ana Silva; Jayme Luiz Szwarcfiter,https://doi.org/10.1016/j.dam.2014.05.005,null,J,no_arxiv,9
+2015,Discrete Applied Math.,"Graphs with few P's under the convexity of paths of order three.",Victor A. Campos; Rudini Menezes Sampaio; Ana Silva; Jayme Luiz Szwarcfiter,https://doi.org/10.1016/j.dam.2014.05.005,null,J,no_arxiv,10
 2015,J. of Graph Theory,"The Maximum Number of Dominating Induced Matchings.",Min Chih Lin; Veronica A. Moyano; Dieter Rautenbach; Jayme Luiz Szwarcfiter,https://doi.org/10.1002/jgt.21804,null,J,no_arxiv,2
 2014,Discrete Applied Math.,"On defensive alliances and strong global offensive alliances.",Mitre Costa Dourado; Luérbio Faria; Miguel A. Pizaña; Dieter Rautenbach; Jayme Luiz Szwarcfiter,https://doi.org/10.1016/j.dam.2013.06.029,null,J,no_arxiv,0
 2014,Discrete Applied Math.,"Scheduling problem with multi-purpose parallel machines.",Rosiane de Freitas Rodrigues; Mitre Costa Dourado; Jayme Luiz Szwarcfiter,https://doi.org/10.1016/j.dam.2011.11.033,null,J,no_arxiv,2

data/profs/search/Manoel-Bezerra-Campelo-Neto.csv

@@ -2,4 +2,4 @@
 2016,Math Program,"The convex recoloring problem: polyhedra, facets and computational experiments.",Manoel B. Campêlo; Alexandre S. Freire; Karla Roberta Lima; Phablo F. S. Moura; Yoshiko Wakabayashi,https://doi.org/10.1007/s10107-015-0880-7,null,J,no_arxiv,6
 2016,Discrete Applied Math.,"A polyhedral study of the maximum stable set problem with weights on vertex-subsets.",Manoel B. Campêlo; Victor A. Campos; Ricardo C. Corrêa; Diego Delle Donne; Javier Marenco; Marcelo Mydlarz,https://doi.org/10.1016/j.dam.2015.05.032,null,J,no_arxiv,0
 2015,Discrete Applied Math.,"On the complexity of the flow coloring problem.",Manoel B. Campêlo; Cristiana G. Huiban; Carlos Diego Rodrigues; Rudini M. Sampaio,https://doi.org/10.1016/j.dam.2015.06.025,null,J,no_arxiv,2
-2014,Theor. Comput. Sci.,"Hardness and inapproximability of convex recoloring problems.",Manoel B. Campêlo; Cristiana G. Huiban; Rudini M. Sampaio; Yoshiko Wakabayashi,https://doi.org/10.1016/j.tcs.2014.03.017,null,J,no_arxiv,2
+2014,Theor. Comput. Sci.,"Hardness and inapproximability of convex recoloring problems.",Manoel B. Campêlo; Cristiana G. Huiban; Rudini M. Sampaio; Yoshiko Wakabayashi,https://doi.org/10.1016/j.tcs.2014.03.017,null,J,no_arxiv,3

data/profs/search/Marcelo-Henriques-Carvalho.csv

@@ -1,3 +1,3 @@
-2018,SIAM J. Discrete Mathematics,"On Two Unsolved Problems Concerning Matching Covered Graphs.",Claudio L. Lucchesi; Marcelo H. de Carvalho; Nishad Kothari; Uppaluri S. R. Murty,https://doi.org/10.1137/17M1138704,null,J,http://arxiv.org/abs/1705.09428v1,0
+2018,SIAM J. Discrete Mathematics,"On Two Unsolved Problems Concerning Matching Covered Graphs.",Claudio L. Lucchesi; Marcelo H. de Carvalho; Nishad Kothari; Uppaluri S. R. Murty,https://doi.org/10.1137/17M1138704,null,J,http://arxiv.org/abs/1705.09428v1,1
 2016,Discrete Mathematics,"A characterization of minimal non-Seymour graphs.",Marcelo H. de Carvalho; C. H. C. Little,https://doi.org/10.1016/j.disc.2015.09.014,null,J,no_arxiv,0
 2016,PR,"Improving semi-supervised learning through optimum connectivity.",Willian Paraguassu Amorim; Alexandre X. Falcão; João P. Papa; Marcelo H. de Carvalho,https://doi.org/10.1016/j.patcog.2016.04.020,null,J,no_arxiv,14