• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 26 matches

• 2024
• 
  Ramin Javadi, Amir Nikabadi:
  On the parameterized complexity of Sparsest Cut and Small-Set Expansion problems. Discret. Appl. Math. 355: 1-12 (2024)
• 
  Andrew Ensinger, Ramin Javadi, Xiaohui Lin, Bella Bose, Tejasvi Anand:
  Minimum Power Point Design of Inverter Based Continuous Time Linear Equalizer (CTLE). ISCAS 2024: 1-5
• 
  Ramin Javadi, Tejasvi Anand:
  An Enhanced Eye-Opening PAM-4 with Encoding for Short-Reach Wireline Communication Systems. MWSCAS 2024: 68-71
• 
  Mohammad Yasin Karbasian, Ramin Javadi:
  A High-Performance External Validity Index for Clustering with a Large Number of Clusters. CoRR abs/2409.14455 (2024)
• 2023
• 
  Ramin Javadi, Meysam Miralaei:
  The multicolor size-Ramsey numbers of cycles. J. Comb. Theory B 158(Part): 264-285 (2023)
• 
  Sahab Hajebi, Ramin Javadi:
  On the parameterized complexity of the acyclic matching problem. Theor. Comput. Sci. 958: 113862 (2023)
• 
  Meisam Abdollahi, Ramin Sabzalizadeh, Samaneh Javadinia, Sepideh Mashhadi, Sara Sanati Mehrizi, Amirali Baniasadi:
  Automatic Modulation Classification for NLOS 5G Signals with Deep Learning Approaches. WINCOM 2023: 1-6
• 2021
• 
  Ramin Javadi, Saleh Ashkboos:
  Multi-way sparsest cut problem on trees with a control on the number of parts and outliers. Discret. Appl. Math. 289: 281-291 (2021)
• 
  Sahab Hajebi, Ramin Javadi:
  On the Parameterized Complexity of the Acyclic Matching Problem. CoRR abs/2109.06004 (2021)
• 
  Ramin Javadi, Ali Momeni:
  The Game of Cops and Robber on (Claw, Even-hole)-free Graphs. CoRR abs/2112.07503 (2021)
• 2019
• 
  Ramin Javadi, Farideh Khoeini, G. R. Omidi, Alexey Pokrovskiy:
  On the Size-Ramsey Number of Cycles. Comb. Probab. Comput. 28(6): 871-880 (2019)
• 
  Ramin Javadi, Sepehr Hajebi:
  Edge clique cover of claw-free graphs. J. Graph Theory 90(3): 311-405 (2019)
• 
  Ramin Javadi, Amir Nikabadi:
  On the Parameterized Complexity of Sparsest Cut and Small-set Expansion Problems. CoRR abs/1910.12353 (2019)
• 2018
• 
  Ramin Javadi, Afsaneh Khodadadpour, Gholam Reza Omidi:
  Decomposition of complete uniform multi-hypergraphs into Berge paths and cycles. J. Graph Theory 88(3): 507-520 (2018)
• 
  Ramin Javadi, Gholam Reza Omidi:
  On a Question of Erdös and Faudree on the Size Ramsey Numbers. SIAM J. Discret. Math. 32(3): 2217-2228 (2018)
• 2017
• 
  Ramin Javadi, Saleh Ashkboos:
  An Efficient Parallel Data Clustering Algorithm Using Isoperimetric Number of Trees. CoRR abs/1702.04739 (2017)
• 
  Ramin Javadi, Saleh Ashkboos:
  Multi-way sparsest cut problem on trees with a control on the number of parts and outliers. CoRR abs/1702.05570 (2017)
• 2016
• 
  Akbar Davoodi, Ramin Javadi, Behnaz Omoomi:
  Pairwise balanced designs and sigma clique partitions. Discret. Math. 339(5): 1450-1458 (2016)
• 
  Ramin Javadi, Zeinab Maleki, Behnaz Omoomi:
  Local Clique Covering of Claw-Free Graphs. J. Graph Theory 81(1): 92-104 (2016)
• 2013
• 
  Amir Daneshgar, Ramin Javadi, Basir Shariat Razavi:
  Clustering and outlier detection using isoperimetric number of trees. Pattern Recognit. 46(12): 3371-3382 (2013)
• 2012
• 
  Ramin Javadi, Behnaz Omoomi:
  On b-coloring of cartesian product of graphs. Ars Comb. 107: 521-536 (2012)
• 
  Amir Daneshgar, Ramin Javadi:
  On the complexity of isoperimetric problems on trees. Discret. Appl. Math. 160(1-2): 116-131 (2012)
• 
  Amir Daneshgar, Ramin Javadi, Basir Shariat Razavi:
  Clustering Using Isoperimetric Number of Trees. CoRR abs/1203.4204 (2012)
• 2010
• 
  Amir Daneshgar, Hossein Hajiabolhassan, Ramin Javadi:
  On the isoperimetric spectrum of graphs and its approximations. J. Comb. Theory B 100(4): 390-412 (2010)
• 
  Amir Daneshgar, Ramin Javadi:
  On Complexity of Isoperimetric Problems on Trees. CoRR abs/1009.0706 (2010)
• 2009
• 
  Ramin Javadi, Behnaz Omoomi:
  On b-coloring of the Kneser graphs. Discret. Math. 309(13): 4399-4408 (2009)