default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMiguel Angel Fiol
Miquel Angel Fiol – Miquel A. Fiol
Person information
- affiliation: Polytechnic University of Catalonia, Barcelona, Spain
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2024
[j121]Cristina Dalfó
, Grahame Erskine, Geoffrey Exoo, Miguel Angel Fiol, Nacho López, Arnau Messegué, James Tuite:
On large regular (1,1,k)-mixed graphs. Discret. Appl. Math. 356: 209-228 (2024)- [j120]M. A. Reyes, Cristina Dalfó, Miguel Angel Fiol:
Structural and Spectral Properties of Chordal Ring, Multi-Ring, and Mixed Graphs. Symmetry 16(9): 1135 (2024) - 2023
- [j119]Aida Abiad, Cristina Dalfó, Miguel Angel Fiol, Sjanne Zeijlemaker:
On inertia and ratio type bounds for the k-independence number of a graph and their relationship. Discret. Appl. Math. 333: 96-109 (2023) - [j118]Cristina Dalfó, Miguel Angel Fiol:
Moore mixed graphs from Cayley graphs. Electron. J. Graph Theory Appl. 11(1): 183-195 (2023) - [j117]Ali Moradi Amani, Miquel A. Fiol, Mahdi Jalili, Guanrong Chen, Xinghuo Yu, Lewi Stone:
Discovering Important Nodes of Complex Networks Based on Laplacian Spectra. IEEE Trans. Circuits Syst. I Regul. Pap. 70(10): 4146-4158 (2023) - 2022
- [j116]Aida Abiad, Gabriel Coutinho, Miguel Angel Fiol, Bruno Demattos Nogueira, Sjanne Zeijlemaker:
Optimization of eigenvalue bounds for the independence and chromatic number of graph powers. Discret. Math. 345(3): 112706 (2022) - 2021
- [j115]Cristina Dalfó, Miguel Angel Fiol, Nacho López:
New results for the Mondrian art problem. Discret. Appl. Math. 293: 64-73 (2021) - [j114]Cristina Dalfó, Miquel A. Fiol, Nacho López, Álvaro Martínez-Pérez:
Decompositions of a rectangle into non-congruent rectangles of equal area. Discret. Math. 344(6): 112389 (2021) - [j113]Gabriela Araujo-Pardo, Cristina Dalfó, Miquel A. Fiol, Nacho López:
Bipartite biregular Moore graphs. Discret. Math. 344(11): 112582 (2021) - [j112]Cristina Dalfó, Miguel Angel Fiol:
On d-Fibonacci digraphs. Electron. J. Graph Theory Appl. 9(2): 527-538 (2021) - 2020
- [j111]Cristina Dalfó, Miguel Angel Fiol, Nacho López, Joseph F. Ryan:
An improved Moore bound and some new optimal families of mixed Abelian Cayley graphs. Discret. Math. 343(10): 112034 (2020) - [j110]Miguel Angel Fiol, Safet Penjic:
On a version of the spectral excess theorem. Electron. J. Graph Theory Appl. 8(2): 391-400 (2020) - 2019
- [j109]Cristina Dalfó, Miguel Angel Fiol, Mirka Miller, Joseph F. Ryan, Jozef Sirán:
An algebraic approach to lifts of digraphs. Discret. Appl. Math. 269: 68-76 (2019) - [j108]Cristina Dalfó, Miguel Angel Fiol:
A new approach to gross error detection for GPS networks. Discret. Appl. Math. 269: 193-199 (2019) - [j107]Aida Abiad, Gabriel Coutinho, Miquel A. Fiol:
On the k-independence number of graphs. Discret. Math. 342(10): 2875-2885 (2019) - [j106]Cristina Dalfó, Miguel Angel Fiol:
A Note on a New General Family of Deterministic Hierarchical Networks. J. Interconnect. Networks 19(2): 1950005:1-1950005:11 (2019) - 2018
- [j105]Miquel A. Fiol, Giuseppe Mazzuoccolo, Eckhard Steffen:
Measures of Edge-Uncolorability of Cubic Graphs. Electron. J. Comb. 25(4): 4 (2018) - [j104]Cristina Dalfó, Miguel Angel Fiol, Nacho López:
An improved upper bound for the order of mixed graphs. Discret. Math. 341(10): 2872-2877 (2018) - [j103]Cristina Dalfó, Miguel Angel Fiol:
Graphs, friends and acquaintances. Electron. J. Graph Theory Appl. 6(2): 282-305 (2018) - [j102]Cristina Dalfó, Miguel Angel Fiol, Nacho López:
On bipartite-mixed graphs. J. Graph Theory 89(4): 386-394 (2018) - 2017
- [j101]Cristina Dalfó, Miguel Angel Fiol, Nacho López:
Sequence mixed graphs. Discret. Appl. Math. 219: 110-116 (2017) - [j100]Victor Diego, Miquel A. Fiol:
Distance mean-regular graphs. Des. Codes Cryptogr. 84(1-2): 55-71 (2017) - [j99]Cristina Dalfó, Miguel Angel Fiol:
A Note on the Order of Iterated Line Digraphs. J. Graph Theory 85(2): 395-399 (2017) - 2016
- [j98]Francesc Aguiló, Miguel Angel Fiol, Sonia Pérez:
Abelian Cayley Digraphs with Asymptotically Large Order for Any Given Degree. Electron. J. Comb. 23(2): 2 (2016) - [j97]Francesc Aguiló, Miguel Angel Fiol, Sonia Pérez:
A geometric approach to dense Cayley digraphs of finite Abelian groups. Electron. Notes Discret. Math. 54: 277-282 (2016) - [j96]Aida Abiad, Edwin R. van Dam, Miguel Angel Fiol:
Some spectral and quasi-spectral characterizations of distance-regular graphs. J. Comb. Theory A 143: 1-18 (2016) - 2015
- [j95]Miguel Angel Fiol, J. Vilaltella:
Some Results on the Structure of Multipoles in the Study of Snarks. Electron. J. Comb. 22(1): 1 (2015) - [j94]Cristina Dalfó, Miquel A. Fiol, Margarida Mitjana:
On middle cube graphs. Electron. J. Graph Theory Appl. 3(2): 133-145 (2015) - [j93]Miguel Angel Fiol:
The spectral excess theorem for distance-regular graphs having distance-d graph with fewer distinct eigenvalues. Electron. Notes Discret. Math. 49: 457-463 (2015) - 2014
- [j92]Marc Cámara, Josep Fàbrega, Miguel Angel Fiol, Ernest Garriga:
On the local spectra of the subconstituents of a vertex set and completely pseudo-regular codes. Discret. Appl. Math. 176: 12-18 (2014) - [j91]Aida Abiad, Cristina Dalfó, Miguel Angel Fiol:
Corrigendum to "Algebraic characterizations of regularity properties in bipartite graphs" [European J. Combin. 34 (2013) 1223-1231]. Eur. J. Comb. 38: 130-132 (2014) - [j90]Cristina Dalfó, Miquel Angel Fiol:
The (Delta, D) and (Delta, N) problems in double-step digraphs with unilateral distance. Electron. J. Graph Theory Appl. 2(1): 1-17 (2014) - 2013
- [j89]Miquel Angel Fiol:
The Spectral Excess Theorem for Distance-Biregular Graphs. Electron. J. Comb. 20(3): 21 (2013) - [j88]Cristina Dalfó, Miguel Angel Fiol, Ernest Garriga:
Moments in graphs. Discret. Appl. Math. 161(6): 768-777 (2013) - [j87]Aida Abiad, Cristina Dalfó, Miguel Angel Fiol:
Algebraic characterizations of regularity properties in bipartite graphs. Eur. J. Comb. 34(8): 1223-1231 (2013) - [j86]Francesc Comellas, Cristina Dalfó, Miguel Angel Fiol:
The Manhattan product of digraphs. Electron. J. Graph Theory Appl. 1(1): 11-27 (2013) - [j85]Anna Agusti-Torra, Cristina Cervello-Pastor, Miquel A. Fiol:
ID Routing Mechanism for Opportunistic Multi-Hop Networks. IEEE Commun. Lett. 17(12): 2388-2391 (2013) - [j84]Marc Cámara, Cristina Dalfó, Charles Delorme, Miguel Angel Fiol, H. Suzuki:
Edge-distance-regular graphs are distance-regular. J. Comb. Theory A 120(5): 1057-1067 (2013) - [j83]Miguel Angel Fiol:
On some approaches to the spectral excess theorem for nonregular graphs. J. Comb. Theory A 120(6): 1285-1290 (2013) - [j82]Miquel Angel Fiol:
Comments on "Extremal Cayley Digraphs of Finite Abelian Groups" [Intercon. Networks 12 (2011), numbers 1-2, 125-135]. J. Interconnect. Networks 14(4) (2013) - 2012
- [j81]Edwin R. van Dam, Miguel Angel Fiol:
A Short Proof of the Odd-Girth Theorem. Electron. J. Comb. 19(3): 12 (2012) - [j80]Cristina Dalfó, Edwin R. van Dam, Miguel Angel Fiol, Ernest Garriga:
Dual concepts of almost distance-regularity and the spectral excess theorem. Discret. Math. 312(17): 2730-2734 (2012) - 2011
- [j79]Cristina Dalfó, Miguel Angel Fiol, Ernest Garriga:
A Differential Approach for Bounding the Index of Graphs under Perturbations. Electron. J. Comb. 18(1) (2011) - [j78]Marc Cámara, Cristina Dalfó, Josep Fàbrega, Miguel Angel Fiol, Ernest Garriga:
Edge-distance-regular graphs. Electron. Notes Discret. Math. 38: 221-226 (2011) - [j77]Cristina Dalfó, Edwin R. van Dam, Miguel Angel Fiol, Ernest Garriga, Bram L. Gorissen:
On almost distance-regular graphs. J. Comb. Theory A 118(3): 1094-1113 (2011) - [j76]Marc Cámara, Cristina Dalfó, Josep Fàbrega, Miguel Angel Fiol, Ernest Garriga:
Edge-distance-regular graphs. J. Comb. Theory A 118(7): 2071-2091 (2011) - [j75]Anna Agusti-Torra, Cristina Cervello-Pastor, Miquel A. Fiol:
Performance analysis of the Sent-But-Sure strategy for Optical Burst and Packet Switched Networks. Perform. Evaluation 68(1): 1-20 (2011) - 2010
- [j74]Marc Cámara, Josep Fàbrega, Miguel Angel Fiol, Ernest Garriga:
Combinatorial vs. Algebraic Characterizations of Completely Pseudo-Regular Codes. Electron. J. Comb. 17(1) (2010) - [j73]Miguel Angel Fiol, Margarida Mitjana:
The local spectra of regular line graphs. Discret. Math. 310(3): 511-517 (2010) - [j72]Cristina Dalfó, Miguel Angel Fiol, Ernest Garriga:
The geometry of t-spreads in k-walk-regular graphs. J. Graph Theory 64(4): 312-322 (2010) - 2009
- [j71]Marc Cámara, Josep Fàbrega, Miguel Angel Fiol, Ernest Garriga:
Some Families of Orthogonal Polynomials of a Discrete Variable and their Applications to Graphs and Codes. Electron. J. Comb. 16(1) (2009) - [j70]Cristina Dalfó, Miguel Angel Fiol, Ernest Garriga:
On k-Walk-Regular Graphs. Electron. J. Comb. 16(1) (2009) - [j69]Lali Barrière, Francesc Comellas, Cristina Dalfó, Miguel Angel Fiol:
The hierarchical product of graphs. Discret. Appl. Math. 157(1): 36-48 (2009) - [j68]Miguel Angel Fiol, Ernest Garriga:
Number of walks and degree powers in a graph. Discret. Math. 309(8): 2613-2614 (2009) - [j67]Lali Barrière, Cristina Dalfó, Miguel Angel Fiol, Margarida Mitjana:
The generalized hierarchical product of graphs. Discret. Math. 309(12): 3871-3881 (2009) - [j66]Cristina Dalfó, Miguel Angel Fiol, Ernest Garriga:
On t-Cliques in k-Walk-Regular Graphs. Electron. Notes Discret. Math. 34: 579-584 (2009) - [j65]Anna Agusti-Torra, Cristina Cervello-Pastor, Miquel A. Fiol:
Load-balanced wavelength assignment strategies for optical burst/packet switching networks. IET Commun. 3(3): 381-390 (2009) - [j64]Anna Agusti-Torra, Cristina Cervello-Pastor, Miquel A. Fiol:
A Routing and Wavelength Assignment Strategy for Successful Transmission in Optical Networks. J. Interconnect. Networks 10(1-2): 1-26 (2009) - 2008
- [j63]Anna Agusti-Torra, Cristina Cervello-Pastor, Miquel A. Fiol:
A general resource assignment scheme for successful transmission in optical burst switched networks. Opt. Switch. Netw. 5(4): 232-243 (2008) - [j62]Francesc Comellas, Cristina Dalfó, Miguel Angel Fiol:
Multidimensional Manhattan Street Networks. SIAM J. Discret. Math. 22(4): 1428-1447 (2008) - 2007
- [j61]Miguel Angel Fiol, Margarida Mitjana:
The Local Spectra of Line Graphs. Electron. Notes Discret. Math. 28: 95-102 (2007) - [j60]Francesc Comellas, Cristina Dalfó, Miguel Angel Fiol, Margarida Mitjana:
A Spectral Study of the Manhattan Networks. Electron. Notes Discret. Math. 29: 267-271 (2007) - [j59]Miguel Angel Fiol, Ernest Garriga:
Spectral and Geometric Properties of k-Walk-Regular Graphs. Electron. Notes Discret. Math. 29: 333-337 (2007) - [j58]Cristina Dalfó, Francesc Comellas, Miguel Angel Fiol:
The Multidimensional Manhattan Network. Electron. Notes Discret. Math. 29: 383-387 (2007) - 2006
- [j57]Miguel Angel Fiol, Ernest Garriga:
On the spectrum of an extremal graph with four eigenvalues. Discret. Math. 306(18): 2241-2244 (2006) - 2004
- [j56]Francesc Comellas, Miguel Angel Fiol, Joan Gimbert, Margarida Mitjana:
Weakly distance-regular digraphs. J. Comb. Theory B 90(2): 233-255 (2004) - 2003
- [j55]Miguel Angel Fiol:
A General Spectral Bound For Distant Vertex Subsets. Comb. Probab. Comput. 12(1): 17-26 (2003) - [j54]Josep M. Brunat, Miguel Angel Fiol, Montserrat Maureso:
Chromatic Automorphisms of Consecutive Digraphs. Graphs Comb. 19(2): 145-159 (2003) - [j53]Miguel Angel Fiol, Joan Gimbert, José Gómez, Yaokun Wu:
On Moore bipartite digraphs. J. Graph Theory 43(3): 171-187 (2003) - [j52]Francesc Comellas, Miguel Angel Fiol, Joan Gimbert, Margarida Mitjana:
The spectra of wrapped butterfly digraphs. Networks 42(1): 15-19 (2003) - 2002
- [j51]Miguel Angel Fiol:
Algebraic characterizations of distance-regular graphs. Discret. Math. 246(1-3): 111-129 (2002) - 2001
- [j50]Miguel Angel Fiol:
Some Spectral Characterizations Of Strongly Distance-Regular Graphs. Comb. Probab. Comput. 10(2): 127-135 (2001) - [j49]Miguel Angel Fiol, Ernest Garriga, José Luis Andres Yebra:
Boundary graphs: The limit case of a spectral property. Discret. Math. 226(1-3): 155-173 (2001) - [j48]Francesc Comellas, Miguel Angel Fiol, Joan Gimbert, Margarida Mitjana:
On the Spectrum of a Weakly Distance-Regular Digraph. Electron. Notes Discret. Math. 10: 80-83 (2001) - [j47]Miguel Angel Fiol, Ernest Garriga:
An Algebraic Characterization of Completely Regular Codes in Distance-Regular Graphs. SIAM J. Discret. Math. 15(1): 1-13 (2001) - 2000
- [j46]Miguel Angel Fiol:
Quasi-Spectral Characterization of Strongly Distance-Regular Graphs. Electron. J. Comb. 7 (2000) - [j45]Miguel Angel Fiol, Ernest Garriga, J. Luis A. Yebra:
On Twisted Odd Graphs. Comb. Probab. Comput. 9(3): 227-240 (2000) - [j44]Francesc Aguiló, Miguel Angel Fiol, Maria Lluisa Fiol:
Periodic Tilings as a Dissection Method. Am. Math. Mon. 107(4): 341-352 (2000) - 1999
- [j43]Camino Balbuena, Ángeles Carmona, Josep Fàbrega, Miguel Angel Fiol:
Superconnectivity of bipartite digraphs and graphs. Discret. Math. 197-198: 61-75 (1999) - [j42]Josep M. Brunat, Margarida Espona, Miguel Angel Fiol, Oriol Serra:
Cayley Digraphs from Complete Generalized Cycles. Eur. J. Comb. 20(5): 337-349 (1999) - 1998
- [j41]Miguel Angel Fiol, Ernest Garriga:
The Alternating and Adjacency Polynomials, and Their Relation with the Spectra and Diameters of Graphs. Discret. Appl. Math. 87(1-3): 77-97 (1998) - [j40]Miguel Angel Fiol, Ernest Garriga, José Luis Andres Yebra:
Boundary graphs - II The limit case of a spectral property. Discret. Math. 182(1-3): 101-111 (1998) - [j39]Miguel Angel Fiol, Ernest Garriga, José Luis Andres Yebra:
From regular boundary graphs to antipodal distance-regular graphs. J. Graph Theory 27(3): 123-140 (1998) - 1997
- [j38]Miguel Angel Fiol:
Some Applications of the Proper and Adjacency Polynomials in the Theory of Graph Spectra. Electron. J. Comb. 4(1) (1997) - [j37]Miguel Angel Fiol:
An Eigenvalue Characterization of Antipodal Distance Regular Graphs. Electron. J. Comb. 4(1) (1997) - [j36]Francesc Aguiló, Miguel Angel Fiol, C. Garcia:
Triple loop networks with small transmission delay. Discret. Math. 167-168: 3-16 (1997) - [j35]Camino Balbuena, Ángeles Carmona, Josep Fàbrega, Miguel Angel Fiol:
Extraconnectivity of graphs with large minimum degree and girth. Discret. Math. 167-168: 85-100 (1997) - [j34]Miguel Angel Fiol, Ernest Garriga, José Luis Andres Yebra:
The alternating polynomials and their relation with the spectra and conditional diameters of graphs. Discret. Math. 167-168: 297-307 (1997) - [j33]M. C. Balbuena, Ángeles Carmona, Josep Fàbrega, Miguel Angel Fiol:
Connectivity of large bipartite digraphs and graphs. Discret. Math. 174(1-3): 3-17 (1997) - [j32]M. C. Balbuena, Ángeles Carmona, Josep Fàbrega, Miguel Angel Fiol:
On the order and size of s-geodetic digraphs with given connectivity. Discret. Math. 174(1-3): 19-27 (1997) - [j31]Josep M. Brunat, Miguel Angel Fiol, Maria Lluisa Fiol:
Digraphs on permutations. Discret. Math. 174(1-3): 73-86 (1997) - [j30]Miguel Angel Fiol, E. Carriga:
From Local Adjacency Polynomials to Locally Pseudo-Distance-Regular Graphs. J. Comb. Theory B 71(2): 162-183 (1997) - 1996
- [j29]Josep Fàbrega, Miguel Angel Fiol:
Bipartite Graphs and Digraphs with Maximum Connectivity. Discret. Appl. Math. 69(3): 271-279 (1996) - [j28]Josep Fàbrega, Miguel Angel Fiol:
On the extraconnectivity of graphs. Discret. Math. 155(1-3): 49-57 (1996) - [j27]Miguel Angel Fiol, Ernest Garriga, José Luis Andres Yebra:
On a Class of Polynomials and Its Relation with the Spectra and Diameters of Graphs. J. Comb. Theory B 67(1): 48-61 (1996) - [j26]Miguel Angel Fiol, Ernest Garriga, José Luis Andres Yebra:
Locally Pseudo-Distance-Regular Graphs. J. Comb. Theory, Ser. B 68(2): 179-205 (1996) - [j25]M. C. Balbuena, Ángeles Carmona, Miguel Angel Fiol:
Distance connectivity in graphs and digraphs. J. Graph Theory 22(4): 281-292 (1996) - [j24]Camino Balbuena, Ángeles Carmona, Josep Fàbrega, Miguel Angel Fiol:
On the connectivity and the conditional diameter of graphs and digraphs. Networks 28(2): 97-105 (1996) - [j23]Carles Padró, Paz Morillo, Miguel Angel Fiol:
Comments on "Line Digraph Iterations and Connectivity Analysis of de Bruijn and Kautz Graphs". IEEE Trans. Computers 45(6): 768 (1996) - 1995
- [j22]Francesc Comellas, Miguel Angel Fiol:
Vertex-symmetric Digraphs with Small Diameter. Discret. Appl. Math. 58(1): 1-11 (1995) - [j21]Francesc Aguiló, Miguel Angel Fiol:
An efficient algorithm to find optimal double loop networks. Discret. Math. 138(1-3): 15-29 (1995) - [j20]Josep M. Brunat, Margarida Espona, Miguel Angel Fiol, Oriol Serra:
On Cayley line digraphs. Discret. Math. 138(1-3): 147-159 (1995) - [j19]Miguel Angel Fiol:
On congruence in Zn and the dimension of a multidimensional circulant. Discret. Math. 141(1-3): 123-134 (1995) - 1994
- [j18]Miguel Angel Fiol:
The superconnectivity of large digraphs and graphs. Discret. Math. 124(1-3): 67-78 (1994) - [j17]Miguel Angel Fiol, Josep Fàbrega:
On the distance connectivity of graphs and digraphs. Discret. Math. 125(1-3): 169-176 (1994) - [j16]Josep Fàbrega, Miguel Angel Fiol:
Extraconnectivity of graphs with large girth. Discret. Math. 127(1-3): 163-170 (1994) - [j15]Francesc Comellas, Miguel Angel Fiol, José Gómez:
On Large Vertex Symmetric 2-Reachable Digraphs. Parallel Process. Lett. 4: 379-384 (1994) - 1993
- [j14]Pilar Esqué, Francesc Aguiló, Miguel Angel Fiol:
Double commutative-step digraphs with minimum diameters. Discret. Math. 114(1-3): 147-157 (1993) - [j13]J. Gómez, Miguel Angel Fiol, Oriol Serra:
On large (Delta, D)-graphs. Discret. Math. 114(1-3): 219-235 (1993) - [j12]Miquel A. Fiol:
The connectivity of large digraphs and graphs. J. Graph Theory 17(1): 31-45 (1993) - [j11]Miguel Angel Fiol, Josep Fàbrega, Oriol Serra, J. Luis A. Yebra:
A Unified Approach to the design and Control of Dynamic Memory Networks. Parallel Process. Lett. 3: 445-456 (1993) - 1992
- [j10]José Gómez, Miguel Angel Fiol, J. Luis A. Yebra:
Graphs on Alphabets as Models for Large Interconnection Networks. Discret. Appl. Math. 37/38: 227-243 (1992) - [j9]Miguel Angel Fiol:
On super-edge-connected digraphs and bipartite digraphs. J. Graph Theory 16(6): 545-555 (1992) - [j8]Miguel Angel Fiol, Anna S. Lladó:
The Partial Line Digraph Technique in the Design of Large Interconnection Networks. IEEE Trans. Computers 41(7): 848-857 (1992) - 1990
- [j7]Miguel Angel Fiol, José Luis Andres Yebra:
Dense bipartite digraphs. J. Graph Theory 14(6): 687-700 (1990) - 1989
- [j6]Josep Fàbrega, Miguel Angel Fiol:
Maximally connected digraphs. J. Graph Theory 13(6): 657-668 (1989) - 1987
- [j5]Miguel Angel Fiol:
Congruences in Zn, finite Abelian groups and the Chinese remainder theorem. Discret. Math. 67(1): 101-105 (1987) - [j4]Miguel Angel Fiol, J. Luis A. Yebra, Ignacio Alegre, Mateo Valero:
A Discrete Optimization Problem in Local Networks and Data Alignment. IEEE Trans. Computers 36(6): 702-713 (1987) - 1986
- [j3]Ignacio Alegre, Miguel Angel Fiol, J. Luis A. Yebra:
Some large graphs with given degree and diameter. J. Graph Theory 10(2): 219-224 (1986) - 1984
- [j2]Miguel Angel Fiol, J. Luis A. Yebra, Ignacio Alegre de Miquel:
Line Digraph Iterations and the (d, k) Digraph Problem. IEEE Trans. Computers 33(5): 400-403 (1984) - 1983
- [j1]Tomás Lang, Mateo Valero, Miguel Angel Fiol:
Reduction of Connections for Multibus Organization. IEEE Trans. Computers 32(8): 707-716 (1983)
Conference and Workshop Papers
- 2024
- [c8]Dominika Závacká, Cristina Dalfó, Miquel Angel Fiol:
Integer Sequences from k-iterated Line Digraphs. ITAT 2024: 156-161 - 2023
- [c7]Mónica Reyes, Cristina Dalfó, Miquel Angel Fiol:
On the Spectra and Spectral Radii of Token Graphs. ITAT 2023: 197-203 - 2007
- [c6]Anna Agusti-Torra, Cristina Cervello-Pastor, Miguel Angel Fiol:
On the fairness issue in OBS loss-free schemes. BROADNETS 2007: 55-64 - 2006
- [c5]Anna Agusti-Torra, Cristina Cervello-Pastor, Miguel Angel Fiol:
A New Approach to Loss-Free Packet/Burst Transmission in All-Optical Networks. BROADNETS 2006 - [c4]Anna Agusti-Torra, Cristina Cervello-Pastor, Miguel Angel Fiol:
Wavelength and Offset Window Assignment Schemes to Avoid Contention in OBS Rings. BROADNETS 2006 - 1987
- [c3]Miguel Angel Fiol, Oriol Serra:
An Algebraic Model for the Storage of Data in Parallel Memories. AAECC 1987: 238-246 - [c2]Paz Morillo, Miguel Angel Fiol, J. Guitart:
On the (d, D, D, s) - Digraph Problem. AAECC 1987: 334-340 - 1983
- [c1]Miguel Angel Fiol, Ignacio Alegre, J. Luis A. Yebra:
Line Digraph Iterations and the (d,k) Problem for Directed Graphs. ISCA 1983: 174-177
Parts in Books or Collections
- 2003
- [p1]Josep Fàbrega, Miguel Angel Fiol, Herbert Fleischner, R. Gary Parker, A Dewdney, Ronald J. Gould, Gregory Z. Gutin:
Connectivity and Traversability. Handbook of Graph Theory 2003: 193-339
Informal and Other Publications
- 2019
- [i4]Cristina Dalfó, Miquel A. Fiol:
El mètode de les línies per a la resolució numèrica d'equacions en derivades parcials. The method of lines for numerical solutions of partial differential equations. CoRR abs/1903.03431 (2019) - 2015
- [i3]Lali Barrière, Francesc Comellas, Cristina Dalfó, Miguel Angel Fiol:
Deterministic hierarchical networks. CoRR abs/1507.05103 (2015) - 2012
- [i2]Miguel Angel Fiol, J. Vilaltella:
A simple and fast heuristic algorithm for edge-coloring of graphs. CoRR abs/1210.5176 (2012) - [i1]Cristina Dalfó, Miguel Angel Fiol:
The (Δ,D) and (Δ,N) problems for New Amsterdam and Manhattan digraphs. CoRR abs/1210.6202 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-25 21:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
